递归
二叉树的镜像
http://www.nowcoder.com/questionTerminal/564f4c26aa584921bc75623e48ca3011
是我太偷懒了?
class Solution { public: void Mirror(TreeNode *pRoot) { if (pRoot){ swap(pRoot->left, pRoot->right); Mirror(pRoot->left); Mirror(pRoot->right); } } };
二叉树的镜像
http://www.nowcoder.com/questionTerminal/564f4c26aa584921bc75623e48ca3011
是我太偷懒了?
class Solution { public: void Mirror(TreeNode *pRoot) { if (pRoot){ swap(pRoot->left, pRoot->right); Mirror(pRoot->left); Mirror(pRoot->right); } } };
相关推荐