again, thank you very much, your help is greatly appreciated!

I don't really understand what you mean by "although you obviously
need to decide which nodes you add as none leaf nodes."
The tree should look in the end like this (not conform with the
example in the starting post):

Clause(AND)
   |__  Nationality=Belgian
   |__  Gender=1
   |__  Clause(OR)
           |__  Studies=BE
           |__  Studies=BI

which then should result in a SQL where clause like:

Nationality='Belorussian' AND Gender=1 AND (Studies='BE' OR
Studies='BI')

what would be a non leaf node in this case?











On 31 Jul., 16:40, Martin Honnen <mahotr...@yahoo.de> wrote:

> That expression returns a node list with child elements of name 'OPTEXT'
> and 'ITEXT', you can then add them to your tree view for the current
> level, then you can recursively process the next level. That way you
> would get a tree with the hierarchy being preserved although you
> obviously need to decide which nodes you add as none leaf nodes.