KS5 - Tree - MMD

What is a tree in data structures?

• A linear data structure with nodes connected by edges

• A non-linear data structure with nodes connected by directed edges

• A collection of nodes with no connections

• A linear data structure with nodes connected in a cycle

In a tree, what is a node with no child nodes called?

• Root node

• Parent node

• Leaf node

• Subtree node

Which node is the root node in the given tree diagram?

• Node B

• Node C

• Node A

• Node D

What differentiates a tree from a graph?

• Trees can have cycles, graphs cannot

• Trees have directed edges, graphs have undirected edges

• Trees have a root node, graphs do not

• Trees do not have cycles, graphs can have cycles

What is a binary tree?

• A tree with a maximum of two child nodes per node

• A tree with a maximum of three child nodes per node

• A tree with a maximum of four child nodes per node

• A tree with no child nodes

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

• Each node has a corresponding value

• Duplicate node values are permitted

• The value in the left child node is greater than the parent node

• The value in the right child node is less than the parent node

In a binary search tree, where is the value of the left child node in relation to the parent node?

• Greater than the parent node

• Less than the parent node

• Equal to the parent node

• Unrelated to the parent node

What happens if a node value is greater than its parent in a binary search tree?

• It becomes a left child node

• It becomes a right child node

• It becomes the root node

• It is removed from the tree

What is the correct order of nodes visited in an in-order traversal?

• Root-Left-Right

• Left-Root-Right

• Right-Root-Left

• Root-Right-Left

In a binary search tree, if a node has a value less than the root, where is it placed?

• Right sub-tree

• Left sub-tree

• Root node

• Anywhere in the tree