refactor

Author: AhmedLSayed9

data_structures/non_linear/graphs/graph.dart

@@ -78,22 +78,22 @@ class Graph<T> {
   /// - Invoke the helper function with the starting vertex.
   /// - Return the result array.
   List<T> dfs(T startingVertex) {
-    // startingVertex vertex doesn't exist.
+    // startingVertex doesn't exist.
     if (_adjacencyList[startingVertex] == null) return [];
 
     final List<T> data = [];
     final Set<T> visited = {};
 
-    _dfsRecursive(data, visited, startingVertex);
+    _dfsRecursion(data, visited, startingVertex);
     return data;
   }
 
-  void _dfsRecursive(List<T> data, Set<T> visited, T vertex) {
+  void _dfsRecursion(List<T> data, Set<T> visited, T vertex) {
     visited.add(vertex);
     data.add(vertex);
 
     for (final neighbor in _adjacencyList[vertex]!) {
-      if (!visited.contains(neighbor)) _dfsRecursive(data, visited, neighbor);
+      if (!visited.contains(neighbor)) _dfsRecursion(data, visited, neighbor);
     }
   }
 
@@ -110,7 +110,7 @@ class Graph<T> {
   ///   - If any of those values have not been visited, mark it as visited and enqueue that vertex.
   /// - Return the result array.
   List<T> bfs(T startingVertex) {
-    // startingVertex vertex doesn't exist.
+    // startingVertex doesn't exist.
     if (_adjacencyList[startingVertex] == null) return [];
 
     final List<T> data = [];

data_structures/non_linear/trees/binary_trees/binary_search_tree.dart

@@ -29,26 +29,26 @@ class BinarySearchTree {
   ///     - If there is not, add that node as the left property.
   BinarySearchTree? insert(num value) {
     if (_root case final root?) {
-      return _insertRecursive(value, root);
+      return _insertRecursion(value, root);
     }
     _root = Node(value);
     return this;
   }
 
-  BinarySearchTree? _insertRecursive(num value, Node<num> node) {
+  BinarySearchTree? _insertRecursion(num value, Node<num> node) {
     if (value < node.value) {
       if (node.left == null) {
         node.left = Node(value);
         return this;
       }
-      return _insertRecursive(value, node.left!);
+      return _insertRecursion(value, node.left!);
     }
     if (value > node.value) {
       if (node.right == null) {
         node.right = Node(value);
         return this;
       }
-      return _insertRecursive(value, node.right!);
+      return _insertRecursion(value, node.right!);
     }
     //value == node.value (value already there)
     return null;
@@ -67,13 +67,13 @@ class BinarySearchTree {
   ///       - If there is, move to that node and repeat these steps.
   ///       - If there is not, we're done searching.
   bool find(num value) {
-    return _findRecursive(value, _root);
+    return _findRecursion(value, _root);
   }
 
-  bool _findRecursive(num value, Node<num>? node) {
+  bool _findRecursion(num value, Node<num>? node) {
     if (node == null) return false;
-    if (value < node.value) return _findRecursive(value, node.left);
-    if (value > node.value) return _findRecursive(value, node.right);
+    if (value < node.value) return _findRecursion(value, node.left);
+    if (value > node.value) return _findRecursion(value, node.right);
     return true; //value == node.value (value has found)
   }
 }

data_structures/non_linear/trees/binary_trees/binary_tree_traversal.dart

@@ -35,15 +35,15 @@ extension BinaryTreeTraversalX on BinarySearchTree {
   /// - Return the array of values.
   List<num> dfsPreOrder() {
     final List<num> data = [];
-    _dfsPreOrderRecursive(data, _root);
+    _dfsPreOrderRecursion(data, _root);
     return data;
   }
 
-  void _dfsPreOrderRecursive(List<num> data, Node<num>? node) {
+  void _dfsPreOrderRecursion(List<num> data, Node<num>? node) {
     if (node == null) return;
     data.add(node.value);
-    if (node.left != null) _dfsPreOrderRecursive(data, node.left);
-    if (node.right != null) _dfsPreOrderRecursive(data, node.right);
+    if (node.left != null) _dfsPreOrderRecursion(data, node.left);
+    if (node.right != null) _dfsPreOrderRecursion(data, node.right);
   }
 
   /// Depth-first Search (DFS) PostOrder Pseudocode (Recursively):
@@ -56,14 +56,14 @@ extension BinaryTreeTraversalX on BinarySearchTree {
   /// - Return the array of values.
   List<num> dfsPostOrder() {
     final List<num> data = [];
-    _dfsPostOrderRecursive(data, _root);
+    _dfsPostOrderRecursion(data, _root);
     return data;
   }
 
-  void _dfsPostOrderRecursive(List<num> data, Node<num>? node) {
+  void _dfsPostOrderRecursion(List<num> data, Node<num>? node) {
     if (node == null) return;
-    if (node.left != null) _dfsPostOrderRecursive(data, node.left);
-    if (node.right != null) _dfsPostOrderRecursive(data, node.right);
+    if (node.left != null) _dfsPostOrderRecursion(data, node.left);
+    if (node.right != null) _dfsPostOrderRecursion(data, node.right);
     data.add(node.value);
   }
 
@@ -77,14 +77,14 @@ extension BinaryTreeTraversalX on BinarySearchTree {
   /// - Return the array of values.
   List<num> dfsInOrder() {
     final List<num> data = [];
-    _dfsInOrderRecursive(data, _root);
+    _dfsInOrderRecursion(data, _root);
     return data;
   }
 
-  void _dfsInOrderRecursive(List<num> data, Node<num>? node) {
+  void _dfsInOrderRecursion(List<num> data, Node<num>? node) {
     if (node == null) return;
-    if (node.left != null) _dfsInOrderRecursive(data, node.left);
+    if (node.left != null) _dfsInOrderRecursion(data, node.left);
     data.add(node.value);
-    if (node.right != null) _dfsInOrderRecursive(data, node.right);
+    if (node.right != null) _dfsInOrderRecursion(data, node.right);
   }
 }