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 |
Does hashtable allow null values?
What is meant by binary tree traversal?
If you are using c language to implement the heterogeneous linked list, explain what pointer type will you use?
Explain quick sort and merge sort algorithms and derive the time-constraint relation for these.
Calculate the efficiency of sequential search?
Explain what is linear search?
What’s the difference between enumeration and iterator interfaces?
An array having 100 elements have numbers from 1 to 99 randomly out of which any number is repeated. Find the repeated number in minimum time and space complexity.
Can sets contain duplicates?
We know that Arrays are objects so why cannot we write strArray.length()?
Explain the Queue
How do stacks work?