public TreeNode invertTree(TreeNode root){
if(root==null) return null;
else{
TreeNode temp = root;
temp = root.left;
root.left = root.right;
root.right = temp;
return root;
}
}
LeetCode226翻转一颗二叉树
猜你喜欢
转载自blog.csdn.net/sinat_40553837/article/details/88775569
今日推荐
周排行