Karpagam Academy of Higher Education

Department of Computer Technology

Subject : Data Structures
Class: II BSC IT & II BSC CT Subject code:22ITU301/22CTU301
Objective Type Questions
UNIT III
Questions opt1 opt2 opt3 opt4 opt5 opt6 Answer
1 A __ is a finite set of one tree graph list set tree
or more nodes, with one
root node and remaining
2 form the disjoint
A _________ is asets
graph tree path set list tree
without any cycle.

3 In binary trees there is no zero one two three two

node with a degree greater
than _____
4 Which of this is true for a It may be The no All the All the
binary tree. empty degree of node above above
all nodes with
must be degree
<=2 greate
r than
two

5 The Number of subtrees of leaf terminal childr degree degree

a node is called its en
_______.
6 Nodes that have degree end node leaf subtre root leaf
zero are called ________. nodes e node nodes

7 A binary tree with all its balanced left sub

full right right
left branches supressed is tree tree binary skewed skewed
called a _________ tree tree tree
8 All node except the leaf terminal percent non childre non
nodes are called________. node node termin n node terminal
al
9 The roots of the subtrees of Parent Children Siblin sub tree Children
a node X, are the _______ g
of X.
10 X is a root then X is the sub tree Parent Sibilin subordi Parent
______ of its children. gs nate
11 The children of the same sibling leaf child subtree sibling
parent are called
__________________.
12 ___________of a node are Degree sub tree Ances parent Ancestor
all the nodes along the path tors s
form the root to that node.

13 The ______________of a weight length breath height height

tree is defined to be a
maximum level of any
node in the tree.
14 A___________ is a set of n Group forest Branc sub tree forest
≥ 0 disjoint trees h
15 A tree with any node branched sub tree binary forest binary
having at most two tree tree tree
branches is called a
_____________.
16 In ------- the remaining full half sub tree full
nodes are partitioned into binary binary tree binary
n>=0. tree tree tree
17 Data structure represents Root Node Tree Addres Tree
the hierarchical s
relationships between
individual data item is
known as __________.
18 A specially designated Child Root Sibilin Parent Root
node is called as ------------- g
-
19 The root of the tree is the Child Parent Ances Head Ancestor
_______of all nodes in the tor
tree.
20 _____is a subset of a tree Branch Root Leaf Subtree Subtree
that is itself a tree.
21 A node with no children is Root Branch Leaf Null Leaf
called _________. Node Node tree Node
22 In a tree structure a link Branch Root Leaf Subtree Branch
between parent and child is
called _______
23 Height – balanced trees are AVL Binary Subtre Branch AVL
also referred as as trees Trees e Tree trees
___________trees.
24 A ---------- is a elegant searching recursion walk path recursion
device for describing the throug
traversal. h
25 In________traversal ,the PreOrder PostOrde Inorde End PreOrder
current node is visited r r Order
before the subtrees.
26 In________traversal ,the PreOrder PostOrde Inorde End Inorder
node is visited between the r r Order
subtrees.
27 In________traversal ,the PreOrder PostOrde Inorde End PostOrde
node is visited after the r r Order r
subtrees.
28 Inorder traversal is also Symmetri End PreOr PostOr Symmetri
sometimes called______ c Order Order der der c Order
29 Postorder traversal is also Symmetri End PreOr PostOr End
sometimes called______ c Order Order der der Order
30 Nodes of any level are Left to Right to Top to Bottom Left to
numbered from _________ right Left Botto to Top right
m
31 ________ search involves binary fibonacci seque non fibonacci
only addition and ntial sequent
subtraction. ial
32 A________ is defined to quick radix merge heap heap
be a complete binary tree
with the property that the
value of root node is at
least as large as the value
of its children node.
33 Binary trees are used in quick sort merge heap lrsort heap sort
______ sorting. sort sort
34 The ____ of the heap has Node Root Leaf Branch Root
the largest key in the tree.
35 In Threaded Binary Tree 1 2 3 0 1
,LCHILD(P) is a normal
pointer When LBIT(P) =
____
36 In Threaded Binary Tree 1 2 3 0 4
,LCHILD(P) is a Thread
When LBIT(P) = ____
37 In Threaded Binary Tree 2 1 3 0 2
,RCHILD(P) is a normal
pointer When RBIT(P) =
____
38 In Threaded Binary Tree 1 2 0 4 3
,RCHILD(P) is a Thread
When LBIT(P) = ____
39 The number of edges from
the root to the node is called
__________ of the tree.
Height Depth Length Width Depth
40 The number of edges from
the node to the deepest
leaf is called _________ of
the tree. Height Depth Length Width Height
 Each
41 node
Each All the has Each
node has Each leaves exactly node has
exactly node has are at one or exactly
zero or exactly the two zero or
two two same childre two
What is a full binary tree? children children level
A n children
42 binary
A binary tree, A binary
tree, which tree,
which is is which is
completel compl completel
y filled, etely y filled,
with the filled, with the
possible with possible
exception the A tree exception
of the possib In of the
Each bottom le which bottom
node has level, except all level,
exactly which is ion of nodes which is
zero or filled the have filled
What is a complete binary two from right botto degree from left
tree? children to left m 2 to right
43
In a full binary tree if there
are L leaves, then total N=L N= N = 2*L
number of nodes N are? N = 2*L N=L+1 –1 2*L – 1 –1
44 n n+1 2n 2n+1 n+1
The no of external nodes
in a full binary tree with n
internal nodes is
45 A threaded binary tree is a Pre-order In-order In- Post- In-order
binary tree in which every successo successor order order successor
node that does not have predec success
right child has a thread to its esso or

46 A binary tree T has n leaf log2n n-1 n n n-1

nodes. The number of nodes 2
of degree 2 in T is
47 The post order traversal of ABFCDE ADBFEC ABDEC ABDCEF ABDECF
binary tree is DEBFCA. Find F
out the pre order traversal

48 Sets are represented as arrays linked lists graphs trees trees

_____
49 What is the maximum height p log(p) log(p)/ p⁄2 log(p)
of an AVL tree with p nodes? 2

50 The leaves of an expression operators operands null expressi operands

tree always contain? on
51 Binary
An expression tree is a search Fibonacci Binary
kind of? tree tree tree Treap Binary tree
52
paranth
postfix prefix infix esized postfix
An expression tree is expressio expressio expre expres expressio
created using? n n ssion sion n
53 An expression tree’s
nodes can be deleted by
calling? malloc calloc delete free free
54 A B-tree of order 4 and of
height 3 will have a
maximum of _______
keys. 255 63 127 188 255
55 What is the maximum
number of children that a
binary tree node can
have? 0 1 2 3 2
56
How many common
operations are performed
in a binary tree? 1 2 rando3 4 3
57 What is the traversal depth- breadth- m Priority breadth-
strategy used in the binary first first traver travers first
tree? traversal traversal sal al traversal
58 Traversing a binary tree
first root and then left none
and right subtrees called inord of
_______traversal. postorderpreorder er these preorder
59
If each node in a tree has
value greater the every
value in its left subtree Binar
and has value less than y Binary
every value in its right searc AVL search
subtree, the tree is called Complete Full
treebinaryhtree
tree tree tree
60 The number of nodes in
a complete binary tree of
level 5 is 15 20 63 71 63
`