Binary search tree is an example of complete binary tree with special attributes:
A. BST does not care about complete binary tree properties.
B. BST takes care of complete binary tree properties.
C. It depends upon the input.
D. None of the above.
Answer:A
Binary search tree is an example of complete binary tree with special attributes:
A. BST does not care about complete binary tree properties. B. BST takes care of complete binary tree properties. C. It depends upon the input. D. None of the above.