Timeline for A red-black full tree where every black node has at most 1 red child has at most (n-1)/4 red nodes
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 4, 2022 at 22:07 | comment | added | John L. | Please come to chat with me. | |
| Jun 4, 2022 at 21:27 | comment | added | SVMteamsTool | Hey I've been thinking about this and I can't seem to prove claim 2? Wouldn't a red node still have a dollar if it either has less than 2 children or has no siblings? | |
| May 28, 2022 at 11:52 | vote | accept | SVMteamsTool | ||
| May 26, 2022 at 16:53 | history | answered | John L. | CC BY-SA 4.0 |