vector<int> postorderTraversal(TreeNode *root) //Binary Tree Postorder Traversal
{
if (root==NULL)
{return t;
}
postorderTraversal(root->left);
postorderTraversal(root->right);
t.push_back(root->val);
return t;
}
LeetCode之postorderTraversal
最新推荐文章于 2022-05-16 19:04:00 发布