Fixing Two nodes of a BST | Practice

Problem
Contest

Here is some troubleshooting advice:

Reset the IDE using the second button on the top right corner.
Avoid using static/global variables in your code as your code is tested against multiple test cases and these tend to retain their previous values.
Passing the Sample/Custom Test cases does not guarantee the correctness of code. On submission, your code is tested against multiple test cases consisting of all possible corner cases and stress constraints.
You can access the hints to get an idea about what is expected of you as well as the final solution code.
You can view the solutions submitted by other users from the submission tab.

Still facing issue? Click here.

Here is some troubleshooting advice for contest problems

Make sure you are not using ad-blockers.
Disable browser extensions.
We recommend using latest version of your browser for best experience.
Avoid using static/global variables in coding problems as your code is tested against multiple test cases and these tend to retain their previous values.
Passing the Sample/Custom Test cases in coding problems does not guarantee the correctness of code. On submission, your code is tested against multiple test cases consisting of all possible corner cases and stress constraints.

Still facing issue? Click here.

Suggest Changes in Problem Statement:

<div>You are given the root of a binary search tree(BST), where exactly two nodes were swapped by mistake. Fix (or correct) the BST by swapping them back. Do not change the structure of the tree.</div>

<div>Note: It is guaranteed that the given input will form BST, except for 2 nodes that will be wrong. All changes must be reflected in the original linked list.</div>

<div>Example 1:</div>

<pre>
Input:
 10
  / \
  5 8
  / \
  2 20
Output: 1
Explanation:
 <img alt="" src="https://media.geeksforgeeks.org/wp-content/uploads/20190528095934/FixNodes.jpg" style="height:252px; width:374px" /></pre>

Example 2:

<pre>
Input:
  11
  / \
  3 17
  \ /
  4 10
Output: 1 
Explanation: 
By swapping nodes 11 and 10, the BST 
can be fixed.
</pre>

Your Task: 
You don't need to take any input. Just complete the function correctBst() that takes root node as parameter. The function should not return anything, all the changes must be done in the existing tree only. BST will then be checked by driver code and 0 or 1 will be printed.

Expected Time Complexity: O(n) 
Expected Auxiliary Space: O(1)

Constraints: 
1 ≤ Number of nodes ≤ 103

<div>You are given the root of a binary search tree(BST), where exactly two nodes were swapped by mistake. Fix (or correct) the BST by swapping them back. Do not change the structure of the tree.</div>

<div>Note: It is guaranteed that the given input will form BST, except for 2 nodes that will be wrong. All changes must be reflected in the original linked list.</div>

<div>Example 1:</div>

<pre>
Input:
 10
  / \
  5 8
  / \
  2 20
Output: 1
Explanation:
 <img alt="" src="https://media.geeksforgeeks.org/wp-content/uploads/20190528095934/FixNodes.jpg" style="height:252px; width:374px" /></pre>

Example 2:

<pre>
Input:
  11
  / \
  3 17
  \ /
  4 10
Output: 1 
Explanation: 
By swapping nodes 11 and 10, the BST 
can be fixed.
</pre>

Your Task: 
You don't need to take any input. Just complete the function correctBst() that takes root node as parameter. The function should not return anything, all the changes must be done in the existing tree only. BST will then be checked by driver code and 0 or 1 will be printed.

Expected Time Complexity: O(n) 
Expected Auxiliary Space: O(1)

Constraints: 
1 ≤ Number of nodes ≤ 103

Loading...

Editorial

Loading...

All Submissions

My Submissions:

Output Window

Message

Loading...

Editorial

Loading...

All Submissions

My Submissions:

Output Window

Select Operation Mode