1.

What is the difference between Binary Tree and Binary Search Tree?

Answer»
  • Binary Tree: A Binary Tree is a tree in which each NODE can have at most 2 children. The children are named left child and right child. There is no CONSTRAINT on the VALUE the node or its children can have. We need to traverse the whole tree for searching in the case of a binary tree.
  • Binary Search Tree: Binary Search Tree (BST) is a Binary Tree but with an additional constraint that the left subtree of a node can only have NODES whose values are less than the parent node's value & the right subtree of a node can only have nodes whose values are GREATER than parent node's value.  We need to traverse only the height of a tree (in the worst-case scenario) for searching in the case of a Binary Search Tree.


Discussion

No Comment Found

Related InterviewSolutions