- #1
fiksx
- 77
- 1
- TL;DR Summary
- I’m not too familiar with ordered tree. I’m solving excercise about tree but i’m not sure it is right or wrong
Summary: I’m not too familiar with ordered tree. I’m solving excercise about tree but i’m not sure it is right or wrong
How many regular ternary ordered tree with height 3 (ordered tree means children of each vertex are assigned a fixed ordering)? What is the smallest and biggest radius for tree with height k?
Attempt: For regular ternary ordered tree with height 3 There will be 9 node that will have children 9C1 +9C2+9C3+9C4+9C4+9C5+9C6+9C7+9C8+9C9
And smallest and biggest radius for tree with height
How many regular ternary ordered tree with height 3 (ordered tree means children of each vertex are assigned a fixed ordering)? What is the smallest and biggest radius for tree with height k?
Attempt: For regular ternary ordered tree with height 3 There will be 9 node that will have children 9C1 +9C2+9C3+9C4+9C4+9C5+9C6+9C7+9C8+9C9
And smallest and biggest radius for tree with height