5.30 B+ Tree Deletion| with example |Data structure & Algorithm Tutorials

[@khanmdmaaz]

The college that i pay, can't teach me, even though i try a lot to learn. Actually, they don't want to word at all, after getting salaries. And some newbies come up on board, and mess up things and end up making the board dirty, and giving tons of confusions. Ur quality is that ma'am, u don't mess up things, go simply with the rules, don't do aennnn aaannnn etc kind of drama, and deliver every dimension of problem related to the topic. Really v good. Having actual knowledge from free source, and having no knowledge from paid source. KALYUG 😕🙁😑

[@ankitagrawal3447]

Ur line is really very effective and true also......

[@manishvatsal9670]

That's so true 👍

[@miraclescience840]

yeah

[@manishsahu6873]

RIghtly said, Paying so much amount in the college but learning nothing. But here We get our concepts cleared with very efficient and simple explanations

[@unemployedcse3514]

Awesome 💞 "deletion is complicated than insertion" against nature rule🌹

[@ninakoch1799]

Thank you for this amazing video Ma‘am! Really helped me understand this concept for my DBMS exam! You are truly a gifted teacher, never stop sharing your knowledge with us! Greeting from Switzerland

[@agaming4187]

12:13

[@meghnajain7889]

this cleared all my confusions....big thumbs up ...the best video on youtube Thanks alot mam

[@Whatever0165]

I can never learn this in a million years

[@koushikrakib7605]

Great video, she explained each and every edge cases.

[@jijivisha3593]

Nice work here.. my concept id clear.. after a study of 2 hour in the end i watch this lecture i was so tired.. but then in the end your smile fix it all i paused the video and watched your smiling face for 1-2 minutes.. 😅 also i screenshot it.. 😋.. i also made my friends see ur smile... It's just made my day.. keep smiling.. and thank you for the video.. it's really helpful.. 😊

[@JennyslecturesCSIT]

I appreciate the fact that you guys gave me this recognition. Thanks.

[@kritikatripathi806]

🤣🤣🤣

[@akashghosh4766]

Thanks a lot, Mam.Best series of B tree and B+trees on KZbin.Subscibed.

[@amarnathsharma9655]

Loved the tutorial. Very nicely and easily explained all cases. Thanks.

[@mouneydonuru2769]

If the rules are written at the side or so, it would be easy to revise

[@norbertkolozsi2461]

Thank you! I passed my exam thanks to you!

[@JennyslecturesCSIT]

Thanks @norbetkolozsi

[@aditya21006]

This topic has been explained in much more detail,than one of the best available paid lecture for gate(sorry cant name it).

[@mohammedumarfarhan9900]

Unaacademy?

[@sandamalgamage1242]

Thank You very much, Ma'am. This video helped me understand B plus tree Deleting Operation crystal clearly. You explain it as a piece of cake❤❤

[@micah167]

Thank you for expkaining all cases thoroughly 👍👌

[@armannaim8826]

the reaction of your eye put me in think that im in front you and watching live . i love your video and simple talks

[@adamazmy6408]

Genuinely best explanation I’ve seen! Thank you so much for helping with exam ❤

[@amitotc]

First of all these videos were very helpful. Thank you for creating videos and sharing the knowledge. I am trying to design something like my own data base. I wanted to know how to serialize and persist these B+ trees and store them in files. It will be very helpful if you can create another video regarding the same. Thank you :)

[@meishimanshu]

Had you created your database?

[@amitotc]

@@meishimanshu I was able to create it. I created a database from scratch by adding a file layer beneath the B-Tree. This allowed for serializing the nodes and loading them into the cache as and when access was requested. The serialization was done in the protobuf format. Unfortunately, all the code I wrote was propriety and was for my ex-employer. I no longer have access to it. I created a distributed database on top of Azure Cloud using custom B-Tree and node format. It was done to avoid costly database solutions on the cloud, as we didn't need very active indexing or reads on the database. Since we needed to persist it long enough in an incrementally backed-up format, we decided to create our own mini-database (which is good for faster writes but can still support log (n) reads occasionally). The journey from this video to the final database took me 6 months to work on scale. I could do 1 million reads in 40 mins and 1 million writes in 10 minutes on Azure Blob-based storage.

[@aarushchaubey516]

@@amitotc baap re kya kya tune bc

[@trump8690]

my goddess, you saved my life

[@serhatylmaz5333]

First of all thank you for your great explanation of these B*tree concepts. I want to clarify one thing is that in 3:30, you told that left child can be less than or equal to parent of it. But conceptually it can't be right as you told in the rest of the video. The right child can be equal and greater than its parent, left child must be strictly less than its parent.

[@jerryjohnthomas4908]

brother that is another of way of implementing it, if you are doing that you have to do that consistently from the root to the leaf nodes, in the example she mentioned its the opposite. so this is not an example to disprove but rather this is an example where right child >= node value. just whatever you are following follow it consistently thats all.

[@sasirekhamsvl9504]

Thank you so much ma'am .You are so clear with your content and you are not concerned with like comment share and subscribe. This makes you unique too.

[@shivathmikachiliveru5543]

i could understand more clearly in ur videos.....ur one of the best teachers....lots of love mam....

[@harshkumaragarwal8326]

Thank you very much for the video One suggestion: the values on the top right is for 4, and the video is using 3, this sometimes creates confusion. :))

[@faisalalkholaifi2102]

I think means 4 pointers and 3 keys

[@mohitpatel5605]

I want to learn this lecture till deleted keys = 25.because by here i can remember the condition for deleting a keys.

[@raihanrashid1378]

while deleting 25 it still had the left sibling available which didn't have the minimum number of nodes. So why are we not taking from the left node?

[@xteez6051]

i guess it will only consider siblings of same parent

[@harinath_mishra]

Thanks alot mam for providing lecture on b tree and b+ tree deletion .Deletion in both is quite tricky and you explained it very well....mam It was hard and difficult to find deletion in both the cases.... Thank you very much mam....keep uploading videos.....

[@shubhamnikam2710]

Best among all !! 🙌💯

[@JennyslecturesCSIT]

I am grateful for the kind words and encouragement

[@prerakpanwar9853]

when deleting 25 why we did not ask key from its left sibling 17|19?

[@WHYTUJAY]

immediate se hii sirf borrow krega , if not then merging

[@bishwanathpatra7283]

Because 25 parent is 28 it can only ask to its sibling . It cannot borrow from others sibling as u said

[@Urbana72]

Good explanation and good design of examples.

[@saikatsudiptashuva5735]

Lovely tutorial😍

[@hamedhomaee6410]

It could not be taught better than this. Awesome. THANK YOU SO MUCH.

[@madhavanu6980]

Thank you so much sister plz do class on B star tree

[@chinnmaychaudhari5199]

So amazing tutorial!

[@-SaiVenkat]

very good exaplanation thanku for teaching me I understand what you said nice explanation

[@deviantistaken]

karaboğa esenlikler diler

[@primefriends7840]

Jenny didi aap boht acha padha rhi hoo🥺🥺 . Mere or mere doston ki taraf se boht saara pyaar❤️❤️

[@AmanRaj-se3fh]

ma'am, it should have min. 2 keys in the leaf node. ceil( (n-1)/2 ).. according to H.F. KORTH (book)..Page no:-635..line no:- 08

[@vimalsheoran8040]

It's ceil (n/2) - 1

[@nj7588]

m is number of children of a node and n is number of keys in the block that is in one node. Since n = m - 1 and m in this case is 4, n = 3 so ceil((3-1)/2) = ceil(2/2) = 1

[@vvedhant7463]

ratio

[@amitmaurya5589]

THANKS A LOT MA'AM VERY VERY MOST IMPORTANT CONTENT PROVIDED BY YOU . 1... PLEASE MAKE A VIDEO ON KANADE ALGORITHMS . THANK YOU AGAIN

[@brahmareddythumu9885]

Thank you but if it is better to put your videos last year 2-2 it helps me a lot .but now also it helped me

[@scorpionkingcr4523]

U r making futures👍

[@gyanprakash302]

The formula for minimum keys should be = ceil[(4-1)/2]==2 , The leaf nodes should always be more than half full right ?

[@tirthadatta7368]

Thank u mam,u r beauty with brain💞💞💞u r just 💕💕💕

[@shalikaashan7924]

Great video. Thank you so much you helped me for the mid term exam.

[@sanjanaattanayake4231]

Great explanation thank youuu Madam! 🙏

[@vijaykumar-mv3ro]

u r doing so much hardwork mam keep it up mam

[@rajneeshkumar3399]

Clear and precise, to the point explanation.. And mam you are cute

[@chirangbpandey9503]

At 16:00, root should be (17) and leaves should be (1),(17,19,28)

[@maheshwariganeshbabu7275]

Thanks a lot mam can you make a videos on oops full lecture pleeeeee....

[@stashatstake]

Quality is crazy high Thank you

[@lillol3245]

Oh god insertion is so much simpler

[@subhashbose4989]

statement at 15:35 is most important in B+Tree

[@gamingparadise2277]

The maximum number of keys in a record is called the order of the B+ tree. But You are referring order as max children.

[@ganeshsharma6326]

Thanks for this concept.😊

[@rahulvats9086]

That was a wonderful revision of b+ tree concepts. Though i need to implement all this with some tweakings as an assignment. So can u give an idea how to implement all this in C.

[@harinath_mishra]

Bro have you implemented b tree using c??

[@rahulvats9086]

@@harinath_mishra yes i have done it now

[@bhaveshpariyani6853]

great video, very easily explained each cases

[@krishnachaitanyayerrapatru4682]

Tnx a lot man..... Please try to upload a series on dbms

[@shahdmohammed9514]

after we deleted 42 then we megerd 28 with empty leaf , you said in the previous case we should delete the index , as we deleted the index 28 in the case when we deleted leaf 25

[@H-CSELEKrishnaMohan]

I Thank you 3000 times

[@IIPoojasriA]

It's very useful mam 😇

[@nishipal8948]

ma'am algorithm insertion and deletion b_ tree ka video bna dijiye

[@SreyRc]

Explained so well! Thanks a lot!

[@AliHaider-j9q]

Love you so much ❤

[@thaliaft]

Thank you very much! Very helpful

[@rayanamb490]

u r amazing thanks for yr vid really helped

[@RameshSingh-py2co]

there should be (ceil( p/2) -1) min key for non-leaf node and non root, leaf node must have ceil ((p-1)/2) minimum keys

[@AmanRaj-se3fh]

yup, you are right.. it should have min. 2 keys for the given question.

[@sumeetubale3923]

thank you for this video!!

[@waghdipak2358]

@10:52 it wasn't deleted , it was just removed from the internal node following the rule....btw thank u so much for these amazing lectures...and like all...i will also appreciate your beauty...

[@kritikatripathi806]

😂😂

[@AmanRaj-se3fh]

yes, finally found someone who is agree on this point.

[@05y1saikiran6]

The minimum number of keys in leaf node is (m/2)+1 thats change the whole problem

[@bholebaba365]

Best explained 🤜❤️🤛

[@FrenzyGamingVideos]

Thank you dear mam 😊 & lv u 😄😍😍

[@anusrithalisetty3239]

Mam plz explain b+ tree deletion of order 5 B tree deletion of order 4 5

[@niranjanhegde3852]

One doubt. At 2:30 timestamp, why didn't you merge left and right subtrees to get 25,28,42 in one node?

[@suchismithakn]

Because the minimum number of children possible are 1, and that condition is satisfied. Hence we don't need to merge it

[@hemanthalugubelli3052]

thanks akka pls do video on b+ trees love from ap

[@jenweatherwax7113]

You are my lifesaver. When I get my degree, I will cross out the university name and put yours XD

[@jithinmv6516]

I am always waiting for the last "bubye and take care" :)

[@tanmeyrawal644]

Too much confusing it's like each time there is a new condition

[@hassanassaad4743]

the problem is with the algorithm not the instructor

[@liorio2847]

that is way this video is good, she talks about each condition

[@darshanv8345]

Best explanation ever 🔥😍

[@Satya_ganta]

She covered each and every condition, that's the speciality of the video...

[@omanshsharma6796]

Get good, it's not that complicated

[@chepurivenkatchari5655]

Superb class

[@GaonkaEngineer123]

best among all;;;;;;;;;;

[@ruchirjain1163]

Great vid!!

[@SuratAdhikari]

Love you Mamm, Thanks alot

[@careerplus2417]

Hello Madam...when ever u r deletion 42 ...siblings max values is 19 but you are using 17...pleace clasrify that

[@bhavanimuddala]

Yes I too have same doubt

[@manusharma9089]

We are looking for the siblings of intermediate index . Not for the leaf node.

[@ahmetsarac6702]

Hi Jenny, you are a great instructure. Thank you so much everythings that you do for us. But i have a question for you. you sad that in left of side smaller or equal must be, and in rigth of side strictly must be greater, am i rigth. But when you remove 20, you add 28 left of side. must it be 25 here instaed of 28. ?

[@erenyeager8609]

bhai parent agr 20 hai toh left side must be smaller then 20 and it also cannot equal to 20 nd right side must be greater than the parent node

[@preparingengineering]

I have confusion: 8:19 borrowed 4 from immediate left node, borrowed node became parent , parent should be go down ,right? how 4 went there(below parent)?

[@Shasikaknowledgehub]

Insert the following no. In given sequence 10,20,30,90,80,60,70,40,50,66,16,84,21,76 And the no. From the tree in the given sequence.. Can uh solve this problem..? I insert but I get stuck in deletion after 80 ... (deletion of 60)

[@tonykrro]

Each leaf should have at least int(0.5n)+1 keys according to .

[@AmanRaj-se3fh]

you mean min. 2 keys for n=4 ?

[@gyanprakash302]

Correct !

[@mdkabinhasan6473]

Thank you maaa.. i loved this video.. also you.. because of i got 10/10 in viva... T_T :*

[@reshmasyed1175]

While deleting the root node we need to take the maximum of left sub tree as u told in the btree deletion can we have any case???

[@batman_1st]

What do you mean internal nodes only store index? Doesn't internal nodes store key value? Otherwise how do you know which path to go down?

[@shivathmikachiliveru5543]

mam...i have a doubt...do we have to keep a node empty to point to the other leaf node...or else its just the linking

[@xof8256]

Thank You Jenny!

[@Carlos-td6bz]

Perfect explanation!

[@l.a.gengar6073]

I don't understand the point to learn this from this way. (The video is amazing you are a very nice teacher). But, whats the point? I implemented a lot of tree's algorithms in different languages, and I don't understand why de colleges want to do the exercises at paper. Also, thanks for your content, greetings from Argentina!

[@tarunluthrabk]

I think we need not delete keys from interior nodes. Refer fig 11.18 from DBMS book by Korth

[@subhadipmaity3253]

Thank you soo much Mam

[@mohanpvs2777]

Mam, in the last step. . Why 1 is not included in keys if root node after merging

[@amankumaramar271]

thank you ma'am

[@vipulkumar276]

Mam make videos on B*(star) tree 2-3 tree 2-3-4 tree

[@ajitnegi1436]

While deleting 7, why we didn't simply delete 7 from leaf and remove its pointer from parent? We will have 17 as parent with 2 child now 1,4 and 17,19 Waiting for your reply. Kindly reply. 😊😊

[@divyanshukushwaha3897]

Hi Mam, please help with below problem, facing problem in Deletion . Tomorrow exam please reply in comments: Create a B+tree Order = 3 2,5,7,10,13,16,20,22,23,24 Delete 23,10

[@manishasen2264]

What is condition for root node and children node like in root node left child can have less than equal to and for children node the left node must have only less than values is it like that?

[@rustincohle3271]

Thank you so much