LeetCode102. 二叉树的层序遍历

//102. 二叉树的层序遍历
//正常的bfs遍历树，相对简单
//不过要注意需要将每层的数据分开
class Solution {
public:
  vector<vector<int>> levelOrder(TreeNode* root) {
    queue<TreeNode*>q;
    vector<vector<int>>ans;
    if (root == NULL) return ans;
    q.push(root);
    while (q.size()) {
      int n = q.size();
      ans.emplace_back(vector<int>());
      while (n--) {
        auto t = q.front(); q.pop();
        ans.back().emplace_back(t->val);
        if (t->left != NULL) q.push(t->left);
        if (t->right != NULL) q.push(t->right);
      }
    }
    return ans;
  }
};
//算是层序遍历的递归形式吧，但是个人感觉不太像
class Solution {
public:
  vector<vector<int>>ans;
  void dfs(TreeNode* node, int n) {
    if (node == NULL) return;
    while (ans.size() <= n) ans.emplace_back(vector<int>{});
    ans[n].emplace_back(node->val);
    dfs(node->left, n + 1);
    dfs(node->right, n + 1);
  }
  vector<vector<int>> levelOrder(TreeNode* root) {
    dfs(root, 0);
    return ans;
  }
};