diff --git a/CHANGELOG.md b/CHANGELOG.md
index 95752ca3..cf7ecb87 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -6,6 +6,10 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 ## [Unreleased]
 
+## [0.19.3] - 2024-07-09
+### Fixed:
+- Docs: Update links in README and rtd docs.
+
 ## [0.19.2] - 2024-06-28
 ### Added:
 - Docs: Add description and credits to playground.
@@ -611,7 +615,8 @@ ignore null attribute columns.
 - Utility Iterator: Tree traversal methods.
 - Workflow To Do App: Tree use case with to-do list implementation.
 
-[Unreleased]: https://github.com/kayjan/bigtree/compare/0.19.2...HEAD
+[Unreleased]: https://github.com/kayjan/bigtree/compare/0.19.3...HEAD
+[0.19.3]: https://github.com/kayjan/bigtree/compare/0.19.2...0.19.3
 [0.19.2]: https://github.com/kayjan/bigtree/compare/0.19.1...0.19.2
 [0.19.1]: https://github.com/kayjan/bigtree/compare/0.19.0...0.19.1
 [0.19.0]: https://github.com/kayjan/bigtree/compare/0.18.3...0.19.0
diff --git a/README.md b/README.md
index 341ead1a..7b2c1407 100644
--- a/README.md
+++ b/README.md
@@ -29,7 +29,7 @@ There are 3 segments to Big Tree consisting of Tree, Binary Tree, and Directed A
 
 For **Tree** implementation, there are 9 main components.
 
-1. [**🌺 Node**](https://bigtree.readthedocs.io/en/stable/bigtree/node/)
+1. [**🌺 Node**](https://bigtree.readthedocs.io/en/stable/bigtree/node/node)
    1. ``BaseNode``, extendable class
    2. ``Node``, BaseNode with node name attribute
 2. [**✨ Constructing Tree**](https://bigtree.readthedocs.io/en/stable/bigtree/tree/construct/)
@@ -73,7 +73,7 @@ For **Tree** implementation, there are 9 main components.
    3. Export tree to *dot* (can save to .dot, .png, .svg, .jpeg files)
    4. Export tree to *Pillow* (can save to .png, .jpg)
    5. Export tree to *Mermaid Flowchart* (can display on .md)
-9. [**✔️ Workflows**](https://bigtree.readthedocs.io/en/stable/demo/workflow/)
+9. [**✔️ Workflows**](https://bigtree.readthedocs.io/en/stable/bigtree/workflows/app_todo)
    1. Sample workflows for tree demonstration!
 
 --------
@@ -81,7 +81,7 @@ For **Tree** implementation, there are 9 main components.
 For **Binary Tree** implementation, there are 3 main components.
 Binary Node inherits from Node, so the components in Tree implementation are also available in Binary Tree.
 
-1. [**🌿 Node**](https://bigtree.readthedocs.io/en/stable/bigtree/node/)
+1. [**🌿 Node**](https://bigtree.readthedocs.io/en/stable/bigtree/node/binarynode)
    1. ``BinaryNode``, Node with binary tree rules
 2. [**✨ Constructing Binary Tree**](https://bigtree.readthedocs.io/en/stable/bigtree/binarytree/construct/)
    1. From *list*, using flattened list structure
@@ -92,7 +92,7 @@ Binary Node inherits from Node, so the components in Tree implementation are als
 
 For **Directed Acyclic Graph (DAG)** implementation, there are 4 main components.
 
-1. [**🌼 Node**](https://bigtree.readthedocs.io/en/stable/bigtree/node/)
+1. [**🌼 Node**](https://bigtree.readthedocs.io/en/stable/bigtree/node/dagnode)
    1. ``DAGNode``, extendable class for constructing Directed Acyclic Graph (DAG)
 2. [**✨ Constructing DAG**](https://bigtree.readthedocs.io/en/stable/bigtree/dag/construct/)
    1. From *list*, containing parent-child tuples
diff --git a/bigtree/__init__.py b/bigtree/__init__.py
index 60b32255..604df293 100644
--- a/bigtree/__init__.py
+++ b/bigtree/__init__.py
@@ -1,4 +1,4 @@
-__version__ = "0.19.2"
+__version__ = "0.19.3"
 
 from bigtree.binarytree.construct import list_to_binarytree
 from bigtree.dag.construct import dataframe_to_dag, dict_to_dag, list_to_dag
diff --git a/docs/home/binarytree.md b/docs/home/binarytree.md
index 40db4c28..2a020e4a 100644
--- a/docs/home/binarytree.md
+++ b/docs/home/binarytree.md
@@ -7,7 +7,7 @@ title: Binary Tree
 For **Binary Tree** implementation, there are 3 main components.
 Binary Node inherits from Node, so the components in Tree implementation are also available in Binary Tree.
 
-## [**🌿 Node**](../bigtree/node/index.md)
+## [**🌿 Node**](../bigtree/node/binarynode.md)
 - ``BinaryNode``, Node with binary tree rules
 
 ## [**✨ Constructing Binary Tree**](../bigtree/binarytree/construct.md)
diff --git a/docs/home/dag.md b/docs/home/dag.md
index f1a30f43..04d86dec 100644
--- a/docs/home/dag.md
+++ b/docs/home/dag.md
@@ -6,7 +6,7 @@ title: Directed Acyclic Graph (DAG)
 
 For **Directed Acyclic Graph (DAG)** implementation, there are 4 main components.
 
-## [**🌼 Node**](../bigtree/node/index.md)
+## [**🌼 Node**](../bigtree/node/dagnode.md)
 - ``DAGNode``, extendable class for constructing Directed Acyclic Graph (DAG)
 
 ## [**✨ Constructing DAG**](../bigtree/dag/construct.md)
diff --git a/docs/home/tree.md b/docs/home/tree.md
index 40a8d32f..53ba308e 100644
--- a/docs/home/tree.md
+++ b/docs/home/tree.md
@@ -6,7 +6,7 @@ title: Tree
 
 For **Tree** implementation, there are 9 main components.
 
-## [**🌺 Node**](../bigtree/node/index.md)
+## [**🌺 Node**](../bigtree/node/node.md)
 - ``BaseNode``, extendable class
 - ``Node``, BaseNode with node name attribute
 
@@ -58,5 +58,5 @@ For **Tree** implementation, there are 9 main components.
 - Export tree to *Pillow* (can save to .png, .jpg)
 - Export tree to *Mermaid Flowchart* (can display on .md)
 
-## [**✔️ Workflows**](../bigtree/workflows/index.md)
+## [**✔️ Workflows**](../bigtree/workflows/app_todo.md)
 - Sample workflows for tree demonstration!