515. Find Largest Value in Each Tree Row

You need to find the largest value in each row of a binary tree.

Example:
Input:

      1
     / \
    3   2
   / \   \  
  5   3   9 

Output: [1, 3, 9]

这道题目也是二叉树的层序遍历的题目，时间复杂度的话是
O(V + E)

/**
 * 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<int> largestValues(TreeNode* root) {
        vector<int> vec;
        if (root == NULL)
          return  vec;
        int max = INT_MIN;
        struct TreeNode* temp;
        queue<struct TreeNode*> que1;
        queue<struct TreeNode*> que2;

        vec.push_back(root -> val);
        if (root -> left != NULL)
          que1.push(root -> left);
        if (root -> right != NULL)
          que1.push(root -> right);

        while (!que1.empty() || !que2.empty()) {
          max = INT_MIN;
          if (!que1.empty()) {
            while (!que1.empty()) {
              temp = que1.front();
              if (temp -> val > max)
                max = temp -> val;
              if (temp -> left != NULL)
                que2.push(temp -> left);
              if (temp -> right != NULL)
                que2.push(temp -> right);
              que1.pop();
            }
          } else if (!que2.empty()) {
            while (!que2.empty()) {
              temp = que2.front();
              if (temp -> val > max)
                max = temp -> val;
              if (temp -> left != NULL)
                que1.push(temp -> left);
              if (temp -> right != NULL)
                que1.push(temp -> right);
              que2.pop();
            }
          }
        vec.push_back(max);
        }
        return  vec;
    }
};

个人觉得只要是能不用递归算法就能方便的实现的题目都是没有必要使用递归算法的，因为递归算法对系统的开销比较大