Timeline for Ratio between number of nodes and leaves in a rooted binary tree
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 5, 2016 at 21:12 | comment | added | D. Ror. | Because of the approximations in this solution some $c > \frac{1}{4}$ may be necessary. | |
| Oct 4, 2016 at 22:17 | comment | added | D. Ror. | I suspect that, when all non-leaf nodes are considered, a lower bound of $2^{h(1-\epsilon)}$ is possible for fixed $\epsilon >0$ and all sufficiently large $h$. Both the full binary tree and the skinniest binary tree of height $h$ attain this. | |
| Oct 4, 2016 at 21:41 | history | edited | D. Ror. | CC BY-SA 3.0 |
deleted 3 characters in body; edited body
|
| Oct 4, 2016 at 21:39 | review | Late answers | |||
| Oct 4, 2016 at 21:41 | |||||
| Oct 4, 2016 at 21:26 | review | First posts | |||
| Oct 4, 2016 at 21:55 | |||||
| Oct 4, 2016 at 21:20 | history | answered | D. Ror. | CC BY-SA 3.0 |