我这题的做法很简单,就是使用广度优先算法的思路
high是树的高度,如果说数的高度和数组一样大,那么就说明没有创建过,则需要让二维数组高度+1,并且树的高度也加1,在把数据压入。即可
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
vector<vector<int>>array;
void dfs(TreeNode *root,int high)
{
if(root == nullptr)
return ;
if(array.size() == high)
{
vector<int>arr;
array.push_back(arr);
}
array[high].push_back(root->val);
dfs(root->left,high+1); //左子树
dfs(root->right,high+1); //右子树
}
vector<vector<int>> levelOrder(TreeNode* root) {
if(root == nullptr)
return array;
dfs(root,0);
return array;
}
};