Thanks a lot. Your explanation is more than my lecture college lecture.🤩👌👌👌
@yuvinducaldera9612 Жыл бұрын
Thank you so much. Would have failed DS if not for you. Much appreciated, from Sri Lanka.
@abhisheksinghdangi502710 ай бұрын
To the right we are adding the same value as well . Keep in mind all we gotta do is place all the elments in leaf nodes as well jo ki top pe hote hai.
@bheemkumar4124 жыл бұрын
interchange the order of lecture 8 and lecture 9.(thansk for helpful video)
@abhi-zc6st Жыл бұрын
Interchange the order of k and s.(most welcome) 😄
@ManahilEjaz-ws9bj5 ай бұрын
Explain on a complex problem, this video Help alot, Thanks
@mohithsarvepalli4305 жыл бұрын
Yep Done with The topic:) Thank You; And By the way mam U look pretty
@SHUBHAMJHA-o3g Жыл бұрын
Thankyou maam all ur lectures were helpful !!!!
@fenghan4766 Жыл бұрын
Thank you Jenny! I like your accent.🤩
@khairulalom14885 жыл бұрын
Excellent ma'am (Bangladesh)
@bhanuprasad597810 ай бұрын
Yaa done with these topic Thank you By the way u look pretty ✨
@KumarSaketComputerhack5 жыл бұрын
U got a nice skill to explain terms in better and Easier way...Thanks.
@dipankargiri76125 жыл бұрын
mam ap baht ache sikha te ho👏👏👏🙏
@supriya36653 жыл бұрын
Mam .. kindly put one separate video for learning Binomial heap and Fibonacci heap
@harshukey6072 Жыл бұрын
It was Very Good explaination
@Heybablufit786 Жыл бұрын
Amazing explanation mam ❤❤
@mayarabdulkareem8299 Жыл бұрын
Time saving! Thank u!
@hemantmahajan9471Ай бұрын
Great Explanation!
@Conquertheworldwithlove.Ай бұрын
B+ intro vedio kha h
@dudekondaradha67564 жыл бұрын
Thanks mam.your teaching is excellent and understand easy
@shalikaashan79245 жыл бұрын
Thank you mam. This video series is very useful
@bharadwajsaibandaru43232 жыл бұрын
Please do upload videos on Segment trees and other advanced Data structures as well.
@Shaamveeraraghavan Жыл бұрын
Final smile enough to see this video in loop mode🥴
@petersilie97024 жыл бұрын
Thank you very much for this video :-) I have a question: What would be the best order to insert values into a B+ tree to get the minimal height? (Let's say we have the values: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10)
@lokesharya84855 жыл бұрын
Thank u mam all doubt clear ☺️ Mam can u make lecture on Bulk loading B+ tree ..
@BharathKumar-kx4kt4 жыл бұрын
Hi mam...there is no programming solution for the explanation kindly if possible give a hint on the programming side also. And your grip on the subject is fantastic.
@prabakaranvlogs15 жыл бұрын
Thanks mam it's very useful to me ☺️
@kevinnilesh6239Ай бұрын
Thank you miss....
@Conquertheworldwithlove.Ай бұрын
B+ intro vedio kha h
@omsoni4528 Жыл бұрын
Thank u so much ❤️
@aishu6653 Жыл бұрын
Thankyou so much mam
@rajesht9702 Жыл бұрын
Thank You Madam
@gopavaramsaimadhuree5204 жыл бұрын
very good explanation ma'am
@naveenkorlepara Жыл бұрын
Mam pls make a video on "patricia" Asap
@sameerbilla5155 жыл бұрын
Ma'am make video on Linked List Please!
@JennyslecturesCSIT5 жыл бұрын
Already uploaded, pls check playlists
@sameerbilla5155 жыл бұрын
@@JennyslecturesCSIT ya, i got that! thanks,
@vinitakeer515 Жыл бұрын
Ma'am kindly make a video for B* tree
@archanabisoyi16804 жыл бұрын
Mamm plzz give lecture on c++
@saritakumari-oh8fs4 жыл бұрын
Great explanation
@yashparamr4261 Жыл бұрын
Thanks 👍
@shizarizvi5576 Жыл бұрын
JazakAllah
@anythingbeyondlimit8398 Жыл бұрын
why you keep the split point in the lower node (leaf) after moving it to the internal nodes?! is that a mistake?! Like 9 and 23 after inserting 8 and 25 at 8:30?
@ABPMEMES-nq9sq5 ай бұрын
i have also same doubt i think if we write only in internal node not in leaf so it will be correct
@hitanshujena7470Ай бұрын
Bhai please do some research on B tree and B+ tree 😊 then you will know the reason@@ABPMEMES-nq9sq
@hitanshujena7470Ай бұрын
@@ABPMEMES-nq9sqAnd it's not mistake it is application of B+ tree watch any difference between B tree and B+ tree
@tomharry15169 ай бұрын
Just wow 😳
@avadhutpatil70412 жыл бұрын
Ma'am please make video on Threaded Binary Trees(TBT).
@quizzaddaa5 жыл бұрын
if it's possible to make video on topic linked list.. plzz
@JennyslecturesCSIT5 жыл бұрын
working on it
@momscookbook2222 Жыл бұрын
Thanks
@nalakabandara15222 жыл бұрын
When add 23 ,should we consider minimum child =3 ? If it so root should be 7,10. Pls explain it
@madhavshrivastava14434 жыл бұрын
Comparison and tournament tree plz
@pahadinegi006 Жыл бұрын
Middle element is 23 at last
@hasinimadhuwanthi68425 жыл бұрын
Thanks mam
@wolfieguy7552 Жыл бұрын
thank u
@FrenzyGamingVideos5 жыл бұрын
Thanks dear mam 😊 U r so much cute 😅
@FrenzyGamingVideos4 жыл бұрын
@code fire trko kya m pdhai kru ya nhi ..apne kaam s kaam rkh
@prabakaranvlogs15 жыл бұрын
Mam I want Topological sorting concept please mam
@JennyslecturesCSIT5 жыл бұрын
Already uploaded. U can check out data structures and algorithms playlist
@laxminarsimhasaikudikala4252 Жыл бұрын
Tqq mam
@asrithavemula18143 күн бұрын
Why did you write 23 two times
@pmkinfinity14412 жыл бұрын
Mam plz tell of order 3 in b+ tree
@AshishKumar-pu6jc4 жыл бұрын
Ma'am make a video on 'Threaded binary tree' plz
@hfya2810 ай бұрын
احبك شكرا
@Conquertheworldwithlove.Ай бұрын
B+ intro vedio kha h
@mkalyan26982 жыл бұрын
(11, 7, 10, 17, 11, 2, 3, 19, 11, 5, 6). b+tree (A) The maximum number of times leaf nodes would get split up as a result of these insertions (b) The height of the index (c) Assume that the root of the B+ tree index, created above, resides in the memory buffer (main memory), and each node of the B+ tree resides on a separate block in the disk. Total number of pointers in the B+ tree index = (d) If the tuples of the given relation are stored physically in the same order given above with each block containing two tuples the number of block accesses required to access all the tuples having key value 11 = (d) If the tuples of the given relation are stored physically in the same order given above with each block containing two tuples the number of block accesses required to access all the tuples having key value 11 = (f) The number of buckets required to create a hash organization (dynamic) of the relation using the binary representation of the keys = if u possible pls explain me madam
@leensaleh23222 жыл бұрын
I love you
@learncodeandphotoshop23282 жыл бұрын
yaar kitni kaata piti kru kopy ki band baj gyi h
@aayushsahu7609 Жыл бұрын
Can't we perform creation after sorting the elements given in question??
@vishnukumard53773 жыл бұрын
❤️
@shinosukenohara29853 жыл бұрын
love you too............
@jacobblack2544 Жыл бұрын
Ich bin schtat
@rehajoseph30566 ай бұрын
How come there are 6 children when the maximum number of children is 5?
@yaswanthganesh77165 ай бұрын
It's an intermediate stage only for representation after the process we see the result
@somu422 жыл бұрын
b tree and b+ tree comparison video?
@samiulislamdurjoy3 жыл бұрын
G 240
@SajanKumar-ec2us2 жыл бұрын
What is difference between b-tree and b+tree
@Satya_Sanatan47710 ай бұрын
Mam hindi m bolke hi padha diya karo jyada sanjh aayega
@harshagrawal34895 жыл бұрын
💕💕🤩
@gbhavyasri7363 жыл бұрын
Zap
@afz523 Жыл бұрын
Why don't you teach in Hindi ?
@raajujitesh7 ай бұрын
Knowledge is not restricted to north hindi speaking idiots😂
It's not bad asking to teach in hindi bcz it may be his mother tongue and may be quite easy to understand, but bro, there are other channels which teach in hindi which are also quite good , u can refer them , like, apna college, code with harry, love babbar,...😊