Binary Tree Level Order Traversal II

最新推荐文章于 2019-06-27 15:08:13 发布

cy320h

最新推荐文章于 2019-06-27 15:08:13 发布

阅读量166

点赞数

分类专栏： Letcode

本文链接：https://blog.csdn.net/cy320h/article/details/80848600

版权

Letcode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Binary Tree Level Order Traversal II
题目描述
Given a binary tree, return the bottom-up level order traversal of its nodes’ values. (ie, from left to right, level by level from leaf to root).

For example:
Given binary tree [3,9,20,null,null,15,7],

return its bottom-up level order traversal as:

[
  [15,7],
  [9,20],
  [3]
]

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrderBottom(TreeNode* root) {
        vector<vector<int>> res;
        vector<int> same_level;
        queue<TreeNode *> que;
        if(root) que.push(root);
        int sz = 0; TreeNode * tmp = NULL;
        while(!que.empty()) {
            same_level.clear();
            sz = que.size();
            while(sz--) {
                tmp = que.front();
                que.pop();
                same_level.push_back(tmp->val);
                if(tmp->left) que.push(tmp->left);
                if(tmp->right) que.push(tmp->right);
            }
            res.insert(res.begin(), same_level);
        }
        return res;
    }
};

102. Binary Tree Level Order Traversal
这道题目把上面的代码修改一行就可以了。
Given a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).
For example:
Given binary tree [3,9,20,null,null,15,7],

return its level order traversal as:

[
  [3],
  [9,20],
  [15,7]
]

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> res;
        vector<int> same_level;
        queue<TreeNode *> que;
        if(root) que.push(root);
        int sz = 0; TreeNode * tmp = NULL;
        while(!que.empty()) {
            same_level.clear();
            sz = que.size();
            while(sz--) {
                tmp = que.front();
                que.pop();
                same_level.push_back(tmp->val);
                if(tmp->left) que.push(tmp->left);
                if(tmp->right) que.push(tmp->right);
            }
            res.push_back(same_level);
        }
        return res;        
    }
};

103. Binary Tree Zigzag Level Order Traversal

Given a binary tree, return the zigzag level order traversal of its nodes’ values. (ie, from left to right, then right to left for the next level and alternate between).

For example:
Given binary tree [3,9,20,null,null,15,7],

return its zigzag level order traversal as:

[
  [3],
  [20,9],
  [15,7]
]

相比于上面的代码，只需要把存进结果的地方进行一个反向即可。

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    vector<vector<int>> zigzagLevelOrder(TreeNode* root) {
        vector<vector<int>> res;
        vector<int> same_level;
        queue<TreeNode *> que; bool dir_left = true;
        int sz = 0; TreeNode * tmp = NULL; 
        if(root) que.push(root);
        while(!que.empty()) {
            same_level.clear();
            sz = que.size();
            while(sz--) {
                tmp = que.front();
                que.pop();
                same_level.push_back(tmp->val);
                if(tmp->left) que.push(tmp->left);    
                if(tmp->right) que.push(tmp->right);
            }
            if(!dir_left)
                res.push_back(vector<int>(same_level.rbegin(), same_level.rend()));
            else    
                res.push_back(vector<int>(same_level.begin(), same_level.end()));

            dir_left = 1^dir_left;
        }
        return res; 
    }
};