https://leetcode.com/problems/binary-tree-preorder-traversal/
Binary Tree Preorder 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
inroder에 비하면 할만하구만~
class Solution:
def preorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
answer = []
stack = [root]
while stack:
node = stack.pop()
if not node:
continue
answer.append(node.val)
stack.append(node.right)
stack.append(node.left)
return answer
def preorderTraversal(self, root):
ret = []
stack = [root]
while stack:
node = stack.pop()
if node:
ret.append(node.val)
stack.append(node.right)
stack.append(node.left)
return ret'코딩 테스트 및 알고리즘 > leetcode for google' 카테고리의 다른 글
| leetcode : Binary Tree Postorder Traversal (0) | 2022.09.11 |
|---|---|
| leetcode : N-ary Tree Preorder Traversal (0) | 2022.09.11 |
| leetcode : Linked List Cycle (0) | 2022.09.11 |
| leetcode : Single Number (0) | 2022.09.11 |
| leetcode hard : Maximum Performance of a Team (0) | 2022.09.11 |