InterviewSolution
Saved Bookmarks
| 1. |
Explain Binary search operation? Write an algorithm? |
|
Answer» When inserting or SEARCHING for an element in a binary search tree, the key of each visited node has to be COMPARED with the key of the element to be inserted or found. |
|