Interested to Buy Any Domain ? << Click Here >> for more details...
what is AVL tree?
- 5 Answers
- 17072 Views
- ADS, TCS, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / narendra sharma
Avl tree is self binary tree in which balancing factor lie
between the -1 to 1.It is also known as self balancing tree.
so BF=h(T(left sub tree))-h(T(right sub tree));
| Is This Answer Correct ? | 57 Yes | 2 No |
Answer / kalpana rana
An AVL tree is a binary tree in which the difference between
the height of the right and left subtrees (or the root node)
is never more than one.
| Is This Answer Correct ? | 11 Yes | 3 No |
Answer / pilli.ramakrishna (student of
An AVL tree is a self-balancing binary search tree, and it
was the first such data structure to be invented.In an AVL
tree, the heights of the two child subtrees of any node
differ by at most one. Lookup, insertion, and deletion all
take O(log n) time in both the average and worst cases,
where n is the number of nodes in the tree prior to the
operation. Insertions and deletions may require the tree to
be rebalanced by one or more tree rotations.
| Is This Answer Correct ? | 7 Yes | 0 No |
Answer / 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 |
Why would you use a linked list?
In depth questions regarding the data structures and the Databases used in the Projects developed.
Define balanced trees?
What is pointer in data structure?
Should I use hashmap or hashtable?
Why we use arraylist instead of linked list?
Can hashtable have duplicate values?
What data type is enum?
Is tuple immutable?
What is rule regarding overriding equals and hascode method?
What are AVL trees?
Explain what are the types of collision resolution techniques and the methods used in each of the type?
Windows 
