二叉搜索树转换为双向链表,实现过程如下所示:
package cn.edu.nwu.structs.tree;
/**
* @author jcm
* 将一颗平衡二叉树转化为双链表
* 时间 2016年9月1日
*/
public class BinaryTreeToLinkList {
public static void main(String[] args) {
BinaryTreeNode root = createBanaceTree();
BinaryTreeNode result=convert(root);
while (result!=null) {
System.out.println(result.data);
result=result.rightTreeNode;
}
}
/**
* 将一颗平衡二叉树转化为双链表
* @param root 二叉查找树根节点指针
* @param last 已经转换好的链表的最后一个节点
* @return 返回一个双链表
*/
public static BinaryTreeNode binaryTreeToLinkList(BinaryTreeNode root,BinaryTreeNode lastTNode){
if(root == null){
return lastTNode;
}
BinaryTreeNode currentTNode = root;
//遍历当前结点的左子树
if(currentTNode.leftTreeNode != null){
lastTNode = binaryTreeToLinkList(root.leftTreeNode,lastTNode);
}
//二叉搜索树中序遍历的特性,当遍历根节点的时候,左子树已经排好序了,
//所以会有一个左子树已经转换好的链表,而这个链表的最后一个节点即是根节点左孩子结点所指向的的节点
currentTNode.leftTreeNode = lastTNode;
//不为空说明需要把根节点和lastNode连起来
if(lastTNode != null){
lastTNode.rightTreeNode = currentTNode;
}
lastTNode = currentTNode;
if(currentTNode.rightTreeNode != null){
lastTNode = binaryTreeToLinkList(root.rightTreeNode,lastTNode);
}
return lastTNode;
}
/**
* @author jcm
* 由于是双向链表,从后面遍历找到链表的头结点
* @param root 树根
* @return 返回链表的头结点
*/
public static BinaryTreeNode convert(BinaryTreeNode root){
BinaryTreeNode lastTNode = null;
lastTNode = binaryTreeToLinkList(root, lastTNode);
BinaryTreeNode headTNode = lastTNode;
while (headTNode.leftTreeNode != null)
headTNode = headTNode.leftTreeNode;
return headTNode;
}
/**
* @author jcm
* 构建平衡二叉树
* @return 返回根结点
*/
private static BinaryTreeNode createBanaceTree() {
BinaryTreeNode root = new BinaryTreeNode(10);
BinaryTreeNode tree6=new BinaryTreeNode(6);
BinaryTreeNode tree4=new BinaryTreeNode(4);
BinaryTreeNode tree8=new BinaryTreeNode(8);
BinaryTreeNode tree14=new BinaryTreeNode(14);
BinaryTreeNode tree12=new BinaryTreeNode(12);
BinaryTreeNode tree16=new BinaryTreeNode(16);
root.leftTreeNode=tree6;
root.rightTreeNode=tree14;
tree6.leftTreeNode=tree4;
tree6.rightTreeNode=tree8;
tree14.leftTreeNode=tree12;
tree14.rightTreeNode=tree16;
return root;
}
}
可以详细访问:http://www.cnblogs.com/keedor/p/4467040.html
http://bylijinnan.iteye.com/blog/1343176