python-red-black-trees

python-red-black-trees copied to clipboard

Successor and predecessor of max and min values results in error

1

```python bst = RedBlackTree() bst.insert(55) bst.insert(40) bst.insert(58) bst.insert(42) assert bst.successor(bst.search(58)).key is None ``` > while not y.is_null() and x == y.right: E AttributeError: 'NoneType' object has no attribute 'is_null'

Beakerboy

Allow for the addition of Node objects

1

A user may wish to extend the Node object, or implement the Node interface within a custom object. The RedBlackTree could be made to accept these objects and organize them...

Beakerboy

Add and test len()

1

Beakerboy

Fix bug in print_tree()

1

* Added a `__str__()` to RedBlackTree to aid testing. * Added testing of `Node.__repr__()`

Beakerboy

Add `__len__()` to RedBlackTree

1

The class has a size attribute so it makes sense to use the standard `__len__()` method to access it instead of relying on it being a public attribute.

Beakerboy

When printing a tree, the root node is preceded with R——

1

The following code: ```python bst = RedBlackTree() bst.insert(1) bst.insert(2) bst.insert(3) bst.print_tree() ``` produces the following output: ``` R---- 2(BLACK) L---- 1(RED) R---- 3(RED) ``` I feel the following would be...

Beakerboy

Usage as a backend for a SET-like datastructure

1

I want to use your implementation for my data structure. In particular set would behave like this: ``` s = set() s.add(1) s.add(2) # Logarithmic search one_present = 1 in...

thestics

Uml Output

1

There is a extended UML format that I feel could be used to visualize the tree structure quite well: ``` @startmindmap *[#red] \rotatebox{90}{Root Entry} **[#black] \rotatebox{90}{} **[#black] \rotatebox{90}{\textcolor{white}{PROJECT}} ***[#red] \rotatebox{90}{PROJECTwm}...

Beakerboy