About This Pattern
Master the Tree DFS / In-order pattern by practicing these problems organized by difficulty.Focus on the Key Signals - these are the indicators that tell you when to use this pattern.
Medium (1)
Convert Binary Search Tree to Sorted Doubly Linked List
Convert a BST to a sorted circular doubly-linked list in-place.
Key Signals:
In-order traversalBST to DLLCircular list