Convert Binary Search Tree to Sorted Doubly Linked List

Example 1:

Input: root = [4,2,5,1,3]Output: [1,2,3,4,5]

思路：Inorder traverse，用stack做；记录一下first 和last node就可以了；最后返回dummpy.right;

错误点：没有想到用dummpy，作为cur node来用；

/*
// Definition for a Node.
class Node {public int val;public Node left;public Node right;public Node() {}public Node(int _val) {val = _val;}public Node(int _val,Node _left,Node _right) {val = _val;left = _left;right = _right;}
};
*/class Solution {public Node treeToDoublyList(Node root) {if(root == null) {return null;}Stack<Node> stack = new Stack<>();pushLeft(root, stack);Node first = null;Node last = null;Node pre = null;while(!stack.isEmpty()) {Node node = stack.pop();// get first;if(first == null) {first = node;}// get last;if(stack.isEmpty()) {last = node;}// connect middle node;if(pre != null) {pre.right = node;node.left = pre;}pre = node;if(node.right != null) {pushLeft(node.right, stack);}}first.left = last;last.right = first;return first;}private void pushLeft(Node node, Stack<Node> stack) {while(node != null) {stack.push(node);node = node.left;}}
}

Convert Binary Search Tree to Sorted Doubly Linked List相关推荐

LeetCode 426. Convert Binary Search Tree to Sorted Doubly Linked List--转换二叉树为双向链表--Java,C++,Python解法
题目地址:Convert Binary Search Tree to Sorted Doubly Linked List - LeetCode Convert a BST to a sorted ci ...
leetcode -day19 Convert Sorted List to Binary Search Tree
1. Convert Sorted List to Binary Search Tree Given a singly linked list where elements are sorted ...
LeetCode: 109. Convert Sorted List to Binary Search Tree
题目 Given a singly linked list where elements are sorted in ascending order, convert it to a height b ...
【leetcode】109. Convert Sorted List to Binary Search Tree
题目如下: Given a singly linked list where elements are sorted in ascending order, convert it to a heigh ...
【链表递归构造二叉树】LeetCode 109. Convert Sorted List to Binary Search Tree
LeetCode 109. Convert Sorted List to Binary Search Tree Solution1:我的答案偷鸡摸狗的做法 /*** Definition for s ...
Convert Sorted Array to Binary Search Tree - LeetCode
目录题目链接注意点解法小结题目链接 Convert Sorted Array to Binary Search Tree - LeetCode 注意点不要访问空结点题目要求的是平衡二叉搜 ...
LeetCode: Convert Sorted Array to Binary Search Tree 解题报告
Convert Sorted Array to Binary Search Tree Given an array where elements are sorted in ascending ord ...
【数组递归构造二叉树】LeetCode 108. Convert Sorted Array to Binary Search Tree
LeetCode 108. Convert Sorted Array to Binary Search Tree Solution1:我的答案构造二叉树利用递归 /*** Definition fo ...
【LeetCode-面试算法经典-Java实现】【109-Convert Sorted List to Binary Search Tree（排序链表转换成二叉排序树）】...
[109-Convert Sorted List to Binary Search Tree(排序链表转换成二叉排序树)] [LeetCode-面试算法经典-Java实现][全部题目文件夹索引] 原题 ...
二叉查找树(binary search tree)详解
二叉查找树(Binary Search Tree),也称二叉排序树(binary sorted tree),是指一棵空树或者具有下列性质的二叉树: 若任意节点的左子树不空,则左子树上所有结点的值均小于 ...

Convert Binary Search Tree to Sorted Doubly Linked List

Convert Binary Search Tree to Sorted Doubly Linked List相关推荐

最新文章

热门文章