Miscellaneous-C # Binary Tree, out-of-band sequential Traversal

Miscellaneous-C # Binary Tree, out-of-band sequential Traversal

 

When we find that the data structure is implemented using the C # syntax, the code looks neat.

 

1. Using system;
3. Namespace binarytree
4. {
5. // Binary Tree node class
6. Class Node
7. {
8. Public int data {Get; set ;}
9. Public node leftsubnode {Get; set ;}
10. Public node rightsubnode {Get; set ;}
12. // Add a child node to the node itself (combined with appending to the left/right to form recursion)
13. Public void append (node subnode)
14. {
15. If (subnode. Data <= This. Data)
16. {
17. This. appendleft (subnode );
18. }
19. Else
20. {
21. This. appendright (subnode );
22. }
23. }
25. // Append to left
26. Public void appendleft (node subnode)
27. {
28. If (this. leftsubnode = NULL)
29. {
30. This. leftsubnode = subnode;
31. }
32. Else
33. {
34. This. leftsubnode. append (subnode );
35. }
36. }
38. // Append to the right
39. Public void appendright (node subnode)
40. {
41. If (this. rightsubnode = NULL)
42. {
43. This. rightsubnode = subnode;
44. }
45. Else
46. {
47. This. rightsubnode. append (subnode );
48. }
49. }
51. // Display your data at the node
52. Public void showdata ()
53. {
54. Console. writeline ("Data = {0}", this. data );
55. }
56. }
58. // Binary tree class
59. Class tree
60. {
61. // Root Node
62. Public node root {Get; set ;}
64. // Start with a node and insert the node
65. Public void insert (node newnode)
66. {
67. If (this. Root = NULL)
68. {
69. This. Root = newnode;
70. }
71. Else
72. {
73. This. Root. append (newnode );
74. }
75. }
77. // Reload. It is inserted starting from the root node by default.
78. Public void midtravel ()
79. {
80. This. midtravel (this. Root );
81. }
83. // Recursive Traversal)
84. Public void midtravel (node)
85. {
86. If (node. leftsubnode! = NULL)
87. {
88. This. midtravel (node. leftsubnode );
89. }
91. Node. showdata ();
93. If (node. rightsubnode! = NULL)
94. {
95. This. midtravel (node. rightsubnode );
96. }
97. }
98. }
100. Class Program
101. {
102. Static void main (string [] ARGs)
103. {
104. TREE tree = new tree ();
106. Tree. insert (new node {DATA = 3 });
107. Tree. insert (new node {DATA = 6 });
108. Tree. insert (new node {DATA = 2 });
109. Tree. insert (new node {DATA = 7 });
110. Tree. insert (new node {DATA = 18 });
112. Tree. midtravel ();
114. }
115. }
116. }
117. // The true meaning of water
118. // Http://blog.csdn.net/FantasiaX