adding a new section for fundamental algorithms and including the chapter for tree traversal.

Author: leios

SUMMARY.md

@@ -11,6 +11,8 @@
     * [Code Quality](chapters/principles_of_code/code_quality.md)
 * [Mathematical Background](chapters/mathematical_background/mathematical_background.md)
     * [Taylor Series](chapters/mathematical_background/taylor_series.md)
+* [Fundamental Algorithms](chapters/fundamental_algorithms/fundamental_algorithms.md)
+    * [Tree Traversal](chapters/fundamental_algorithms/tree_traversal.md)
 * [Computational Mathematics](chapters/computational_mathematics/computational_mathematics.md)
     * [Matrix Methods](chapters/computational_mathematics/matrix_methods/matrix_methods.md)
         * [Gaussian Elimination](chapters/computational_mathematics/matrix_methods/gaussian_elimination.md)

chapters/fundamental_algorithms/fundamental_algorithms.md

@@ -0,0 +1,5 @@
+# Computational Mathematics
+
+Algorithms are a set of techniques programmers use to attack whatever challenge they are faced with. Each one is a tool meant to be used for a specific purpose and to solve a subset of problems. As the field of computer science has grown, certain algorithms that were once ground-breaking in their own right have become fundamental features of other, more complex algorithms. Even so, these algorithms should not be taken lightly. "Fundamental" does not mean "straightforward." Especially for new programmers, some of these algorithms might be significantly callenging to understand and use, but that's part of the beauty of programming! The more you learn, the better programmer you become and what once might taken hours (or even days) to understand becomes a straightforward exercise done without a second-thought.
+
+All algorithms in this section are used later in the archive for more complex algorithms; however, some of those later chapters may not be written yet, so if you have an algorithm you want to cover, let me know! 

chapters/fundamental_algorithms/tree_traversal.md

@@ -0,0 +1,26 @@
+<script>
+MathJax.Hub.Queue(["Typeset",MathJax.Hub]);
+</script>
+$$ 
+\newcommand{\d}{\mathrm{d}}
+\newcommand{\bff}{\boldsymbol{f}}
+\newcommand{\bfg}{\boldsymbol{g}}
+\newcommand{\bfp}{\boldsymbol{p}}
+\newcommand{\bfq}{\boldsymbol{q}}
+\newcommand{\bfx}{\boldsymbol{x}}
+\newcommand{\bfu}{\boldsymbol{u}}
+\newcommand{\bfv}{\boldsymbol{v}}
+\newcommand{\bfA}{\boldsymbol{A}}
+\newcommand{\bfB}{\boldsymbol{B}}
+\newcommand{\bfC}{\boldsymbol{C}}
+\newcommand{\bfM}{\boldsymbol{M}}
+\newcommand{\bfJ}{\boldsymbol{J}}
+\newcommand{\bfR}{\boldsymbol{R}}
+\newcommand{\bfT}{\boldsymbol{T}}
+\newcommand{\bfomega}{\boldsymbol{\omega}}
+\newcommand{\bftau}{\boldsymbol{\tau}}
+$$
+
+# Tree Traversal 
+
+COMING SOON!