What is binary search tree and its conditions?
Answers
Answered by
0
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.
Similar questions