dxchen1
BAN USER
Comments (2)
Reputation 0
Page:
1
Comment hidden because of low score. Click to expand.
Comment hidden because of low score. Click to expand.
0
of 0 vote
TreeNode[] registr = new TreeNode[2];
convertBinaryTreeToCL(t1, registr);
public static void convertBinaryTreeToCL(TreeNode node, TreeNode[] register) {
if(node == null)
return ;
convertBinaryTreeToCL(node.left, register);
TreeNode head = register[0];
TreeNode prev = register[1];
if(head == null) {
register[0] = head = node;
}
else {
node.left = prev;
prev.right = node;
}
register[1] = prev = node;
convertBinaryTreeToCL(node.right, register);
if(prev.right == null) {
prev.right = head;
head.left = prev;
}
}
Page:
1
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.
- dxchen1 March 15, 2015