2025/10/16
思路:DFS遍历每个节点,调换他们的左右子树
手写代码:
def reverse(T):
temp = T.left
T.right = temp
T.left = self.right
reverse(T.left)
reverse(T.right)
答案:简单,秒了
November 25, 2025
思路:DFS遍历每个节点,调换他们的左右子树
手写代码:
def reverse(T):
temp = T.left
T.right = temp
T.left = self.right
reverse(T.left)
reverse(T.right)
答案:简单,秒了