Timeline for Changing AVL's balance factor to some other $s>2 \in \mathbb{N}$
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 6, 2013 at 20:14 | vote | accept | Scis | ||
| May 6, 2013 at 17:41 | comment | added | wece | All branches = all root's branches. If all the branches have size $h-s$ then you have $2^{h-s}$ nodes and to get a branch of size $h$ you have to add $s$ node to one branch, hence a total of $2^{h-s}+s$ nodes. And lastly: sorry it doesn't answer your question :S I don't really know but I don't see why it would not work ... | |
| May 6, 2013 at 16:47 | comment | added | Scis | Thanks ,but when you say "All the branches" which branches are you talking about? Are those the root's branches? And why is the conclusion "One branch of height $h$ the others of height $h−s$" $\Rightarrow$ $n=2^{h-s}+s$ is true? Lastly and unfortunately I did not understand how does this answer the second part, sorry but could you elaborate? | |
| May 6, 2013 at 16:34 | history | answered | wece | CC BY-SA 3.0 |