M199 Binary Tree Right Side View
Recommended: DFS Approach
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode(int x) { val = x; }
* }
*/
class Solution {
List<Integer> res = new LinkedList<Integer>();
public List<Integer> rightSideView(TreeNode root) {
if(root == null) return res;
dfs(root, 0);
return res