【Leetcode】Binary Tree Right Side View

题目链接：https://leetcode.com/problems/binary-tree-right-side-view/

题目：

Given a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.

For example:
Given the following binary tree,

   1            <---
 /   \
2     3         <---
 \     \
  5     4       <---

You should return [1, 3, 4].

思路：

1、参考Binary Tree Level Order Traversal II 中有个方法可以获取每一层结点的list，然后对每个list获取最后一个结点值就是我们要求的结果。

注意：获取所有从root-leaf路径的方法和获取每一层结点的方法是非常重要的，利用它们可以方便的解决很多问题。

2、利用二叉树的层次遍历，难点在于如何在队列中分割出那些结点是那一层的。

算法1：

	public List<Integer> rightSideView(TreeNode root) {
		List<Integer> result = new ArrayList<Integer>();
		int height = heightTree(root);
		for (int i = 1; i <= height; i++) {
			List<Integer> list = new ArrayList<Integer>();
			list = kLevelNumber(root, 1, list, i);
			result.add(list.get(list.size() - 1)); //取每一层最后一个元素
		}
		return result;
	}

	public List<Integer> kLevelNumber(TreeNode p, int height, List<Integer> list, int kk) {
		if (p != null) {
			if (height == kk) {
				list.add(p.val);
			}
			list = kLevelNumber(p.left, height + 1, list, kk);
			list = kLevelNumber(p.right, height + 1, list, kk);
		}
		return list;
	}

	public int heightTree(TreeNode p) {
		if (p == null)
			return 0;
		int h1 = heightTree(p.left);
		int h2 = heightTree(p.right);
		return h1 > h2 ? h1 + 1 : h2 + 1;
	}

算法2：

	public List<Integer> rightSideView(TreeNode root) {
		List<Integer> result = new ArrayList<Integer>();
		Queue<TreeNode> q = new LinkedList<TreeNode>();
		if (root == null)
			return result;
		q.offer(root);
		while (!q.isEmpty()) {
			int size = q.size();
			for (int i = 0; i < size; i++) { // 该层结点数
				TreeNode t = q.poll();
				if (i == size - 1) {// 当到了该层最后一个结点
					result.add(t.val);
				}
				if (t.left != null) {
					q.offer(t.left);
				}
				if (t.right != null) {
					q.offer(t.right);
				}
			}
		}
		return result;
	}