leetcode hot100-226翻转二叉树

张开发
2026/6/19 3:11:56 15 分钟阅读
leetcode hot100-226翻转二叉树
递归class Solution { public: TreeNode* invertTree(TreeNode* root) { if(rootnullptr){ return root; } TreeNode* leftinvertTree(root-left); TreeNode* rightinvertTree(root-right); root-leftright; root-rightleft; return root; } };

更多文章