Well, feedback more than help. By making the tutorial longer it will take more time as I'm so busy these days. The code isn't too much of a problem, but writing an understandable explanation for such complex concepts is very time consuming.
Both AVL and Red Black insertion and deletion
Both AVL and Red Black insertion, only AVL deletion
Both AVL and Red Black insertion, only Red Black deletion
Both AVL and Red Black insertion and deletion, AND lazy deletion for both! I want Prelude to work hard and give me the best tutorial ever!
Well, feedback more than help. By making the tutorial longer it will take more time as I'm so busy these days. The code isn't too much of a problem, but writing an understandable explanation for such complex concepts is very time consuming.
My best code is written with the delete key.
Unless you simply just didn't have the time, and I think I can speak for all of us by saying this should definately be a low priority in your life, I would have to go for both insertion and deletion on both tree types. Anyone who is interested enough to try and learn about them would almost certainly want to know how to code both the insertion and deletion. I wouldn't bother with lazy deletion though except maybe mention it in passing, its pretty easy to figure out on their own.
why not employ someone to help you ?Originally Posted by Prelude
blow me ... ...
>why not employ someone to help you ?
Because I'm a control freak.
>Do versions for C
Already doing that.
>C++
The standard library already does that.
>and Managed C++ too.
*smack!*
My best code is written with the delete key.
Now dont forget C# as well