Timeline for How to solve recurrence of a binary tree
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 3, 2021 at 13:36 | vote | accept | Tiberius | ||
| Apr 3, 2021 at 12:07 | answer | added | Yuval Filmus | timeline score: 1 | |
| Apr 3, 2021 at 11:33 | comment | added | Tiberius | @YuvalFilmus They just gave me that recurrence in the lecture, but now that I think about it, it doesn't seem right, I have updated the question with the code, what would be the correct recurrence for that, and how can I solve it. Sorry I'm a bit newbie with maths. | |
| Apr 3, 2021 at 11:32 | history | edited | Tiberius | CC BY-SA 4.0 |
More details
|
| Apr 3, 2021 at 9:17 | comment | added | Yuval Filmus | The heights do not satisfy the equation $n_l + n_r + 1 = n$. Rather, $n = \max(n_l,n_r) + 1$. | |
| Apr 3, 2021 at 9:17 | history | edited | Yuval Filmus | CC BY-SA 4.0 |
added 1 character in body
|
| Apr 3, 2021 at 4:47 | comment | added | Yuval Filmus | You cannot solve this recurrence since it’s not completely specified. | |
| Apr 3, 2021 at 2:42 | review | First posts | |||
| Apr 5, 2021 at 20:13 | |||||
| Apr 3, 2021 at 2:37 | history | asked | Tiberius | CC BY-SA 4.0 |