題目:
題解:
struct TreeNode* invertTree(struct TreeNode* root) {if (root == NULL) {return NULL;}struct TreeNode* left = invertTree(root->left);struct TreeNode* right = invertTree(root->right);root->left = right;root->right = left;return root;
}
題目:
題解:
struct TreeNode* invertTree(struct TreeNode* root) {if (root == NULL) {return NULL;}struct TreeNode* left = invertTree(root->left);struct TreeNode* right = invertTree(root->right);root->left = right;root->right = left;return root;
}
本文來自互聯網用戶投稿,該文觀點僅代表作者本人,不代表本站立場。本站僅提供信息存儲空間服務,不擁有所有權,不承擔相關法律責任。 如若轉載,請注明出處:http://www.pswp.cn/web/42863.shtml 繁體地址,請注明出處:http://hk.pswp.cn/web/42863.shtml 英文地址,請注明出處:http://en.pswp.cn/web/42863.shtml
如若內容造成侵權/違法違規/事實不符,請聯系多彩編程網進行投訴反饋email:809451989@qq.com,一經查實,立即刪除!