Java sorting algorithm code-binary tree sorting

Java sorting algorithm code-binary tree sorting

1. /**
2. * The Java sorting algorithm implements code-binary tree sorting.
3. *
4. * @ Author old zizhu Java century network (java2000.net)
5. *
6. */
7. Public class test {
8. Public static int [] A = {0, 10, 32, 1, 9, 5, 7, 12, 2, 4, 3}; // default data array
9. Public static int [] DATA = new int [20]; // default data array
11. Public static void main (string ARGs []) {
12. Int I; // The variable of the cyclic count.
13. Int Index = 1; // data index variable
14. Bntreearray bntree = new bntreearray (); // declare a binary tree Array
16. Data [Index] = A [Index];
17. Bntreearray. treedata [0] = data [Index];
18. Index ++;
19. For (I = 2; I <A. length; I ++ ){
20. Data [Index] = A [Index];
21. Bntree. Create (data [Index]); // create a binary search tree
22. Index ++;
23. }
25. // Pre-sorting data content
26. System. Out. Print ("Before sorting :");
27. For (I = 1; I <index; I ++)
28. System. Out. Print ("" + data [I] + "");
29. System. Out. println ("");
31. // Sorted result
32. System. Out. Print ("sorted :");
33. Bntreearray. Inorder (0); // center Traversal
34. }
35. }
37. Class bntreearray {
38. Public static int maxsize = 20;
39. Public static int [] treedata = new int [maxsize];
40. Public static int [] rightnode = new int [maxsize];
41. Public static int [] leftnode = new int [maxsize];
43. Public bntreearray (){
44. Int I; // The variable of the cyclic count.
46. For (I = 0; I <maxsize; I ++ ){
47. Treedata [I] = 0;
48. Rightnode [I] =-1;
49. Leftnode [I] =-1;
50. }
51. }
53. //----------------------------------------------------
54. // Create a binary tree
55. //----------------------------------------------------
56. Public void create (INT data ){
57. Int I; // The variable of the cyclic count.
58. Int level = 0; // Number of classes in the tree
59. Int position = 0;
61. For (I = 0; treedata [I]! = 0; I ++)
62. ;
64. Treedata [I] = data;
65. While (true) // find the node location
66. {
67. // Determine the left or right subtree
68. If (data> treedata [level]) {
69. // Whether the right tree has the next class
70. If (rightnode [level]! =-1)
71. Level = rightnode [level];
72. Else {
73. Position =-1; // set it to the right tree
74. Break;
75. }
76. } Else {
77. // Whether the left tree has the next class
78. If (leftnode [level]! =-1)
79. Level = leftnode [level];
80. Else {
81. Position = 1; // set it to the left Tree
82. Break;
83. }
84. }
85. }
87. If (position = 1) // create the left and right links of the node
88. Leftnode [level] = I; // link the left subtree
89. Else
90. Rightnode [level] = I; // link to the right subtree
91. }
93. //---------------------------------------------------------
94. // Sequential traversal of Binary Trees
95. //---------------------------------------------------------
96. Public static void inorder (INT pointer ){
97. If (pointer! =-1) // termination condition of Traversal
98. {
99. Inorder (leftnode [pointer]); // process the left subtree
100. // Process the printed node content
101. System. Out. Print ("" + treedata [pointer] + "");
102. Inorder (rightnode [pointer]); // process the right subtree
103. }
104. }
105. }

/*** Java sorting algorithm implements code-binary tree sorting. ** @ Author old zizhu Java century network (java2000.net) **/public class test {public static int [] A = {0, 10, 32, 1, 9, 5, 7, 12, 2, 4, 3}; // default data array public static int [] DATA = new int [20]; // default data array public static void main (string ARGs []) {int I; // The cyclic count variable int Index = 1; // data index variable bntreearray bntree = new bntreearray (); // declare the binary tree array data [Index] = A [Index]; bntreearray. treedata [0] = data [Index]; index ++; for (I = 2; I <. length; I ++) {data [Index] = A [Index]; bntree. create (data [Index]); // create a binary search tree index ++;} // pre-sorting data content system. out. print ("Before sorting:"); for (I = 1; I <index; I ++) system. out. print ("" + data [I] + ""); system. out. println (""); // sorted result system. out. print ("sorted:"); bntreearray. inorder (0); // ordinal traversal} class bntreearray {public static int maxsize = 20; public static int [] treedata = new int [maxsize]; Public static int [] rightnode = new int [maxsize]; public static int [] leftnode = new int [maxsize]; Public bntreearray () {int I; // The cyclic count variable for (I = 0; I <maxsize; I ++) {treedata [I] = 0; rightnode [I] =-1; leftnode [I] =-1 ;}// ------------------------------------------------------ // create a binary tree // define public void create (INT data) {int I; // The cyclic count variable I NT level = 0; // The number of classes in the tree int position = 0; for (I = 0; treedata [I]! = 0; I ++); treedata [I] = data; while (true) // find the node location {// determine whether the left subtree or right subtree if (data> treedata [level]) {// whether the right tree has the next level if (rightnode [level]! =-1) level = rightnode [level]; else {position =-1; // set it to right tree break ;}} else {// whether the left tree has the next level if (leftnode [level]! =-1) level = leftnode [level]; else {position = 1; // set to left Tree break; }}} if (position = 1) // create the left and right links of the node leftnode [level] = I; // link the left subtree else rightnode [level] = I; // link to the right subtree} // Binary Tree in-order traversal // ------------------------------------------------------------- public static void inorder (INT pointer) {If (pointer! =-1) // terminate condition for traversal {inorder (leftnode [pointer]); // process the left subtree // process the printed node content system. out. print ("" + treedata [pointer] + ""); inorder (rightnode [pointer]); // process the right subtree }}}

Running result

Before sorting: 10 32 1 9 5 7 12 2 4 3

After sorting: 1 2 3 4 5 7 9 10 12 32