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
Please Help Members By Posting Answers For Below Questions
What is example of data?
Write a Program for Linked list manipulation.
How do we search a specific element in an array?
What is a multidimensional array?
What is a simple graph?
What is difference between list and set?
How do you find the height of a binary tree?
What is the difference between set and unordered_set?
What are the advantages of sorting and filtering data?
What is the purpose of tochararray ()?
Why is map not a collection?
What is weight balanced tree in data structure?
What is mean by sorting?
What is data structure and why it is important?
Define distributed query and linked server?
