← Oracle questions

BST, Binary Tree Views, and Graph Bipartiteness

Filed under Oracle

Given the root of a binary search tree (BST) where exactly two nodes were swapped by mistake, recover the tree without changing its structure.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Oracle questions

Collected from public candidate posts and coding forums. Updated Nov 2026.