vector<int> preorderTraversal(TreeNode *root) //Binary Tree Preorder Traversal
{
if (root==NULL)
{return t;
}
t.push_back(root->val);
preorderTraversal(root->left);
preorderTraversal(root->right);
return t;
}
LeetCode之preorderTraversal
最新推荐文章于 2023-04-26 08:24:37 发布