利用队列实现树的先序遍历

利用队列实现树的先序遍历

void non_recursive_traverse(TreeNode *tree)

{

    Queue nodeQueue;

    TreeNode *currentNode = NULL;

    nodeQueue.push(tree);

    while(!nodeQueue.empty())

    {

        currentNode = nodeQueue.pop();

        if currentNode has children

            push its children into the queue;

    }

}