AVL Tree
AVL tree is a self-balancing binary search tree.
Insertion/Deletion in 2-3 Tree
Insertion: Let we create 2-3 tree by inserting elements: 20, 30, 40, 50, 60, 10, 15, 70, 80 Insert 20,30: Now we insert these two element in a single node as it can hold 2 elements so, Insert 40: Node is already full so split the node In splitting: We take two nodes left and right and a root node Left node contain smallest element Right node contain greatest element Root node contain middle element and take lest and right as child So the final tree will be: Insert 50: 50 is greater than 40 and after 40 a blank space so insert 50 in that blank space: Insert 60: 60 is greater than 50 but there is no space for 60 so split, after splitting the root element will move to the root that contain 30 b/c there is an empty space in that node, so final tree will be: Insert 10: 10 is smal
Comments
Post a Comment