二叉树的右视图

199. Binary Tree Right Side View

DFS

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<Integer> rightSideView(TreeNode root) {
        List<Integer> result = new ArrayList();
        if (root != null) {
            Stack<TreeNode> nodeStack = new Stack();
            Stack<Integer> depthStack = new Stack();
            nodeStack.push(root);
            depthStack.push(1);
            int maxDepth = 0;
            while (!nodeStack.isEmpty()) {
                TreeNode node = nodeStack.pop();
                int currDepth = depthStack.pop();
                if (currDepth > maxDepth) {
                    result.add(node.val);
                    maxDepth = currDepth;
                }
                if (node.left != null) {
                    nodeStack.push(node.left);
                    depthStack.push(currDepth + 1);
                }
                if (node.right != null) {
                    nodeStack.push(node.right);
                    depthStack.push(currDepth + 1);
                }
            }
        }
        return result;
    }
}

BFS

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public List<Integer> rightSideView(TreeNode root) {
        List<Integer> result = new ArrayList();
        if (root != null) {
            Queue<TreeNode> nodeQueue = new LinkedList();
            nodeQueue.offer(root);
            while (!nodeQueue.isEmpty()) {
                int size = nodeQueue.size();
                for (int i = 0; i < size; i++) {
                    TreeNode node = nodeQueue.poll();
                    if (i == 0) {
                        result.add(node.val);
                    }
                    if (node.right != null) {
                        nodeQueue.offer(node.right);
                    }
                    if (node.left != null) {
                        nodeQueue.offer(node.left);
                    }
                }
            }
        }
        return result;
    }
}