题目：请完成一个函数，输入一个二叉树，该函数输出它的镜像.
代码:
func mirrorTree(rootNode:inout TreeNode?) -> Void {
if rootNode == nil || (rootNode?.leftChild == nil && rootNode?.rightChild != nil) {
return
}
let tempNode:TreeNode = rootNode!
swap(&tempNode.leftChild, &tempNode.rightChild)
if rootNode?.leftChild != nil {
mirrorTree(rootNode: &tempNode.leftChild)
}
if rootNode?.rightChild != nil {
mirrorTree(rootNode: &tempNode.rightChild)
}
}
测试代码:
var util:TreeUtil = TreeUtil()
var rootStr:String = "124##5##36##7##"
var preRootNode:TreeNode?
util.rootList = rootStr
util.createTreeByPreOrder(root: &preRootNode)
var treeOrder:TreeOrder = TreeOrder()
var mirrorTree:MirrorTree = MirrorTree()
mirrorTree.mirrorTree(rootNode: &preRootNode)
print("镜像")
treeOrder.levelOrder(preRootNode)
print()
