二叉树练习
中序遍历
class TreeNode(object):def __init__(self, x):self.val xself.left Noneself.right Nonedef in_order_traversal(root): # 中序res []stack []#借用栈if root is None:return rescur rootwhile len(stack) ! 0 or cur is not None:while cur is not None:sta…
2026/7/28 17:45:22