Binary Tree
- Get link
- X
- Other Apps
- Get link
- X
- Other Apps
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 ...
Comments
Post a Comment