Tree Data Structure Quiz

What is the maximum number of edges in a tree with n nodes?

• (n+1)

• (2n)

• (n-1)

• (n/2)

Which of the following is true about a root node in a tree?

• It can have multiple parents.

• It cannot have any children.

• There must be only one root node.

• It is the last node in the tree.

What is the degree of a node?

• The total number of edges in the tree.

• The total number of children of that node.

• The height of the tree.

• The level of the node.

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

• One or two

• Any number

• Zero or two

• Zero or one

What is a skewed binary tree?

• A tree dominated by left or right child nodes.

• A tree with equal number of left and right children.

• A tree with all levels completely filled.

• A tree with no children.

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

• The total number of nodes in the tree

• The number of edges from root to leaf

• 1

• 0

Which of the following is NOT an application of tree data structures?

• Used for linear search.

• Used in data compression.

• Manipulate hierarchical data.

• Used by compilers to build syntax trees.

What is a subtree?

• A tree with no children.

• A tree formed by a child node and its descendants.

• A tree that has multiple roots.

• A tree with only one node.

What is the purpose of the insert function in a binary search tree?

• To add a new element at the appropriate location.

• To find the height of the tree.

• To traverse the tree.

• To delete a node.

What happens when deleting a non-leaf node with two children in a binary search tree?

• It cannot be deleted.

• It is replaced with the largest element in its left subtree or the smallest in its right subtree.

• It is replaced with a random node.

• It is removed without any replacement.