vector<int> inorderTraversal(TreeNode *root) //Binary Tree inorder Traversal
{
if (root==NULL)
{return t;
}
inorderTraversal(root->left);
t.push_back(root->val);
inorderTraversal(root->right);
return t;
}
LeetCode之inorderTraversal
最新推荐文章于 2022-12-05 22:20:35 发布