Data Structures - Trees

What is a characteristic of a binary tree?

• Each node has exactly one child

• Each node has at most three children

• Each node has at most two children

• There are no specific limits on the number of children each node can have

Which traversal is not a type of recursive tree-traversal algorithm?

• In-order

• Pre-order

• Post-order

• Cross-order

What is a tree in the context of computer science?

• A physical tree found in nature

• A type of data structure with nodes and connections

• A programming language

• A software development methodology

How does a tree in computer science differ from a natural tree in terms of structure?

• It does not have any branches or leaves

• Its root is typically at the bottom

• Its root is at the top

• It is always green

What is the definition of a tree in the context of data structures?

• A connected, directed graph with no cycles.

• A connected, undirected graph with no cycles.

• A graph with at least one cycle.

• A disconnected graph with multiple paths between nodes.

What is a rooted tree in data structures?

• A tree where each node has two children

• A tree where each node can have any number of children, but only one parent

• A tree where each node is connected to all other nodes

• A tree where each node has exactly one parent and no children

What is the term used to describe the topmost node in a rooted tree diagram?

• Edge

• Node

• Root

• Leaf

In a rooted tree, what term is used to describe any node that does not have child nodes?

• Root

• Subtree

• Parent

• Leaf

Which term describes the connection between any two nodes in a tree?

• Edge

• Subtree

• Child

• Parent

What do you call the subset of a tree that consists of a node and all its descendants?

• Node

• Edge

• Subtree

• Leaf