Traversing a n-ary tree without using recurrsion

How can I traverse an n-ary tree without using recursion?

Recursive way:

traverse(Node node){    if(node == null)        return;    for(Node child : node.getChilds()) {        traverse(child);    }}