chore: fix links

Author: nejcm

docs/Algorithms/Overview.mdx

@@ -60,34 +60,34 @@ typically to solve a class of problems or to perform a computation. (Source: Wik
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/breadth-first-search/index.ts)]
 - `B` [Depth first search](/docs/Algorithms/Tree/BFS&DFS)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/depth-first-search/index.ts)]
-- `B` [Is balanced tree](/docs/Algorithms/Tree/IsBalanced)
+- `B` Is balanced tree
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/tree/is-balanced/index.ts)]
-- `B` [Is complete tree](/docs/Algorithms/Tree/IsComplete)
+- `B` Is complete tree
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/tree/is-complete/index.ts)]
-- `B` [Is full tree](/docs/Algorithms/Tree/IsFull)
+- `B` Is full tree
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/tree/is-full/index.ts)]
-- `B` [Is perfect tree](/docs/Algorithms/Tree/IsPerfect)
+- `B` Is perfect tree
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/tree/is-perfect/index.ts)]
 
 **Graph**
 
-- `A` [Articulation points](/docs/Algorithms/Graph/ArticulationPoints)
+- `A` [Articulation points](/docs/Algorithms/Graph/ArticulationPoints.mdx)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/articulation-points/index.ts)]
-- `A` [Bellman-Ford algorithm](/docs/Algorithms/Graph/BellmanFord)
+- `A` [Bellman-Ford algorithm](/docs/Algorithms/Graph/BellmanFord.mdx)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/bellman-ford/index.ts)]
 - `B` [Breadth first search](/docs/Algorithms/Graph/BFS&DFS)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/breadth-first-search/index.ts)]
-- `A` [Bridges](/docs/Algorithms/Graph/Bridges)
+- `A` [Bridges](/docs/Algorithms/Graph/Bridges.mdx)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/bridges/index.ts)]
 - `B` [Depth first search](/docs/Algorithms/Graph/BFS&DFS)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/depth-first-search/index.ts)]
 - `A` [Detect cycle](/docs/Algorithms/Graph/DetectCycle)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/detect-cycle/index.ts)]
-- `A` [Dijkstra algorithm](/docs/Algorithms/Graph/Dijkstra)
+- `A` [Dijkstra algorithm](/docs/Algorithms/Graph/Dijkstra.mdx)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/dijkstra/index.ts)]
-- `A` [Floyd-Warshall algorithm](/docs/Algorithms/Graph/FloydWarshall)
+- `A` [Floyd-Warshall algorithm](/docs/Algorithms/Graph/FloydWarshall.mdx)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/floyd-warshall/index.ts)]
-- `A` [Hamiltonian cycle](/docs/Algorithms/Graph/HamiltonianCycle)
+- `A` [Hamiltonian cycle](/docs/Algorithms/Graph/HamiltonianCycle.mdx)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/hamiltonian-cycle/index.ts)]
 - `B` [Kruskal's algorithm](/docs/Algorithms/Graph/Kruskal)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/kruskal/index.ts)]
@@ -107,33 +107,33 @@ typically to solve a class of problems or to perform a computation. (Source: Wik
   - Branch & Bound
     [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/travelling-salesman/branch&Bound.ts)]
 
-- `A` [A* search algorithm](/docs/Algorithms/Graph/AStar)
+- `A` [A* search algorithm](/docs/Algorithms/Graph/AStar.mdx)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/graph/a-star-search-algorithm/index.ts)]
 
 **Math**
 
-- `B` [Combinations](/docs/Algorithms/Math/Combinations)
+- `B` [Combinations](/docs/Algorithms/Math/Combinations.mdx)
   - With repetitions
     [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/math/combinations/withRepetitions.ts)]
   - Without repetitions
     [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/math/combinations/withoutRepetitions.ts)]
-- `B` [Permutations](/docs/Algorithms/Math/Permutations)
+- `B` [Permutations](/docs/Algorithms/Math/Permutations.mdx)
   - With repetitions
     [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/math/permutations/withRepetitions.ts)]
   - Without repetitions
     [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/math/permutations/withoutRepetitions.ts)]
-- `B` [Factorial](/docs/Algorithms/Math/Factorial)
+- `B` [Factorial](/docs/Algorithms/Math/Factorial.mdx)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/math/factorial/index.ts)]
 
 **Other**
 
-- `A` [Knapsack problem](/docs/Algorithms/Other/KnapsackProblem)
+- `A` [Knapsack problem](/docs/Algorithms/Other/KnapsackProblem.mdx)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/other/knapsack/index.ts)]
-- `B` [Hanoi tower](/docs/Algorithms/Other/HanoiTower)
+- `B` Hanoi tower
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/other/hanoi-tower/index.ts)]
-- `B` [Knight tour](/docs/Algorithms/Other/KnightTour)
+- `B` Knight tour
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/other/knight-tour/index.ts)]
-- `B` [N-queens](/docs/Algorithms/Other/NQueens)
+- `B`N-queens
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/other/n-queens/index.ts)]
-- `B` [Square matrix rotation](/docs/Algorithms/Other/SquareMatrixRotation)
+- `B` Square matrix rotation
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/algorithms/other/square-matrix-rotation/index.ts)]

docs/data-structures/overview.md

@@ -36,7 +36,7 @@ that can be applied to the data. (Source: Wikipedia)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/data-structures/queue/index.ts)]
 - `B` [Stack](./stack)
   [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/data-structures/stack/index.ts)]
-- `A` [Trees](./trees)
+- `A` [Trees](./tree)
   - `A` AVL tree
     [[Code](https://github.com/nejcm/js-algorithms/blob/master/src/data-structures/tree/avl-tree/index.ts)]
   - `A` Binary search tree

docs/installation.md

@@ -20,7 +20,7 @@ yarn start
 
 ## Contributing
 
-Read [CONTRIBUTING.md](../CONTRIBUTING.md) for more info.
+Read CONTRIBUTING.md for more info.
 
 > Submit a [Pull request](https://github.com/nejcm/js-algorithms/pulls) to include your algorithm.