Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / baskar
AVL is balance the binary tree and the make the time
complexity is O(log n).
| Is This Answer Correct ? | 4 Yes | 2 No |
Post New Answer View All Answers
List out the basic operations that can be performed on a stack?
What's the difference between a hashtable and a hashmap?
What is a dequeue?
How to reverse singly link list?
How can I search for data in a linked list?
What is a sorting algorithm in data structure?
What are stacks? Give some of its applications.
What is the time complexity of arrays sort?
Why is concurrenthashmap thread safe?
Can binary tree have 1 child?
What is bubble sort algorithm in data structure sort and searching?
When is a binary search best applied?
Design a datastructure to represent the movement of a knight on a chess board
What is a b+ tree? Explain its uses.
which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?
