题目:
输入一棵二元查找树,将该二元查找树转换成一个排序的双向链表。
要求不能创建任何新的结点,只调整指针的指向。
10
/ \
6 14
/ \ / \
4 8 12 16
转换成双向链表
4=6=8=10=12=14=16。
分析:
显然,所需的双向链表的节点顺序是该二叉树的中序遍历结果,可在中序遍历时,对节点进行处理(改变左右孩子)。代码与中序遍历的算法类似,只是多加了一个步骤。代码如下:
public class BstChangeToLink {
private Node head,tail;
public static class Node{
private int value;
private Node leftNode;
private Node rightNode;
public Node(int value, Node leftNode, Node rightNode){
this.value = value;
this.leftNode = leftNode;
this.rightNode = rightNode;
}
}
public void traversal(Node node){
if(node==null) return;
if(node.leftNode!=null) traversal(node.leftNode);
changeNode(node);
if(node.rightNode!=null) traversal(node.rightNode);
}
private void changeNode(Node node) {
//初始时,双向链表中无节点,head及tail均为null
if(head == null){
head = node;
tail = node;
}else{
//将新node的左指针指向当前tail,再将当前tail的右指针指向新node,最后将tail后移
node.leftNode = tail;
tail.rightNode = node;
tail = node;
}
}
//头结点向后打印
private void printHead() {
while(head!=null){
System.out.print(head.value+" ");
head = head.rightNode;
}
}
//尾节点向前打印
private void printTail(){
while(tail!=null){
System.out.print(tail.value+" ");
tail = tail.leftNode;
}
}
public static void main(String[] args) {
Node node1 = new Node(4,null,null);
Node node2 = new Node(8,null,null);
Node node3 = new Node(12,null,null);
Node node4 = new Node(16,null,null);
Node node5 = new Node(6,node1,node2);
Node node6 = new Node(14,node3,node4);
Node node7 = new Node(10,node5,node6);
BstChangeToLink t = new BstChangeToLink();
t.traversal(node7);
System.out.println("双向链表从头结点向后遍历:");
t.printHead();
System.out.println("双向链表从尾结点向前遍历:");
t.printTail();
}
}