The binary search tree facilitates duplicate elimination is false.
b.The binary search tree facilitates duplicate elimination.
Explanation:
A tree is branch which grows left and right and straight. But in computer tree has node which is grows left and right depends on the data inserted. There or bubble sort tree and binary sort tree etc. Each caries own method.
Binary tree insert the data left side key data is small than exist key data. In other way rights of key is always greater keys on exist key data or node.
Tree been further classified to nodes which has 3 parts
1. left side key address
2. Data and
3 right side key address.
To maintain the address in program we use pointer variable to carry the address of nodes.
