LeetCode 199.Binary Tree Right Side View

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.

Example:

Input: [1,2,3,null,5,null,4]
Output: [1, 3, 4]
Explanation:

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

解题思路

题目要求输出二叉树的每层的最右边的结点的值，个人思路就是通过层序遍历，保存每层的最后一个节点的值。那么就是用bfs即可。

解题代码

bfs（c++）：

class Solution {
public:
    vector<int> rightSideView(TreeNode* root) {
        vector<int> v;
        queue<TreeNode*> q;
        if(!root) return v;
        q.push(root);
        while(!q.empty()){
            int qsize = q.size();
            for(int i = 0; i < qsize; i++){
                TreeNode* node  = q.front();
                q.pop();
                if(node->left) q.push(node->left);
                if(node->right) q.push(node->right);
                if(i == qsize - 1) v.push_back(node->val);
            }
        }
        return v;
    }
};

bfs(java )

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    //使用bfs对二叉树进行遍历哦
    //遍历每层只选择每层的最后一个元素
    public List<Integer> rightSideView(TreeNode root) {
        List<Integer> list = new ArrayList<>();
        Queue<TreeNode> q = new ArrayDeque<>();
        if(root == null) return list;
        q.add(root);
        while(!q.isEmpty()){
            int qsize = q.size();
            for(int i = 0; i < qsize; i++){
                TreeNode node = q.poll();
                if(node.left != null)
                    q.add(node.left);
                if(node.right != null)
                    q.add(node.right);
                if(i == qsize - 1)
                    list.add(node.val);
            }
        }
        return list;
    }
}

参考其他的dfs思路

dfs

class Solution {
public:
    vector<int> rightSideView(TreeNode* root) {
        vector<int> view;
        rightView(root, view, 0);
        return view;
    }
private:
    void rightView(TreeNode* root, vector<int>& view, int level) {
        if (!root) return;
        if (view.size() == level) 
            view.push_back(root -> val);
        rightView(root -> right, view, level + 1);
        rightView(root -> left, view, level + 1);
    }
};