# Definition for a binary tree node.# class TreeNode:# def __init__(self, x):# self.val = x# self.left = None# self.right = NoneclassSolution:defpreorderTraversal(self, root: TreeNode)-> List[int]:
p = root
stack, out =[],[]while p or stack:if p:
out.append(p.val