leetcode-hot100 3.翻转二叉树 (cpp)

图片来自leetcode

//先序遍历，注意交换前的保存
class Solution {
public:
	TreeNode* invertTree(TreeNode* root) {

		if (root == NULL)
		{
			return NULL;
		}
       
		TreeNode* leftroot = root->left;
		root->left = invertTree(root->right);
		root->right = invertTree(leftroot);
		return root;
	}
};