- #1

- 77

- 1

how to find upper bound height and lower bound height of 3-ary ordered tree that have leaves of 101? ( the tree don't have to be complete tree, but have to be have 3 children)

$$m^h \ge 101=3^h \ge 101$$

$$log \, m^h \ge 101=3^h \ge 101$$

$$h \ge 5$$

but how to know upper bound and lower bound of leaves?

edit: leaves at the last height is 3

$$3+2(n-1) \ge 101= 3+2n-2 \ge 101 = 2n-1 \ge 101= 2n \ge 100 = n \ge 50 $$

is this right?

$$m^h \ge 101=3^h \ge 101$$

$$log \, m^h \ge 101=3^h \ge 101$$

$$h \ge 5$$

but how to know upper bound and lower bound of leaves?

edit: leaves at the last height is 3

$$3+2(n-1) \ge 101= 3+2n-2 \ge 101 = 2n-1 \ge 101= 2n \ge 100 = n \ge 50 $$

is this right?

**[Moderator's note: Moved from a technical forum and thus no template.]**
Last edited by a moderator: