本文主要是介绍Invert Binary Tree问题及解法,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
问题描述:
Invert a binary tree.
4/ \2 7/ \ / \ 1 3 6 9to4/ \7 2/ \ / \ 9 6 3 1
过程详见代码:
/*** Definition for a binary tree node.* struct TreeNode {* int val;* TreeNode *left;* TreeNode *right;* TreeNode(int x) : val(x), left(NULL), right(NULL) {}* };*/
class Solution {
public:TreeNode* invertTree(TreeNode* root) {if(root == NULL) return NULL;TreeNode* left = root->left;TreeNode* right = root->right;root->left = invertTree(right);root->right = invertTree(left);return root;}
};
这篇关于Invert Binary Tree问题及解法的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!