fixed index out of range issue

Author: henrikac

contents/tree_traversal/code/csharp/Tree.cs

@@ -11,23 +11,23 @@ public class Tree
 
         public Tree(int depthCount, int childrenCount)
         {
-            this.Id = 1;
+            Id = 1;
 
             if (!(depthCount <= 1))
             {
                 for (int i = 0; i < childrenCount; i++)
-                    this._children.Add(new Tree(this.Id * 10 + i + 1, depthCount - 1, childrenCount));
+                    _children.Add(new Tree(Id * 10 + i + 1, depthCount - 1, childrenCount));
             }
         }
 
         private Tree(int id, int depthCount, int childrenCount)
         {
-            this.Id = id;
+            Id = id;
 
             if (!(depthCount <= 1))
             {
                 for (int i = 0; i < childrenCount; i++)
-                    this._children.Add(new Tree(this.Id * 10 + i + 1, depthCount - 1, childrenCount));
+                    _children.Add(new Tree(Id * 10 + i + 1, depthCount - 1, childrenCount));
             }
         }
 
@@ -61,20 +61,25 @@ public void DFSRecursiveInorderBinary()
         {
             DFSRecursiveInorderBinary(this);
 
-            // This assumes only 2 children
             void DFSRecursiveInorderBinary(Tree tree)
             {
-                if (tree._children.Count > 2)
-                    throw new Exception("Not binary tree!");
-
-                if (tree._children.Count > 0)
+                switch (tree._children.Count)
                 {
-                    DFSRecursiveInorderBinary(tree._children[0]);
-                    Console.WriteLine(tree.Id);
-                    DFSRecursiveInorderBinary(tree._children[1]);
+                    case 2:
+                        DFSRecursiveInorderBinary(tree._children[0]);
+                        Console.WriteLine(tree.Id);
+                        DFSRecursiveInorderBinary(tree._children[1]);
+                        break;
+                    case 1:
+                        DFSRecursiveInorderBinary(tree._children[0]);
+                        Console.WriteLine(tree.Id);
+                        break;
+                    case 0:
+                        Console.WriteLine(tree.Id);
+                        break;
+                    default:
+                        throw new Exception("Not binary tree!");
                 }
-                else
-                    Console.WriteLine(tree.Id);
             }
         }
 

contents/tree_traversal/tree_traversal.md

@@ -157,7 +157,7 @@ In this case, the first node visited is at the bottom of the tree and moves up t
 {% sample lang="cpp" %}
 [import:34-52 lang:"cpp"](code/c++/tree_example.cpp)
 {% sample lang="cs" %}
-[import:60-79, lang:"csharp"](code/csharp/Tree.cs)
+[import:60-84, lang:"csharp"](code/csharp/Tree.cs)
 {% sample lang="c" %}
 [import:55-73, lang:"c"](code/c/tree_traversal.c)
 {% sample lang="java" %}
@@ -215,7 +215,7 @@ In code, it looks like this:
 {% sample lang="cpp" %}
 [import:55-70, lang:"cpp"](code/c++/tree_example.cpp)
 {% sample lang="cs" %}
-[import:81-94, lang:"csharp"](code/csharp/Tree.cs)
+[import:86-99, lang:"csharp"](code/csharp/Tree.cs)
 {% sample lang="c" %}
 [import:75-93, lang:"c"](code/c/tree_traversal.c)
 {% sample lang="java" %}
@@ -266,7 +266,7 @@ And this is exactly what Breadth-First Search (BFS) does! On top of that, it can
 {% sample lang="cpp" %}
 [import:73-86, lang:"cpp"](code/c++/tree_example.cpp)
 {% sample lang="cs" %}
-[import:96-109, lang:"csharp"](code/csharp/Tree.cs)
+[import:101-114, lang:"csharp"](code/csharp/Tree.cs)
 {% sample lang="c" %}
 [import:95-113, lang:"c"](code/c/tree_traversal.c)
 {% sample lang="java" %}