FilesExpand file tree

 master

/

solution.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

27 lines (26 loc) · 748 Bytes

 master

/

solution.py

Copy path

Top

File metadata and controls

• Code
• Blame

27 lines (26 loc) · 748 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

# Definition for a binary tree node

# class TreeNode:

# def __init__(self, x):

# self.val = x

# self.left = None

# self.right = None

class Solution:

# @param root, a tree node

# @return a list of integers

def postorderTraversal(self, root):

path = []

if root is None:

return path

stack1 = []

stack2 = []

stack1.append(root)

while stack1:

root = stack1.pop()

stack2.append(root.val)

if root.left is not None:

stack1.append(root.left)

if root.right is not None:

stack1.append(root.right)

while stack2:

path.append(stack2.pop())

return path