Interested to Buy Any Domain ? << Click Here >> for more details...
why do tree always takes o(log n) time?
- 2 Answers
- 8150 Views
- TCS, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / manish kumar yadav
Tree always takes o(log n) time because tree has height is
(log n).
| Is This Answer Correct ? | 24 Yes | 23 No |
Answer / hanuman
Not all tree takes O(logn) time. but only BST takes O(logn) time just because it search,insert, delete node using mid element that means complexity of that tree is O(logn).
| Is This Answer Correct ? | 0 Yes | 0 No |
What are linked lists most commonly used for?
Define shortest path?
How do you assign an address to an element of a pointer array ?
Which is the parent class of hashmap class?
What is data structure in programming language?
Why do we use hashmap?
Does list maintain insertion order?
List the types of tree.
What is a height of a tree?
What are different techniques for making hash function? Explain with example.
List the area of applications of data structure.
What are the basic operations of stack?
Windows 
