C# 2003 实现二叉树遍历

C# 2003 实现二叉树遍历

包括：先序、中序、后序，层次遍历。

定义二叉树类TreeNode。

1. using System;
3. namespace binaryTreeTest
4. {
5.     /// <summary>
6.     /// Summary description for binaryTree.
7.     /// </summary>
8.     
9.     public class TreeNode
10.     {
11.         public string data;
12.         public TreeNode lChild,rChild;
14.         public int nodeNum;
15.         public int height;
17.         public TreeNode()
18.         {
20.         }
22.         public TreeNode(string d)
23.         {
24.             data = d;
25.             lChild = null;
26.             rChild = null;
27.         }
29.         #region//以层次遍历的次序构造一颗二叉树
30.         public TreeNode CreateTree() 
31.         {
32.             TreeNode[] p = new TreeNode[8];
34.             //创建节点
35.             p[0] = new TreeNode("A");
36.             p[1] = new TreeNode("B");
37.             p[2] = new TreeNode("C");
38.             p[3] = new TreeNode("D");
39.             p[4] = new TreeNode("E");
40.             p[5] = new TreeNode("F");
41.             p[6] = new TreeNode("G");
42.             p[7] = new TreeNode("H");
44.             //构造二叉树
45.             p[0].lChild = p[1];
46.             p[0].rChild = p[2];
48.             p[1].rChild = p[3];
50.             p[2].lChild = p[4];
51.             p[2].rChild = p[5];
53.             p[3].lChild = p[6];
54.             p[3].rChild = p[7];
56.             //返回二叉树根节点
57.             return p[0];
58.         }
59.         #endregion
61.         #region//先序遍历方法
62.         public string preOrder(TreeNode p)
63.         {
64.             string result = "";
65.             if ( null != p )
66.             {
67.                 result += p.data.ToString();
68.                 result += preOrder(p.lChild);
69.                 result += preOrder(p.rChild);
70.             }
71.             return result;
72.         }
73.         #endregion
75.         #region//中序遍历方法
76.         public string inOrder(TreeNode p)
77.         {
78.             string result = "";
79.             if (null != p)
80.             {
81.                 result += inOrder(p.lChild);
82.                 result += p.data.ToString();
83.                 result += inOrder(p.rChild);
84.             }
85.             return result;
86.         }
87.         #endregion
89.         #region//后序遍历方法
90.         public string postOrder(TreeNode p)
91.         {
92.             string result = "";
93.             if ( null != p)
94.             {
95.                 result += postOrder(p.lChild);
96.                 result += postOrder(p.rChild);
97.                 result += p.data.ToString();
98.             }
99.             return result;
100.         }
101.         #endregion
103.         #region//层次遍历方法
104.         public string layerOrder(TreeNode p)
105.         {
106.             TreeNode[] tempNode = new TreeNode[10];
107.             int front = -1;
108.             int rear = 0;
109.             if (null != p)
110.             {
111.                 tempNode[rear] = p;
112.             }
114.             string result = "";
115.             while ( front != rear )
116.             {
117.                 front ++;
118.                 p = tempNode[front];
119.                 result += p.data.ToString();
120.                 if ( null != p.lChild )
121.                 {
122.                     rear ++;
123.                     tempNode[rear] = p.lChild;
124.                 }
125.                 if ( null != p.rChild )
126.                 {
127.                     rear ++;
128.                     tempNode[rear] = p.rChild;
129.                 }
130.             }
131.             return result;
132.         }
133.         #endregion
134.     }
135. }

然后在Form中添加一个按钮和四个TextBox，代码如下：

1. private void btn_Traverse_Click(object sender, System.EventArgs e)
2.         {
3.             TreeNode myBinaryTree = new TreeNode();
4.             myBinaryTree = myBinaryTree.CreateTree();
6.             string preOrder = myBinaryTree.preOrder(myBinaryTree);
7.             string inOrder = myBinaryTree.inOrder(myBinaryTree);
8.             string postOrder = myBinaryTree.postOrder(myBinaryTree);
9.             string layerOrder = myBinaryTree.layerOrder(myBinaryTree);
11.             tbx_preOrder.Text = preOrder;
12.             tbx_inOrder.Text = inOrder;
13.             tbx_postOrder.Text = postOrder;
14.             tbx_layerOrder.Text = layerOrder;
15.         }

程序执行效果如图：