[Go] Solution - Recursive
⚡ 𝗖𝗵𝗮𝗹𝗹𝗲𝗻𝗴𝗲:
Return the postorder traversal of an n-ary tree.🔸𝗘𝘅𝗮𝗺𝗽𝗹𝗲:
Input: Tree in the attached image.
Output: [5,6,3,2,4,1]🔹 𝗔𝗽𝗽𝗿𝗼𝗮𝗰𝗵:
1️⃣ Recursively trave

⚡ 𝗖𝗵𝗮𝗹𝗹𝗲𝗻𝗴𝗲:
Return the postorder traversal of an n-ary tree.

🔸𝗘𝘅𝗮𝗺𝗽𝗹𝗲:
Input: Tree in the attached image.
Output: [5,6,3,2,4,1]

🔹 𝗔𝗽𝗽𝗿𝗼𝗮𝗰𝗵:
1️⃣ Recursively traverse children first.
2️⃣ Append root's value after children.

# Code
```golang []
func postorder(root *Node) []int {
	ret := []int{}

	var visit func(node *Node)
	visit = func(node *Node) {
		if node == nil {
			return
		}
		for _, child := range node.Children {
			visit(child)
		}
		ret = append(ret, node.Val)
	}

	visit(root)
	return ret
}
```
['Go']