Exploring Trees and Graphs

What distinguishes a complete binary tree from a regular binary tree?

• A complete binary tree is always balanced in height.

• A complete binary tree is fully filled at all levels except possibly the last, while a regular binary tree can have varying structures.

• A complete binary tree can have any number of children per node.

• A complete binary tree has nodes only on the left side.

Explain the concept of a binary search tree.

• A binary search tree is a data structure that only allows duplicate values in the left child.

• A binary search tree is a linear data structure where each node can have any number of children.

• A binary search tree is a type of graph where nodes are connected in a circular manner.

• A binary search tree is a hierarchical data structure where each node has at most two children, with the left child containing values less than the node and the right child containing values greater.

What is a heap in the context of trees?

• A heap is a database management system used for storing large datasets.

• A heap is a tree-based data structure that satisfies the heap property, allowing efficient access to the maximum or minimum element.

• A heap is a type of graph that represents relationships between nodes.

• A heap is a linear data structure that stores elements in a sorted order.

Define the term 'root' in a tree structure.

• The root is any node in a tree structure.

• The root is the node with the highest value in a tree structure.

• The root is the topmost node in a tree structure.

• The root is the last node in a tree structure.

What is the degree of a node?

• The degree of a node is the total number of nodes in the graph.

• The degree of a node is the number of edges connected to it.

• The degree of a node is the average distance to other nodes.

• The degree of a node is its value in the graph.

Differentiate between terminal nodes and non-terminal nodes.

• Both terminal and non-terminal nodes are leaf nodes.

• Terminal nodes are always at the top of a tree; non-terminal nodes are at the bottom.

• Terminal nodes are leaf nodes with no children; non-terminal nodes are internal nodes with children.

• Terminal nodes can have children; non-terminal nodes cannot.

What are siblings in a tree?

• Nodes that share the same parent in a tree.

• Nodes that are at the same level in a tree.

• Nodes that are connected by a direct edge in a tree.

• Nodes that share the same grandparent in a tree.

Define the level of a node in a tree.

• The level of a node is its value in the tree.

• The level of a node is the depth of the tree.

• The level of a node is the number of edges from the root to that node.

• The level of a node is the total number of nodes in the tree.

Explain what a path is in the context of trees.

• A path is the total number of nodes in a tree.

• A path is a single node in a tree.

• A path is a method for balancing trees.

• A path in trees is a sequence of nodes connected by edges, representing a route from one node to another.

What is the depth of a node?

• The depth of a node is the total number of nodes from the root to that node.

• The depth of a node is the number of edges from the root to that node.

• The depth of a node is the height of the tree minus the level of that node.

• The depth of a node is the number of children that node has.