InterviewSolution
Saved Bookmarks
InterviewSolution
| 1. |
What is a binary search tree? |
|
Answer» A binary search tree is a binary tree with a special provision where a node's left child must have value less than its parent's value and node's right child must have value greater than it's parent value. |
|