Scribd
Upload
355 views

Data Structure Unit-3 Quiz

This document contains a 25 question quiz on data structures and trees. The questions cover topics like tree traversal, types of trees (including binary search trees, AVL trees, binary trees, etc.), tree properties, balancing techniques, and tree representations. The document also provides the answers to each question.

Uploaded by

Jaganath S
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
355 views

Data Structure Unit-3 Quiz

This document contains a 25 question quiz on data structures and trees. The questions cover topics like tree traversal, types of trees (including binary search trees, AVL trees, binary trees, etc.), tree properties, balancing techniques, and tree representations. The document also provides the answers to each question.

Uploaded by

Jaganath S
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

DATA STRUCTURE UNIT-3 QUIZ

QUESTIONS:-

1) It is mainly used to represent data


containing a hierarchical relationship
between elements.

A) Tree
B) Linked list
C) Stack
D) Queue

2) It is special type of tree in which


every node or vertex has either no
children, one child, or two children.

A) Binary search tree


B) Avl tree
C) Binary tree
D) None of the above

3) Which of the following is a true about


Binary Trees.

A) Every binary tree is either complete or full.

B) Every complete binary tree is also a full binary tree.

C) Every full binary tree is also a complete binary tree.

D) None of the above.

4) If every non-leaf node in a binary tree has


a non-empty left and right sub trees, the
tree is known as:

A) Binary search tree


B) Avl tree
C) Binary tree
D) Strictly binary tree
5) A complete binary tree is also known as:

A) General tree
B) 2 - 3 tree
C) Heap
D) Binary tree

6) Tree can be represented in:


Case 1: List representation
Case 2: Representation of degree two
tree

A) Case 1 is true but case 2 is false.


B) Case 1 is true.
C) Case 2 is false.
D) Case 1 and 2 is true.

7) The "Extended binary tree" is also known


as:

A) Avl tree
B) 2 tree
C) 2 - 3 tree
D) both A and B

8) Below this given condition which one suits


the extended binary tree:

A) A single path connects any two nodes of a tree.


B) Every node in a tree has exactly one parent except the root node.
C) Any binary tree with n internal nodes has (n+1) external nodes.
D) All of the above

9) B- tree is also known as:

A) Binary tree
B) Binary traversal tree
C) Balanced search tree
D) Balancing tree

10) When the value present at any node is


greater than all its children, then the tree
is called:
A) Ascending heap
B) Descending heap
C) Min heap
D) All of the above

11) A set of several trees that are not linked


to each other is known as:

A) Forest
B) Non binary tree
C) Traversal tree
D) Both B and C

12) Among the given vertices which obeys


the constraints for Red-black trees:

Case 1: Every leaf is colored black.


Case 2: If a vertex is red, then both of its
children are red.
A) Case 1 is true but case 2 is false.
B) Case 2 is true but case 1 is false.
C) Case 1 and 2 is true.
D) Case 1 and 2 is false.

13) The number of nodes connected to a


particular node is known as:

A) Level of a node
B) Position of a node
C) Degree of a node
D) Angle of a node

14) If all non-leaf nodes of a binary tree have


exactly two non-empty children and
levels of all leaf nodes of a binary tree is
same then the tree is called:

A) Complete binary tree


B) In Complete binary tree
C) Empty tree
D) None of the above
15) The process of visiting every node in the
tree exactly one is known as:

A) Recursive Traversal
B) Non Recursive Traversal
C) Traversal
D) Sorting

16) Which of the following suits the below


condition:

◇ Visit the root


◇ Traverse the left subtree in preorder
◇ Traverse the Right subtree in preorder

A) In order Traversal
B) Post order Traversal
C) Pre order Traversal
D) None of the above

17) Level of any node of a tree is

A) Its distance from the root


B) height of its left subtree minus height of its right subtree
C) height of its right subtree minus height of its left subtree
D) None of these

18) A balanced binary tree is a binary tree in


which the heights of two subtrees of every
node never offer by more than:

A) 2
B) 1
C) 3
D) 0

19) The technique of balancing the height of


binary trees is known as:

A) Avl tree
B) Balanced tree
C) Balancing factor
D) None of these
20) The threaded binary tree is used for

A) Insertion
B) Traversal
C) Deletion
D) All of the above

21) The ordered set of ordered tree is known


as:

A) Orchard
B) Linear tree
C) Non linear tree
D) Forest

22) How many kinds of rotations are there in


AVL trees:

A) 3
B) 4
C) 5
D) 2

23) If a node is inserted in the left subtree of


the left subtree. The tree then needs a
right rotation.

A) Left rotation
B) Right rotation
C) Left right rotation
D) Right left rotation

24) The combination of right rotation followed


by left notation:

A) Left rotation
B) Right rotation
C) Left right rotation
D) Right left notation

25) Riddle:-
" A node that has no sons"

A) Root node
B) Tree node
C) Leaf node
D) Single node

Answers:-

1) Tree (a)
2) Binary tree (c)
3) None of the above (d)
4) Strictly binary tree (d)
5) Heap (c)
6) Case 1 and 2 true. (d)
7) 2-tree (b)
8) All of the above (d)
9) Balanced search tree (c)
10) Descending heap (b)
11) Forest (a)
12) Case 1 is true but case 2 is false (a)
13) Degree of a node (c)
14) Complete binary tree (a)
15) Recursive traversal (a)
16) Pre order traversal (c)
17) Its distance from the root (a)
18) 1 (b)
19) Avl tree (a)
20) All of the above (d)
21) Orchard (a)
22) 4 (b)
23) Right rotation (b)
24) Right left rotation (d)
25) Leaf node (c)

You might also like