search

emilydolson / python-red-black-trees

Red-black tree implementation in Python
Other
18 stars 5 forks source link

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

Open Beakerboy opened 8 months ago

Beakerboy commented 8 months ago

The following code:

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 more appropriate:

2(BLACK)
     L----  1(RED)
     R----  3(RED)

let me know if you disagree:

Beakerboy commented 8 months ago

10 fixes this