A-level Binary Trees (video)

What is a fundamental characteristic of a tree data structure?

• It can only have one child node per parent.
• It consists of nodes and edges.
• It has a single root node at the bottom.
• It is always a linear structure.

What is a key characteristic that distinguishes a binary tree from a standard tree?

• A binary tree can have an unlimited number of child nodes.
• Binary trees cannot have leaf nodes.
• Each node in a binary tree can have at most two children.
• A binary tree must always be balanced.

Which of the following statements accurately describes leaf nodes in a tree?

• They are nodes at the very bottom of the tree.
• They are nodes that do not connect to any other nodes.
• They are always connected to the root node.
• They are nodes that have at least one child.

In a tree structure, what is the role of the root node?

• It can only connect to one child node.
• It connects to all leaf nodes directly.
• It is the only node without children.
• It is the topmost node that connects to child nodes.

What defines a subtree in a tree structure?

• A single node without any connections.
• A set of nodes and edges from any single node down through all of its descendants.
• The entire tree excluding the root node.
• Any node that has at least two child nodes.

Which of the following is a common application of tree data structures?

• Storing and managing flat file data.
• Creating simple arrays for data storage.
• Implementing search algorithms in linear lists.
• Storing and managing file and folder structures.

Which of the following statements is true about the A* pathfinding algorithm?

• It does not utilize tree structures.
• It is implemented using binary trees.
• It is only used in gaming applications.
• It is a linear search algorithm.

Which of the following best describes the relationship between tree structures and hierarchical data?

• Only binary trees can represent hierarchical data.
• Trees are ideal for storing and manipulating hierarchical data.
• Trees cannot represent hierarchical data.
• Hierarchical data is always stored in arrays.

What is a defining feature of a binary tree?

• Each node can have up to three children.
• Each node can only have zero, one, or two pointers.
• It cannot have leaf nodes.
• All nodes must be connected to the root.

What is a common misconception about binary trees?

• They can only be used for searching.
• They can have more than two child nodes.
• They are not useful in database applications.
• They can only be represented as linked lists.