1.

What is binary search tree and its conditions?

Answer»

By DEFINITION of Binary search tree, if every NODE of the binary tree satisfythe following CONDITIONS then it is aBinary Search Tree: The left subtree of a node should contain only nodes with keys LESS than the node's key. The right subtree of a node should contain only nodes with keys greater than thenode's key.



Discussion

No Comment Found