Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?
- 1 Answers
- 1040 Views
- I also Faced
- E-Mail Answers
Answer / Shilpi Priya
Searching a node in a binary search tree is efficient because the tree is sorted, allowing for a divide-and-conquer approach where the search space can be cut in half with each comparison.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is difference between hashmap and map?
Why is concurrenthashmap thread safe?
What method is used to place a value onto the top of a stack?
How can you insert a node in a random location of the linked list?
Why is hashing used?
What are linear and non linear data structures?
What is collections singletonmap?
What is difference between set and map?
Is priority queue sorted?
Is quicksort a stable sorting algorithm?
Is bubble sort adaptive?
Which process places data at the back of the queue?
Windows 
