Binary Trees Questions

MCQ bookmark_border

21.

Huffman codes are the applications of _________ with minimal weighted external path length obtained by an optimal set.

A

BST

B

MST

C

Binary tree

D

Weighted Graph

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

22.

Which of the following is not a limitation of binary search algorithm?

A

must use a sorted array

B

requirement of sorted array is expensive when a lot of insertion and deletions are needed

C

there must be a mechanism to access middle element directly

D

binary search algorithm is not efficient when the data elements are more than 1000

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

23.

Binary Search Algorithm cannot be applied to

A

Sorted linked list

B

Sorted linear array

C

Sorted binary tree

D

Pointer array

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

24.

The complexity of Binary search algorithm is

A

O(n)

B

O(n²)

C

O(log n)

D

O(n log n)

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

25.

Express -15 as a 6-bit signed binary number.

A

1111

B

101111

C

101110

D

1110

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

26.

Which of the following code snippet is used to convert decimal to binary numbers?

A

public void convertBinary(int num)
{
     int bin[] = new int[50];
     int index = 0;
     while(num > 0)
     {
       bin[index++] = num%2;
       num = num/2;
     }
     for(int i = index-1;i >= 0;i--)
     {
       System.out.print(bin[i]);
     }
}

B

public void convertBinary(int num)
{
     int bin[] = new int[50];
     int index = 0;
     while(num > 0)
     {
       bin[++index] = num%2;
       num = num/2;
     }
     for(int i = index-1;i >= 0;i--)
     {
       System.out.print(bin[i]);
     }
}

C

public void convertBinary(int num)
{
     int bin[] = new int[50];
     int index = 0;
     while(num > 0)
     {
         bin[index++] = num/2;
         num = num%2;
     }
     for(int i = index-1;i >= 0;i--)
     {
         System.out.print(bin[i]);
     }
}

D

public void convertBinary(int num)
 {
     int bin[] = new int[50];
     int index = 0;
     while(num > 0)
     {
         bin[++index] = num/2;
         num = num%2;
     }
     for(int i = index-1;i >= 0;i--)
     {
         System.out.print(bin[i]);
     }
  }

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

27.

Binary search tree is an example of complete binary tree with special attributes.

A

BST does not care about complete binary tree properties.

B

BST takes care of complete binary tree properties.

C

It depends upon the input.

D

None of the above.

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

28.

A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called

A

AVL tree

B

Red-black tree

C

Lemma tree

D

None of the above

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

29.

Herder node is used as sentinel in

A

Graphs

B

Stacks

C

Binary tree

D

Queues

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

30.

The property of binary tree is

A

The first subset is called left subtree

B

The second subtree is called right subtree

C

The root cannot contain NULL

D

The right subtree can be empty

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion