Interview Question

Intern Interview Hyderābād (India)

Binary search trees

Answer

Interview Answer

1 Answer

0

A binary search tree is a type tree which is in sorted form and has a leaf node which have two nodes, and each and every node can have maximum two child nodes.

Sahil on Feb 9, 2013

Add Answers or Comments

To comment on this question, Sign In with Facebook or Sign Up