Draw the Red Black Tree that results from inserting the following values in the given order:
[10, 20, 30, 4, 5, 50]
Draw the red connections with a dotted line and the black ones with a continuous line.
What I understand about Red Black Trees:
Every node is either red or black.
The root and leaves are black.
If a node is red, then its parent is black.
For every leaf, the path has the same number of black nodes (the tree is balanced).
My profs solution:
Solution from this website
I'm very confused as to how to solve this, my prof's PPTs say that all the red connections are to the left, I've found places that say that all reds are to the right, others where it's irrelevant. Can someone explain how to solve this?