- 题目描述
请完成一个函数,输入一个二叉树,该函数输出它的镜像。
例如输入:
4
/ \
2 7
/ \ / \
1 3 6 9
镜像输出:
4
/ \
7 2
/ \ / \
9 6 3 1
示例 1:
输入:root = [4,2,7,1,3,6,9]
输出:[4,7,2,9,6,3,1]
限制:
0 <= 节点个数 <= 1000
注意:本题与主站 226 题相同:https://leetcode-cn.com/problems/invert-binary-tree/
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/er-cha-shu-de-jing-xiang-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
-
思路
1、理解好递归这题就非常简单了 -
示例1(好理解)
func mirrorTree(root *TreeNode) *TreeNode {
DFS(root)
return root
}
func DFS(root *TreeNode){
if root == nil {
return
}
tmp := root.Left
root.Left = root.Right
root.Right = tmp
DFS(root.Left)
DFS(root.Right)
}
- 示例二(完美解)
func mirrorTree(root *TreeNode) *TreeNode {
if root == nil {
return root
}
tmp := root.Left
root.Left = mirrorTree(root.Right)
root.Right = mirrorTree(tmp)
return root
}
- 测试代码
package main
import "fmt"
type TreeNode struct {
Val int
Left *TreeNode
Right *TreeNode
}
func main() {
var A = new(TreeNode)
A.Val = 4
A.Left = &TreeNode{2,nil,nil}
A.Right = &TreeNode{7,nil,nil}
A.Left.Left = &TreeNode{1,nil,nil}
A.Left.Right = &TreeNode{3,nil,nil}
A.Right.Left = &TreeNode{6,nil,nil}
A.Right.Right = &TreeNode{9,nil,nil}
B := mirrorTree(A)
printTree(B)
}
func mirrorTree(root *TreeNode) *TreeNode {
if root == nil {
return root
}
tmp := root.Left
root.Left = mirrorTree(root.Right)
root.Right = mirrorTree(tmp)
return root
}
//中序遍历
func printTree(root *TreeNode){
if root == nil {
return
}
printTree(root.Left)
fmt.Println(root.Val)
printTree(root.Right)
}