Code Review: Is this the most efficient/elegant way to recursively walk a tree

Question

This is more of a general question so the answer does not have to be in C#. I have a general code structure below that I use to recursively walk a tree structure. In this particular case I am appending to a string builder object in each iteration.

Is there a way to improve this code to be faster or better?

    public static void RecursiveFunction(StringBuilder sb, Object treeObject)
    {
        sb.Append(treeObject.GetCurrentValue("Name"));

        if (treeObject.MoveToFirstChild())
        {
            RecursiveFunction(sb, treeObject);
        }

        if (treeObject.MoveToNextSibling())
        {
            RecursiveFunction(sb, treeObject);
        }

        if (treeObject.MoveToParent()) 
        {
            if (treeObject.MoveToNextSibling())
            {
                RecursiveFunction(sb, treeObject);
            }
        }        

        return;
    }

Thanks.

Answer 1

void RecurseTree(StringBuilder sb, Object tree)
{
    foreach (var child in tree.Children)
    {
        sb.Append(child.Name);
        if (child.Children.Count > 0)
        {
            RecurseTree(sb, child);
        }
    }
}

Answer 2

I would probably do

public static void RecursiveFunction(StringBuilder sb, Object treeObject) {
    sb.Append(treeObject.GetCurrentValue("Name"));
    if (treeObject.MoveToFirstChild()) {
        do {
            RecursiveFunction(sb, treeObject);
        } while (treeObject.MoveToNextSiblin());
        treeObject.MoveToParent();
    }
}

Answer 3

I think this part should be redundant:

if (treeObject.MoveToParent()) 
    {
        if (treeObject.MoveToNextSibling())
        {
            RecursiveFunction(sb, treeObject);
        }
    }

The recursion should take care of that for you.