剑指 Offer 27. 二叉树的镜像(python/c++)
2021/9/21 22:10:54
本文主要是介绍剑指 Offer 27. 二叉树的镜像(python/c++),对大家解决编程问题具有一定的参考价值,需要的程序猿们随着小编来一起学习吧!
/** * 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* mirrorTree(TreeNode* root) { if(!root){ return NULL; } TreeNode*left = mirrorTree(root->left); TreeNode*right = mirrorTree(root->right); root->left = right; root->right = left; return root; } };
# Definition for a binary tree node. # class TreeNode: # def __init__(self, x): # self.val = x # self.left = None # self.right = None class Solution: def mirrorTree(self, root: TreeNode) -> TreeNode: if not root:return root.left,root.right = self.mirrorTree(root.right),self.mirrorTree(root.left) return root
这篇关于剑指 Offer 27. 二叉树的镜像(python/c++)的文章就介绍到这儿,希望我们推荐的文章对大家有所帮助,也希望大家多多支持为之网!
- 2024-05-08有遇到过吗?同样的规则 Excel 中 比Python 结果大
- 2024-03-30开始python成长之路
- 2024-03-29python optparse
- 2024-03-29python map 函数
- 2024-03-20invalid format specifier python
- 2024-03-18pool.map python
- 2024-03-18threads in python
- 2024-03-14python Ai 应用开发基础训练,字符串,字典,文件
- 2024-03-13id3 algorithm python
- 2024-03-13sum array elements python