Every time a path is decomposed, an array is created in association with the path that contains the elements on the path from the root to the leaf.
Level 42 | High-level programming language | Year 2000 problem | The Spirit Level: Why More Equal Societies Almost Always Do Better | prefecture-level city | Low-level programming language | Waring's problem | The Final Problem | The Problem with Popplers | Split Level | Low Level Owl | Hume and the Problem of Causation | High Level Bridge | Fermi level | Dirichlet problem | Boolean satisfiability problem | Birmingham Snow Hill to Wolverhampton Low Level Line | Twelve Level Cap and Rank System | The Dog Problem | The Beatnuts: Street Level | The Ancestor Cell | Tammes problem | Species problem | Scalp Level, Pennsylvania | problem solving | Problem gambling | Prefecture-level city | Packing problem | packing problem | 'O' Level |