arborpy 0.2.0

A comprehensive Python library for tree data structures

ArborPy 🌳

A comprehensive, typed, and well-tested Python library for tree data structures.

Installation

pip install arborpy

Or with uv:

uv add arborpy

Quick Start

from arborpy import BinarySearchTree

bst = BinarySearchTree()
for val in [5, 3, 7, 1, 4]:
    bst.insert(val)

print(bst.inorder())    # [1, 3, 4, 5, 7]
print(bst.search(4))    # True
print(5 in bst)         # True
print(len(bst))         # 5
print(bst)              # Pretty-printed tree

Features

Binary Search Tree

from arborpy import BinarySearchTree

bst = BinarySearchTree()

# Insert values
for val in [5, 3, 7, 1, 4, 6, 8]:
    bst.insert(val)

# Search
bst.search(4)       # True
bst.search(99)      # False

# Delete
bst.delete(3)

# Min and max
bst.find_min()      # 1
bst.find_max()      # 8

# Tree properties
bst.height()        # 2
len(bst)            # 7

AVL Tree

from arborpy import AVLTree

avl = AVLTree()
for val in [10, 20, 30, 25, 28]:
    avl.insert(val)

print(avl)           # Pretty-printed balanced tree
print(avl.inorder()) # [10, 20, 25, 28, 30]
print(avl.height())  # 2 — stays balanced!

AVL Tree

from arborpy import AVLTree

avl = AVLTree()
for val in [10, 20, 30, 25, 28]:
    avl.insert(val)

print(avl)           # Pretty-printed balanced tree
print(avl.inorder()) # [10, 20, 25, 28, 30]
print(avl.height())  # 2 — stays balanced!

Traversals

from arborpy import BinarySearchTree

bst = BinarySearchTree()
for val in [5, 3, 7, 1, 4, 6, 8]:
    bst.insert(val)

bst.inorder()       # [1, 3, 4, 5, 6, 7, 8]
bst.preorder()      # [5, 3, 1, 4, 7, 6, 8]
bst.postorder()     # [1, 4, 3, 6, 8, 7, 5]
bst.level_order()   # [[5], [3, 7], [1, 4, 6, 8]]

Serialization

from arborpy import BinarySearchTree, to_json, from_json, to_dict, from_dict

bst = BinarySearchTree()
for val in [5, 3, 7]:
    bst.insert(val)

# To/from dictionary
d = to_dict(bst.root)
node = from_dict(d)

# To/from JSON
json_str = to_json(bst.root)
node = from_json(json_str)

Standalone Traversal Functions

from arborpy import Node, inorder, preorder, postorder, level_order

# Build a tree manually
root = Node(1, Node(2, Node(4), Node(5)), Node(3))

inorder(root)       # [4, 2, 5, 1, 3]
preorder(root)      # [1, 2, 4, 5, 3]
postorder(root)     # [4, 5, 2, 3, 1]
level_order(root)   # [[1], [2, 3], [4, 5]]

Roadmap

<<<<<<< HEAD

• Binary Search Tree
• Traversals (inorder, preorder, postorder, level-order)
• Serialization (dict, JSON)
• ASCII visualization
• AVL Tree (self-balancing)
• Min/Max Heap
• Red-Black Tree
• Trie (prefix tree)
• Segment Tree
• Fenwick Tree (Binary Indexed Tree)
• N-ary Tree

Contributing

See CONTRIBUTING.md for guidelines.

License

MIT — see LICENSE for details.