树的遍历 非递归实现

1.从左到右，从上到下的广度优先遍历（用队列实现）：

void breadthFirst(TreeNode *root) {
  Queue<TreeNode *>  queue;
  TreeNode * p = root;
  if(p != 0) {
    queue.push(p);
    while(!queue.empty()) {
       p = queue.front();
       queue.pop();
       visit(p);
       if(p->left !=0) {
            queue.push(p->left);  
       }
       if(p->right !=0) {
          queue.push(p->right);
       }
     }
  }
}

2.前序遍历的非递归实现

void iterativePreorder(TreeNode * root) {
stack <TreeNode *> travStack;
TreeNode *p = root;
if(p != 0) {
travStack.push(p);
while(!travStack.empty()) {
p = travStack.pop();
visit(p);
if(p->right != 0) {
travStack.push(p->right);
}
if(p->left != 0) {
travStack.push(p->left);
}
}
}
}

3.后序遍历的非递归实现

void iterativePostorder(TreeNode *root) {
stack<TreeNode *> travStack;
TreeNode * p = root,*q=root;
while(p !=0 ) {
for(;p->right!=0; p=p->left) {
travStack.push(p);
}
while(p!=0 && (p->right == 0 || p->right == q)) {
visit(p);
q = p;
if(travStack.empty())
return;
p = travStack.pop();
}
travStack.push(p);
p=p->right;
}
}