bintrees_red_black_tree_insert_search_quickstart.py

1from bintrees import RBTree
2
3# Initialize the Red-Black Tree
4tree = RBTree()
5
6# Insert some key-value pairs
7tree.insert(10, "Ten")
8tree.insert(20, "Twenty")
9tree.insert(5, "Five")
10
11# Retrieve a value by key
12print(f"Value for key 10: {tree.get(10)}")
13
14# Check if a key exists
15if 20 in tree:
16    print("Key 20 exists in the tree.")
17
18# Iterate through the tree (sorted by key)
19print("Tree contents:")
20for key, value in tree.items():
21    print(f"{key}: {value}")