NeetCode #470LC-426MediumTrees
← Back to All Problems#470 · #426 · Convert Binary Search Tree to Sorted Doubly Linked List(将二叉搜索树转化为排序的双向链表)
📌 Problem Statement & Constraints
Convert a binary search tree into a sorted circular doubly linked list in place, where
left is the predecessor and right is the successor. Return the smallest value's node. Constraints: the number of nodes is in [0, 2000], -1000 <= Node.val <= 1000.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!