fix paths

Author: shkvik

src/bst/problems/bfs-all-paths.task.ts

@@ -1,4 +1,4 @@
-import { Graph } from "src/graph";
+import { Graph } from "src/graph/utilities";
 
 export function bfsAllPaths(graph: Graph, start: string, end: string): string[][] {
   const paths: string[][] = [];

src/bst/problems/bst-max-path-sum.ts

@@ -1,5 +1,5 @@
-import { printTree } from "..";
-import { TreeNode } from "../bst.structure";
+import { printTree, TreeNode } from "../utilities";
+
 
 function maxPathSum(root: TreeNode | null): number {
   let maxSum = -Infinity;

src/bst/problems/bst-side-view.ts

@@ -1,5 +1,4 @@
-import { TreeNode } from "../bst.structure";
-import { printTree } from "../bst.utilities";
+import { printTree, TreeNode } from "../utilities";
 
 function rightSideView(root: TreeNode | null): number[] {
   const result: number[] = [];

src/bst/problems/delete.ts

@@ -1,5 +1,4 @@
-import { TreeNode } from "../bst.structure";
-import { printTree } from "../bst.utilities";
+import { printTree, TreeNode } from "../utilities";
 
 function deleteNode(root: TreeNode | null, key: number): TreeNode | null {
   if (!root) {

src/bst/problems/duplicates-subtrees.ts

@@ -1,5 +1,4 @@
-import { TreeNode } from "../bst.structure";
-import { printTree } from "../bst.utilities";
+import { printTree, TreeNode } from "../utilities";
 
 function findDuplicateSubtrees(root: TreeNode | null): TreeNode[] {
   const map = new Map<string, number>();

src/bst/problems/find-min.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from "../bst.structure";
+import { TreeNode } from "../utilities";
 
 function findMin(root: TreeNode | null): number | null {
   if (!root) {

src/bst/problems/insert.ts

@@ -1,5 +1,4 @@
-import { TreeNode } from "../bst.structure";
-import { printTree } from "../bst.utilities";
+import { printTree, TreeNode } from "../utilities";
 
 function insertIntoBST(root: TreeNode | null, val: number): TreeNode | null {
   if (!root) {

src/bst/problems/is-balanced.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from "../bst.structure";
+import { printTree, TreeNode } from "../utilities";
 
 function isBalanced(root: TreeNode | null): boolean {
   function checkBalance(node: TreeNode | null): number {

src/bst/problems/is-symmetric.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from "../bst.structure";
+import { printTree, TreeNode } from "../utilities";
 
 function isSymmetric(root: TreeNode | null): boolean {
   if (!root) return true;

src/bst/problems/is-valid-bst.ts

@@ -1,5 +1,4 @@
-import { TreeNode } from "../bst.structure";
-import { printTree } from "../bst.utilities";
+import { printTree, TreeNode } from "../utilities";
 
 function isValidBST(root: TreeNode | null, min?: number, max?: number): boolean {
   const currentVal = root?.val;

src/bst/problems/lowest-common-ancestor.ts

@@ -1,5 +1,4 @@
-import { printTree } from "..";
-import { TreeNode } from "../bst.structure";
+import { printTree, TreeNode } from "../utilities";
 
 function lowestCommonAncestor(root: TreeNode | null, p: TreeNode | null, q: TreeNode | null): TreeNode | null {
   if (root === null || root === p || root === q) {

src/bst/problems/max-depth.ts

@@ -1,5 +1,4 @@
-import { printTree } from "..";
-import { TreeNode } from "../bst.structure";
+import { printTree, TreeNode } from "../utilities";
 
 export namespace Recursion {
   function maxDepth(root: TreeNode | null): number {

src/bst/problems/serialize-and-deserialize.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from "../bst.structure";
+import { printTree, TreeNode } from "../utilities";
 
 function serialize(root: TreeNode): string {
   const preorderSerialize = (node: TreeNode) => {

src/bst/bst.structure.ts renamed to src/bst/utilities/bst.structure.ts

@@ -9,20 +9,13 @@ function _printTree(
   hasLeftSibling: boolean = false
 ): void {
   if (node === null) return;
-
-  // Определяем текущий префикс для текущего узла
   const currentPrefix = prefix + (isRight ? (hasLeftSibling ? "├── " : "└── ") : hasLeftSibling == isRight ?  "└── ": "├── ");
   console.log(currentPrefix + node.val);
-
-  // Формируем префикс для потомков
   const childPrefix = prefix + (hasLeftSibling ? "│   " : "    ");
-
   if (node.left || node.right) {
-    // Сначала обрабатываем правый узел, чтобы он был сверху
     if (node.right) {
       _printTree(node.right, childPrefix, true, node.left !== null);
     }
-    // Затем обрабатываем левый узел, чтобы он был внизу
     if (node.left) {
       _printTree(node.left, childPrefix, false, false);
     }
@@ -40,7 +33,6 @@ export function printTree(node: TreeNode): void {
     if (node.right) {
       _printTree(node.right, childPrefix, true, node.left !== null);
     }
-    // Затем обрабатываем левый узел, чтобы он был ниже
     if (node.left) {
       _printTree(node.left, childPrefix, false, false);
     }