Emir Pasic
|
fae29a732d
|
red-black tree Clear() method
|
11 years ago |
|
Emir Pasic
|
a2b057ed41
|
red-black tree, get keys and values in-order (with tests)
|
11 years ago |
|
Emir Pasic
|
2ac9c4d384
|
- implemented linke list stack - minor changes on other libs - tests included
|
11 years ago |
|
Emir Pasic
|
14efefae45
|
- unexporting node struct and color constants (keeping the lib clean)
|
11 years ago |
|
Emir Pasic
|
3ba3ce1b0e
|
- adding Size() method to the redblacktree
|
11 years ago |
|
Emir Pasic
|
ca8727c91c
|
- adding save color(node) function to guard against nil-nodes
|
11 years ago |
|
Emir Pasic
|
8e21214018
|
- fix in insertion (break breaks the wrong thing)
|
11 years ago |
|
emirpasic
|
1c6ebbbd32
|
- debugging removal in red black tree (will carry on later)
|
11 years ago |
|
emirpasic
|
5cd4ddeb6d
|
- FIX: checking insertion into red black tree
|
11 years ago |
|
emirpasic
|
855ba6d469
|
- red-black-tree remove
- test failing (fixing it up)
|
11 years ago |
|
emirpasic
|
e42a0a3ce8
|
- red-black tree tests
- start on remove function of tree
|
11 years ago |
|
emirpasic
|
e7a7e55a47
|
- red black tree get and put
|
11 years ago |