深度有限遍历记录层数：增加一个level

//深度优先遍历
void depthFirstSearch(Tree root){stack<pair<int, Node *> > nodeStack;  //使用C++的STL标准模板库nodeStack.push(make_pair(0, root));Node *node;while(!nodeStack.empty()){node = nodeStack.top().second;int level = nodeStack.top().first;printf(format, node->data);  //遍历根结点nodeStack.pop();if(node->rchild){nodeStack.push(make_pair(level + 1, node->rchild));  //先将右子树压栈}if(node->lchild){nodeStack.push(make_pair(level + 1, node->lchild));  //再将左子树压栈}}
}

#include <iostream>
#include <stack>
#include <queue>
#include <locale.h>
using namespace std;
typedef struct BiTNode {//二叉树结点char data;                      //数据struct BiTNode *lchild,*rchild; //左右孩子指针
} BiTNode,*BiTree;
int CreateBiTree(BiTree &T) {//按先序序列创建二叉树char data;scanf("%c",&data);//按先序次序输入二叉树中结点的值（一个字符），‘#’表示空树if (data == '#') {T = NULL;} else {T = (BiTree)malloc(sizeof(BiTNode));T->data = data;         //生成根结点CreateBiTree(T->lchild);//构造左子树CreateBiTree(T->rchild);//构造右子树}return 0;
}
void Visit(BiTree T) {//输出if (T->data != '#') {printf("%c ",T->data);}
}
void PreOrder(BiTree T) {//先序遍历if (T != NULL) {Visit(T);               //访问根节点PreOrder(T->lchild);    //访问左子结点PreOrder(T->rchild);    //访问右子结点}
}
void InOrder(BiTree T) {//中序遍历if (T != NULL) {InOrder(T->lchild);     //访问左子结点Visit(T);               //访问根节点InOrder(T->rchild);     //访问右子结点}
}
void PostOrder(BiTree T) {//后序遍历if (T != NULL) {PostOrder(T->lchild);   //访问左子结点PostOrder(T->rchild);   //访问右子结点Visit(T);               //访问根节点}
}
void PreOrder2(BiTree T) {//先序遍历(非递归)
//访问T->data后，将T入栈，遍历左子树；遍历完左子树返回时，栈顶元素应为T，出栈，再先序遍历T的右子树。stack<BiTree> stack;BiTree p = T;//p是遍历指针while (p || !stack.empty()) {   //栈不空或者p不空时循环if (p != NULL) {stack.push(p);          //存入栈中printf("%c ",p->data);  //访问根节点p = p->lchild;          //遍历左子树} else {p = stack.top();        //退栈stack.pop();p = p->rchild;          //访问右子树}}
}
void InOrder2(BiTree T) {//中序遍历(非递归)
//T是要遍历树的根指针，中序遍历要求在遍历完左子树后，访问根，再遍历右子树。
//先将T入栈，遍历左子树；遍历完左子树返回时，栈顶元素应为T，出栈，访问T->data，再中序遍历T的右子树。stack<BiTree> stack;BiTree p = T;//p是遍历指针while (p || !stack.empty()) {   //栈不空或者p不空时循环if (p != NULL) {stack.push(p);          //存入栈中p = p->lchild;          //遍历左子树} else {p = stack.top();        //退栈，访问根节点printf("%c ",p->data);stack.pop();p = p->rchild;          //访问右子树}}
}typedef struct BiTNodePost{BiTree biTree;char tag;
} BiTNodePost,*BiTreePost;
void PostOrder2(BiTree T) {//后序遍历(非递归)stack<BiTreePost> stack;BiTree p = T;//p是遍历指针BiTreePost BT;while (p != NULL || !stack.empty()) {//栈不空或者p不空时循环while (p != NULL) {//遍历左子树BT = (BiTreePost)malloc(sizeof(BiTNodePost));BT->biTree = p;BT->tag = 'L';//访问过左子树stack.push(BT);p = p->lchild;}while (!stack.empty() && (stack.top())->tag == 'R') {//左右子树访问完毕访问根节点BT = stack.top();stack.pop();//退栈printf("%c ",BT->biTree->data);}if (!stack.empty()) {//遍历右子树BT = stack.top();BT->tag = 'R';//访问过右子树p = BT->biTree;p = p->rchild;}}
}void LevelOrder(BiTree T) {//层次遍历if (T == NULL) return;BiTree p = T;queue<BiTree> queue;//队列queue.push(p);//根节点入队while (!queue.empty()) {    //队列不空循环p = queue.front();      //对头元素出队printf("%c ",p->data);  //访问p指向的结点queue.pop();            //退出队列if (p->lchild != NULL) {//左子树不空，将左子树入队queue.push(p->lchild);}if (p->rchild != NULL) {//右子树不空，将右子树入队queue.push(p->rchild);}}
}
int main() {BiTree T;setlocale(LC_ALL,"chs");CreateBiTree(T);printf("先序遍历        ：");PreOrder  (T);printf("\n");printf("先序遍历(非递归)：");PreOrder2 (T);printf("\n");printf("\n");printf("中序遍历        ：");InOrder   (T);printf("\n");printf("中序遍历(非递归)：");InOrder2  (T);printf("\n");printf("\n");printf("后序遍历        ：");PostOrder (T);printf("\n");printf("后序遍历(非递归)：");PostOrder2(T);printf("\n");printf("\n");printf("层次遍历        ：");LevelOrder(T);printf("\n");return 0;
}
//ABC##DE#G##F###
//先序遍历        ：A B C D E G F
//先序遍历(非递归)：A B C D E G F
//
//中序遍历        ：C B E G D F A
//中序遍历(非递归)：C B E G D F A
//
//后序遍历        ：C G E F D B A
//后序遍历(非递归)：C G E F D B A
//
//层次遍历        ：A B C D E F G
/////       A
///      /
///     B
///    / \
///   C   D
///      / \
///     E   F
///      \
///       G

深度优先遍历：

//深度优先遍历
void depthFirstSearch(Tree root){stack<Node *> nodeStack;  //使用C++的STL标准模板库nodeStack.push(root);Node *node;while(!nodeStack.empty()){node = nodeStack.top();printf(format, node->data);  //遍历根结点nodeStack.pop();if(node->rchild){nodeStack.push(node->rchild);  //先将右子树压栈}if(node->lchild){nodeStack.push(node->lchild);  //再将左子树压栈}}
}<pre class="cpp" name="code">

</pre><pre class="cpp" name="code">

/*** <!--* File   : binarytree.h* Author : fancy* Email  : fancydeepin@yeah.net* Date   : 2013-02-03* --!>*/
#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <Stack>
#include <Queue>
using namespace std;
#define Element char
#define format "%c"typedef struct Node {Element data;struct Node *lchild;struct Node *rchild;
} *Tree;int index = 0;  //全局索引变量//二叉树构造器,按先序遍历顺序构造二叉树
//无左子树或右子树用'#'表示
void treeNodeConstructor(Tree &root, Element data[]){Element e = data[index++];if(e == '#'){root = NULL;}else{root = (Node *)malloc(sizeof(Node));root->data = e;treeNodeConstructor(root->lchild, data);  //递归构建左子树treeNodeConstructor(root->rchild, data);  //递归构建右子树}
}//深度优先遍历
void depthFirstSearch(Tree root){stack<Node *> nodeStack;  //使用C++的STL标准模板库nodeStack.push(root);Node *node;while(!nodeStack.empty()){node = nodeStack.top();printf(format, node->data);  //遍历根结点nodeStack.pop();if(node->rchild){nodeStack.push(node->rchild);  //先将右子树压栈}if(node->lchild){nodeStack.push(node->lchild);  //再将左子树压栈}}
}//广度优先遍历
void breadthFirstSearch(Tree root){queue<Node *> nodeQueue;  //使用C++的STL标准模板库nodeQueue.push(root);Node *node;while(!nodeQueue.empty()){node = nodeQueue.front();nodeQueue.pop();printf(format, node->data);if(node->lchild){nodeQueue.push(node->lchild);  //先将左子树入队}if(node->rchild){nodeQueue.push(node->rchild);  //再将右子树入队}}
}

广度优先遍历：

//广度优先遍历
void breadthFirstSearch(Tree root){queue<Node *> nodeQueue;  //使用C++的STL标准模板库nodeQueue.push(root);Node *node;while(!nodeQueue.empty()){node = nodeQueue.front();nodeQueue.pop();printf(format, node->data);if(node->lchild){nodeQueue.push(node->lchild);  //先将左子树入队}if(node->rchild){nodeQueue.push(node->rchild);  //再将右子树入队}}
}

完整代码：