Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit f38efd9

Browse files
Time: 43 ms (6.95%), Space: 16.6 MB (20.02%) - LeetHub
1 parent 7e4037b commit f38efd9

File tree

1 file changed

+24
-0
lines changed

1 file changed

+24
-0
lines changed
Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
# Definition for a binary tree node.
2+
# class TreeNode:
3+
# def __init__(self, val=0, left=None, right=None):
4+
# self.val = val
5+
# self.left = left
6+
# self.right = right
7+
class Solution:
8+
def postorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
9+
if not root:
10+
return []
11+
12+
stack1, stack2 = [], []
13+
stack1.append(root)
14+
15+
while stack1:
16+
node = stack1.pop()
17+
stack2.append(node)
18+
19+
if node.left:
20+
stack1.append(node.left)
21+
if node.right:
22+
stack1.append(node.right)
23+
24+
return [node.val for node in reversed(stack2)]

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /