CHAPTER 5 : TREES

What is the root node in a tree?

• The last node in the tree

• A node without any children

• The first node in the tree

• A node with two children

In a binary tree, how many children can a node have at most?

• One

• Two

• Three

• Unlimited

Which of the following is true about a binary search tree (BST)?

• The left child must have a value greater than the root

• The right child must have a value greater than the root

• All children must have the same value

• The root must be smaller than all children

What is a leaf node?

• A node that is the root

• A node with no children

• A node with exactly two children

• A node with multiple parents

What is the degree of a node in a tree?

• The number of siblings

• The number of children a node has

• The number of parents a node has

• The number of leaves in the tree

Which traversal method visits the left subtree, then the root, and finally the right subtree?

• Pre-order traversal

• Post-order traversal

• In-order traversal

• Level-order traversal

Which type of tree allows a node to have at most three children?

• Binary Tree

• Ternary Tree

• N-ary Tree

• AVL Tree

What is the depth of a node in a tree?

• The distance from the root to the node

• The number of children the node has

• The number of sibling nodes

• The distance from the leaf to the node

In a binary search tree (BST), which node should be inserted into the left subtree?

• Any node smaller than the root

• Any node with a value smaller than the root

• Any node with a value greater than the root

• Any node with a value equal to the root

What type of node has no child nodes?

• Root node

• Leaf node

• Parent node

• Subtree node