Difference between revisions of "Talk:DIP55"
FBergemann (talk | contribs) |
FBergemann (talk | contribs) |
||
| Line 2: | Line 2: | ||
------------------------ | ------------------------ | ||
An initial version of <br> | An initial version of <br> | ||
| − | [https://github.com/FBergemann/ASF-RBT/tree/for_delete ASF RBT] Red/Black-Tree algorithm using this programming model w/o need for a parent ptr in the node structure. <br> | + | :[https://github.com/FBergemann/ASF-RBT/tree/for_delete ASF RBT] Red/Black-Tree algorithm using this programming model w/o need for a parent ptr in the node structure. <br> |
| − | - including delete operation - | + | - including delete operation - is available now. <br> |
| − | is available now. <br> | ||
I feel excited about the new way of programming :-) <br> | I feel excited about the new way of programming :-) <br> | ||
And i am pretty sure, so far i only touched the top of an iceberg. <br> | And i am pretty sure, so far i only touched the top of an iceberg. <br> | ||
Revision as of 14:39, 15 June 2016
2016-06-15 - FBergemann:
An initial version of
- ASF RBT Red/Black-Tree algorithm using this programming model w/o need for a parent ptr in the node structure.
- including delete operation - is available now.
I feel excited about the new way of programming :-)
And i am pretty sure, so far i only touched the top of an iceberg.
Notes:
+) ASF-RBT still has to be tested, documented, and cleaned-up (re-align "insert" with experiences from "delete"), maybe still some errors to be fixed.
+) ASF-RBT is just an example
