Amazon Interview Question: Binary search trees... | Glassdoor

Interview Question

Intern Interview Hyderabad (India)

Binary search trees


Interview Answer

1 Answer


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, Sign In or Sign Up.