二叉查找树转换成双向链表，java实现
package cn.edu.cqupt.mircrosoft100;/* * 1.把二元查找树转变成排序的双向链表（树） 题目：输入一棵二元查找树，将该二元查找树转换成一个排序的双向链表。要求不能创建任何新的结点，只调整指针的指向。 10 / / 6 14 / / / /4 8 12 16 转换成双向链表4=6=8=10=12=14=16 * * */public class BSTreeNode {private Integer value;private BSTreeNode left;private BSTreeNode right;private BSTreeNode Llist;static BSTreeNode head;static BSTreeNode temp;/* * 插入节点 */public void add(int insertValue){if(null==value)value=insertValue;else if(insertValue<=value){if(null==left){left = new BSTreeNode();left.setValue(insertValue);}elseleft.add(insertValue);}else{if(null==right){right = new BSTreeNode();right.setValue(insertValue);}elseright.add(insertValue);}}/* * 中序遍历打印二叉树 */public void list(){if(null==this.value)return;if(null!=left)left.list();System.out.println(value);if(null!=right)right.list();}/* * 中序遍历链表 */public BSTreeNode convertToLinkList(){if(null!=left)left.convertToLinkList(); addNodeToList(this);if(null!=right)right.convertToLinkList();return null;}/* * * 添加节点到双向链表尾部 */public void addNodeToList(BSTreeNode node){node.left=temp;if(null!=temp){temp.right=node;}else{head=node;}temp=node;}public int getValue() {return value;}public void setValue(int value) {this.value = value;}public BSTreeNode getLeft() {return left;}public void setLeft(BSTreeNode left) {this.left = left;}public BSTreeNode getRight() {return right;}public void setRight(BSTreeNode right) {this.right = right;}public static void main(String args[]){BSTreeNode tree = new BSTreeNode();tree.add(10);tree.add(6);tree.add(8);tree.add(4);tree.add(16);tree.add(12);tree.add(14);tree.add(2);tree.list();tree.convertToLinkList();BSTreeNode node = tree.head;System.out.println("Linklist:");while(null!=node){System.out.println(node.getValue());node = node.getRight();}}}?