diff --git a/docs/sql/query_syntax/with.md b/docs/sql/query_syntax/with.md
index 45c5e7172f6..bce8e392be4 100644
--- a/docs/sql/query_syntax/with.md
+++ b/docs/sql/query_syntax/with.md
@@ -41,7 +41,7 @@ SELECT * FROM cte2;
 
 `WITH RECURSIVE` can be used to traverse trees. For example, take a hierarchy of tags:
 
-![](with-recursive-tree-example.png)
+![](/images/examples/with-recursive-tree-example.png)
 
 ```sql
 CREATE TABLE tag(id int, name varchar, subclassof int);
@@ -88,7 +88,7 @@ One way to achieve this is to store the path of a traversal in a [list](../../sq
 
 Take the following directed graph from the [LDBC Graphalytics benchmark](https://arxiv.org/pdf/2011.15028.pdf):
 
-![](with-recursive-graph-example.png)
+![](/images/examples/with-recursive-graph-example.png)
 
 ```sql
 CREATE TABLE edge(node1id int, node2id int);
diff --git a/docs/sql/query_syntax/with-recursive-graph-example.png b/images/examples/with-recursive-graph-example.png
similarity index 100%
rename from docs/sql/query_syntax/with-recursive-graph-example.png
rename to images/examples/with-recursive-graph-example.png
diff --git a/docs/sql/query_syntax/with-recursive-tree-example.png b/images/examples/with-recursive-tree-example.png
similarity index 100%
rename from docs/sql/query_syntax/with-recursive-tree-example.png
rename to images/examples/with-recursive-tree-example.png