How do I parse a whole 2-3 tree?

Question

I have a 2-3 tree with the following node structure:

struct node
{
    int value1, value2;
    node *parent, *left, *right, *middle;
}

The problem is I don't know how to parse the whole tree. I know how we search for it because you simply go to the right path. But how to I get to check all the nodes in the tree?

Do you mean you want to *walk* the tree? – Fred Foo Jan 20 '14 at 13:44 — Fred Foo, Jan 20 '14 at 13:44
Yes. Get through all the nodes. – user3141607 Jan 20 '14 at 15:19 — user3141607, Jan 20 '14 at 15:19

thumbmunkeys · Accepted Answer · 2014-01-20T13:20:42.260

1

Here is pseudocode, that might help:

   void ParseNode(node *n)
   {
        OperationToParseCurrentNode();

        if(n->left)
           ParseNode(n->left);
        if(n->middle)
           ParseNode(n->middle);
        if(n->right)
           ParseNode(n->right);
   }

This will traverse all nodes if you input the root node.

edited Jan 20 '14 at 13:20

answered Jan 20 '14 at 12:45

thumbmunkeys

20,606
8
62
110

How do I parse a whole 2-3 tree?

1 Answers1