Roadmap DSA Tracker Code Editor Tech Blogs

Loading question...

The ultimate platform to master JavaScript interviews. Comprehensive questions, interactive practice, and detailed explanations.

Explore

Home
Practice Arena
Browse Topics
All Questions

Resources

Learning Roadmap
Cheatsheets
Tech Blog
Community

Stay Updated

Get the latest interview questions and tips delivered to your inbox.

Join 5,000+ developers

© 2026 JS Interview Prep. Made withby developers.

Privacy Terms Cookies

Buy Me A Coffee

Recover Binary Search Tree

Hard

00:00

0 users online

Recover a BST where two nodes were swapped by mistake.

Sample Input:

[1,3,null,null,2]

Sample Output:

[3,1,null,null,2]

Hints

Hint 1

Use inorder traversal to find swapped nodes

Hint 2

Track previous node during traversal

Hint 3

Swap values of the two incorrect nodes

Code Editor

Loading...