Timeline for Red-Black tree height from CLRS
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 8, 2021 at 11:06 | vote | accept | user8469759 | ||
| Nov 1, 2021 at 12:55 | comment | added | AlessandroF | Yes I wrote it twice to show that from the minimum to the highest height, $bh(x) \geq h(x)/2$ always | |
| Oct 31, 2021 at 15:50 | comment | added | user8469759 | it's good to discuss. I think the answer is ok overall. I think you wrote twice the same inequality, not sure this was meant. | |
| Oct 30, 2021 at 18:50 | comment | added | AlessandroF | Hi @user8469759, I updated my answer. I am just a student so I don't know if I might be wrong, I hope not :-) | |
| Oct 30, 2021 at 18:49 | history | edited | AlessandroF | CC BY-SA 4.0 |
added 446 characters in body
|
| Oct 30, 2021 at 9:40 | history | edited | xskxzr | CC BY-SA 4.0 |
added 6 characters in body
|
| Oct 27, 2021 at 12:07 | comment | added | user8469759 | I think you want to clarify a bit on the maximum height and why that's combination is the one that attains the maximum (and eventually why it's the unique one), for given $n$ nodes in the tree. | |
| Oct 27, 2021 at 8:53 | comment | added | user8469759 | It's never too late. | |
| S Oct 26, 2021 at 17:35 | review | First answers | |||
| Oct 30, 2021 at 9:40 | |||||
| S Oct 26, 2021 at 17:35 | history | answered | AlessandroF | CC BY-SA 4.0 |