Class Node

algorithms/data_structures/b_tree.py:18–46

A node in a B-tree containing keys and child pointers. Examples: >>> node = Node() >>> node.keys []

class Node:
    """A node in a B-tree containing keys and child pointers.

    Examples:
        >>> node = Node()
        >>> node.keys
        []
    """

    def __init__(self) -> None:
        self.keys: list = []
        self.children: list[Node] = []

    def __repr__(self) -> str:
        """Return a string representation of the node.

        Returns:
            A string showing the node's keys.
        """
        return f"<id_node: {self.keys}>"

    @property
    def is_leaf(self) -> bool:
        """Check whether this node is a leaf.

        Returns:
            True if the node has no children, False otherwise.
        """
        return len(self.children) == 0


class BTree: