輸入一棵二叉搜索樹，將該二叉搜索樹轉換成一個排序的循環雙向鏈表。要求不能創建任何新的節點，只能調整樹中節點指針的指向。

代碼：

package offer;
class BineryTreeNode
{
?? ?int val;
?? ?BineryTreeNode left = null;
?? ?BineryTreeNode right = null;
?? ?BineryTreeNode(int val)
?? ?{
?? ??? ?this.val = val;
?? ?}
}
public class ti36 {
?? ? private static BineryTreeNode pre = null; //保存當前節點的前一個節點
?? ? ? ?private static BineryTreeNode head = null;//保存鏈表的頭結點
?? ? ? ?public static BineryTreeNode Convert(BineryTreeNode pRootOfTree) {
?? ? ? ? ? ?if(pRootOfTree==null) return null;
?? ? ? ? ? ?inOrder(pRootOfTree);
?? ? ? ? ? ?return head;
?? ? ? ?}
?? ? ? ?private static void inOrder(BineryTreeNode node) {
?? ? ? ? ? ?if (node == null) return;
?? ? ? ? ? ?System.out.println(node.val);
?? ? ? ? ? ?inOrder(node.left);
?? ? ? ? ? ?node.left = pre;
?? ? ? ? ? ?if (pre != null) ?pre.right = node;
?? ? ? ? ? ?pre = node;
?? ? ? ? ? ?if (head == null) head = node;
?? ? ? ? ? ?inOrder(node.right);
?? ? ? ?}
?? ?public static void main(String[] args)
?? ?{
?? ??? ?/*BineryTreeNode a = new BineryTreeNode(10);
?? ??? ?BineryTreeNode b = new BineryTreeNode(6);
?? ??? ?BineryTreeNode c = new BineryTreeNode(14);
?? ??? ?BineryTreeNode d = new BineryTreeNode(4);
?? ??? ?BineryTreeNode e = new BineryTreeNode(8);
?? ??? ?BineryTreeNode f = new BineryTreeNode(12);
?? ??? ?BineryTreeNode g = new BineryTreeNode(16);
?? ??? ?a.left = b;
?? ??? ?a.right = c;
?? ??? ?b.left = d;
?? ??? ?b.right = e;
?? ??? ?c.left = f;
?? ??? ?c.right = g;*/
?? ??? ?BineryTreeNode a = new BineryTreeNode(4);
?? ??? ?BineryTreeNode b = new BineryTreeNode(2);
?? ??? ?BineryTreeNode c = new BineryTreeNode(5);
?? ??? ?BineryTreeNode d = new BineryTreeNode(1);
?? ??? ?BineryTreeNode e = new BineryTreeNode(3);
?? ??? ?a.left = b;
?? ??? ?a.right = c;
?? ??? ?b.left = d;
?? ??? ?b.right = e;
?? ??? ?BineryTreeNode result = Convert(a);
?? ?}
}
?

總結

以上是生活随笔為你收集整理的【剑指offer】面试题36：二叉搜索树与双向链表（java）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。