Binary Tree Quiz

Which of the following is a property of a binary tree?

• Each node has at most two children.

• All nodes have exactly two children.

• The height of the tree is always equal to the number of nodes.

• All nodes are at the same level.

In a binary search tree (BST), which of the following statements is true?

• The left child is always greater than the parent node.

• The right child is always less than the parent node.

• The left child is always less than the parent node.

• The nodes are arranged in a random order.

Which of the following is a characteristic of a balanced binary tree?

• All leaf nodes are at the same level.

• The height difference between the left and right subtrees is at most one.

• Every node has two children.

• The tree is always complete.

If a binary tree has a height of 3, what is the maximum number of nodes it can have?

• 7

• 15

• 31

• 63

Given a binary tree, how would you determine its height?

• Count the number of leaf nodes.

• Count the number of edges from the root to the deepest leaf.

• Count the total number of nodes.

• Measure the width of the tree.

If you are given a binary tree and asked to perform an in-order traversal, which sequence would you follow?

• Visit the root, then the left subtree, and finally the right subtree.

• Visit the left subtree, then the root, and finally the right subtree.

• Visit the left subtree, then the right subtree, and finally the root.

• Visit the right subtree, then the left subtree, and finally the root.

Analyze the following binary tree structure. If the root node has a value of 10, the left child has a value of 5, and the right child has a value of 15, what can you conclude about this tree?

• It is a binary search tree.

• It is an unbalanced tree.

• It is a complete binary tree.

• It has duplicate values.

Evaluate the following binary tree. If the left subtree has a height of 2 and the right subtree has a height of 1, is this tree balanced?

• Yes, it is balanced.

• No, it is unbalanced.

• It depends on the number of nodes.

• It is balanced if the left subtree has more nodes.

If you were to create a binary tree with the following values: 20, 10, 30, 5, 15, which of the following structures would be correct?

• 20 as root, 10 as left child of 20, 30 as right child of 20, 5 as left child of 10, 15 as right child of 10.

• 20 as root, 30 as left child of 20, 10 as right child of 20, 15 as left child of 30, 5 as right child of 30.

• 20 as root, 10 as left child of 20, 5 as right child of 10, 30 as right child of 20, 15 as left child of 30.

• 20 as root, 10 as left child of 20, 30 as right child of 20, 15 as left child of 30, 5 as right child of 30.

Which traversal method would you use to create a sorted list from a binary search tree?

• Pre-order traversal

• In-order traversal

• Post-order traversal

• Level-order traversal