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] ]
/** * 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>> ret; if (!root) return ret; queue<TreeNode*> que; que.push(root); while (!que.empty()) { int size = que.size(); vector<int> temp; for (int i = 0; i < size; i++) { TreeNode *p = que.front(); que.pop(); temp.push_back(p->val); if (p->left) que.push(p->left); if (p->right) que.push(p->right); } ret.push_back(temp); } return ret; } };