Tree

Definition

Non-linear data structure where nodes are organized in a hierarchy.

Terms

• Node: A data point in a tree data structure
• Edge: Connection/relation between nodes
• Root: Top-most node
• Branch: Middle node
• Leaf: Bottom-most node
• Parent: Node that has a child
• Child: Node that has a parent
• Siblings: Node that share the same parent
• Subtree: Smaller tree held within a larger tree
• Size: Total number of nodes
• Depth: Number of edges under the root node
• Height: Number of edges above furthest leaf node
• Tree traversal: Algorithm for navigating a tree data structure

Structure

from dataclasses import dataclass
 
type _Node = Node | None
 
@dataclass
class Node[T]:
    data: T
    left: _Node = None
    right: _Node = None

Implementation

See Operations in Binary Search Tree

Algorithms

Binary Tree

• Binary Tree Traversal Algorithms

Link to original