Menu

Question Discussion & Solution

MCQ

Q.

A binary tree can easily be converted into a 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.

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

MCQ

2.

What is the time complexity for finding the height of the binary tree?

A

h = O(loglogn)

B

h = O(nlogn)

C

h = O(n)

D

h = O(log n)

Discussion

MCQ

3.

The complexity of Binary search algorithm is

A

O(n)

B

O(log )

C

O(n^2)

D

O(n log n)

Discussion

MCQ

4.

In a full binary tree if number of internal nodes is I, then number of nodes N are?

A

N = 2I

B

N = I + 1

C

N = I

D

N = 2I + 1

Discussion

MCQ

5.

Unlike a general tree, each node in a binary tree is restricted to have at the most __________child nodes only.

A

Four

B

Three

C

Two

D

One

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