글모음

[Leetcode] 145. Binary Tree Postorder Traversal [Python, Easy] 본문

카테고리 없음

[Leetcode] 145. Binary Tree Postorder Traversal [Python, Easy]

Nova_61 2021. 6. 12. 16:13
728x90
반응형

 

 

 

Postorder는 

1. Traverse left
1. Traverse right
2. Visit the Node

순으로 순회를 한다.

 

[ 코드2. Stack으로 구현 ]

 

 

 

 

Binary Tree Postorder Traversal - LeetCode

Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.

leetcode.com

 

 

 

728x90
반응형
Comments