题目:给定二叉树例如: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[ [3],[9,20],[15,7]]
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> ans;
题目:给定二叉树例如: [3,9,20,null,null,15,7],
3
/ \
9 20
/ \
15 7
返回其层次遍历结果:
[ [3],[9,20],[15,7]]
vector<vector<int>> levelOrder(TreeNode* root) {
vector<vector<int>> ans;