Binary Trees and Heaps Quiz

The topmost node of a binary tree is called:

• Parent node

• Root node

• Leaf node

• Child node

A binary tree can have at most how many children per parent?

• 1

• 2

• 3

• Unlimited

In a binary tree, nodes without children are called:

• Parents

• Roots

• Leaves

• Branches

Which traversal visits nodes in the order Left-Root-Right?

• Preorder

• Postorder

• Inorder

• Level order

Which traversal visits the root node first, then left and right subtrees?

• Inorder

• Preorder

• Postorder

• Level order

In a Binary Search Tree (BST), all values in the left subtree are:

• Equal to the parent

• Less than the parent

• Greater than the parent

• Random

A BST does not allow:

• Unique keys

• Duplicates

• Left subtrees

• Right subtrees

Which traversal is most useful for retrieving BST values in sorted order?

• Preorder

• Postorder

• Inorder

• Level order

Which traversal uses a queue and visits nodes level by level?

• Inorder

• Postorder

• Preorder

• Breadth-first

In an AVL tree, the balance factor is:

• Height of right - height of left

• Height of left - height of right

• Total height of tree

• Sum of children's heights