DoubleTree

package tree;

public class DoubleTree {

	/**
	 * Write a program that converts a given tree to its Double tree. 
	 * To create Double tree of the given tree, create a new duplicate for each node, 
	 * and insert the duplicate as the left child of the original node.

So the tree…

    2
   / \
  1   3
is changed to…

       2
      / \
     2   3
    /   /
   1   3
  /
 1
	 * @param args
	 */
	public static void doubleTree(TreeNode root){
		TreeNode cur = root;
		if(cur==null) return;
		doubleTree(cur.left);
		doubleTree(cur.right);
		TreeNode newNode = new TreeNode(cur.value);
		newNode.left = cur.left;
		cur.left = newNode;
	}
	public static void print(TreeNode root){
		if(root==null) return;
		System.out.print(root.value+" ");
		print(root.left);
		print(root.right);
	}
	public static void main(String[] args) {
		
		TreeNode root = new TreeNode(2);
		root.left = new TreeNode(1);
		root.right = new TreeNode(3);
		print(root);
		doubleTree(root);
		System.out.println();
		print(root);

	}

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值