590. N-ary Tree Postorder Traversal
## 思路
跟昨天的一样
Iter1. 照顺序加到stack, 最后再把结果reverse
Iter2. child反顺序加进stack, 记录node有没有走过, 走过才加进res
## Code
Iter1
```python
class Solution:
def postorder(self, root: 'Node') -> List[int]:
if not root:
return []
res = []
stack = [root]
while stack:
node = stack.pop()
res.append(node.val)
for child in node.children:
stack.append(child)
return res[::-1]
```
Iter2
```python
class Solution:
def postorder(self, root: 'Node') -> List[int]:
if not root:
return []
res = []
stack = [(root, False)]
while stack:
curr, is_visited = stack.pop()
if is_visited:
res.append(curr.val)
else:
stack.append((curr, True))
for child in reversed(curr.children):
stack.append((child, False))
return res
```

剩我只会写recursive了

我是大便