btr - Python

btr is a Python module that provides an interface to the binary tree based on the red-black tree implementation.

Features

• Efficient implementation with logarithmic time complexity for insertion, deletion, and search operations.
• Balanced tree structure with stable maximum height for optimal performance.
• Easy to use interface for adding, removing, and searching for elements.
• Flexible node structure for customization of elements.

Installation

You can install btr using pip:

pip install btr

Usage

To start using btr, import the RedBlackTree class:

from btr import RedBlackTree

Creating a tree

To create an empty tree, simply call the constructor:

tree = RedBlackTree()

Adding elements

To add elements to the tree, use the add method:

tree.add(42)
tree.add(13)
tree.add(27)

Removing elements

To remove elements from the tree, use the remove method:

tree.remove(13)
tree.remove(42)

Searching for elements

To search for an element in the tree, use the contains method:

if tree.contains(27):
    print("Element found!")
else:
    print("Element not found.")

Node structure

Each node in the tree is represented by an instance of the Node class, which has two attributes: left and right, which represent the left and right child nodes, respectively. The Node class can be subclassed to store additional attributes for the elements being stored in the tree.

Conclusion

btr provides a reliable and efficient implementation of a red-black tree in Python. Its balanced tree structure and logarithmic time complexity for insertion, deletion, and search operations make it an excellent choice for a variety of applications.