Documentation for 296f3d00d0

2020-07-22 12:41:17 +00:00 · 2020-07-22 12:41:17 +00:00 · d4d69d989a
parent 64b8de4c4b
commit d4d69d989a
320 changed files with 2010 additions and 794 deletions
--- a/annotated.html
+++ b/annotated.html
@ -116,7 +116,7 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
 <tr id="row_17_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d8a/structmax__heap.html" target="_self">max_heap</a></td><td class="desc"></td></tr>
 <tr id="row_18_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/dce/structmin__heap.html" target="_self">min_heap</a></td><td class="desc"></td></tr>
 <tr id="row_19_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"><a class="el" href="db/d8b/struct_node.html" title="Node, the basic data structure of the tree.">Node</a>, the basic data structure of the tree </td></tr>
-<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc">Kyler Smith, 2017 <a class="el" href="dd/d10/struct_stack.html">Stack</a> data structure implementation </td></tr>
+<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"><a class="el" href="db/d8b/struct_node.html" title="Node, the basic data structure of the tree.">Node</a>, the basic data structure in the tree </td></tr>
 <tr id="row_21_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d43/structpid.html" target="_self">pid</a></td><td class="desc">PID Controller </td></tr>
 <tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d36/structqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
 <tr id="row_23_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d10/struct_queue_rep.html" target="_self">QueueRep</a></td><td class="desc"></td></tr>
--- a/d0/d04/qr__decompose_8h__incl.svg
+++ b/d0/d04/qr__decompose_8h__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: numerical_methods/qr_decompose.h Pages: 1 -->
 <svg width="186pt" height="95pt"
--- a/d0/d1f/structnodecollgraph.map
+++ b/d0/d1f/structnodecollgraph.map
@ -1,3 +1,3 @@
 <map id="node" name="node">
-<area shape="rect" id="node1" title="Kyler Smith, 2017 Stack data structure implementation." alt="" coords="5,51,56,77"/>
+<area shape="rect" id="node1" title="Node, the basic data structure in the tree." alt="" coords="5,51,56,77"/>
 </map>
--- a/d0/d1f/structnodecollgraph.md5
+++ b/d0/d1f/structnodecollgraph.md5
@ -1 +1 @@
-043576a4dcc74ad8f1be870cb495956f
+21a53e6fa8de46465f347924b7a45b32
--- a/d0/d1f/structnodecollgraph.svg
+++ b/d0/d1f/structnodecollgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: node Pages: 1 -->
 <svg width="107pt" height="96pt"
@ -12,7 +12,7 @@
 <!-- Node1 -->
 <g id="node1" class="node">
 <title>Node1</title>
-<g id="a_node1"><a xlink:title="Kyler Smith, 2017 Stack data structure implementation.">
+<g id="a_node1"><a xlink:title="Node, the basic data structure in the tree.">
 <polygon fill="#bfbfbf" stroke="black" points="0,-34.5 0,-53.5 38,-53.5 38,-34.5 0,-34.5"/>
 <text text-anchor="middle" x="19" y="-41.5" font-family="Helvetica,sans-Serif" font-size="10.00">node</text>
 </a>
--- a/d0/d3d/problem__8_2sol2_8c__incl.svg
+++ b/d0/d3d/problem__8_2sol2_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_8/sol2.c Pages: 1 -->
 <svg width="188pt" height="95pt"
--- a/d0/d46/kohonensomtrace_8c_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ b/d0/d46/kohonensomtrace_8c_a0283886819c7c140a023582b7269e2d0_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test2 Pages: 1 -->
 <svg width="497pt" height="142pt"
--- a/d0/d46/kohonensomtrace_8c_a107f00650b8041f77767927073ddddb8_cgraph.svg
+++ b/d0/d46/kohonensomtrace_8c_a107f00650b8041f77767927073ddddb8_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test_circle Pages: 1 -->
 <svg width="160pt" height="28pt"
--- a/d0/d46/kohonensomtrace_8c_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
+++ b/d0/d46/kohonensomtrace_8c_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test1 Pages: 1 -->
 <svg width="497pt" height="142pt"
--- a/d0/d46/kohonensomtrace_8c_a41ae16442e3e5b891a58d2e5932a2cd0_cgraph.svg
+++ b/d0/d46/kohonensomtrace_8c_a41ae16442e3e5b891a58d2e5932a2cd0_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test_3d_classes Pages: 1 -->
 <svg width="186pt" height="28pt"
--- a/d0/d46/kohonensomtrace_8c_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
+++ b/d0/d46/kohonensomtrace_8c_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test3 Pages: 1 -->
 <svg width="497pt" height="142pt"
--- a/d0/d46/kohonensomtrace_8c_aa2246f940155472084ee461f3685d614_cgraph.svg
+++ b/d0/d46/kohonensomtrace_8c_aa2246f940155472084ee461f3685d614_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test_lamniscate Pages: 1 -->
 <svg width="184pt" height="28pt"
--- a/d0/d59/problem__9_2sol2_8c__incl.svg
+++ b/d0/d59/problem__9_2sol2_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_9/sol2.c Pages: 1 -->
 <svg width="120pt" height="95pt"
--- a/d0/d91/binary__search_8c__incl.svg
+++ b/d0/d91/binary__search_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: searching/binary_search.c Pages: 1 -->
 <svg width="139pt" height="84pt"
--- a/d0/d99/catoistrtointeger_8c__incl.svg
+++ b/d0/d99/catoistrtointeger_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: conversions/c_atoi_str_to_integer.c Pages: 1 -->
 <svg width="258pt" height="95pt"
--- a/d0/db8/collatz_8c__incl.svg
+++ b/d0/db8/collatz_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: misc/collatz.c Pages: 1 -->
 <svg width="120pt" height="84pt"
--- a/d0/dcb/groupkohonen1d.svg
+++ b/d0/dcb/groupkohonen1d.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: Kohonen SOM trace/chain algorithm Pages: 1 -->
 <svg width="313pt" height="38pt"
--- a/d0/dcb/groupkohonen1d_gae334493a0917a24736fe5ba82aa6f81f_cgraph.svg
+++ b/d0/dcb/groupkohonen1d_gae334493a0917a24736fe5ba82aa6f81f_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: kohonen_update_weights Pages: 1 -->
 <svg width="280pt" height="28pt"
--- a/d0/dcb/groupkohonen1d_gaeaeffbff2be4d5d15b0d4f10f846abde_cgraph.svg
+++ b/d0/dcb/groupkohonen1d_gaeaeffbff2be4d5d15b0d4f10f846abde_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: kohonen_som_tracer Pages: 1 -->
 <svg width="423pt" height="28pt"
--- a/d0/df1/threadedbinarytrees_8c__incl.svg
+++ b/d0/df1/threadedbinarytrees_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: data_structures/binary_trees/threaded_binary_trees.c Pages: 1 -->
 <svg width="124pt" height="106pt"
--- a/d1/d07/sol4_8c__incl.svg
+++ b/d1/d07/sol4_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_1/sol4.c Pages: 1 -->
 <svg width="118pt" height="95pt"
--- a/d1/d10/structelemcollgraph.svg
+++ b/d1/d10/structelemcollgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: elem Pages: 1 -->
 <svg width="86pt" height="28pt"
--- a/d1/d6b/groupkohonen2d.svg
+++ b/d1/d6b/groupkohonen2d.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: Kohonen SOM topology algorithm Pages: 1 -->
 <svg width="302pt" height="38pt"
--- a/d1/d6b/groupkohonen2d_ga49d35f68f5d11d8ef6f8cce0d0e7bcba_cgraph.svg
+++ b/d1/d6b/groupkohonen2d_ga49d35f68f5d11d8ef6f8cce0d0e7bcba_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: save_u_matrix Pages: 1 -->
 <svg width="217pt" height="28pt"
--- a/d1/d6b/groupkohonen2d_ga83abb572c60d202e100595a989dfe123_cgraph.svg
+++ b/d1/d6b/groupkohonen2d_ga83abb572c60d202e100595a989dfe123_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: kohonen_update_weights Pages: 1 -->
 <svg width="264pt" height="66pt"
--- a/d1/d6b/groupkohonen2d_gacb42eda8af6ebd6a141a34ab00a0b710_cgraph.svg
+++ b/d1/d6b/groupkohonen2d_gacb42eda8af6ebd6a141a34ab00a0b710_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: kohonen_som Pages: 1 -->
 <svg width="377pt" height="66pt"
--- a/d1/d6c/odeforwardeuler_8c__incl.svg
+++ b/d1/d6c/odeforwardeuler_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: numerical_methods/ode_forward_euler.c Pages: 1 -->
 <svg width="248pt" height="95pt"
--- a/d1/d8d/struct_a_v_lnodecollgraph.svg
+++ b/d1/d8d/struct_a_v_lnodecollgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: AVLnode Pages: 1 -->
 <svg width="103pt" height="30pt"
--- a/d1/dc2/odemidpointeuler_8c_a148003d8b261d040c1c41e73b40af1dd_cgraph.svg
+++ b/d1/dc2/odemidpointeuler_8c_a148003d8b261d040c1c41e73b40af1dd_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: midpoint_euler Pages: 1 -->
 <svg width="315pt" height="28pt"
--- a/d1/dc2/odemidpointeuler_8c_affe6cc2ab040b94a29e6c41782f72d51_cgraph.svg
+++ b/d1/dc2/odemidpointeuler_8c_affe6cc2ab040b94a29e6c41782f72d51_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: midpoint_euler_step Pages: 1 -->
 <svg width="199pt" height="28pt"
--- a/d1/dd3/problem__401_2sol1_8c__incl.svg
+++ b/d1/dd3/problem__401_2sol1_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_401/sol1.c Pages: 1 -->
 <svg width="327pt" height="95pt"
--- a/d1/df8/merge__sort_8c__incl.svg
+++ b/d1/df8/merge__sort_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: sorting/merge_sort.c Pages: 1 -->
 <svg width="120pt" height="84pt"
--- a/d2/d97/palindrome_8c__incl.svg
+++ b/d2/d97/palindrome_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: misc/palindrome.c Pages: 1 -->
 <svg width="198pt" height="84pt"
--- a/d2/dd8/problem__3_2sol1_8c__incl.svg
+++ b/d2/dd8/problem__3_2sol1_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_3/sol1.c Pages: 1 -->
 <svg width="120pt" height="95pt"
--- a/d2/ddf/struct_lcollgraph.svg
+++ b/d2/ddf/struct_lcollgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: L Pages: 1 -->
 <svg width="77pt" height="28pt"
--- a/d2/de9/realtime__stats_8c__incl.svg
+++ b/d2/de9/realtime__stats_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: numerical_methods/realtime_stats.c Pages: 1 -->
 <svg width="190pt" height="95pt"
--- a/d2/df6/kohonensomtopology_8c_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ b/d2/df6/kohonensomtopology_8c_a0283886819c7c140a023582b7269e2d0_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test2 Pages: 1 -->
 <svg width="467pt" height="204pt"
--- a/d2/df6/kohonensomtopology_8c_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
+++ b/d2/df6/kohonensomtopology_8c_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test1 Pages: 1 -->
 <svg width="462pt" height="204pt"
--- a/d2/df6/kohonensomtopology_8c_a5bb02a8322d717ead1b11182c5f02a3a_cgraph.svg
+++ b/d2/df6/kohonensomtopology_8c_a5bb02a8322d717ead1b11182c5f02a3a_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test_3d_classes2 Pages: 1 -->
 <svg width="191pt" height="28pt"
--- a/d2/df6/kohonensomtopology_8c_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
+++ b/d2/df6/kohonensomtopology_8c_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test3 Pages: 1 -->
 <svg width="467pt" height="204pt"
--- a/d2/df6/kohonensomtopology_8c_ad9e25202bb8b481461f932668f249dbc_cgraph.svg
+++ b/d2/df6/kohonensomtopology_8c_ad9e25202bb8b481461f932668f249dbc_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test_3d_classes1 Pages: 1 -->
 <svg width="191pt" height="28pt"
--- a/d2/df6/kohonensomtopology_8c_adb5ded007be1fd666fab9affe6764018_cgraph.svg
+++ b/d2/df6/kohonensomtopology_8c_adb5ded007be1fd666fab9affe6764018_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test_2d_classes Pages: 1 -->
 <svg width="186pt" height="28pt"
--- a/d3/d01/problem__21_2sol1_8c__incl.svg
+++ b/d3/d01/problem__21_2sol1_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_21/sol1.c Pages: 1 -->
 <svg width="182pt" height="95pt"
--- a/d3/d21/sol3_8c__incl.svg
+++ b/d3/d21/sol3_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_1/sol3.c Pages: 1 -->
 <svg width="118pt" height="95pt"
--- a/d3/d47/modifiedbinarysearch_8c_a7df9a198e30cded6229d79bef7591f8f_cgraph.svg
+++ b/d3/d47/modifiedbinarysearch_8c_a7df9a198e30cded6229d79bef7591f8f_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: modifiedBinarySearch Pages: 1 -->
 <svg width="230pt" height="28pt"
--- a/d3/d60/union__find_8c__incl.svg
+++ b/d3/d60/union__find_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: misc/union_find.c Pages: 1 -->
 <svg width="120pt" height="84pt"
--- a/d3/d61/problem__1_2sol1_8c__incl.svg
+++ b/d3/d61/problem__1_2sol1_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_1/sol1.c Pages: 1 -->
 <svg width="118pt" height="95pt"
--- a/d3/da9/problem__5_2sol_8c__incl.svg
+++ b/d3/da9/problem__5_2sol_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_5/sol.c Pages: 1 -->
 <svg width="118pt" height="95pt"
--- a/d3/ddb/bead__sort_8c__incl.svg
+++ b/d3/ddb/bead__sort_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: sorting/bead_sort.c Pages: 1 -->
 <svg width="120pt" height="84pt"
--- a/d4/d07/odeforwardeuler_8c_aaf88ad8f9f7c39fc38f3f03d6fea9df9_cgraph.svg
+++ b/d4/d07/odeforwardeuler_8c_aaf88ad8f9f7c39fc38f3f03d6fea9df9_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: forward_euler Pages: 1 -->
 <svg width="305pt" height="28pt"
--- a/d4/d07/odeforwardeuler_8c_ae6c9413953c8d9d4bc9e374b29586350_cgraph.svg
+++ b/d4/d07/odeforwardeuler_8c_ae6c9413953c8d9d4bc9e374b29586350_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: forward_euler_step Pages: 1 -->
 <svg width="194pt" height="28pt"
--- a/d4/d15/qreigenvalues_8c__incl.svg
+++ b/d4/d15/qreigenvalues_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: numerical_methods/qr_eigen_values.c Pages: 1 -->
 <svg width="344pt" height="151pt"
--- a/d4/d22/struct_trie_nodecollgraph.svg
+++ b/d4/d22/struct_trie_nodecollgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: TrieNode Pages: 1 -->
 <svg width="119pt" height="28pt"
--- a/d4/d68/qr__decompose_8h_a45c7640d9d22c89c11beb1f567843c56_cgraph.svg
+++ b/d4/d68/qr__decompose_8h_a45c7640d9d22c89c11beb1f567843c56_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: qr_decompose Pages: 1 -->
 <svg width="290pt" height="117pt"
--- a/d4/d68/qr__decompose_8h_a82b20e027437df768d7e994cf4cae29f_cgraph.svg
+++ b/d4/d68/qr__decompose_8h_a82b20e027437df768d7e994cf4cae29f_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: vector_proj Pages: 1 -->
 <svg width="171pt" height="28pt"
--- a/d4/d68/qr__decompose_8h_abeec1f78a7a7e7251687e75340331212_cgraph.svg
+++ b/d4/d68/qr__decompose_8h_abeec1f78a7a7e7251687e75340331212_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: vector_mag Pages: 1 -->
 <svg width="174pt" height="28pt"
--- a/d4/d68/qr__decompose_8h_source.html
+++ b/d4/d68/qr__decompose_8h_source.html
@ -331,7 +331,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
 <div class="ttc" id="agroup__kohonen__2d_html_ga6824dc6d973eb3339af7aef5fea78b0c"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#ga6824dc6d973eb3339af7aef5fea78b0c">save_2d_data</a></div><div class="ttdeci">int save_2d_data(const char *fname, double **X, int num_points, int num_features)</div><div class="ttdoc">Save a given n-dimensional data martix to file.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:102</div></div>
 <div class="ttc" id="astruct_b_s_t_iterator_html"><div class="ttname"><a href="../../d4/d02/struct_b_s_t_iterator.html">BSTIterator</a></div><div class="ttdoc">Definition for a binary tree node.</div><div class="ttdef"><b>Definition:</b> 173.c:13</div></div>
 <div class="ttc" id="agroup__kohonen__2d_html_gaf5ce14f026d6d231bef29161bac2b485"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gaf5ce14f026d6d231bef29161bac2b485">_random</a></div><div class="ttdeci">double _random(double a, double b)</div><div class="ttdoc">Helper function to generate a random number in a given interval.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:87</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Kyler Smith, 2017 Stack data structure implementation.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:14</div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Node, the basic data structure in the tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:15</div></div>
 <div class="ttc" id="aqr__decompose_8h_html_a82b20e027437df768d7e994cf4cae29f"><div class="ttname"><a href="../../d4/d68/qr__decompose_8h.html#a82b20e027437df768d7e994cf4cae29f">vector_proj</a></div><div class="ttdeci">double * vector_proj(double *a, double *b, double *out, int L)</div><div class="ttdoc">Compute projection of vector  on  defined as.</div><div class="ttdef"><b>Definition:</b> qr_decompose.h:76</div></div>
 <div class="ttc" id="acantor__set_8c_html_a85df3c64a683100ac6246e1e034df43d"><div class="ttname"><a href="../../dc/d80/cantor__set_8c.html#a85df3c64a683100ac6246e1e034df43d">free_memory</a></div><div class="ttdeci">void free_memory(CantorSet *head)</div><div class="ttdoc">Clear memory allocated by propagate function.</div><div class="ttdef"><b>Definition:</b> cantor_set.c:72</div></div>
 <div class="ttc" id="astruct__large__num_html_a3fd11c0b413bbabfb8737d4ae73e5aa0"><div class="ttname"><a href="../../d3/d5a/struct__large__num.html#a3fd11c0b413bbabfb8737d4ae73e5aa0">_large_num::num_digits</a></div><div class="ttdeci">unsigned int num_digits</div><div class="ttdoc">number of digits in the number</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:17</div></div>
@ -347,6 +347,7 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
 <div class="ttc" id="acartesian__to__polar_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../d6/d2e/cartesian__to__polar_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition:</b> cartesian_to_polar.c:118</div></div>
 <div class="ttc" id="afibonacci__fast_8c_html_a0ddf1224851353fc92bfbff6f499fa97"><div class="ttname"><a href="../../d4/d99/fibonacci__fast_8c.html#a0ddf1224851353fc92bfbff6f499fa97">main</a></div><div class="ttdeci">int main(int argc, char *argv[])</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition:</b> fibonacci_fast.c:65</div></div>
 <div class="ttc" id="afactorial__large__number_8c_html_ab54882961780c41a4929a6d390f6522d"><div class="ttname"><a href="../../d6/d3d/factorial__large__number_8c.html#ab54882961780c41a4929a6d390f6522d">large_num</a></div><div class="ttdeci">struct _large_num large_num</div><div class="ttdoc">dynamically large number</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_ac73c73be92dbbeeaad942c0103b9540d"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#ac73c73be92dbbeeaad942c0103b9540d">newNode</a></div><div class="ttdeci">node * newNode(int data)</div><div class="ttdoc">The node constructor, which receives the key value input and returns a node pointer.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:28</div></div>
 <div class="ttc" id="afactorial__large__number_8c_html_ad8101f58545bd891ae8b6e11caadd7eb"><div class="ttname"><a href="../../d6/d3d/factorial__large__number_8c.html#ad8101f58545bd891ae8b6e11caadd7eb">new_number</a></div><div class="ttdeci">large_num * new_number(void)</div><div class="ttdoc">create a new large number</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:24</div></div>
 <div class="ttc" id="adurand__kerner__roots_8c_html_a26d5695ebed0818a3e7cf4b10aacab52"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#a26d5695ebed0818a3e7cf4b10aacab52">check_termination</a></div><div class="ttdeci">char check_termination(long double delta)</div><div class="ttdoc">check for termination condition</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:83</div></div>
 <div class="ttc" id="aode__semi__implicit__euler_8c_html_ad80059877222f885b549f2d0a3dc6b55"><div class="ttname"><a href="../../d4/d99/ode__semi__implicit__euler_8c.html#ad80059877222f885b549f2d0a3dc6b55">semi_implicit_euler</a></div><div class="ttdeci">double semi_implicit_euler(double dx, double x0, double x_max, double *y, char save_to_file)</div><div class="ttdoc">Compute approximation using the semi-implicit-Euler method in the given limits.</div><div class="ttdef"><b>Definition:</b> ode_semi_implicit_euler.c:109</div></div>
@ -388,7 +389,6 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
 <div class="ttc" id="aode__semi__implicit__euler_8c_html_a9ceb646336224ee890a269d0b4600d09"><div class="ttname"><a href="../../d4/d99/ode__semi__implicit__euler_8c.html#a9ceb646336224ee890a269d0b4600d09">order</a></div><div class="ttdeci">#define order</div><div class="ttdoc">number of dependent variables in problem</div><div class="ttdef"><b>Definition:</b> ode_semi_implicit_euler.c:47</div></div>
 <div class="ttc" id="agroup__kohonen__2d_html_gadc22d512c00a9f5799ee067f4fb90b4b"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gadc22d512c00a9f5799ee067f4fb90b4b">get_min_2d</a></div><div class="ttdeci">void get_min_2d(double **X, int N, double *val, int *x_idx, int *y_idx)</div><div class="ttdoc">Get minimum value and index of the value in a matrix.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:204</div></div>
 <div class="ttc" id="aproblem__26_2sol1_8c_html_aabf4f709c8199e41cf279c77112345fe"><div class="ttname"><a href="../../d1/df9/problem__26_2sol1_8c.html#aabf4f709c8199e41cf279c77112345fe">MAX_LEN</a></div><div class="ttdeci">#define MAX_LEN</div><div class="ttdoc">length of resulting recurring fraction number</div><div class="ttdef"><b>Definition:</b> sol1.c:15</div></div>
-<div class="ttc" id="athreaded__binary__trees_8c_html_ad8ecdcce462dd8e170ae1f164935aaa6"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6">node</a></div><div class="ttdeci">struct Node node</div><div class="ttdoc">Node, the basic data structure of the tree.</div></div>
 <div class="ttc" id="acartesian__to__polar_8c_html_afb80d77f0c994240309ccddcc9525e70"><div class="ttname"><a href="../../d6/d2e/cartesian__to__polar_8c.html#afb80d77f0c994240309ccddcc9525e70">to_polar</a></div><div class="ttdeci">void to_polar(double x, double y, double *r, double *theta)</div><div class="ttdoc">Function to convert cartesian coordinates to polar.</div><div class="ttdef"><b>Definition:</b> cartesian_to_polar.c:22</div></div>
 <div class="ttc" id="athreaded__binary__trees_8c_html_a306d567466f22e1e927aaed97d8bb58c"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c">search</a></div><div class="ttdeci">void search(node *root, int ele)</div><div class="ttdoc">searches for the element</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:98</div></div>
 <div class="ttc" id="aspirograph_8c_html_a708a4c1a4d0c4acc4c447310dd4db27f"><div class="ttname"><a href="../../d7/d98/spirograph_8c.html#a708a4c1a4d0c4acc4c447310dd4db27f">test</a></div><div class="ttdeci">void test(void)</div><div class="ttdoc">Test function to save resulting points to a CSV file.</div><div class="ttdef"><b>Definition:</b> spirograph.c:74</div></div>
@ -415,12 +415,14 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
 <div class="ttc" id="astructkohonen__array__3d_html_a16720581653fa9a34d1029e7229a7377"><div class="ttname"><a href="../../d8/db8/structkohonen__array__3d.html#a16720581653fa9a34d1029e7229a7377">kohonen_array_3d::dim1</a></div><div class="ttdeci">int dim1</div><div class="ttdoc">lengths of first dimension</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:49</div></div>
 <div class="ttc" id="anewton__raphson__root_8c_html_a72f87d423a488946b319627a454d3925"><div class="ttname"><a href="../../dd/d08/newton__raphson__root_8c.html#a72f87d423a488946b319627a454d3925">func</a></div><div class="ttdeci">double complex func(double complex x)</div><div class="ttdoc">Return value of the function to find the root for.</div><div class="ttdef"><b>Definition:</b> newton_raphson_root.c:22</div></div>
 <div class="ttc" id="astructsudoku_html_a507f788b793d4d3d6f6a70415be84ded"><div class="ttname"><a href="../../dc/d18/structsudoku.html#a507f788b793d4d3d6f6a70415be84ded">sudoku::a</a></div><div class="ttdeci">uint8_t * a</div><div class="ttdoc">matrix as a flattened 1D row-major array</div><div class="ttdef"><b>Definition:</b> sudoku_solver.c:34</div></div>
+<div class="ttc" id="astructnode_html_af7109e6ffd82cbbb705e486fd0ce92f0"><div class="ttname"><a href="../../d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0">node::left</a></div><div class="ttdeci">struct node * left</div><div class="ttdoc">left child</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:16</div></div>
 <div class="ttc" id="aadaline__learning_8c_html_ab4ecb3accf5d9e0263087e7265bbe3a9"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#ab4ecb3accf5d9e0263087e7265bbe3a9">test1</a></div><div class="ttdeci">void test1(double eta)</div><div class="ttdoc">test function to predict points in a 2D coordinate system above the line  as +1 and others as -1.</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:225</div></div>
 <div class="ttc" id="aadaline__learning_8c_html_a05cc9a0acb524fde727a4d7b4a747ee6"><div class="ttname"><a href="../../dd/d8c/adaline__learning_8c.html#a05cc9a0acb524fde727a4d7b4a747ee6">test2</a></div><div class="ttdeci">void test2(double eta)</div><div class="ttdoc">test function to predict points in a 2D coordinate system above the line  as +1 and others as -1.</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:273</div></div>
 <div class="ttc" id="adurand__kerner__roots_8c_html_af270a96662132d0385cb6b4637c5a689"><div class="ttname"><a href="../../da/d38/durand__kerner__roots_8c.html#af270a96662132d0385cb6b4637c5a689">ACCURACY</a></div><div class="ttdeci">#define ACCURACY</div><div class="ttdoc">maximum accuracy limit</div><div class="ttdef"><b>Definition:</b> durand_kerner_roots.c:41</div></div>
 <div class="ttc" id="astructsudoku_html"><div class="ttname"><a href="../../dc/d18/structsudoku.html">sudoku</a></div><div class="ttdoc">Structure to hold the matrix and dimensions.</div><div class="ttdef"><b>Definition:</b> sudoku_solver.c:33</div></div>
 <div class="ttc" id="aode__midpoint__euler_8c_html_a148003d8b261d040c1c41e73b40af1dd"><div class="ttname"><a href="../../d1/dc2/ode__midpoint__euler_8c.html#a148003d8b261d040c1c41e73b40af1dd">midpoint_euler</a></div><div class="ttdeci">double midpoint_euler(double dx, double x0, double x_max, double *y, char save_to_file)</div><div class="ttdoc">Compute approximation using the midpoint-Euler method in the given limits.</div><div class="ttdef"><b>Definition:</b> ode_midpoint_euler.c:106</div></div>
 <div class="ttc" id="agroup__kohonen__2d_html_ga83abb572c60d202e100595a989dfe123"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#ga83abb572c60d202e100595a989dfe123">kohonen_update_weights</a></div><div class="ttdeci">double kohonen_update_weights(const double *X, struct kohonen_array_3d *W, double **D, int num_out, int num_features, double alpha, int R)</div><div class="ttdoc">Update weights of the SOM using Kohonen algorithm.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:234</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_af4aeda155dbe167f1c1cf38cb65bf324"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#af4aeda155dbe167f1c1cf38cb65bf324">node</a></div><div class="ttdeci">struct node node</div><div class="ttdoc">Node, the basic data structure in the tree.</div></div>
 <div class="ttc" id="anewton__raphson__root_8c_html_af270a96662132d0385cb6b4637c5a689"><div class="ttname"><a href="../../dd/d08/newton__raphson__root_8c.html#af270a96662132d0385cb6b4637c5a689">ACCURACY</a></div><div class="ttdeci">#define ACCURACY</div><div class="ttdoc">solution accuracy</div><div class="ttdef"><b>Definition:</b> newton_raphson_root.c:16</div></div>
 <div class="ttc" id="akohonen__som__trace_8c_html_a41ae16442e3e5b891a58d2e5932a2cd0"><div class="ttname"><a href="../../d0/d46/kohonen__som__trace_8c.html#a41ae16442e3e5b891a58d2e5932a2cd0">test_3d_classes</a></div><div class="ttdeci">void test_3d_classes(double *const *data, int N)</div><div class="ttdoc">Creates a random set of points distributed in four clusters in 3D space with centroids at the points.</div><div class="ttdef"><b>Definition:</b> kohonen_som_trace.c:410</div></div>
 <div class="ttc" id="acartesian__to__polar_8c_html_ae1a3968e7947464bee7714f6d43b7002"><div class="ttname"><a href="../../d6/d2e/cartesian__to__polar_8c.html#ae1a3968e7947464bee7714f6d43b7002">test</a></div><div class="ttdeci">void test()</div><div class="ttdoc">Test implementation.</div><div class="ttdef"><b>Definition:</b> cartesian_to_polar.c:98</div></div>
@ -428,8 +430,10 @@ $(document).ready(function(){initNavTree('d4/d68/qr__decompose_8h_source.html','
 <div class="ttc" id="apalindrome_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d16/palindrome_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Driver Code.</div><div class="ttdef"><b>Definition:</b> palindrome.c:14</div></div>
 <div class="ttc" id="astructadaline_html"><div class="ttname"><a href="../../d2/daa/structadaline.html">adaline</a></div><div class="ttdoc">structure to hold adaline model parameters</div><div class="ttdef"><b>Definition:</b> adaline_learning.c:44</div></div>
 <div class="ttc" id="acartesian__to__polar_8c_html_a60e62b809ca9dcb1b20a140b30d30f60"><div class="ttname"><a href="../../d6/d2e/cartesian__to__polar_8c.html#a60e62b809ca9dcb1b20a140b30d30f60">get_rand</a></div><div class="ttdeci">double get_rand(double lim1, double lim2)</div><div class="ttdoc">Generate a random number in the given limits.</div><div class="ttdef"><b>Definition:</b> cartesian_to_polar.c:88</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdoc">Utilitary procedure to measure the height of the binary tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:187</div></div>
 <div class="ttc" id="agroup__kohonen__2d_html_ga49d35f68f5d11d8ef6f8cce0d0e7bcba"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#ga49d35f68f5d11d8ef6f8cce0d0e7bcba">save_u_matrix</a></div><div class="ttdeci">int save_u_matrix(const char *fname, struct kohonen_array_3d *W)</div><div class="ttdoc">Create the distance matrix or U-matrix from the trained weights and save to disk.</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:139</div></div>
 <div class="ttc" id="aode__semi__implicit__euler_8c_html_a720b7e995d2bbc615f94a2c7dbcf84eb"><div class="ttname"><a href="../../d4/d99/ode__semi__implicit__euler_8c.html#a720b7e995d2bbc615f94a2c7dbcf84eb">semi_implicit_euler_step</a></div><div class="ttdeci">void semi_implicit_euler_step(double dx, double *x, double *y, double *dy)</div><div class="ttdoc">Compute next step approximation using the semi-implicit-Euler method.</div><div class="ttdef"><b>Definition:</b> ode_semi_implicit_euler.c:85</div></div>
+<div class="ttc" id="astructnode_html_a51e160f22dc6064bac4a4f9f1d931c2c"><div class="ttname"><a href="../../d5/da1/structnode.html#a51e160f22dc6064bac4a4f9f1d931c2c">node::right</a></div><div class="ttdeci">struct node * right</div><div class="ttdoc">right child</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:17</div></div>
 <div class="ttc" id="akohonen__som__topology_8c_html_a1440a7779ac56f47a3f355ce4a8c7da0"><div class="ttname"><a href="../../d2/df6/kohonen__som__topology_8c.html#a1440a7779ac56f47a3f355ce4a8c7da0">test1</a></div><div class="ttdeci">void test1()</div><div class="ttdoc">Test that creates a random set of points distributed in four clusters in 2D space and trains an SOM t...</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:406</div></div>
 <div class="ttc" id="astruct__cantor__set_html"><div class="ttname"><a href="../../d9/dd7/struct__cantor__set.html">_cantor_set</a></div><div class="ttdoc">structure to define Cantor set</div><div class="ttdef"><b>Definition:</b> cantor_set.c:12</div></div>
 <div class="ttc" id="astruct__large__num_html_afaf353a072cf050ac86ac6e39868bcc9"><div class="ttname"><a href="../../d3/d5a/struct__large__num.html#afaf353a072cf050ac86ac6e39868bcc9">_large_num::digits</a></div><div class="ttdeci">char * digits</div><div class="ttdoc">array to store individual digits</div><div class="ttdef"><b>Definition:</b> factorial_large_number.c:16</div></div>
--- a/d4/d83/problem__401_2sol1_8c_a236548478af932f1115a71f601a68788_cgraph.svg
+++ b/d4/d83/problem__401_2sol1_8c_a236548478af932f1115a71f601a68788_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: sigma2 Pages: 1 -->
 <svg width="234pt" height="28pt"
--- a/d4/d83/problem__401_2sol1_8c_a7380e14d595d560007b02ce516b6b215_cgraph.svg
+++ b/d4/d83/problem__401_2sol1_8c_a7380e14d595d560007b02ce516b6b215_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: get_divisors Pages: 1 -->
 <svg width="150pt" height="28pt"
--- a/d4/d89/problem__23_2sol1_8c__incl.svg
+++ b/d4/d89/problem__23_2sol1_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_23/sol1.c Pages: 1 -->
 <svg width="182pt" height="95pt"
--- a/d4/d99/odesemiimplicit__euler_8c_a720b7e995d2bbc615f94a2c7dbcf84eb_cgraph.svg
+++ b/d4/d99/odesemiimplicit__euler_8c_a720b7e995d2bbc615f94a2c7dbcf84eb_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: semi_implicit_euler_step Pages: 1 -->
 <svg width="219pt" height="28pt"
--- a/d4/d99/odesemiimplicit__euler_8c_ad80059877222f885b549f2d0a3dc6b55_cgraph.svg
+++ b/d4/d99/odesemiimplicit__euler_8c_ad80059877222f885b549f2d0a3dc6b55_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: semi_implicit_euler Pages: 1 -->
 <svg width="355pt" height="28pt"
--- a/d4/dbd/problem__23_2sol2_8c_a3ab61b5a1c4f2288625d160aa0ea8478_cgraph.svg
+++ b/d4/dbd/problem__23_2sol2_8c_a3ab61b5a1c4f2288625d160aa0ea8478_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: is_sum_of_abundant Pages: 1 -->
 <svg width="355pt" height="47pt"
--- a/d4/ddb/jump__search_8c__incl.svg
+++ b/d4/ddb/jump__search_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: searching/jump_search.c Pages: 1 -->
 <svg width="190pt" height="84pt"
--- a/d4/dee/modifiedbinarysearch_8c__incl.svg
+++ b/d4/dee/modifiedbinarysearch_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: searching/modified_binary_search.c Pages: 1 -->
 <svg width="120pt" height="95pt"
--- a/d5/d38/bubblesortrecursion_8c_aa8989f6c9bfd1f040854fa18b180114f_cgraph.svg
+++ b/d5/d38/bubblesortrecursion_8c_aa8989f6c9bfd1f040854fa18b180114f_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: bubbleSort Pages: 1 -->
 <svg width="147pt" height="28pt"
--- a/d5/d3e/problem__3_2sol2_8c__incl.svg
+++ b/d5/d3e/problem__3_2sol2_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_3/sol2.c Pages: 1 -->
 <svg width="118pt" height="95pt"
--- a/d5/d4c/group__sorting_gab99b8a397bdd0bf2903d66c22ba4ba43_cgraph.svg
+++ b/d5/d4c/group__sorting_gab99b8a397bdd0bf2903d66c22ba4ba43_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: merge_sort Pages: 1 -->
 <svg width="153pt" height="66pt"
--- a/d5/d51/problem__25_2sol1_8c__incl.svg
+++ b/d5/d51/problem__25_2sol1_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_25/sol1.c Pages: 1 -->
 <svg width="318pt" height="95pt"
--- a/d5/da1/structnode.html
+++ b/d5/da1/structnode.html
@ -97,7 +97,7 @@ $(document).ready(function(){initNavTree('d5/da1/structnode.html','../../'); ini
 </div><!--header-->
 <div class="contents">

-<p>Kyler Smith, 2017 <a class="el" href="../../dd/d10/struct_stack.html">Stack</a> data structure implementation.  
+<p><a class="el" href="../../db/d8b/struct_node.html" title="Node, the basic data structure of the tree.">Node</a>, the basic data structure in the tree.  
 <a href="../../d5/da1/structnode.html#details">More...</a></p>
 <div class="dynheader">
 Collaboration diagram for node:</div>
@ -109,13 +109,16 @@ Collaboration diagram for node:</div>
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
 Data Fields</h2></td></tr>
 <tr class="memitem:af7109e6ffd82cbbb705e486fd0ce92f0"><td class="memItemLeft" align="right" valign="top"><a id="af7109e6ffd82cbbb705e486fd0ce92f0"></a>
-struct <a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>left</b></td></tr>
+struct <a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0">left</a></td></tr>
+<tr class="memdesc:af7109e6ffd82cbbb705e486fd0ce92f0"><td class="mdescLeft">&#160;</td><td class="mdescRight">left child <br /></td></tr>
 <tr class="separator:af7109e6ffd82cbbb705e486fd0ce92f0"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a51e160f22dc6064bac4a4f9f1d931c2c"><td class="memItemLeft" align="right" valign="top"><a id="a51e160f22dc6064bac4a4f9f1d931c2c"></a>
-struct <a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>right</b></td></tr>
+struct <a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/da1/structnode.html#a51e160f22dc6064bac4a4f9f1d931c2c">right</a></td></tr>
+<tr class="memdesc:a51e160f22dc6064bac4a4f9f1d931c2c"><td class="mdescLeft">&#160;</td><td class="mdescRight">right child <br /></td></tr>
 <tr class="separator:a51e160f22dc6064bac4a4f9f1d931c2c"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a2d890bb9f6af0ffd73fe79b21124c2a2"><td class="memItemLeft" align="right" valign="top"><a id="a2d890bb9f6af0ffd73fe79b21124c2a2"></a>
-int&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
+int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2">data</a></td></tr>
+<tr class="memdesc:a2d890bb9f6af0ffd73fe79b21124c2a2"><td class="mdescLeft">&#160;</td><td class="mdescRight">data of the node <br /></td></tr>
 <tr class="separator:a2d890bb9f6af0ffd73fe79b21124c2a2"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a2783f1aec750191646305988f7e28756"><td class="memItemLeft" align="right" valign="top"><a id="a2783f1aec750191646305988f7e28756"></a>
 struct <a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>leftNode</b></td></tr>
@ -152,9 +155,10 @@ char&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
 <tr class="separator:a6f9100a3fe81d82776ce47ecdba94691"><td class="memSeparator" colspan="2">&#160;</td></tr>
 </table>
 <a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
-<div class="textblock"><p>Kyler Smith, 2017 <a class="el" href="../../dd/d10/struct_stack.html">Stack</a> data structure implementation. </p>
+<div class="textblock"><p><a class="el" href="../../db/d8b/struct_node.html" title="Node, the basic data structure of the tree.">Node</a>, the basic data structure in the tree. </p>
+<p>Kyler Smith, 2017 <a class="el" href="../../dd/d10/struct_stack.html">Stack</a> data structure implementation. </p>
 </div><hr/>The documentation for this struct was generated from the following files:<ul>
-<li>data_structures/binary_trees/binary_search_tree.c</li>
+<li>data_structures/binary_trees/<a class="el" href="../../da/d02/binary__search__tree_8c.html">binary_search_tree.c</a></li>
 <li>data_structures/binary_trees/create_node.c</li>
 <li>data_structures/binary_trees/redblacktree.c</li>
 <li>data_structures/graphs/bfs.c</li>
--- a/d5/df4/group__sudoku_ga3a0ec150ac9d0cb6b28279d36d95d72f_cgraph.svg
+++ b/d5/df4/group__sudoku_ga3a0ec150ac9d0cb6b28279d36d95d72f_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: OK Pages: 1 -->
 <svg width="122pt" height="104pt"
--- a/d5/df4/group__sudoku_gadfe0ed5085b4775d8fa00b434cc0fdfc_cgraph.svg
+++ b/d5/df4/group__sudoku_gadfe0ed5085b4775d8fa00b434cc0fdfc_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: solve Pages: 1 -->
 <svg width="265pt" height="104pt"
--- a/d6/d2e/cartesiantopolar_8c_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
+++ b/d6/d2e/cartesiantopolar_8c_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test Pages: 1 -->
 <svg width="131pt" height="66pt"
--- a/d6/d3d/factoriallargenumber_8c_af2869d36c22a2b8f93d3166a84e124b3_cgraph.svg
+++ b/d6/d3d/factoriallargenumber_8c_af2869d36c22a2b8f93d3166a84e124b3_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: add_digit Pages: 1 -->
 <svg width="180pt" height="28pt"
--- a/d6/d42/problem__22_2sol1_8c__incl.svg
+++ b/d6/d42/problem__22_2sol1_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_22/sol1.c Pages: 1 -->
 <svg width="250pt" height="95pt"
--- a/d6/d6d/struct_graphcollgraph.map
+++ b/d6/d6d/struct_graphcollgraph.map
@ -1,5 +1,5 @@
 <map id="Graph" name="Graph">
 <area shape="rect" id="node1" title=" " alt="" coords="81,200,138,227"/>
-<area shape="rect" id="node2" href="$d5/da1/structnode.html" title="Kyler Smith, 2017 Stack data structure implementation." alt="" coords="5,51,56,77"/>
+<area shape="rect" id="node2" href="$d5/da1/structnode.html" title="Node, the basic data structure in the tree." alt="" coords="5,51,56,77"/>
 <area shape="rect" id="node3" href="$d5/db4/struct_edge.html" title=" " alt="" coords="162,51,214,77"/>
 </map>
--- a/d6/d6d/struct_graphcollgraph.md5
+++ b/d6/d6d/struct_graphcollgraph.md5
@ -1 +1 @@
-f064474cca635c627187b8c318fcd218
+597e8c63a5e3c93f042b98e826741c61
--- a/d6/d6d/struct_graphcollgraph.svg
+++ b/d6/d6d/struct_graphcollgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: Graph Pages: 1 -->
 <svg width="165pt" height="174pt"
@ -21,7 +21,7 @@
 <!-- Node2 -->
 <g id="node2" class="node">
 <title>Node2</title>
-<g id="a_node2"><a xlink:href="../../d5/da1/structnode.html" target="_top" xlink:title="Kyler Smith, 2017 Stack data structure implementation.">
+<g id="a_node2"><a xlink:href="../../d5/da1/structnode.html" target="_top" xlink:title="Node, the basic data structure in the tree.">
 <polygon fill="white" stroke="black" points="0,-112.5 0,-131.5 38,-131.5 38,-112.5 0,-112.5"/>
 <text text-anchor="middle" x="19" y="-119.5" font-family="Helvetica,sans-Serif" font-size="10.00">node</text>
 </a>
--- a/d6/d7b/jump__search_8c_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
+++ b/d6/d7b/jump__search_8c_ae1a3968e7947464bee7714f6d43b7002_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test Pages: 1 -->
 <svg width="149pt" height="28pt"
--- a/d6/df3/graph_8h_source.html
+++ b/d6/df3/graph_8h_source.html
@ -141,7 +141,8 @@ $(document).ready(function(){initNavTree('d6/df3/graph_8h_source.html','../../')
 <div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;<span class="comment">//             hhoanhtuann@gmail.com</span></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Kyler Smith, 2017 Stack data structure implementation.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:14</div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Node, the basic data structure in the tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:15</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_ac73c73be92dbbeeaad942c0103b9540d"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#ac73c73be92dbbeeaad942c0103b9540d">newNode</a></div><div class="ttdeci">node * newNode(int data)</div><div class="ttdoc">The node constructor, which receives the key value input and returns a node pointer.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:28</div></div>
 <div class="ttc" id="astructqueue_html"><div class="ttname"><a href="../../d2/d36/structqueue.html">queue</a></div><div class="ttdef"><b>Definition:</b> bfs.c:6</div></div>
 <div class="ttc" id="aclient_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d93/client_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Driver code.</div><div class="ttdef"><b>Definition:</b> client.c:70</div></div>
 <div class="ttc" id="astruct_graph_rep_html"><div class="ttname"><a href="../../d2/d6a/struct_graph_rep.html">GraphRep</a></div><div class="ttdef"><b>Definition:</b> graph.c:9</div></div>
--- a/d7/d0a/fibonacci__fast_8c__incl.svg
+++ b/d7/d0a/fibonacci__fast_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: misc/fibonacci_fast.c Pages: 1 -->
 <svg width="188pt" height="84pt"
--- a/d7/d50/qreigenvalues_8c_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ b/d7/d50/qreigenvalues_8c_a0283886819c7c140a023582b7269e2d0_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test2 Pages: 1 -->
 <svg width="474pt" height="161pt"
--- a/d7/d50/qreigenvalues_8c_a0d8ed79786d17df48396b333c09d05bb_cgraph.svg
+++ b/d7/d50/qreigenvalues_8c_a0d8ed79786d17df48396b333c09d05bb_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: eigen_values Pages: 1 -->
 <svg width="400pt" height="161pt"
--- a/d7/d50/qreigenvalues_8c_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
+++ b/d7/d50/qreigenvalues_8c_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: test1 Pages: 1 -->
 <svg width="474pt" height="161pt"
--- a/d7/d6d/client_8c__incl.svg
+++ b/d7/d6d/client_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: client_server/client.c Pages: 1 -->
 <svg width="496pt" height="84pt"
--- a/d7/d86/structbigintcollgraph.svg
+++ b/d7/d86/structbigintcollgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: _big_int Pages: 1 -->
 <svg width="122pt" height="30pt"
--- a/d7/dac/problem__9_2sol1_8c__incl.svg
+++ b/d7/dac/problem__9_2sol1_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_9/sol1.c Pages: 1 -->
 <svg width="118pt" height="95pt"
--- a/d7/dd8/catoistrtointeger_8c_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
+++ b/d7/dd8/catoistrtointeger_8c_a3c04138a5bfe5d72780bb7e82a18e627_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: main Pages: 1 -->
 <svg width="226pt" height="47pt"
--- a/d7/ddb/problem__23_2sol1_8c_a3ab61b5a1c4f2288625d160aa0ea8478_cgraph.svg
+++ b/d7/ddb/problem__23_2sol1_8c_a3ab61b5a1c4f2288625d160aa0ea8478_cgraph.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: is_sum_of_abundant Pages: 1 -->
 <svg width="494pt" height="47pt"
--- a/d7/de0/stack_8h_source.html
+++ b/d7/de0/stack_8h_source.html
@ -138,9 +138,9 @@ $(document).ready(function(){initNavTree('d7/de0/stack_8h_source.html','../../')
 <div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="preprocessor">#endif</span></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
-<div class="ttc" id="astructdata_html"><div class="ttname"><a href="../../df/dea/structdata.html">data</a></div><div class="ttdef"><b>Definition:</b> prime_factoriziation.c:25</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Kyler Smith, 2017 Stack data structure implementation.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:14</div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Node, the basic data structure in the tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:15</div></div>
 <div class="ttc" id="astruct_t_html"><div class="ttname"><a href="../../d5/d7e/struct_t.html">T</a></div><div class="ttdef"><b>Definition:</b> stack.c:16</div></div>
+<div class="ttc" id="astructnode_html_a2d890bb9f6af0ffd73fe79b21124c2a2"><div class="ttname"><a href="../../d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2">node::data</a></div><div class="ttdeci">int data</div><div class="ttdoc">data of the node</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:18</div></div>
 <div class="ttc" id="aclient_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d93/client_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Driver code.</div><div class="ttdef"><b>Definition:</b> client.c:70</div></div>
 <div class="ttc" id="agroup__kohonen__2d_html_gaffe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a></div><div class="ttdeci">#define max(a, b)</div><div class="ttdoc">shorthand for maximum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:39</div></div>
 <div class="ttc" id="astructelem_html"><div class="ttname"><a href="../../d0/d6b/structelem.html">elem</a></div><div class="ttdef"><b>Definition:</b> stack.c:10</div></div>
--- a/d7/ded/problem__10_2sol2_8c__incl.svg
+++ b/d7/ded/problem__10_2sol2_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_10/sol2.c Pages: 1 -->
 <svg width="186pt" height="95pt"
--- a/d8/d11/newtonraphsonroot_8c__incl.svg
+++ b/d8/d11/newtonraphsonroot_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: numerical_methods/newton_raphson_root.c Pages: 1 -->
 <svg width="394pt" height="95pt"
--- a/d8/d1c/binarysearchtree_8c__incl.map
+++ b/d8/d1c/binarysearchtree_8c__incl.map
@ -0,0 +1,5 @@
+<map id="data_structures/binary_trees/binary_search_tree.c" name="data_structures/binary_trees/binary_search_tree.c">
+<area shape="rect" id="node1" title="A basic unbalanced binary search tree implementation in C." alt="" coords="5,5,188,47"/>
+<area shape="rect" id="node2" title=" " alt="" coords="23,95,85,121"/>
+<area shape="rect" id="node3" title=" " alt="" coords="109,95,173,121"/>
+</map>
--- a/d8/d1c/binarysearchtree_8c__incl.md5
+++ b/d8/d1c/binarysearchtree_8c__incl.md5
@ -0,0 +1 @@
+556e030ef9b357ef70157db6647c3b8f
--- a/d8/d1c/binarysearchtree_8c__incl.svg
+++ b/d8/d1c/binarysearchtree_8c__incl.svg
@ -0,0 +1,53 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
+ "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
+ -->
+<!-- Title: data_structures/binary_trees/binary_search_tree.c Pages: 1 -->
+<svg width="145pt" height="95pt"
+ viewBox="0.00 0.00 145.00 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
+<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
+<title>data_structures/binary_trees/binary_search_tree.c</title>
+<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 141,-91 141,4 -4,4"/>
+<!-- Node1 -->
+<g id="node1" class="node">
+<title>Node1</title>
+<g id="a_node1"><a xlink:title="A basic unbalanced binary search tree implementation in C.">
+<polygon fill="#bfbfbf" stroke="black" points="0,-56.5 0,-86.5 137,-86.5 137,-56.5 0,-56.5"/>
+<text text-anchor="start" x="8" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">data_structures/binary</text>
+<text text-anchor="middle" x="68.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">_trees/binary_search_tree.c</text>
+</a>
+</g>
+</g>
+<!-- Node2 -->
+<g id="node2" class="node">
+<title>Node2</title>
+<g id="a_node2"><a xlink:title=" ">
+<polygon fill="white" stroke="#bfbfbf" points="13.5,-0.5 13.5,-19.5 59.5,-19.5 59.5,-0.5 13.5,-0.5"/>
+<text text-anchor="middle" x="36.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">stdio.h</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node2 -->
+<g id="edge1" class="edge">
+<title>Node1&#45;&gt;Node2</title>
+<path fill="none" stroke="midnightblue" d="M60.92,-56.4C56.46,-48.11 50.78,-37.55 46.02,-28.71"/>
+<polygon fill="midnightblue" stroke="midnightblue" points="48.98,-26.81 41.16,-19.66 42.81,-30.12 48.98,-26.81"/>
+</g>
+<!-- Node3 -->
+<g id="node3" class="node">
+<title>Node3</title>
+<g id="a_node3"><a xlink:title=" ">
+<polygon fill="white" stroke="#bfbfbf" points="77.5,-0.5 77.5,-19.5 125.5,-19.5 125.5,-0.5 77.5,-0.5"/>
+<text text-anchor="middle" x="101.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">stdlib.h</text>
+</a>
+</g>
+</g>
+<!-- Node1&#45;&gt;Node3 -->
+<g id="edge2" class="edge">
+<title>Node1&#45;&gt;Node3</title>
+<path fill="none" stroke="midnightblue" d="M76.32,-56.4C80.97,-48.02 86.9,-37.33 91.84,-28.42"/>
+<polygon fill="midnightblue" stroke="midnightblue" points="94.91,-30.1 96.7,-19.66 88.79,-26.71 94.91,-30.1"/>
+</g>
+</g>
+</svg>
--- a/d8/d38/queue_8h_source.html
+++ b/d8/d38/queue_8h_source.html
@ -129,12 +129,12 @@ $(document).ready(function(){initNavTree('d8/d38/queue_8h_source.html','../../')
 <div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;<span class="comment">//             hhoanhtuann@gmail.com</span></div>
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
-<div class="ttc" id="astructdata_html"><div class="ttname"><a href="../../df/dea/structdata.html">data</a></div><div class="ttdef"><b>Definition:</b> prime_factoriziation.c:25</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Kyler Smith, 2017 Stack data structure implementation.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:14</div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Node, the basic data structure in the tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:15</div></div>
+<div class="ttc" id="astructnode_html_a2d890bb9f6af0ffd73fe79b21124c2a2"><div class="ttname"><a href="../../d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2">node::data</a></div><div class="ttdeci">int data</div><div class="ttdoc">data of the node</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:18</div></div>
 <div class="ttc" id="astructqueue_html"><div class="ttname"><a href="../../d2/d36/structqueue.html">queue</a></div><div class="ttdef"><b>Definition:</b> bfs.c:6</div></div>
 <div class="ttc" id="aclient_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d93/client_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Driver code.</div><div class="ttdef"><b>Definition:</b> client.c:70</div></div>
-<div class="ttc" id="aunion__find_8c_html_a3e13b69cce5a1b25ae034798092f3d86"><div class="ttname"><a href="../../df/df3/union__find_8c.html#a3e13b69cce5a1b25ae034798092f3d86">find</a></div><div class="ttdeci">int find(int *p, int x)</div><div class="ttdoc">Find index of or value in an array.</div><div class="ttdef"><b>Definition:</b> union_find.c:17</div></div>
 <div class="ttc" id="astruct_queue_rep_html"><div class="ttname"><a href="../../d0/d10/struct_queue_rep.html">QueueRep</a></div><div class="ttdef"><b>Definition:</b> queue.c:14</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_adff4c6248834a9944a1fb03a20230c9c"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#adff4c6248834a9944a1fb03a20230c9c">find</a></div><div class="ttdeci">int find(node *root, int data)</div><div class="ttdoc">Search procedure, which looks for the input key in the tree and returns 1 if it's present or 0 if it'...</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:152</div></div>
 <div class="ttc" id="astructsubset_html"><div class="ttname"><a href="../../dc/de5/structsubset.html">subset</a></div><div class="ttdef"><b>Definition:</b> kruskal.c:41</div></div>
 <div class="ttc" id="astruct_edge_html"><div class="ttname"><a href="../../d5/db4/struct_edge.html">Edge</a></div><div class="ttdef"><b>Definition:</b> bellman_ford.c:8</div></div>
 <div class="ttc" id="astruct_graph_html"><div class="ttname"><a href="../../d4/dd4/struct_graph.html">Graph</a></div><div class="ttdef"><b>Definition:</b> bellman_ford.c:14</div></div>
--- a/d8/d48/problem__10_2sol1_8c__incl.svg
+++ b/d8/d48/problem__10_2sol1_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_10/sol1.c Pages: 1 -->
 <svg width="186pt" height="95pt"
--- a/d8/d6a/problem__8_2sol1_8c__incl.svg
+++ b/d8/d6a/problem__8_2sol1_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: project_euler/problem_8/sol1.c Pages: 1 -->
 <svg width="120pt" height="95pt"
--- a/d8/d7c/cartesiantopolar_8c__incl.svg
+++ b/d8/d7c/cartesiantopolar_8c__incl.svg
@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8" standalone="no"?>
 <!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
 "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
-<!-- Generated by graphviz version 2.44.0 (20200408.0750)
+<!-- Generated by graphviz version 2.44.1 (20200629.0846)
 -->
 <!-- Title: misc/cartesian_to_polar.c Pages: 1 -->
 <svg width="256pt" height="84pt"
--- a/d8/d7c/dict_8h_source.html
+++ b/d8/d7c/dict_8h_source.html
@ -162,25 +162,36 @@ $(document).ready(function(){initNavTree('d8/d7c/dict_8h_source.html','../../');
 </div><!-- fragment --></div><!-- contents -->
 </div><!-- doc-content -->
 <div class="ttc" id="athreaded__binary__trees_8c_html_a284d683f74b6c884e79ba00d3d1c3317"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a284d683f74b6c884e79ba00d3d1c3317">delete_bt</a></div><div class="ttdeci">void delete_bt(node **root, int ele)</div><div class="ttdoc">deletion of a node from the tree if the node isn't present in the tree, it takes no action.</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:173</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main funcion.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:249</div></div>
 <div class="ttc" id="astructdata_html"><div class="ttname"><a href="../../df/dea/structdata.html">data</a></div><div class="ttdef"><b>Definition:</b> prime_factoriziation.c:25</div></div>
-<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Kyler Smith, 2017 Stack data structure implementation.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:14</div></div>
+<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdoc">Node, the basic data structure in the tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:15</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_a0f18adaaca5ecc410cfa16dd2a3684dc"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#a0f18adaaca5ecc410cfa16dd2a3684dc">inOrder</a></div><div class="ttdeci">void inOrder(node *root)</div><div class="ttdoc">Traversal procedure to list the current keys in the tree in order of value (from the left to the righ...</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:238</div></div>
 <div class="ttc" id="astruct_a_v_lnode_html"><div class="ttname"><a href="../../d2/d71/struct_a_v_lnode.html">AVLnode</a></div><div class="ttdef"><b>Definition:</b> avl.c:5</div></div>
+<div class="ttc" id="astructnode_html_a2d890bb9f6af0ffd73fe79b21124c2a2"><div class="ttname"><a href="../../d5/da1/structnode.html#a2d890bb9f6af0ffd73fe79b21124c2a2">node::data</a></div><div class="ttdeci">int data</div><div class="ttdoc">data of the node</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:18</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_ac73c73be92dbbeeaad942c0103b9540d"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#ac73c73be92dbbeeaad942c0103b9540d">newNode</a></div><div class="ttdeci">node * newNode(int data)</div><div class="ttdoc">The node constructor, which receives the key value input and returns a node pointer.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:28</div></div>
 <div class="ttc" id="astruct_node_html_a87c003c9f600e3fc58e6e90835f0b605"><div class="ttname"><a href="../../db/d8b/struct_node.html#a87c003c9f600e3fc58e6e90835f0b605">Node::data</a></div><div class="ttdeci">int data</div><div class="ttdoc">stores the number</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:28</div></div>
 <div class="ttc" id="astruct_node_html_a0ed3c7305b43527f0f237bbfd438b8f7"><div class="ttname"><a href="../../db/d8b/struct_node.html#a0ed3c7305b43527f0f237bbfd438b8f7">Node::rlink</a></div><div class="ttdeci">struct Node * rlink</div><div class="ttdoc">link to right child</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:30</div></div>
 <div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdoc">Node, the basic data structure of the tree.</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:27</div></div>
 <div class="ttc" id="astruct_dict_html"><div class="ttname"><a href="../../d4/dfe/struct_dict.html">Dict</a></div><div class="ttdef"><b>Definition:</b> dict.h:18</div></div>
 <div class="ttc" id="aclient_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d93/client_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Driver code.</div><div class="ttdef"><b>Definition:</b> client.c:70</div></div>
 <div class="ttc" id="athreaded__binary__trees_8c_html_a5a82ae0ee13788be51ca4ba6cddb0719"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a5a82ae0ee13788be51ca4ba6cddb0719">postorder_display</a></div><div class="ttdeci">void postorder_display(node *curr)</div><div class="ttdoc">performs postorder traversal param[in] curr node pointer to the topmost node of the tree</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:143</div></div>
-<div class="ttc" id="aunion__find_8c_html_a3e13b69cce5a1b25ae034798092f3d86"><div class="ttname"><a href="../../df/df3/union__find_8c.html#a3e13b69cce5a1b25ae034798092f3d86">find</a></div><div class="ttdeci">int find(int *p, int x)</div><div class="ttdoc">Find index of or value in an array.</div><div class="ttdef"><b>Definition:</b> union_find.c:17</div></div>
 <div class="ttc" id="athreaded__binary__trees_8c_html_ad8ecdcce462dd8e170ae1f164935aaa6"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#ad8ecdcce462dd8e170ae1f164935aaa6">node</a></div><div class="ttdeci">struct Node node</div><div class="ttdoc">Node, the basic data structure of the tree.</div></div>
 <div class="ttc" id="athreaded__binary__trees_8c_html_a306d567466f22e1e927aaed97d8bb58c"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a306d567466f22e1e927aaed97d8bb58c">search</a></div><div class="ttdeci">void search(node *root, int ele)</div><div class="ttdoc">searches for the element</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:98</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_adff4c6248834a9944a1fb03a20230c9c"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#adff4c6248834a9944a1fb03a20230c9c">find</a></div><div class="ttdeci">int find(node *root, int data)</div><div class="ttdoc">Search procedure, which looks for the input key in the tree and returns 1 if it's present or 0 if it'...</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:152</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_ad297e528a7bb8604ca93af149d609150"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#ad297e528a7bb8604ca93af149d609150">getMax</a></div><div class="ttdeci">node * getMax(node *root)</div><div class="ttdoc">Utilitary procedure to find the greatest key in the left subtree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:72</div></div>
 <div class="ttc" id="astruct_node_html_a60b73f452505cef98795d2c8de3e72ef"><div class="ttname"><a href="../../db/d8b/struct_node.html#a60b73f452505cef98795d2c8de3e72ef">Node::llink</a></div><div class="ttdeci">struct Node * llink</div><div class="ttdoc">link to left child</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:29</div></div>
 <div class="ttc" id="athreaded__binary__trees_8c_html_a8169ba0dfd5b8183672e444d1434bf9c"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a8169ba0dfd5b8183672e444d1434bf9c">preorder_display</a></div><div class="ttdeci">void preorder_display(node *curr)</div><div class="ttdoc">performs preorder traversal param[in] curr node pointer to the topmost node of the tree</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:157</div></div>
 <div class="ttc" id="agroup__kohonen__2d_html_gaffe776513b24d84b39af8ab0930fef7f"><div class="ttname"><a href="../../d1/d6b/group__kohonen__2d.html#gaffe776513b24d84b39af8ab0930fef7f">max</a></div><div class="ttdeci">#define max(a, b)</div><div class="ttdoc">shorthand for maximum value</div><div class="ttdef"><b>Definition:</b> kohonen_som_topology.c:39</div></div>
 <div class="ttc" id="astruct_c_array_html"><div class="ttname"><a href="../../d4/d2d/struct_c_array.html">CArray</a></div><div class="ttdef"><b>Definition:</b> carray.h:32</div></div>
+<div class="ttc" id="astructnode_html_af7109e6ffd82cbbb705e486fd0ce92f0"><div class="ttname"><a href="../../d5/da1/structnode.html#af7109e6ffd82cbbb705e486fd0ce92f0">node::left</a></div><div class="ttdeci">struct node * left</div><div class="ttdoc">left child</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:16</div></div>
 <div class="ttc" id="athreaded__binary__trees_8c_html_a4c1e06b5f0876ec9c1bd6817f3b7eda7"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a4c1e06b5f0876ec9c1bd6817f3b7eda7">inorder_display</a></div><div class="ttdeci">void inorder_display(node *curr)</div><div class="ttdoc">performs inorder traversal param[in] curr node pointer to the topmost node of the tree</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:129</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_af4aeda155dbe167f1c1cf38cb65bf324"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#af4aeda155dbe167f1c1cf38cb65bf324">node</a></div><div class="ttdeci">struct node node</div><div class="ttdoc">Node, the basic data structure in the tree.</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_a73152b9ccb4aa5cd4c1bacd4188bb2de"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#a73152b9ccb4aa5cd4c1bacd4188bb2de">insert</a></div><div class="ttdeci">node * insert(node *root, int data)</div><div class="ttdoc">Insertion procedure, which inserts the input key in a new node in the tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:46</div></div>
 <div class="ttc" id="athreaded__binary__trees_8c_html_ab21d1d36d95001defbca2f6abd4d410c"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#ab21d1d36d95001defbca2f6abd4d410c">create_node</a></div><div class="ttdeci">node * create_node(int data)</div><div class="ttdoc">creates a new node param[in] data value to be inserted</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:38</div></div>
 <div class="ttc" id="athreaded__binary__trees_8c_html_a823432888332fc9f0aa6072cff28c3bb"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#a823432888332fc9f0aa6072cff28c3bb">insert_bt</a></div><div class="ttdeci">void insert_bt(node **root, int data)</div><div class="ttdoc">inserts a node into the tree param[in,out] root pointer to node pointer to the topmost node of the tr...</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:51</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdoc">Utilitary procedure to measure the height of the binary tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:187</div></div>
+<div class="ttc" id="astructnode_html_a51e160f22dc6064bac4a4f9f1d931c2c"><div class="ttname"><a href="../../d5/da1/structnode.html#a51e160f22dc6064bac4a4f9f1d931c2c">node::right</a></div><div class="ttdeci">struct node * right</div><div class="ttdoc">right child</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:17</div></div>
+<div class="ttc" id="abinary__search__tree_8c_html_a01151353aa2d9688934ed39208133241"><div class="ttname"><a href="../../da/d02/binary__search__tree_8c.html#a01151353aa2d9688934ed39208133241">purge</a></div><div class="ttdeci">void purge(node *root)</div><div class="ttdoc">Utilitary procedure to free all nodes in a tree.</div><div class="ttdef"><b>Definition:</b> binary_search_tree.c:217</div></div>
 <div class="ttc" id="athreaded__binary__trees_8c_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../df/d3c/threaded__binary__trees_8c.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">main function</div><div class="ttdef"><b>Definition:</b> threaded_binary_trees.c:255</div></div>
 <!-- start footer part -->
 <div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
--- a/Show More
+++ b/Show More