例题:
589. N 叉树的前序遍历
class Solution
{
private:
vector<int> v;
public:
void traversal(Node* root)
{
if (root == nullptr)
{
return;
}
v.push_back(root->val);
for (auto c : root->children)
{
traversal(c);
}
}
vector<int> preorder(Node* root)
{
traversal(root);
return v;
}
};
590. N 叉树的后序遍历
class Solution
{
private:
vector<int> v;
public:
void traversal(Node* root)
{
if (root == nullptr)
{
return;
}
for (auto c : root->children)
{
traversal(c);
}
v.push_back(root->val);
}
vector<int> postorder(Node* root)
{
traversal(root);
return v;
}
};