排序二叉树的中序遍历

public class Node { private int value; private Node left; private Node right; // 构建二叉树 public void put(int value) { if (value < this.value) { if (null == left) { left = new Node(); left.setValue(value); } else { left.put(value); } } else { if (null == right) { right = new Node(); right.setValue(value); } else { right.put(value); } } } // 寻找二叉树对应的值 public boolean get(int value) { if (this.value == value) { return true; } else { if (this.value > value) { if (null == left) { return false; } return left.get(value); } else { if (null == right) { return false; } return right.get(value); } } } // 遍历二叉树 先序 public void preList() { System.out.print(this.value + ","); if (null != left) { left.preList(); } if (null != right) { right.preList(); } } // 中序 public void midList() { if (null != left) { left.midList(); } System.out.print(this.value + ","); if (null != right) { right.midList(); } } // 后序 public void afterList() { if (null != left) { left.afterList(); } if (null != right) { right.afterList(); } System.out.print(this.value + ","); } public static void main(String... strings) { int[] data = new int[100]; for (int i = 0; i < 100; i++) { data[i] = (int) (Math.random() * 100) + 1; System.out.print(data[i] + ","); } System.out.println(); Node root = new Node(); root.value = data[0]; for (int i = 1; i < 100; i++) { root.put(data[i]); } if (root.get(data[4])) { // System.out.println("命中目标"); } root.preList(); System.out.println(); root.midList(); System.out.println(); root.afterList(); } public int getValue() { return value; } public void setValue(int value) { this.value = value; } public Node getLeft() { return left; } public void setLeft(Node left) { this.left = left; } public Node getRight() { return right; } public void setRight(Node right) { this.right = right; } }

输出结果： 58,14,23,70,12,42,86,86,42,18,8,43,62,97,83,80,60,12,40,4,91,61,32,10,29,11,72,14,47,95,40,60,88,50,4,60,37,34,30,59,9,52,10,82,39,53,98,62,64,87,100,30,94,58,13,77,70,85,41,42,18,47,32,85,75,6,3,77,29,93,51,49,6,84,77,65,73,36,34,35,66,94,89,20,16,91,58,64,37,6,19,60,97,1,91,84,55,31,75,18, 先序： 58,14,12,8,4,3,1,4,6,6,6,10,9,11,10,12,13,23,18,14,16,18,20,19,18,42,40,32,29,30,29,30,31,37,34,32,36,34,35,39,37,40,41,42,43,42,47,50,47,49,52,51,53,55,70,62,60,59,58,58,61,60,60,60,62,64,65,64,66,86,83,80,72,70,77,75,73,75,77,77,82,85,84,84,85,86,97,91,88,87,89,95,94,93,91,91,94,98,97,100, 中序： 1,3,4,4,6,6,6,8,9,10,10,11,12,12,13,14,14,16,18,18,18,19,20,23,29,29,30,30,31,32,32,34,34,35,36,37,37,39,40,40,41,42,42,42,43,47,47,49,50,51,52,53,55,58,58,58,59,60,60,60,60,61,62,62,64,64,65,66,70,70,72,73,75,75,77,77,77,80,82,83,84,84,85,85,86,86,87,88,89,91,91,91,93,94,94,95,97,97,98,100, 后序： 1,3,6,6,6,4,4,9,10,11,10,8,13,12,12,16,14,18,19,20,18,18,29,31,30,30,29,32,35,34,36,34,37,39,37,32,41,40,40,42,49,47,51,55,53,52,50,47,43,42,42,23,14,58,58,59,60,60,60,61,60,64,66,65,64,62,62,70,73,75,75,77,77,77,72,82,80,84,84,85,85,83,87,89,88,91,91,93,94,94,95,91,97,100,98,97,86,86,70,58,