bintrees_rbtree_insert_search_delete_iteration_quickstart.py

1from bintrees import RBTree
2
3# Initialize a new Red-Black Tree
4tree = RBTree()
5
6# Insert elements into the tree (key, value)
7tree.insert(10, "Ten")
8tree.insert(20, "Twenty")
9tree.insert(5, "Five")
10tree.insert(15, "Fifteen")
11
12# Accessing values by key
13print(f"Value for key 10: {tree[10]}")
14
15# Checking if a key exists
16if 20 in tree:
17    print("Key 20 exists in the tree.")
18
19# Deleting an element
20tree.remove(5)
21print(f"Tree size after removal: {len(tree)}")
22
23# Iterating over the tree (yields sorted keys)
24print("Sorted keys in the tree:")
25for key in tree:
26    print(key)
27
28# Get the minimum and maximum keys
29print(f"Minimum key: {tree.min_key()}")
30print(f"Maximum key: {tree.max_key()}")