Timeline for Speculating big O for a binary tree
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 29, 2017 at 7:00 | comment | added | D.W.♦ | Cross-posted: cs.stackexchange.com/q/71727/755, stackoverflow.com/q/42883388/781723. Please do not post the same question on multiple sites. Each community should have an honest shot at answering without anybody's time being wasted. | |
| Mar 20, 2017 at 23:37 | history | tweeted | twitter.com/StackCompSci/status/843969891321438211 | ||
| Mar 19, 2017 at 7:47 | vote | accept | Megidd | ||
| Mar 19, 2017 at 7:41 | answer | added | Yuval Filmus | timeline score: 2 | |
| Mar 19, 2017 at 7:34 | history | edited | Yuval Filmus | CC BY-SA 3.0 |
added 8 characters in body
|
| Mar 19, 2017 at 3:46 | history | edited | Megidd | CC BY-SA 3.0 |
Added the case for a perfect binary tree
|
| Mar 19, 2017 at 2:22 | history | edited | Megidd | CC BY-SA 3.0 |
Added most un-balanced case
|
| Mar 18, 2017 at 18:58 | comment | added | D.W.♦ | What have you tried so far? Have you tried working through some examples or extreme cases? Have you tried working out what the value will be for a balanced tree? For a maximally unbalanced tree? You should be able to answer your question on your own if you just work through those two cases... | |
| Mar 18, 2017 at 18:49 | review | First posts | |||
| Mar 18, 2017 at 19:19 | |||||
| Mar 18, 2017 at 18:45 | history | asked | Megidd | CC BY-SA 3.0 |