Quiz on Trees and Binary Search Trees

What is the worst-case time complexity for searching in a balanced binary search tree?

• O(n)

• O(log n)

• O(n log n)

• O(1)

What is the degree of a node in a tree?

• Number of edges from the root to the node

• Number of children of the node

• Total number of nodes in the tree

• Height of the node

Which of the following is true about leaf nodes?

• They are also known as internal nodes

• They have no children

• They have at least one child

• They are always at the root level

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

• More than 2

• 0 or 1

• 0, 1, or 2

• 1 or 2

What is the height of a leaf node in a tree?

• The number of children

• 0

• 1

• The number of edges to the root

What is the primary purpose of an expression tree?

• To visualize tree structures

• To store hierarchical data

• To represent algebraic expressions

• To perform binary search operations

Which traversal method visits the root node last?

• Pre-order

• In-order

• Level-order

• Post-order

What is the balance factor in an AVL tree?

• Height of the tree

• Total number of nodes in the tree

• Height of the left subtree minus height of the right subtree

• Number of children of the root

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

• All nodes have two children

• It can have any number of children

• Left subtree contains only nodes with values less than the root

• All nodes are at the same level

What happens when a node with two children is deleted from a binary search tree?

• It is replaced with its in-order predecessor or successor

• It is replaced with a leaf node

• It cannot be deleted

• It is simply removed