what is AVL tree?
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 |
Differentiate among cycle, path, and circuit?
What is a minimum spanning tree?
Are linked lists useful?
Can we sort hashmap?
Explain what are the major data structures used in the rdbms?
What happens when arraylist is full?
What is the difference between dictionary and hashtable?
What is stack in data structure with the example?
Explain the term recursive case?
What does it mean to sort an array?
What is the height of a binary tree?
Are sets sorted?