Documentation for b6108e4

Author: jenningsloy318

d0/d6f/namespaceothers.html

@@ -134,7 +134,7 @@
 <p>Other algorithms</p>
 <p>for assert for IO Operations for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/list.html">std::list</a></p>
 <p>Other algorithms</p>
-<p>for assert for I/O operations</p>
+<p>for assert for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a> for I/O operations</p>
 <p>Other algorithms </p>
 </div><h2 class="groupheader">Function Documentation</h2>
 <a id="aa17dc6d061dff34f6b9a610bc5e26703" name="aa17dc6d061dff34f6b9a610bc5e26703"></a>

d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html

@@ -110,7 +110,7 @@
 
 <p>This is the complete list of members for <a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a>, including all inherited members.</p>
 <table class="directory">
-  <tr class="even"><td class="entry"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a3b8c7ec2863de75916be027fa5287570">data</a></td><td class="entry"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a></td><td class="entry"></td></tr>
+  <tr class="even"><td class="entry"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade">data</a></td><td class="entry"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a></td><td class="entry"></td></tr>
   <tr class="odd"><td class="entry"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a></td><td class="entry"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a></td><td class="entry"></td></tr>
   <tr class="even"><td class="entry"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a></td><td class="entry"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">others::recursive_tree_traversals::Node</a></td><td class="entry"></td></tr>
 </table></div><!-- contents -->

d8/d90/iterative__tree__traversals_8cpp.html

@@ -1,7 +1,7 @@
 <map id="others::recursive_tree_traversals::BT" name="others::recursive_tree_traversals::BT">
-<area shape="rect" id="Node000001" title="BT used to make the entire structure of the binary tree and the functions associated with the binary ..." alt="" coords="8,213,156,253"/>
-<area shape="rect" id="Node000002" href="/Users/runner/work/TheAlgorithms-C-Plus-Plus/TheAlgorithms-C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,94,159,120"/>
-<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="85,135,85,212,79,212,79,135"/>
-<area shape="rect" id="Node000003" href="/Users/runner/work/TheAlgorithms-C-Plus-Plus/TheAlgorithms-C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="35,5,129,31"/>
-<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="85,47,85,94,79,94,79,47"/>
+<area shape="rect" id="Node000001" title="BT used to make the entire structure of the binary tree and the functions associated with the binary ..." alt="" coords="21,213,169,253"/>
+<area shape="rect" id="Node000002" href="/Users/runner/work/TheAlgorithms-C-Plus-Plus/TheAlgorithms-C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector.html" title=" " alt="" coords="5,94,185,120"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="98,135,98,212,92,212,92,135"/>
+<area shape="rect" id="Node000003" href="/Users/runner/work/TheAlgorithms-C-Plus-Plus/TheAlgorithms-C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="48,5,142,31"/>
+<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="98,47,98,94,92,94,92,47"/>
 </map>

d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.map

@@ -1 +1 @@
-6de26c307272ce069ff6ca7f9d33e5b0
+8a587620e86c3507095bcace70130b01

d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.md5

@@ -116,15 +116,15 @@
 <div class="dynheader">
 Collaboration diagram for others::recursive_tree_traversals::Node:</div>
 <div class="dyncontent">
-<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg" width="207" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
+<div class="center"><iframe scrolling="no" frameborder="0" src="../../db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg" width="207" height="140"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
 <center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
 <table class="memberdecls">
 <tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
 Public Attributes</h2></td></tr>
-<tr class="memitem:a3b8c7ec2863de75916be027fa5287570" id="r_a3b8c7ec2863de75916be027fa5287570"><td class="memItemLeft" align="right" valign="top"><a id="a3b8c7ec2863de75916be027fa5287570" name="a3b8c7ec2863de75916be027fa5287570"></a>
-uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b> = 0</td></tr>
-<tr class="memdesc:a3b8c7ec2863de75916be027fa5287570"><td class="mdescLeft">&#160;</td><td class="mdescRight">The value/key of the node. <br /></td></tr>
-<tr class="separator:a3b8c7ec2863de75916be027fa5287570"><td class="memSeparator" colspan="2">&#160;</td></tr>
+<tr class="memitem:a59cc94ba784aeaefec2e915ddfdb1ade" id="r_a59cc94ba784aeaefec2e915ddfdb1ade"><td class="memItemLeft" align="right" valign="top"><a id="a59cc94ba784aeaefec2e915ddfdb1ade" name="a59cc94ba784aeaefec2e915ddfdb1ade"></a>
+<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integer.html">std::uint64_t</a>&#160;</td><td class="memItemRight" valign="bottom"><b>data</b> = 0</td></tr>
+<tr class="memdesc:a59cc94ba784aeaefec2e915ddfdb1ade"><td class="mdescLeft">&#160;</td><td class="mdescRight">The value/key of the node. <br /></td></tr>
+<tr class="separator:a59cc94ba784aeaefec2e915ddfdb1ade"><td class="memSeparator" colspan="2">&#160;</td></tr>
 <tr class="memitem:a5a8a7bc2d2f847994220ae9e0b60fff3" id="r_a5a8a7bc2d2f847994220ae9e0b60fff3"><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a> {}</td></tr>
 <tr class="memdesc:a5a8a7bc2d2f847994220ae9e0b60fff3"><td class="mdescLeft">&#160;</td><td class="mdescRight">struct pointer to left subtree.  <br /></td></tr>
 <tr class="separator:a5a8a7bc2d2f847994220ae9e0b60fff3"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -156,7 +156,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#a5a8a7bc2d2f847994220ae9e
 </div><div class="memdoc">
 
 <p>struct pointer to left subtree. </p>
-<div class="fragment"><div class="line"><span class="lineno">   80</span>{};   <span class="comment">///&lt; struct pointer to left subtree.</span></div>
+<div class="fragment"><div class="line"><span class="lineno">   81</span>{};     <span class="comment">///&lt; struct pointer to left subtree.</span></div>
 </div><!-- fragment -->
 </div>
 </div>
@@ -173,7 +173,7 @@ <h2 class="memtitle"><span class="permalink"><a href="#ab875304781a4eb9661c0931a
 </div><div class="memdoc">
 
 <p>struct pointer to right subtree. </p>
-<div class="fragment"><div class="line"><span class="lineno">   81</span>{};  <span class="comment">///&lt; struct pointer to right subtree.</span></div>
+<div class="fragment"><div class="line"><span class="lineno">   82</span>{};    <span class="comment">///&lt; struct pointer to right subtree.</span></div>
 </div><!-- fragment -->
 </div>
 </div>

d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg

@@ -1,6 +1,6 @@
 var structothers_1_1recursive__tree__traversals_1_1_node =
 [
-    [ "data", "d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a3b8c7ec2863de75916be027fa5287570", null ],
+    [ "data", "d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade", null ],
     [ "left", "d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3", null ],
     [ "right", "d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83", null ]
 ];

d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph_org.svg

@@ -1,4 +1,6 @@
 <map id="others::recursive_tree_traversals::Node" name="others::recursive_tree_traversals::Node">
-<area shape="rect" id="Node000001" title="The structure to hold Nodes of the tree." alt="" coords="5,5,153,46"/>
-<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="169,18,179,26,171,33,153,36,153,30,169,28,174,26,167,23"/>
+<area shape="rect" id="Node000001" title="The structure to hold Nodes of the tree." alt="" coords="5,94,153,135"/>
+<area shape="poly" id="edge2_Node000001_Node000001" title=" " alt="" coords="170,105,179,114,171,123,154,126,153,121,169,118,174,114,166,110"/>
+<area shape="rect" id="Node000002" href="/Users/runner/work/TheAlgorithms-C-Plus-Plus/TheAlgorithms-C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/types/integer.html" title=" " alt="" coords="32,5,126,31"/>
+<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="82,46,82,93,76,93,76,46"/>
 </map>