Binary search tree
Across
- 1. The process of moving the nodes to make tree balanced
- 3. LDR- left, root, right
- 6. Smallest entity in tree
- 7. Tree used in routers and bridges respectively in computer networks
- 8. DLR-root, left, right
Down
- 2. NULL links can be replaced by pointers called threads to other nodes
- 4. Used in Compilers
- 5. Unique node in the tree to which further sub trees are attached