Timeline for Changing AVL's balance factor to some other $s>2 \in \mathbb{N}$
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 6, 2013 at 20:14 | vote | accept | Scis | ||
| May 6, 2013 at 17:38 | comment | added | Petr | That reminds me of Scapegoat trees that are $\alpha$-height balanced: $\mbox{height}(T)\leq (\log\mbox{size}(T))/(\log (1/\alpha))+1$ where you can choose any $0.5<\alpha<1$. The higher $\alpha$ the less balances, so inserting is faster and lookup slower. | |
| May 6, 2013 at 17:15 | history | edited | Scis | CC BY-SA 3.0 |
edited body
|
| May 6, 2013 at 16:57 | history | tweeted | twitter.com/#!/StackCompSci/status/331452659129253888 | ||
| May 6, 2013 at 16:34 | answer | added | wece | timeline score: 2 | |
| May 6, 2013 at 14:22 | history | asked | Scis | CC BY-SA 3.0 |