码迷,mamicode.com
首页 > 其他好文 > 详细

Flatten Binary Tree to Linked List

时间:2014-06-30 18:13:31      阅读:229      评论:0      收藏:0      [点我收藏+]

标签:java   leetcode   tree   

题目

Given a binary tree, flatten it to a linked list in-place.

For example,
Given

         1
        /        2   5
      / \        3   4   6

The flattened tree should look like:
   1
         2
             3
                 4
                     5
                         6

方法

先将根节点的左子树连接到右边,在递归处理子节点。
    public void flatten(TreeNode root) {
        if(root == null) return;
        
        TreeNode left = root.left;
        TreeNode right = root.right;
        
        if(left != null){
            root.right = left;
            root.left = null;
            
            TreeNode rightmost = left;
            while(rightmost.right != null){
                rightmost = rightmost.right;
            }
            rightmost.right = right;
        }
        flatten(root.right);
    }


Flatten Binary Tree to Linked List,布布扣,bubuko.com

Flatten Binary Tree to Linked List

标签:java   leetcode   tree   

原文地址:http://blog.csdn.net/u010378705/article/details/35991429

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!