Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / 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 |
Post New Answer View All Answers
What is data type explain?
How do you create a tree diagram?
What thread means?
What is the top of a stack?
Explain what are the major data structures used in the rdbms?
Which is the best book for data structures and algorithms?
How many types of searching are there in data structure?
What is pointer in data structure?
Can list contain null values?
How would you use qsort() function to sort the name stored in an array of pointers to string?
Can you sort a string?
How do you access the values within an array?
Does array sort mutate?
Define data type and what are the types of data type?
how to delete first node from singly linked list?
