Data Structures and Algorithms MCQs | Objective Questions Answers

Questions
31 The in order traversal of tree will yield a sorted listing of elements of tree in....
A Merging
B AVL Trees
C Binary trees
D Binary search trees

Answer: Option [D]
32 A binary tree whose every node has either zero or two children is called.........
A Extended binary tree
B Complete binary tree
C Binary Search tree
D Disjoint tree

Answer: Option [A]

⭐ Make GKSeries Your Preferred Source on Google

Add GKSeries as Preferred Source
33 The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
A ABFCDE
B ADBFEC
C ABDECF
D ABDCEF

Answer: Option [C]
34 Three standards ways of traversing a binary tree T with root R .......
A Prefix, infix, postfix
B Pre-process, in-process, post-process
C Pre-traversal, in-traversal, post-traversal
D Pre-order, in-order, post-order

Answer: Option [D]
35 A technique for direct search is
A Hashing
B Tree Search
C Binary Search
D Linear Search

Answer: Option [A]
36 If a node having two children is deleted from a binary tree, it is replaced by its
A Preorder predecessor
B Inorder predecessor
C Inorder successor
D Preorder successor

Answer: Option [C]
37 A full binary tree with 2n+1 nodes contain
A n leaf nodes
B n non-leaf nodes
C n-1 leaf nodes
D n-1 non-leaf nodes

Answer: Option [B]
38 A full binary tree with n leaves contains
A n - 1 nodes
B log2n nodes
C 2n – 1 nodes
D 2n nodes

Answer: Option [C]
39 The smallest element of an array’s index is called its
A extraction
B range
C lower bound
D upper bound

Answer: Option [C]
40 The data structure required for Breadth First Traversal on a graph is
A queue
B stack
C array
D None of the above

Answer: Option [A]
apsc complete general studies course