首页 > 代码库 > [LeetCode]156 Binary Tree Upside Down
[LeetCode]156 Binary Tree Upside Down
https://oj.leetcode.com/problems/binary-tree-upside-down/
http://blog.csdn.net/xudli/article/details/42362441
/**
* Definition for binary tree
* 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)
return null;
Stack<TreeNode> stack = new Stack<>();
TreeNode node = root;
while (node != null)
{
stack.push(node);
node = node.left;
}
TreeNode newhead = null;
while (!stack.empty())
{
node = stack.pop();
if (newhead == null)
newhead = node;
if (!stack.empty())
{
node.left = stack.peek().right;
node.right = stack.peek();
}
else
{
node.left = null;
node.right = null;
}
}
return newhead;
}
}[LeetCode]156 Binary Tree Upside Down
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。