1.

Define A Binary Search Tree?

Answer»

A binary search tree is a special binary tree, which is either empty or it should satisfy the following characteristics:

  • Every node has a VALUE and no two nodes should have the same value i.e) the VALUES in the binary search tree are DISTINCT.
  • The values in any left sub-tree is less than the value of its parent node.
  • The values in any RIGHT sub-tree is greater than the value of its parent node.
  • The left and right sub-trees of each node are again binary search trees.

A binary search tree is a special binary tree, which is either empty or it should satisfy the following characteristics:


Discussion

No Comment Found

Related InterviewSolutions