docs: ✏️ update comment about dfs

Author: dandedotdev

src/0001-1000/133/cloneGraph.ts

@@ -4,6 +4,7 @@ import { Node } from 'classes/GraphNode'
 // Time: O(n)
 // Space: O(n)
 
+// 1. dfs
 function dfs(node: Node, visited: Map<Node, Node>): Node {
     if (visited.has(node)) {
         return visited.get(node)!

src/0001-1000/230/kthSmallest2.ts

@@ -37,6 +37,7 @@ class MyBst {
     public kthSmallest(k: number): number {
         let cur: TreeNode | null = this.root
 
+        // 1. dfs
         while (cur) {
             const leftChildNum = this.getChildNum(cur.left)
 

src/0001-1000/235/lowestCommonAncestor.ts

@@ -17,6 +17,7 @@ function lowestCommonAncestor(
         return root
     }
 
+    // 1. dfs
     if (p!.val < root.val && q!.val < root.val) {
         return lowestCommonAncestor(root.left, p, q)
     }

src/0001-1000/235/lowestCommonAncestor2.ts

@@ -4,6 +4,7 @@ import { TreeNode } from 'classes/BinaryTreeNode'
 // Time: O(n)
 // Space: O(n)
 
+// 1. dfs
 function getPath(node: TreeNode, target: TreeNode): TreeNode[] {
     const path: TreeNode[] = []
 

src/0001-1000/236/lowestCommonAncestor3.ts

@@ -14,6 +14,7 @@ function lowestCommonAncestor(
         return root
     }
 
+    // 1. dfs
     const leftChild = lowestCommonAncestor(root.left, p, q)
     const rightChild = lowestCommonAncestor(root.right, p, q)
 

src/0001-1000/450/deleteNode.ts

@@ -10,6 +10,7 @@ function deleteNode(root: TreeNode | null, key: number): TreeNode | null {
         return root
     }
 
+    // 1. dfs
     if (root.val > key) {
         root.left = deleteNode(root.left, key)
         return root

src/0001-1000/669/trimBST.ts

@@ -10,6 +10,7 @@ function trimBST(root: TreeNode | null, low: number, high: number): TreeNode | n
         return root
     }
 
+    // 1. dfs
     if (root.val < low) {
         return trimBST(root.right, low, high)
     }

src/0001-1000/700/searchBST.ts

@@ -13,6 +13,7 @@ function searchBST(root: TreeNode | null, val: number): TreeNode | null {
         return root
     }
 
+    // 1. dfs
     return searchBST(val < root.val ? root.left : root.right, val)
 }
 

src/0001-1000/814/pruneTree.ts

@@ -10,6 +10,7 @@ function pruneTree(root: TreeNode | null): TreeNode | null {
         return root
     }
 
+    // 1. dfs
     root.left = pruneTree(root.left)
     root.right = pruneTree(root.right)
 

src/1001-2000/1325/removeLeafNodes.ts

@@ -10,6 +10,7 @@ function removeLeafNodes(root: TreeNode | null, target: number): TreeNode | null
         return root
     }
 
+    // 1. dfs
     root.left = removeLeafNodes(root.left, target)
     root.right = removeLeafNodes(root.right, target)