What is a Binary Tree?
A
A tree with unlimited children per node B
A tree with nodes having at most two children C
A tree where each node has exactly two children D
A linked list with two pointers
Analysis & Theory
In a binary tree, each node can have at most two children.
What are the two children of a binary tree node commonly called?
A
Left and Right child B
Parent and Child C
Top and Bottom node D
First and Last node
Analysis & Theory
They are called the left child and the right child.
In a Binary Search Tree (BST), where are smaller values stored?
A
Right subtree B
Left subtree C
Root node D
Leaf nodes
Analysis & Theory
In a BST, left subtree nodes contain smaller values.
What is the maximum number of nodes at level 'l' in a binary tree?
A
l B
2^l C
2^(l-1) D
l^2
Analysis & Theory
At level l, there can be at most 2^(l-1) nodes.
Which traversal of a Binary Tree processes nodes in the order: Left, Root, Right?
A
Pre-order B
Post-order C
In-order D
Level-order
Analysis & Theory
In-order traversal processes Left, Root, Right.
What is a Full Binary Tree?
A
A tree where every node has two children or none B
A tree with all leaves on the same level C
A tree where all nodes have exactly two children D
A tree completely filled except for the last level
Analysis & Theory
A Full Binary Tree has nodes with either 0 or 2 children.
What is a Complete Binary Tree?
A
A tree where every node has exactly two children B
A tree that is completely filled except possibly the last level, which is filled left to right C
A tree with all leaves at the same level D
A tree where all nodes have the same value
Analysis & Theory
A Complete Binary Tree has all levels filled except possibly the last.
Which traversal uses a queue to visit nodes level by level?
A
Pre-order traversal B
Level-order traversal C
Post-order traversal D
In-order traversal
Analysis & Theory
Level-order traversal uses a queue and visits nodes breadth-first.
Which of these is NOT true about Binary Search Trees?
A
Left subtree nodes < root node B
Right subtree nodes > root node C
Duplicates are always stored in the right subtree D
All levels are always completely filled
Analysis & Theory
BSTs do not require all levels to be filled.
In a Binary Tree with n nodes, what is the maximum height?
A
log₂(n) B
n-1 C
n D
n/2
Analysis & Theory
The maximum height occurs when the tree is skewed, height = n-1.