C# 实现二叉树

1. namespace BinaryTree
2. {
3.     // Binary Tree的结点类
4.     class Node
5.     {
6.         public int Data { get; set; }
7.         public Node LeftSubNode { get; set; }
8.         public Node RightSubNode { get; set; }
10.         // 结点为自己追加子结点（与向左/向右追加结合，形成递归）
11.         public void Append(Node subNode)
12.         {
13.             if (subNode.Data <= this.Data)
14.             {
15.                 this.AppendLeft(subNode);
16.             }
17.             else
18.             {
19.                 this.AppendRight(subNode);
20.             }
21.         }
23.         // 向左追加
24.         public void AppendLeft(Node subNode)
25.         {
26.             if (this.LeftSubNode == null)
27.             {
28.                 this.LeftSubNode = subNode;
29.             }
30.             else
31.             {
32.                 this.LeftSubNode.Append(subNode);
33.             }
34.         }
36.         // 向右追加
37.         public void AppendRight(Node subNode)
38.         {
39.             if (this.RightSubNode == null)
40.             {
41.                 this.RightSubNode = subNode;
42.             }
43.             else
44.             {
45.                 this.RightSubNode.Append(subNode);
46.             }
47.         }
49.         // 结点显示自己的数据
50.         public void ShowData()
51.         {
52.             Console.WriteLine("Data={0}", this.Data);
53.         }
54.     }
56.     // Binary Tree类
57.     class Tree
58.     {
59.         // 根结点
60.         public Node Root { get; set; }
62.         // 以某结点为起点，插入结点
63.         public void Insert(Node newNode)
64.         {
65.             if (this.Root == null)
66.             {
67.                 this.Root = newNode;
68.             }
69.             else
70.             {
71.                 this.Root.Append(newNode);
72.             }
73.         }
75.         // 重载，默认以根结点为起点插入
76.         public void MidTravel()
77.         {
78.             this.MidTravel(this.Root);
79.         }
80.         
81.         // 中序遍历（递归）
82.         public void MidTravel(Node node)
83.         {
84.             if (node.LeftSubNode != null)
85.             {
86.                 this.MidTravel(node.LeftSubNode);
87.             }
89.             node.ShowData();
91.             if (node.RightSubNode != null)
92.             {
93.                 this.MidTravel(node.RightSubNode);
94.             }
95.         }
96.     }
98.     class Program
99.     {
100.         static void Main(string[] args)
101.         {
102.             Tree tree = new Tree();
103.             
104.             tree.Insert(new Node { Data = 3 });
105.             tree.Insert(new Node { Data = 6 });
106.             tree.Insert(new Node { Data = 2 });
107.             tree.Insert(new Node { Data = 7 });
108.             tree.Insert(new Node { Data = 18 });
109.             
110.             tree.MidTravel();
112.         }
113.     }
114. }

转载于:https://www.cnblogs.com/AlonaLiu/archive/2008/11/24/1340105.html