adplus-dvertising
frame-decoration

Question

The balance factor for an AVL tree is either

a.

0,1 or -1

b.

-2,-1 or 0

c.

0,1 or 2

d.

All the above

Answer: (a).0,1 or -1

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. The balance factor for an AVL tree is either

Similar Questions

Discover Related MCQs

Q. AVL trees have LL, LR, RR, RL rotations to balance the tree to maintain the balance factor (LR : Insert node in Right sub tree of Left sub tree of node A, etc). Among rotations the following are single and double rotations

Q. Heap is an example of ................

Q. The number of unused pointers in a complete binary tree of depth 5 is:

Q. The running time for creating a heap of size n is .............

Q. One can determine whether a Binary tree is a Binary Search Tree by traversing it in ................

Q. The maximum number of nodes in a binary tree of depth 5 is ...............

Q. In a min-heap:

Q. A complete binary tree with n leaf nodes has ..............

Q. A binary tree can be converted in to its mirror image by traversing it in ..............

Q. Which one of the following statements is false?

Q. A list integers is read in, one at a time, and a binary search tree is constructed. Next the tree is traversed would result in a printout which duplicates the original order of the list of integers?

Q. Which of the following need not to be a binary tree ?

Q. Which of the following statements is false ?

Q. Which of the following remarks about Tree- indexing are true?

Q. A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called

Q. A complete binary tree with the property that the value at each node is at least as large as the values at its children is called

Q. Traversing a binary tree first root and then left and right subtrees called _______traversal.

Q. A binary tree having n nodes and depth d will be about complete binary tree if

Q. Which of the following statements is/are correct ?

Q. A binary tree of depth "d" is an almost complete binary tree if