| Balanced Binary Tree |
A tree structure that maintains a height difference of at most one between its left and right subtrees, promoting efficient performance for operations. |
| Binary Tree |
A data structure composed of nodes, where each node has at most two children. |
| Breadth-First Traversal |
A tree traversal technique that processes all sibling nodes before proceeding to their children, ensuring that nodes are visited in a level-wise manner. |
| Child |
A node that is a direct descendant of another node. A node can have a left child and a right child. |
| Complete Binary Tree |
A tree where all levels are fully filled except possibly for the last level, which is filled from left to right. |
| Decision Trees |
Used in machine learning for classification tasks. |
| Deletion |
Can be more complex as it requires careful consideration of the node's children, with different cases arising depending on whether the node to be deleted has zero, one, or two children. |
| Depth |
The number of edges from the root to a specific node. The root is at depth zero. |
| Full Binary Tree |
A tree structure where every node, except for the leaves, has exactly two children. |
| Game Trees |
Represent possible moves in two-player games for decision-making. |
| Heap Data Structures |
Used in priority queues for efficient access to max/min elements. |
| Huffman Coding |
Used in data compression to represent variable-length codes. |
| Inorder Traversal |
A technique where the nodes are visited in the order: left subtree, root, right subtree. |
| Insertion |
Involves adding a new node while maintaining the tree's properties by placing the new node in the correct position based on its value. |
| Leaf Node |
A node that has no children, meaning it is at the end of a branch. |
| Level-Order Traversal |
A method of visiting nodes in a tree data structure by exploring all nodes at the current depth level before moving on to nodes at the next depth level. |
| Node |
The basic building block of the tree, which holds data and references to its left and right children. |
| Parent |
A node that has one or more children. Every node, except the root, has one parent. |
| Postorder Traversal |
A strategy where the nodes are visited in the order: left subtree, right subtree, root. |
| Preorder Traversal |
A method where the nodes are visited in the order: root, left subtree, right subtree. |
| Root |
The topmost node in the tree, which serves as the starting point. It has no parent. |
| Siblings |
Nodes that share the same parent. |
| Subtree |
A portion of the tree that consists of a node and all its descendants. |
| Traversal Algorithms |
Crucial in searching, sorting, and evaluating hierarchical data. |
| Unbalanced Binary Tree |
A tree structure where the nodes are arranged in a skewed manner, potentially degenerating into a linked list and adversely affecting operation time complexity. |
