Sal Enriquez
|abonnees
Over
My Short-term Dbol-only Experiment Or, How I Learned To Stop Worrying And Love Oral Anabolics Part-1
Nested Structure
- Item 1
- Subitem 1
- Subsubitem 1
- Subsubsubitem 1
- Subsubsubsubitem 1
- Subsubsubsubsubitem 1
- Subsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubitem 1
- Subsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubsubitem 1
We see that the tree is huge. The depth of leaf nodes might be variable, but we need to consider all possible root-to-leaf paths.
Given the structure, the longest path from root to a leaf would go through the longest chain in this nested tree. Let's analyze:
The outermost `Tree` has two children: a leaf `leaf0`, and a `Tree leaf1`. So at least one child is a leaf. The other child is a subtree with just leaf1.
Then that subtree is a Tree with a single node leaf2, and the rest of the tree continues as a chain.
Actually the pattern is:
Root: Tree (leaf0 : subtree) where subtree = Tree (leaf1 : rest) where rest = Tree (leaf2 : Tree (leaf3 : ...)). So it's basically a single path of length 4? Wait no, each step adds a new leaf at the front. Actually let's illustrate:
root = Tree (
leaf0 :
