Interested to Buy Any Domain ? << Click Here >> for more details...
why do tree always takes o(log n) time?
- 2 Answers
- 8262 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 |
Define level of the tree?
How do you check if a stack is empty or not?
What is the difference between for and foreach loop?
what is traversal in linked lists?
What is the use of bubble sort?
Does arraylist guarantee insertion order?
How to get the index of an array element?
What are the categories of avl rotations?
What is meant by binary tree traversal?
Does linked list allow duplicates?
What is the difference between Array and Array List ? Explain in brief with example.
What is int data type?
Windows 
