Menu

Question Discussion & Solution

MCQ

Q.

A binary tree can easily be converted into q 2-tree

A

by replacing each empty sub tree by a new internal node

B

by inserting an internal nodes for non-empty node

C

by inserting an external nodes for non-empty node

D

by replacing each empty sub tree by a new external node

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

A binary tree is a special type of tree, which can either be empty or have a finite set of nodes, such that, one of the nodes is designated as the root node and the remaining nodes are partitioned into sub trees of the root nodes known as__________.

A

Left sub tree

B

Right sub tree

C

Both (a) and (b)

D

Heap tree

Discussion

MCQ

2.

Worst case time complexity of binary search is ______________

A

O(n)

B

O(logn)

C

?(nlogn)

D

?(logn)

Discussion

MCQ

3.

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

A

Heap

B

B-Tree

C

AVL-Tree

D

Search tree

Discussion

MCQ

4.

A binary tree of depth

A

Each leaf in the tree is either at level

B

For any node

C

Both a and b

D

None of the above

Discussion

MCQ

5.

What are the children for node

A

2w and 2w+1

B

2+w and 2-w

C

w+1/2 and w/2

D

w-1/2 and w+1/2

Discussion

More Data Structure Topics

Data Structure Basics

128 MCQs

Abstract data types

37 MCQs

Arrays

134 MCQs

Lists

166 MCQs

Stacks

165 MCQs

Queues

61 MCQs

Trees

133 MCQs

Binary Trees

120 MCQs

B Trees

8 MCQs

Heaps

36 MCQs

Hash based structures

7 MCQs

Graphs

157 MCQs

Mixed

10 MCQs