From dd2f6c7d9a5a3447e102f754b3ff1f4b702ee8d8 Mon Sep 17 00:00:00 2001
From: Vladimir Kotal <vlada@kotalovi.cz>
Date: Sun, 19 May 2024 19:58:29 +0200
Subject: [PATCH] fix the example also for the bonus task

---
 modules/home-assignments/dirtree.md | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/modules/home-assignments/dirtree.md b/modules/home-assignments/dirtree.md
index d5b09ba8..94369789 100644
--- a/modules/home-assignments/dirtree.md
+++ b/modules/home-assignments/dirtree.md
@@ -33,7 +33,7 @@ char *paths[] = {
 #solution dirtree.c
 
 Bonus tasks:
-  - Print also non-leaf nodes via depth first, with each node indented based on
+  - Print also non-leaf nodes via depth first traversal, with each node indented based on
     its tree depth.  E.g:
 
 ```
@@ -44,6 +44,7 @@ foo/
 	b.c
 f.txt
 bar/
+	c.c
 ```
 
   - Remove the limitation for the constant number of children.