遍历二叉树（Traverse BinaryTree）/冒泡排序（BubbleSort）

public class Node {

	public Node(String value) {
		this.value = value;
	}
	public Node leftNode;//左节点
	public Node rightNode;//右节点
	public String value;//当前的节点值

	public static void read(Node node) {

		if (node == null) {
			return;
		}

		System.out.print(node.value);//遍历顺序（print在前先序，在中间为中序，在全部read方法后为后序）
		read(node.leftNode);
		read(node.rightNode);

	}

	public static void main(String[] args) {

		Node node1 = new Node("A");
		Node node2 = new Node("B");
		Node node3 = new Node("C");
		Node node4 = new Node("D");
		Node node5 = new Node("E");
		Node node6 = new Node("F");

		node1.leftNode = node2;
		node1.rightNode = node3;
		node2.leftNode = node4;
		node3.leftNode = node5;
		node3.rightNode = node6;
		read(node1);
	}

}

冒泡排序：

public class BubbleSort {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		int[] temp = new int[] { 3, 4, 5, 7, 1, 6, 2 };
		int[] bbbb = bubsort(temp);
		for (int i = 0; i < bbbb.length; i++) {
			System.out.println(bbbb[i]);
		}
	}

	public static int[] bubsort(int[] arrs) {

		for (int i = 0; i < arrs.length; i++) {
			int max = arrs[i];
			for (int j = i + 1; j < arrs.length; j++) {
				if (arrs[i] < arrs[j]) {
					int temp = arrs[j];
					arrs[j] = arrs[i];
					arrs[i] = temp;
				}

			}

		}
		return arrs;

	}

}