IS IT BST

CodeChefOpen on judge ↗

Given a Binary Search Tree(BST) with $N$ nodes in which all the nodes will be unique. Now given a query of the following format: ### **X Y** where X and Y are **integers** and query can be interpreted as: **node with value X is to be changed with value Y**. Determine whether the resulting tree after processing the query is BST or not. ###Input Format: First line of input contain

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI