package sort;
public class Test36 {
public static BinayTreeNode head = null;
public static BinayTreeNode prehead = null;
public static void main(String[] args) {
int deepth = 2;
BinayTreeNode root = new BinayTreeNode(1, null, null);
makeTree(root, deepth);
CoverLinkedlist(root);
printList(head);
}
private static void printList(BinayTreeNode root) {
// TODO Auto-generated method stub
while (root != null) {
System.out.print(root.value + " ");
root = root.right;
}
}
private static void makeTree(BinayTreeNode node, int deep) {
// TODO Auto-generated method stub
if (deep > 0) {
node.left = new BinayTreeNode(node.value * 2, null, null);
node.right = new BinayTreeNode(node.value * 2 + 1, null, null);
makeTree(node.left, deep - 1);
makeTree(node.right, deep - 1);
}
}
public static void CoverLinkedlist(BinayTreeNode bt) {// 使用树的中序遍历
if (bt != null) {// 递归出口
CoverLinkedlist(bt.left);// 遍历左节点
if (prehead == null) {// 如果是第一个节点则吧head,prehead都指向该节点
prehead = bt;
head = bt;
} else {// 如果不是第一个节点则吧前一个节点的右指针指向该节点,该节点的左指针指向前一个节点,形成双向链表
prehead.right = bt;// 同时pehead指向下一个
bt.left = prehead;
prehead = prehead.right;
}
CoverLinkedlist(bt.right);// 遍历右子树
}
}
}