Question

I have this array that I want to read:

Tree [ "my",
       [ "name",
         [ "is",
           [ "Toto" ],
           [ "Bob"  ]
         ]
       ],
       [ "algo",
         [ "doesn't",
           [ "work" ]
         ],
         [ "fail" ]
       ]
     ]

This should give my 4 sentences:

• My name is Toto
• My name is Bob
• My algo doesn’t work
• My algo fail

But my recursive try doesn’t success …
Thank you.

Answer 1

Since your structure is like that:

node = [first, second]
first = string
second = [node, node, ...] or [string, string, ...]

Your pseudocode will be like this:

struct node {string first; object second }

parse(string s, node tree)
{
    if (node.second is string)               //leaf of tree
        print(s + " " + node.second);
    else                                    //go deeper for each branch
        for each (b in node.second)
            parse(s + node.first, b);
}

main()
{
   parse(root.first, root.second);
}