首页 > 代码库 > 156. Binary Tree Upside Down
156. Binary Tree Upside Down
Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip it upside down and turn it into a tree where the original right nodes turned into left leaf nodes. Return the new root.
For example:
Given a binary tree {1,2,3,4,5},
1 / 2 3 / 4 5
return the root of the binary tree [4,5,2,#,#,3,1].
4 / 5 2 / 3 1
思路：不是特别理解怎么翻转，用recursive做的。完全按照题目给的例子来。翻转左子树，然后原来的root.left重新分配指向。
/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public TreeNode upsideDownBinaryTree(TreeNode root) { if(root==null||root.left==null&&root.right==null) { return root; } TreeNode check=upsideDownBinaryTree(root.left); root.left.left=root.right; root.left.right=root; root.left=null; root.right=null; return check; }}
156. Binary Tree Upside Down
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。