题目
class Solution:
def levelOrder(self, root: TreeNode) -> List[List[int]]:
if not root: return []
stack=[root]
ans=[]
while stack:
temp=[]
for _ in range(len(stack)):
node=stack.pop(0)
temp.append(node.val)
if node.left:
stack.append(node.left)
if node.right:
stack.append(node.right)
ans.append(temp)
return ans
class Solution {
public:
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> ans;
if (root==NULL) return ans;
queue<TreeNode*> myqueue;
myqueue.push(root);
while(!myqueue.empty())
{
int size=myqueue.size();
vector<int> temp;
for(int i=0;i<size;i++)
{
TreeNode* node=myqueue.front();
myqueue.pop();
temp.emplace_back(node->val);
if (node->left){
myqueue.push(node->left);
}
if (node->right)
{
myqueue.push(node->right);
}
}
ans.emplace_back(temp);
}
return ans;
}
};