102. Binary Tree Level Order Traversal [LeetCode]

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],

    3
   / \
  9  20
    /  \
   15   7

return its level order traversal as:

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

  层序遍历，广度优先遍历的经典例子，不外乎两种经典的实现方式，迭代和递归。

/// iteration
    vector<vector<int>> levelOrder(TreeNode* root) {
        vector<vector<int>> res;
        if (nullptr == root) return res;
        queue<TreeNode*>q;
        q.push(root);
        
        while (!q.empty()) {
            const int n = q.size();
            vector<int> path;
            for (int i = 0; i < n; i++) {
                TreeNode *cur = q.front();
                q.pop();
                path.push_back(cur->val);
                if (cur->left) q.push(cur->left);
                if (cur->right) q.push(cur->right);
            }
            res.push_back(path);
        }
        return res;
    }
 


///  recursion
vector<vector<int> > levelOrder(TreeNode *root) {
    vector<vector<int> > result;
    traverse(root, 1, result);
    return result;
}
void traverse(TreeNode *root, size_t level, vector<vector<int>> &result) {
    if (!root) return;
    if (level > result.size())
        result.push_back(vector<int>());
    result[level - 1].push_back(root->val);
    traverse(root->left, level + 1, result);
    traverse(root->right, level + 1, result);
}