Binary Trees Questions

MCQ bookmark_border

51.

A binary tree is said to be a complete binary tree if all the leaf nodes of the tree are at ________.

A

Same level

B

Opposite level

C

Different level

D

Adjacent level

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

52.

A binary tree is said to be an extended binary tree (also known as 2-tree) if all of its nodes are of _______.

A

Zero degree

B

Two degrees

C

Both (a) and b)

D

None of the above

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

53.

Like _________- binary trees can also be represented in two ways in the memory

A

Stacks

B

Queues

C

Strings

D

Both (a) and (b)

Correct Answer: D

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

54.

In the array representation, what is represented sequentially in memory using a single one-dimensionalarray?

A

Binary tree

B

Stacks

C

Nodes

D

None of the above

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

55.

The linked representation of a binary tree is implemented by using a linked list having an_________.

A

Info part

B

Two pointers- left and right

C

Both (a) and (b)

D

One pointer

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

56.

Traversing a binary tree refers to the process of visiting each and every node of the tree exactly how many times?

A

Once

B

Twice

C

Thrice

D

None

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

57.

A binary search tree, also known as_________.

A

Binary tree

B

Binary sorted tree

C

Sibling node

D

Heap trees

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

58.

Which code for an alphabet (set of symbols) is generated by constructing a binary tree with nodes containing the symbols to be encoded and their probabilities of occurrence?

A

Algorithm

B

Hughman code

C

Huffman code

D

Canonical Huffman codes

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

59.

The process of inserting a node in a binary search tree can be divided into how many steps?

A

Three

B

Two

C

Four

D

None of the above

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

60.

The number of nodes in a complete binary tree of depth d (with root at depth 0) is

A

2^(d?1) +1

B

2^(d+1) -1

C

2^(d?1) -1

D

2^(d+1) +1

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion