classSolution:
def preorderTraversal(self,root: Optional[TreeNode])->List[int]:
result =[]
result =self.handleTree(root,result)return result
def handleTree(self,root,result):if root ==None:return[]
result.append(root.val)self.handleTree(root.left,result)self.handleTree(root.right,result)return result