leetcode226

递归，回朔的时候改变根节点指向左右子树的位置即可

 1 /**
 2  * Definition for a binary tree node.
 3  * struct TreeNode {
 4  *     int val;
 5  *     TreeNode *left;
 6  *     TreeNode *right;
 7  *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 8  * };
 9  */
10 class Solution {
11 public:
12     TreeNode* invertTree(TreeNode* root) {
13         if(root==NULL)return root;
14         TreeNode *a,*b;
15         a=invertTree(root->left);
16         b=invertTree(root->right);
17         root->left=b;
18         root->right=a;
19         return root;
20     }
21 };

 

posted @ 2016-07-21 10:15  HYDhyd  阅读(111)  评论(0)  编辑  收藏  举报