DataStructures / Data structures Interview questions
Difference between Binary tree and Binary search tree.
A Binary tree is a type of tree data structure where each parent node can have at most two child nodes ( 0 to 2 nodes).
Binary search tree is a binary tree where the left child contains only nodes with values less than the parent node, and where the right child only contains nodes with values greater than or equal to the parent node.
More Related questions...