Binary Trees and Search Trees Quiz

Tree Data Structure

• A leaf node is a node in a tree that has no children, i.e., it is a terminal node with no further branches.

Node Relationships

• An ancestor node is a node that is above a given node in the tree, i.e., it is a parent or a grandparent, etc. of the node.
• Sibling nodes are nodes that have the same parent node, i.e., they are at the same level in the tree and are children of the same parent.

Tree Structure

• The root node is the topmost node in a tree, i.e., it is the node that has no parent node.

Tree Types

• A binary tree is a tree in which each node has at most two children, i.e., a left child and a right child.

Variations

• A threaded binary tree is a binary tree in which the empty child pointers of nodes are used to thread the nodes together, i.e., to create a linked list.

Tree Navigation

• A path in a tree is a sequence of nodes that connect from the root node to a particular node, i.e., it is a route through the tree to reach a specific node.