Which link search algorithm to choose for a sitemap?

Question

Algorithms

Hello!
On the current PHP project, there is work with a sitemap. The site map is in a file, a hierarchical structure, then a structure is filled in which has a parent and children. Everything would be fine, but searching for a link by ID takes a lot of iterations and a lot of time.
- Test (id: 100)
- - Test 3 (id: 10)
- Test 1 (id 80)
- - Test 4 (id: 1)
- - - Test 5 (id: 33)
Maximum nesting depth = 4.
I'm thinking implement using a B-tree. Who thinks what? Maybe there are other ways to speed up the search?

Answer 1

So there are duplicates? Can all levels be combined into a single-level array and searched in it?