Trees Questions

MCQ bookmark_border

91.

The number of edges from the root to the node is called __________ of the tree.

A

Height

B

Depth

C

Length

D

None of the mentioned

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

92.

The number of edges from the node to the deepest leaf is called _________ of the tree.

A

Height

B

Depth

C

Length

D

None of the mentioned

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

93.

Which of the following is not an advantage of trees?

A

Hierarchical structure

B

Faster search

C

Router algorithms

D

Undo/Redo operations in a notepad

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

94.

What is an AVL tree?

A

a tree which is balanced and is a height balanced tree

B

a tree which is unbalanced and is a height balanced tree

C

a tree with three children

D

a tree with atmost 3 children

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

95.

What is the maximum height of an AVL tree with p nodes?

A

p

B

log(p)

C

log(p)/2

D

p?2

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

96.

To restore the AVL property after inserting a element, we start at the insertion point and move towards root of that tree. is this statement true?

A

1

C

May be

D

Can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

97.

Given an empty AVL tree, how would you construct AVL tree when a set of numbers are given without performing any rotations?

A

just build the tree with the given input

B

find the median of the set of elements given, make it as root and construct the tree

C

use trial and error

D

use dynamic programming to build the tree

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

98.

What maximum difference in heights between the leafs of a AVL tree is possible?

A

log(n) where n is the number of nodes

B

n where n is the number of nodes

C

0 or 1

D

atmost 1

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

99.

Consider the pseudo code below.
Does the below code can check if a binary search tree is an AVL tree?

int avl(binarysearchtree root):
     if(not root)
       return 0
     left_tree_height = avl(left_of_root)
 
     if(left_tree_height== -1) 
       return left_tree_height
 
     right_tree_height= avl(right_of_root)
 
     if(right_tree_height==-1)
       return right_tree_height

A

yes

B

no

C

May be

D

Can't say

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

100.

Consider the below left-left rotation pseudo code where the node contains value pointers to left, right child nodes and a height value and Height() function returns height value stored at a particular node.
What is missing?

avltree leftrotation(avltreenode z):
   avltreenode w =x-left
   x-left=w-right
   w-right=x
   x-height=max(Height(x-left),Height(x-right))+1 
   w-height=max(missing)+1   
  return w

A

Height(w-left), x-height

B

Height(w-right), x-height

C

Height(w-left), x

D

Height(w-left)

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion