Interested to Buy Any Domain ? << Click Here >> for more details...
why do tree always takes o(log n) time?
- 2 Answers
- 7974 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 the properties of an algorithm?
Why linked list is required?
Can we insert null in list?
Write the syntax in c to create a node in the singly linked list.
Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.
Write the algorithm for converting infix expression to postfix expression?
State the advantages of using postfix notations?
Which sorting algorithms are in place?
What are the types of collection?
What is a postfix expression?
No. of possible ordered trees with n nodes ? Please give formula (if any).
Is hashmap fail safe?
Windows 
