updating tree_traversal.md

Author: Gathros

chapters/tree_traversal/tree_traversal.md

@@ -10,7 +10,7 @@ Trees are naturally recursive data structures, and because of this, we cannot ac
 {% sample lang="cs" %}
 [import:11-15, lang:"csharp"](code/cs/TreeMdAdditional/TreeMdAdditional.cs)
 {% sample lang="c" %}
-[import:5-9, lang:"c_cpp"](code/c/tree_traversal.c)
+[import:7-11, lang:"c_cpp"](code/c/tree_traversal.c)
 {% sample lang="js" %}
 This has not been implemented in your chosen language, so here is the Julia code
 [import:3-7, lang:"julia"](code/julia/Tree.jl)
@@ -35,7 +35,7 @@ Because of this, the most straightforward way to traverse the tree might be recu
 {% sample lang="cs" %}
 [import:48-57, lang:"csharp"](code/cs/TreeMdAdditional/TreeMdAdditional.cs)
 {% sample lang="c" %}
-[import:78-87, lang:"c_cpp"](code/c/tree_traversal.c)
+[import:37-45, lang:"c_cpp"](code/c/tree_traversal.c)
 {% sample lang="js" %}
 [import:15-23, lang:"javascript"](code/javascript/Tree_example.js)
 {% sample lang="py2" %}
@@ -70,7 +70,7 @@ This has not been implemented in your chosen language, so here is the Julia code
 {% sample lang="cs" %}
 [import:75-84, lang:"csharp"](code/cs/TreeMdAdditional/TreeMdAdditional.cs)
 {% sample lang="c" %}
-[import:89-95, lang:"c_cpp"](code/c/tree_traversal.c)
+[import:47-53, lang:"c_cpp"](code/c/tree_traversal.c)
 {% sample lang="js" %}
 This has not been implemented in your chosen language, so here is the Julia code
 [import:18-26, lang:"julia"](code/julia/Tree.jl)
@@ -103,7 +103,7 @@ This has not been implemented in your chosen language, so here is the Julia code
 {% sample lang="cs" %}
 [import:86-104, lang:"csharp"](code/cs/TreeMdAdditional/TreeMdAdditional.cs)
 {% sample lang="c" %}
-[import:97-110, lang:"c_cpp"](code/c/tree_traversal.c)
+[import:55-73, lang:"c_cpp"](code/c/tree_traversal.c)
 {% sample lang="js" %}
 This has not been implemented in your chosen language, so here is the Julia code
 [import:28-43, lang:"julia"](code/julia/Tree.jl)
@@ -145,9 +145,7 @@ In code, it looks like this:
 {% sample lang="cs" %}
 [import:36-52, lang:"csharp"](code/cs/Tree/Tree.cs)
 {% sample lang="c" %}
-[import:20-33, lang:"c_cpp"](code/c/tree_traversal.c)
-[import:35-47, lang:"c_cpp"](code/c/tree_traversal.c)
-[import:112-130, lang:"c_cpp"](code/c/tree_traversal.c)
+[import:75-93, lang:"c_cpp"](code/c/tree_traversal.c)
 {% sample lang="js" %}
 [import:25-40, lang:"javascript"](code/javascript/Tree_example.js)
 {% sample lang="py2" %}
@@ -177,7 +175,7 @@ And this is exactly what Breadth-First Search (BFS) does! On top of that, it can
 {% sample lang="cs" %}
 [import:54-70, lang:"csharp"](code/cs/Tree/Tree.cs)
 {% sample lang="c" %}
-[import:132-150, lang:"c_cpp"](code/c/tree_traversal.c)
+[import:95-113, lang:"c_cpp"](code/c/tree_traversal.c)
 {% sample lang="js" %}
 [import:42-57, lang:"javascript"](code/javascript/Tree_example.js)
 {% sample lang="py2" %}
@@ -207,6 +205,9 @@ Program.cs
 [import, lang:"csharp"](code/cs/Tree/Program.cs)
 {% sample lang="c" %}
 ### C
+utility.h
+[import, lang:"c_cpp"](code/c/utility.h)
+tree_traversal.c
 [import, lang:"c_cpp"](code/c/tree_traversal.c)
 {% sample lang="js" %}
 ### JavaScript