144-Binary-Tree-Preorder-Traversal
Sat 17 May 2025
https://leetcode.com/problems/binary-tree-preorder-traversal
import pyutil as pyu
pyu.get_local_pyinfo()
print(pyu.ps2("python-dotenv"))
from typing import List
class Solution:
def preorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
ans = []
def preorder(root: Optional[TreeNode]) -> None:
if not root:
return
ans.append(root.val)
preorder(root.left)
preorder(root.right)
preorder(root)
return ans
new Solution().preorderTraversal()
Score: 5
Category: leetcode