# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS CLICK HERE TO DOWNLOAD ## Binary Tree Operations Multiple choice Questions and Answers (MCQs)

 Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is the maximum number of children that a binary tree node can have?
 A 0 B 1 C 2 D 3
Question 1 Explanation:
In a binary tree, a node can have atmost 2 nodes (i.e.) 0, 1 or 2 left and right child.

 Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
The following given tree is an example for?
 A Binary tree B Binary search tree C Fibonacci tree D AVL tree
Question 2 Explanation:
The given tree is an example for binary search since the tree has got two children and the left and right children do not satisfy binary search tree's property.

 Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
A binary tree is a rooted tree but not an ordered tree.
 A true B false
Question 3 Explanation:
A binary tree is a rooted tree and also an ordered tree (i.e) every node in a binary tree has at most two children.

 Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
How many common operations are performed in a binary tree?
 A 1 B 2 C 3 D 4
Question 4 Explanation:
Three common operations are performed in a binary tree- they are insertion, deletion and traversal.

 Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is the traversal strategy used in the binary tree?
 A depth-first traversal B breadth-first traversal C random traversal D preorder traversal
Question 5 Explanation:
Breadth first traversal, also known as level order traversal is the traversal strategy used in a binary tree. It involves visiting all the nodes at a given level.

There are 5 questions to complete.