Binary Tree Operations Multiple choice Questions and Answers (MCQs)
What is the maximum number of children that a binary tree node can have?
Question 1 Explanation:
In a binary tree, a node can have atmost 2 nodes (i.e.) 0, 1 or 2 left and right child.
The following given tree is an example for?
Binary search 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.
A binary tree is a rooted tree but not an ordered tree.
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.
How many common operations are performed in a binary tree?
Question 4 Explanation:
Three common operations are performed in a binary tree- they are insertion, deletion and traversal.
What is the traversal strategy used in the binary tree?
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.