Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   ERRORS new

 Categories  >>  Software  >>  Operating Systems  >>  Data Structures

 Windows Interview Questions Linux Interview Questions Unix Interview Questions Solaris Interview Questions RTOS Interview Questions Bulnex Interview Questions Operating Systems General Concepts Interview Questions Data Structures Interview Questions Operating Systems AllOther Interview Questions
Question
`what is AVL tree?`
Question Submitted By :: Devil.mca17
I also faced this Question!!     Rank Answer Posted By

Re: what is AVL tree?
# 1
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 ? 53 Yes 2 No
Narendra Sharma

Re: what is AVL tree?
# 2
AVL is balance the binary tree and the make the time
complexity is O(log n).

 Is This Answer Correct ? 3 Yes 2 No

Re: what is AVL tree?
# 3
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 ? 8 Yes 3 No
Kalpana Rana

Re: what is AVL tree?
# 4
it is a height balanced binary search tree!
 Is This Answer Correct ? 4 Yes 1 No
Princy

Re: what is AVL tree?
# 5
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 ? 6 Yes 0 No
Pilli.ramakrishna (student Of

  Question Asked @ Answers Other Data Structures Interview Questions Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements. Syntel 22 What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest? ABB 17 I am given a sequential algorithm that does a routine search on an unordered list. N = 20. The probability that the value x does NOT appear in the list is exactly 60%, and the probability that x DOES appear is 40%. The 3 questions that I could not get were: A) What is the avg number of element comparisons performed when n = 20 and x does NOT appear in the List. (my answer was 20, is this correct?) B) What is the avg number of element comparisons peformed when n = 20 and x DOES appear in the list? C) What is the avg number of element comparisons performed when n = 20. This should be a single number answer they said. 3 simple algorithm for bubble sort? 1 wt is a datastructure CybAge 8 No. of possible ordered trees with n nodes ? Please give formula (if any). 1 Parenthesis are never needed in prefix or postfix expressions. Why? Microsoft 11 why do tree always takes o(log n) time? TCS 1 what is the different between B-tree and B+ tree. Syntel 6 what is AVL tree? ADS 5 Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1 9 Write a Binary Search program Microsoft 7 For more Data Structures Interview Questions Click Here