剑指offer第15天 队列

44）二叉树每层的最大值

class Solution {
public:
    vector<int> largestValues(TreeNode* root) {
      queue<TreeNode*> q;
      q.push(root);
      vector<int> res;
      if(root==nullptr) return res;
      while(q.size()>0){
        int len = q.size();
        int maxItem = INT_MIN;
        while(len--){
          TreeNode* node = q.front(); q.pop();
          if(node->left !=nullptr) q.push(node->left);
          if(node->right != nullptr) q.push(node->right);
          int cur = node->val;
          maxItem = max(cur, maxItem);
        }
        res.push_back(maxItem);
      }
      return res;
    }
};

45)二叉树最底层最左边的值

class Solution {
public:
    int findBottomLeftValue(TreeNode* root) {
      queue<TreeNode*> q;
      int res = root->val;
      q.push(root);
      while(!q.empty()){
        int len = q.size();
        bool flag=false;
        while(len--){
          TreeNode* node = q.front(); q.pop();
          if(node->left) {
            q.push(node->left);
            if(!flag) flag = true, res = node->left->val;
          }
          if(node->right) {
            q.push(node->right);
            if(!flag) flag = true, res = node->right->val;
          }
        }
      }
      return res;
    }
};

46)二叉树的右侧视图

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