核心:不断的让左枝进栈
class Solution:
def inorderTraversal(self, root: Optional[TreeNode]) -> List[int]:
if root==None:
return []
skact,res=[],[]
while skact or root:
while root:
skact.append(root)
root=root.left
root=skact.pop()
res.append(root.val)
root=root.right
return res