Inorder

Increasing Order Search Tree — LeetCode 897 Inorder Rewire in O(n)

LeetCode 897 (Easy). Rebuild a BST into a strictly right-skewed list using a single inorder traversal that rewires left and right pointers in place.