TreeNode mirrorTreeNode(TreeNode root){ if(root == null){ return null; } TreeNode left = mirrorTreeNode(root.left); TreeNode right = mirrorTreeNode(root.right); root.left = right; root.right = left; return root; }
翻转二叉树或镜像二叉树
猜你喜欢
转载自www.cnblogs.com/yingpu/p/9287194.html
今日推荐
周排行