Saved Bookmarks
| 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. 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. |
|