[Leetcode] no.226 Invert Binary Tree

Topic

Invert a binary tree.

     4   /     2     7/\   /1   3 6   9

To

     4   /     7     2/\   /9   6 3   1

[Problem resolution] or two fork tree problems, such topics can be disassembled to deal with the current node, processing the left subtree, processing the right sub-tree several sub-problems.
The problem with Saozi right subtree is the current problem, and recursion can be used. This kind of thinking is relatively simple and straightforward. The maximum depth problem of binary tree is obtained by reference. The code is as follows.

Private classTreeNode {intVal;    TreeNode left;    TreeNode right; TreeNode (intX) {val =x;}} PublicTreeNode inverttree (TreeNode root) {if(NULL= = root)return NULL; if(NULL= = Root.left &&NULL= = Root.right)returnRoot; TreeNode tmp=Inverttree (Root.left); Root.left=Inverttree (root.right); Root.right=tmp; returnRoot;} 

[Leetcode] no.226 Invert Binary Tree