Create Tutorial.md

Glorycs29 · Aug 4, 2023 · 7554403 · 7554403
1 parent 765f4db
commit 7554403
Showing 1 changed file with 7 additions and 0 deletions.
diff --git a/Minimum swaps required to convert binary tree into BST/Tutorial.md b/Minimum swaps required to convert binary tree into BST/Tutorial.md
@@ -0,0 +1,7 @@
+1. Find inorder traversal and store it.
+
+2. Similar to minimum swaps required to sort an array.
+
+3. Create a vector and store values with there indexes.
+
+4. Sort the vector and traverse it, if any value is not present at its correct index, swap it with correct index value and ans++.