打印二叉樹兩個葉子節點間的路徑

轉載請注明出處：http://blog.csdn.net/luonanqin

       前兩天在網上看到百度的一個校園招聘面試題：輸出二叉樹中兩個葉子節點間的路徑。

感覺不是非常難，所以花了點時間用Java實現了下。

假設有更好的想法能夠一起討論。（還有一個面試題是求二叉樹中的最長路徑，即相距最遠的兩個葉子節點，因為網上有實現所以我就不放出來了。）

public class TwoLeafPath {

	// 暫時存放要用的兩個葉子節點
	public static Node2 leaf = null;
	// 表示已經找到葉子節點
	public static boolean find = false;

	// 實在沒有好辦法輸出一個非平衡非全然二叉樹，所以各位看官自己畫畫吧:P
	public static Node2 generateTree() {
		Node2 root = new Node2(1);
		Node2 node2 = new Node2(2);
		Node2 node3 = new Node2(3);
		Node2 node4 = new Node2(4);
		Node2 node5 = new Node2(5);
		Node2 node6 = new Node2(6);
		Node2 node7 = new Node2(7);
		Node2 node8 = new Node2(8);
		Node2 node9 = new Node2(9);
		Node2 node10 = new Node2(10);
		Node2 node11 = new Node2(11);
		Node2 node12 = new Node2(12);

		root.setParentNode(null);
		root.setLeftNode(node2);
		root.setRightNode(node3);

		node2.setLeftNode(node4);
		node2.setRightNode(node5);

		node3.setLeftNode(node6);

		node4.setLeftNode(node7);
		node4.setRightNode(node8);

		node5.setRightNode(node9);

		node8.setLeftNode(node10);

		node9.setLeftNode(node11);

		node11.setRightNode(node12);

		return root;
	}

	// 以后序遍歷的方式最快找到葉子節點
	public static void findNode(Node2 root, int data) {
		// 假設找到葉子節點則停止遍歷
		if (!find) {
			if (root.getLeftNode() != null) {
				root.getLeftNode().setParentNode(root);
				findNode(root.getLeftNode(), data);
			}
		}

		// 假設找到葉子節點則停止遍歷
		if (!find) {
			if (root.getRightNode() != null) {
				root.getRightNode().setParentNode(root);
				findNode(root.getRightNode(), data);
			}
		}

		if (root.getData() == data) {
			leaf = root;
			find = true;
			return;
		} else {
			return;
		}
	}

	public static void printLeavesPath(Node2 leaf1, Node2 leaf2) {
		int leaf1Data = leaf1.getData();
		int leaf2Data = leaf2.getData();
		Deque<Integer> leaf1Path = new LinkedList<Integer>();
		Deque<Integer> leaf2Path = new LinkedList<Integer>();

		while (true) {
			leaf1Path.offerFirst(leaf1.getData());
			leaf1 = leaf1.getParentNode();
			if (leaf1 == null) {
				break;
			}
		}

		System.out.println("Leaf "+leaf1Data+" Path: " + leaf1Path);

		while (true) {
			leaf2Path.offerFirst(leaf2.getData());
			leaf2 = leaf2.getParentNode();
			if (leaf2 == null) {
				break;
			}
		}

		System.out.println("Leaf "+leaf2Data+" Path: " + leaf2Path);

		int temp = 0;
		// 比較兩個葉子節點的路徑。從根節點開始往下查找，若發現節點不同，則說明兩條路徑從此節點分叉。就可以輸出兩葉子節點間的路徑
		while (leaf1Path.peekFirst() == leaf2Path.peekFirst()) {
			temp = leaf1Path.pollFirst();
			leaf2Path.pollFirst();
		}

		// 順序輸出
		Iterator<Integer> leaf1Iter = leaf1Path.iterator();
		// 逆序輸出
		Iterator<Integer> leaf2Iter = leaf2Path.descendingIterator();

		StringBuffer result = new StringBuffer();
		while (leaf2Iter.hasNext()) {
			result.append(leaf2Iter.next() + ", ");
		}

		result.append(temp + ", ");

		while (leaf1Iter.hasNext()) {
			result.append(leaf1Iter.next() + ", ");
		}

		System.out.println("Leaf " + leaf1Data + " & Leaf " + leaf2Data + " Path: " + result.substring(0, result.length() - 2));
	}

	public static void main(String[] args) {
		Node2 root = generateTree();

		int data1 = 6;
		int data2 = 12;

		findNode(root, data1);
		find = false;
		Node2 leaf1 = leaf;

		findNode(root, data2);
		find = false;
		Node2 leaf2 = leaf;

		if (leaf1 == null) {
			System.out.println("Can't find leaf with " + data1);
		}
		if (leaf2 == null) {
			System.out.println("Can't find leaf with " + data2);
		}

		printLeavesPath(leaf1, leaf2);
	}
}

關鍵代碼如上，其余代碼可自行腦補，或者參考我的github:  https://github.com/luonanqin/study/tree/master/Algorithm/src