题目: Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1 将二叉树倒置 思路: 递归的遍历根的左子树和右子树 代码: