Red black tree sort: Difference between revisions
m
no edit summary
(red black trees need a rosettacode task) |
mNo edit summary |
||
Line 1:
{{draft task}}
Implement red-black tree sorting of fixed width integers. Here, the left branch will only contain nodes with a smaller key and the right branch will only contain nodes with a larger key.
Start with an empty tree, add 30 nodes each with arbitrary (aka "random") keys, then traverse the tree, printing the values from the left node, the key value, then the values from the right node, displaying their value and their color. Since we are using a red-black tree here, this would eliminate any duplicate values.
You may use an implementation at [[Algebraic data types]] as a starting point, if you find that helpful.
| |||