Recover BST

Category: Trees & BSTs

Difficulty: advanced

Description: Fix BST with two swapped nodes

Time Complexity: O(n)

Space Complexity: O(h)

Related LeetCode Problems

• 99. Recover Binary Search Tree (Hard)
• 98. Validate Binary Search Tree (Medium)
• 230. Kth Smallest Element in a BST (Medium)
• 501. Find Mode in Binary Search Tree (Easy)
• 124. Binary Tree Maximum Path Sum (Hard)
• 99. Recover Binary Search Tree (duplicate) (Hard)
• 98. Validate Binary Search Tree (duplicate) (Medium)