Data Structures 1

Data Structures 1

University

25 Qs

quiz-placeholder

Similar activities

EC8393_FDS_MODEL EXAM_3_PART A

EC8393_FDS_MODEL EXAM_3_PART A

University

30 Qs

Exploring Trees and Graph Algorithms

Exploring Trees and Graph Algorithms

University

20 Qs

DS2

DS2

University

20 Qs

DSA_Midterm Quiz no. 1

DSA_Midterm Quiz no. 1

University

25 Qs

Data Structure & Algorithm-Quiz-1

Data Structure & Algorithm-Quiz-1

University

30 Qs

SD Pra UAS

SD Pra UAS

University

23 Qs

Trees, Linked Lists, Stacks and Queues

Trees, Linked Lists, Stacks and Queues

11th Grade - University

30 Qs

Exploring Binary Trees

Exploring Binary Trees

University

20 Qs

Data Structures 1

Data Structures 1

Assessment

Quiz

Computers

University

Hard

Created by

R Suganya

Used 11+ times

FREE Resource

25 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 2 pts

Assume there is a tree in which every node has a value greater than value of any node in its LST but lesser

than any node in its RST. An in order traversal of this tree shall result in

A. a sorted sequence in ascending order

B. a sorted sequence in descending order

C. sequence is sorted only of tree is a complete or full binary tree

D. sequence is not always sorted

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Assume an algebric expression E is represented using the binary tree

A. the variable in E forms external nodes and operators in internal nodes

B. the operators in E forms external nodes and variables in internal nodes

C. the variable and operations in E forms internal nodes

D. the variable and operations in E forms external nodes

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Balance factor is defined as the

A. Difference between Left sub tree and Right sub tree

B. Difference between the height of Left sub tree and the height of Right sub tree

C. Difference between Right sub tree and Left sub tree

D. Difference between the height of Right sub tree and the height of Left sub tree

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Assume the level of root node is 1 and the levels of left and right children of root is 2. The maximum number of

nodes on level i of a binary tree is

A. 2^i

B. 2^(i-1)

C. 2^(i+1)

D. 2^i+1

5.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

The maximum number of binary trees that can be formed with three nodes

A. 3

B. 1

C. 5

D. 4

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of

nodes in a binary tree of height h is:

A. 2^h-1

B. 2^(h-1)-1

C. 2^(h+1)-1

D. 2*(h+1)

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of

nodes in a binary tree of height 4 are

A. 31 and 5

B. 32 and 5

C. 15 and 5

D. 15 and 4

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?