# 50+ Binary Trees using Linked Lists MCQs with FREE PDF

We have the best collection of Binary Trees using Linked Lists MCQs and answer with FREE PDF. These Binary Trees using Linked Lists MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

## Binary Trees using Linked Lists MCQs

#### 1. Level order traversal of a tree is formed with the help of

a) breadth first search

b) depth first search

c) dijkstra’s algorithm

d) prims algorithm

#### 2. Identify the reason which doesn’t play a key role to use threaded binary trees?

a) The storage required by stack and queue is more

b) The pointers in most of nodes of a binary tree are NULL

c) It is Difficult to find a successor node

d) They occupy less size

Answer: They occupy less size

#### 3. Advantages of linked list representation of binary trees over arrays?

a) dynamic size

b) ease of insertion/deletion

c) ease in randomly accessing a node

d) both dynamic size and ease in insertion/deletion

Answer: both dynamic size and ease in insertion/deletion

#### 4. What is the code below trying to print?

``````void print(tree *root,tree *node)
{
if(root ==null) return 0
if(root-->left==node || root-->right==node) || print(root->left,node)
||printf(root->right,node)
{
print(root->data)
}
}
``````

a) just printing all nodes

b) not a valid logic to do any task

c) printing ancestors of a node passed as argument

d) printing nodes from leaf node to a node passed as argument

Answer: printing ancestors of a node passed as argument

#### 5. Disadvantages of linked list representation of binary trees over arrays?

a) Randomly accessing is not possible

b) Extra memory for a pointer is needed with every element in the list

c) Difficulty in deletion

d) Random access is not possible and extra memory with every element

Answer: Random access is not possible and extra memory with every element

a) Post order

b) Pre order

c) Post order

d) Randomized

#### 7. The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion)

i) from root search for the node to be deleted

ii)

iii) delete the node at

what must be statement ii) and fill up statement iii)

a) ii)-find random node,replace with node to be deleted. iii)- delete the node

b) ii)-find node to be deleted. iii)- delete the node at found location

c) ii)-find deepest node,replace with node to be deleted. iii)- delete a node

d) ii)-find deepest node,replace with node to be deleted. iii)- delete the deepest node

Answer: ii)-find deepest node,replace with node to be deleted. iii)- delete the deepest node

#### 8. What may be the psuedo code for finding the size of a tree?

a) find_size(root_node–>left_node) + 1 + find_size(root_node–>right_node)

b) find_size(root_node–>left_node) + find_size(root_node–>right_node)

c) find_size(root_node–>right_node) – 1

d) find_size(root_node–>left_node + 1

Answer: find_size(root_node–>left_node) + 1 + find_size(root_node–>right_node)