chore: fixing

Author: rupeshtiwari

README.md

@@ -66,6 +66,7 @@
     - [Route Between Nodes: Given a directed graph, design an algorithm to find out whether there is a route between two nodes.](#route-between-nodes-given-a-directed-graph-design-an-algorithm-to-find-out-whether-there-is-a-route-between-two-nodes)
     - [Minimal Tree: Given a sorted increasing order array with unique integer elements, write an algorithm to create a binary search tree with minimal height](#minimal-tree-given-a-sorted-increasing-order-array-with-unique-integer-elements-write-an-algorithm-to-create-a-binary-search-tree-with-minimal-height)
     - [Check if a given binary tree is BST ( Binary Search Tree )](#check-if-a-given-binary-tree-is-bst--binary-search-tree-)
+    - [Delete node from Binary Search Tree (BST)](#delete-node-from-binary-search-tree-bst)
   - [Recursion Interview Questions](#recursion-interview-questions)
     - [Calculate x to the power n using recursion](#calculate-x-to-the-power-n-using-recursion)
     - [Calculate Modular Exponentiation using recursion](#calculate-modular-exponentiation-using-recursion)
@@ -681,21 +682,29 @@ Trade off or invest some memory to improve run time complexity. Suppose use Has-
 
 **Binary Search Tree (BST)**: is a binary tree in which for each node value of all the nodes in the left subtree is lesser or equal to the root node. And the values of all the nodes in the right subtree is greater than the root node.
 
-In order to find a tree as BST we must define each node range that is its outer and inner bound values.
+In order to find a tree as BST we must `define each node range` that is its outer and inner bound values and iterate the tree and compare their ranges.
 
 ![](https://i.imgur.com/gxHDDqd.png)
 
-Is Binary Search Tree Algorithm
+Is Binary Search Tree `Algorithm`
 
 ![](https://i.imgur.com/zaxKJxL.png)
 
-Is Binary Search Tree Algorithm Simulation
+Is Binary Search Tree `Algorithm Simulation`
 
 ![](https://i.imgur.com/il4sN6p.png)
 
+Is Binary Search Tree `Coding Files`
+
 - [Question](https://codepen.io/roopkt/pen/JjWwYGo)
 - [Answer](https://codepen.io/roopkt/pen/zYZyvzO)
 
+
+#### Delete node from Binary Search Tree (BST)
+
+
+
+
 ### Recursion Interview Questions
 
 #### Calculate x to the power n using recursion
@@ -722,6 +731,7 @@ Modular Exponentiation is the remainder dividing up on `Pow(x,n)` by `M`.
 ![Modular Exponentiation is the remainder dividing up on `Pow(x,n)` by `M`](https://i.imgur.com/Y3GkhRT.png)
 
 - [Question](https://codepen.io/roopkt/pen/GRWYVEa?editors=0010)
+
 - [Answer](https://codepen.io/roopkt/pen/gOmBVWJ?editors=0010)
 
 ### Sorted Array Interview Coding