backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-16 11:32:44 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 0953376d31

Browse Source
This commit is contained in:
github-actions
2023-06-16 21:18:14 +00:00
parent 26f1eee566
commit 14deeecd50
7241 changed files with 234176 additions and 54779 deletions
Download Patch File Download Diff File Expand all files Collapse all files

81
d9/dde/classbinary__search__tree.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: binary_search_tree&lt; T &gt; Class Template Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.6 -->
<!-- Generated by Doxygen 1.9.7 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -112,8 +112,7 @@ $(document).ready(function(){initNavTree('d9/dde/classbinary__search__tree.html'
<div class="dynheader">
Collaboration diagram for binary_search_tree&lt; T &gt;:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/da6/classbinary__search__tree__coll__graph.svg" width="339" height="171"><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="../../d3/da6/classbinary__search__tree__coll__graph.svg" width="339" height="171"><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="nested-classes" name="nested-classes"></a>
@@ -229,8 +228,8 @@ template&lt;class T &gt; </div>
<div class="line"><span class="lineno"> 248</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 249</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a> = 0;</div>
<div class="line"><span class="lineno"> 250</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_a07ba32ce1a2af6e357600ac8c8e98dbc"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">binary_search_tree::size_</a></div><div class="ttdeci">std::size_t size_</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:43</div></div>
<div class="ttc" id="aclassbinary__search__tree_html_aa08f65f6f3bfcb14f8c3d1e65305ae50"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">binary_search_tree::root_</a></div><div class="ttdeci">std::unique_ptr&lt; bst_node &gt; root_</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:42</div></div>
<div class="ttc" id="aclassbinary__search__tree_html_a07ba32ce1a2af6e357600ac8c8e98dbc"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">binary_search_tree::size_</a></div><div class="ttdeci">std::size_t size_</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:43</div></div>
<div class="ttc" id="aclassbinary__search__tree_html_aa08f65f6f3bfcb14f8c3d1e65305ae50"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">binary_search_tree::root_</a></div><div class="ttdeci">std::unique_ptr&lt; bst_node &gt; root_</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:42</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -295,13 +294,12 @@ false Otherwise. </dd></dl>
<div class="line"><span class="lineno"> 187</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 188</span> }</div>
<div class="line"><span class="lineno"> 189</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_aa4f84b2eec9b9201af1840868ddb5fb2"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">binary_search_tree::contains</a></div><div class="ttdeci">bool contains(std::unique_ptr&lt; bst_node &gt; &amp;node, T value)</div><div class="ttdoc">Recursive function to check if a value is in the BST.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:177</div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition:</b> binary_search_tree.cpp:11</div></div>
<div class="ttc" id="aclassbinary__search__tree_html_aa4f84b2eec9b9201af1840868ddb5fb2"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">binary_search_tree::contains</a></div><div class="ttdeci">bool contains(std::unique_ptr&lt; bst_node &gt; &amp;node, T value)</div><div class="ttdoc">Recursive function to check if a value is in the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:177</div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.svg" width="143" height="76"><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="../../d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -346,8 +344,7 @@ false Otherwise. </dd></dl>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.svg" width="143" height="76"><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="../../d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -408,12 +405,11 @@ false Otherwise. </dd></dl>
<div class="line"><span class="lineno"> 59</span> }</div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right, ret_value);</div>
<div class="line"><span class="lineno"> 61</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_a75f897af6aa732a9901454401c869bcb"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">binary_search_tree::find_max</a></div><div class="ttdeci">bool find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the maximum value in the BST.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:53</div></div>
<div class="ttc" id="aclassbinary__search__tree_html_a75f897af6aa732a9901454401c869bcb"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">binary_search_tree::find_max</a></div><div class="ttdeci">bool find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the maximum value in the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:53</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.svg" width="143" height="76"><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="../../d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -458,8 +454,7 @@ false Otherwise. </dd></dl>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.svg" width="143" height="76"><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="../../d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -521,12 +516,11 @@ false Otherwise. </dd></dl>
<div class="line"><span class="lineno"> 78</span> </div>
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left, ret_value);</div>
<div class="line"><span class="lineno"> 80</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_af9a2c7c187a7ca3142c77ce342ef3153"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">binary_search_tree::find_min</a></div><div class="ttdeci">bool find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the minimum value in the BST.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:71</div></div>
<div class="ttc" id="aclassbinary__search__tree_html_af9a2c7c187a7ca3142c77ce342ef3153"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">binary_search_tree::find_min</a></div><div class="ttdeci">bool find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the minimum value in the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:71</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.svg" width="143" height="76"><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="../../d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -571,8 +565,7 @@ false Otherwise. </dd></dl>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.svg" width="143" height="76"><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="../../d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -610,14 +603,13 @@ template&lt;class T &gt; </div>
<div class="line"><span class="lineno"> 324</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
<div class="line"><span class="lineno"> 325</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 326</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_a2fcf37549bd002c174a45b0b4203c2bd"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">binary_search_tree::traverse_inorder</a></div><div class="ttdeci">void traverse_inorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in in-order order.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:197</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="aclassbinary__search__tree_html_a2fcf37549bd002c174a45b0b4203c2bd"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">binary_search_tree::traverse_inorder</a></div><div class="ttdeci">void traverse_inorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in in-order order.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:197</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.svg" width="344" height="76"><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="../../d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.svg" width="344" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -655,12 +647,11 @@ template&lt;class T &gt; </div>
<div class="line"><span class="lineno"> 348</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
<div class="line"><span class="lineno"> 349</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 350</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_a87c0a35845d27e0f6fc1f4eaa0333362"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">binary_search_tree::traverse_postorder</a></div><div class="ttdeci">void traverse_postorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in post-order order.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:231</div></div>
<div class="ttc" id="aclassbinary__search__tree_html_a87c0a35845d27e0f6fc1f4eaa0333362"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">binary_search_tree::traverse_postorder</a></div><div class="ttdeci">void traverse_postorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in post-order order.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:231</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.svg" width="364" height="76"><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="../../d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.svg" width="364" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -698,12 +689,11 @@ template&lt;class T &gt; </div>
<div class="line"><span class="lineno"> 336</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
<div class="line"><span class="lineno"> 337</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 338</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_ab81edd415324d372632c42dc7dbcb9e1"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">binary_search_tree::traverse_preorder</a></div><div class="ttdeci">void traverse_preorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in pre-order order.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:214</div></div>
<div class="ttc" id="aclassbinary__search__tree_html_ab81edd415324d372632c42dc7dbcb9e1"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">binary_search_tree::traverse_preorder</a></div><div class="ttdeci">void traverse_preorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in pre-order order.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:214</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.svg" width="352" height="76"><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="../../d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.svg" width="352" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -780,13 +770,12 @@ false Otherwise. </dd></dl>
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 113</span> }</div>
<div class="line"><span class="lineno"> 114</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_a9d1e7e10efa74d741bf48cf032df3778"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree::insert</a></div><div class="ttdeci">bool insert(std::unique_ptr&lt; bst_node &gt; &amp;node, T new_value)</div><div class="ttdoc">Recursive function to insert a value into the BST.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:90</div></div>
<div class="ttc" id="aclassbinary__search__tree_html_a9d1e7e10efa74d741bf48cf032df3778"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree::insert</a></div><div class="ttdeci">bool insert(std::unique_ptr&lt; bst_node &gt; &amp;node, T new_value)</div><div class="ttdoc">Recursive function to insert a value into the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:90</div></div>
<div class="ttc" id="aunique_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.svg" width="143" height="76"><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="../../d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -837,8 +826,7 @@ false Otherwise. </dd></dl>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.svg" width="322" height="76"><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="../../d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.svg" width="322" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -939,13 +927,12 @@ false Otherwise. </dd></dl>
<div class="line"><span class="lineno"> 165</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right, rm_value);</div>
<div class="line"><span class="lineno"> 166</span> }</div>
<div class="line"><span class="lineno"> 167</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_af4a865ce5244608819b169fc78a41153"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">binary_search_tree::remove</a></div><div class="ttdeci">bool remove(std::unique_ptr&lt; bst_node &gt; &amp;parent, std::unique_ptr&lt; bst_node &gt; &amp;node, T rm_value)</div><div class="ttdoc">Recursive function to remove a value from the BST.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:125</div></div>
<div class="ttc" id="aclassbinary__search__tree_html_af4a865ce5244608819b169fc78a41153"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">binary_search_tree::remove</a></div><div class="ttdeci">bool remove(std::unique_ptr&lt; bst_node &gt; &amp;parent, std::unique_ptr&lt; bst_node &gt; &amp;node, T rm_value)</div><div class="ttdoc">Recursive function to remove a value from the BST.</div><div class="ttdef"><b>Definition</b> binary_search_tree2.cpp:125</div></div>
<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.svg" width="322" height="126"><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="../../d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.svg" width="322" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -996,8 +983,7 @@ false Otherwise. </dd></dl>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.svg" width="502" height="126"><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="../../d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.svg" width="502" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -1089,8 +1075,7 @@ template&lt;class T &gt; </div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.svg" width="143" height="76"><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="../../d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -1151,8 +1136,7 @@ template&lt;class T &gt; </div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.svg" width="148" height="76"><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="../../d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.svg" width="148" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -1213,8 +1197,7 @@ template&lt;class T &gt; </div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.svg" width="143" height="76"><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="../../d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.svg" width="143" height="76"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
@@ -1279,7 +1262,7 @@ template&lt;class T &gt; </div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.6 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
</ul>
</div>
</body>

6
d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.map
View File

@@ -1,4 +1,6 @@
<map id="binary_search_tree::get_elements_inorder" name="binary_search_tree::get_elements_inorder">
<area shape="rect" id="node1" title="Get all values of the BST in in&#45;order order." alt="" coords="5,29,159,70"/>
<area shape="rect" id="node2" href="$d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd" title="Recursive function to traverse the tree in in&#45;order order." alt="" coords="207,29,338,70"/>
<area shape="rect" id="Node000001" title="Get all values of the BST in in&#45;order order." alt="" coords="5,29,159,70"/>
<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd" title="Recursive function to traverse the tree in in&#45;order order." alt="" coords="207,29,338,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="159,47,192,47,192,52,159,52"/>
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="236,29,234,19,240,10,253,5,272,3,294,5,306,12,303,17,292,10,272,8,254,10,244,15,239,20,241,28"/>
</map>

2
d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.md5
View File

@@ -1 +1 @@
1769e88fe301834296d6c738a456af71
a5a3d5f581caced7886143e2b98bc0d1

43
d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::get_elements_inorder Pages: 1 -->
<svg width="258pt" height="57pt"
viewBox="0.00 0.00 257.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::get_elements_inorder</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Get all values of the BST in in&#45;order order.">
<g id="a_Node000001"><a xlink:title="Get all values of the BST in in&#45;order order.">
<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_inorder</text>
@@ -19,9 +29,9 @@
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd" target="_top" xlink:title="Recursive function to traverse the tree in in&#45;order order.">
<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd" target="_top" xlink:title="Recursive function to traverse the tree in in&#45;order order.">
<polygon fill="white" stroke="#666666" points="249.5,-30.5 151,-30.5 151,0 249.5,0 249.5,-30.5"/>
<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="200.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_inorder</text>
@@ -29,16 +39,37 @@
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M115.34,-15.25C123.42,-15.25 131.75,-15.25 139.87,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="139.78,-18.75 149.78,-15.25 139.78,-11.75 139.78,-18.75"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M174.95,-30.99C169.79,-40.06 178.22,-48.5 200.25,-48.5 212.64,-48.5 220.73,-45.83 224.51,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="228.09,-42.27 225.55,-31.99 221.12,-41.61 228.09,-42.27"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

50
d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph_org.svg Normal file
View File

@@ -0,0 +1,50 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::get_elements_inorder Pages: 1 -->
<svg width="258pt" height="57pt"
viewBox="0.00 0.00 257.50 56.50" 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 52.5)">
<title>binary_search_tree::get_elements_inorder</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Get all values of the BST in in&#45;order order.">
<polygon fill="#999999" stroke="#666666" points="115,-30.5 0,-30.5 0,0 115,0 115,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="57.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_inorder</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd" target="_top" xlink:title="Recursive function to traverse the tree in in&#45;order order.">
<polygon fill="white" stroke="#666666" points="249.5,-30.5 151,-30.5 151,0 249.5,0 249.5,-30.5"/>
<text text-anchor="start" x="159" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="200.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_inorder</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M115.34,-15.25C123.42,-15.25 131.75,-15.25 139.87,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="139.78,-18.75 149.78,-15.25 139.78,-11.75 139.78,-18.75"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M174.95,-30.99C169.79,-40.06 178.22,-48.5 200.25,-48.5 212.64,-48.5 220.73,-45.83 224.51,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="228.09,-42.27 225.55,-31.99 221.12,-41.61 228.09,-42.27"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.5 KiB

3
d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.map
View File

@@ -1,3 +1,4 @@
<map id="binary_search_tree::traverse_inorder" name="binary_search_tree::traverse_inorder">
<area shape="rect" id="node1" title="Recursive function to traverse the tree in in&#45;order order." alt="" coords="5,29,137,70"/>
<area shape="rect" id="Node000001" title="Recursive function to traverse the tree in in&#45;order order." alt="" coords="5,29,137,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,92,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
</map>

2
d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.md5
View File

@@ -1 +1 @@
ae3d39f18edbd50efffe461cf6c9cba4
69b581b1f66e8723358f5796f63c8def

34
d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::traverse_inorder Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::traverse_inorder</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Recursive function to traverse the tree in in&#45;order order.">
<g id="a_Node000001"><a xlink:title="Recursive function to traverse the tree in in&#45;order order.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_inorder</text>
@@ -19,10 +29,28 @@
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.4 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

31
d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph_org.svg Normal file
View File

@@ -0,0 +1,31 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::traverse_inorder Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" 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 52.5)">
<title>binary_search_tree::traverse_inorder</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Recursive function to traverse the tree in in&#45;order order.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_inorder</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.5 KiB

3
d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.map
View File

@@ -1,3 +1,4 @@
<map id="binary_search_tree::find_max" name="binary_search_tree::find_max">
<area shape="rect" id="node1" title="Find the largest value in the BST." alt="" coords="5,29,137,70"/>
<area shape="rect" id="Node000001" title="Find the largest value in the BST." alt="" coords="5,29,137,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,92,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
</map>

2
d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.md5
View File

@@ -1 +1 @@
f3fb1f0c5ba6442ce57d4c38efec2c24
4ca8a999839ead2cbdf7c7164fd64bad

34
d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::find_max Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::find_max</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Find the largest value in the BST.">
<g id="a_Node000001"><a xlink:title="Find the largest value in the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
@@ -19,10 +29,28 @@
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.3 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

31
d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph_org.svg Normal file
View File

@@ -0,0 +1,31 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::find_max Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" 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 52.5)">
<title>binary_search_tree::find_max</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Find the largest value in the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.4 KiB

6
d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.map
View File

@@ -1,4 +1,6 @@
<map id="binary_search_tree::get_elements_preorder" name="binary_search_tree::get_elements_preorder">
<area shape="rect" id="node1" title="Get all values of the BST in pre&#45;order order." alt="" coords="5,29,167,70"/>
<area shape="rect" id="node2" href="$d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1" title="Recursive function to traverse the tree in pre&#45;order order." alt="" coords="215,29,346,70"/>
<area shape="rect" id="Node000001" title="Get all values of the BST in pre&#45;order order." alt="" coords="5,29,167,70"/>
<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1" title="Recursive function to traverse the tree in pre&#45;order order." alt="" coords="215,29,346,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="167,47,200,47,200,52,167,52"/>
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="243,29,241,19,248,10,261,5,280,3,302,5,315,12,312,17,300,10,280,8,262,10,251,15,247,20,249,28"/>
</map>

2
d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.md5
View File

@@ -1 +1 @@
78a9b51607c19d9b0f1bd1956ce825f4
33a023938c7c97af165b7458f2853978

43
d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::get_elements_preorder Pages: 1 -->
<svg width="264pt" height="57pt"
viewBox="0.00 0.00 263.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::get_elements_preorder</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Get all values of the BST in pre&#45;order order.">
<g id="a_Node000001"><a xlink:title="Get all values of the BST in pre&#45;order order.">
<polygon fill="#999999" stroke="#666666" points="121,-30.5 0,-30.5 0,0 121,0 121,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="60.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_preorder</text>
@@ -19,9 +29,9 @@
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1" target="_top" xlink:title="Recursive function to traverse the tree in pre&#45;order order.">
<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1" target="_top" xlink:title="Recursive function to traverse the tree in pre&#45;order order.">
<polygon fill="white" stroke="#666666" points="255.5,-30.5 157,-30.5 157,0 255.5,0 255.5,-30.5"/>
<text text-anchor="start" x="165" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="206.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_preorder</text>
@@ -29,16 +39,37 @@
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.21,-15.25C129.38,-15.25 137.76,-15.25 145.92,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="145.87,-18.75 155.87,-15.25 145.87,-11.75 145.87,-18.75"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M180.42,-30.99C175.15,-40.06 183.76,-48.5 206.25,-48.5 218.9,-48.5 227.16,-45.83 231.02,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="234.6,-42.28 232.08,-31.99 227.63,-41.6 234.6,-42.28"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

50
d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph_org.svg Normal file
View File

@@ -0,0 +1,50 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::get_elements_preorder Pages: 1 -->
<svg width="264pt" height="57pt"
viewBox="0.00 0.00 263.50 56.50" 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 52.5)">
<title>binary_search_tree::get_elements_preorder</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Get all values of the BST in pre&#45;order order.">
<polygon fill="#999999" stroke="#666666" points="121,-30.5 0,-30.5 0,0 121,0 121,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="60.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_preorder</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1" target="_top" xlink:title="Recursive function to traverse the tree in pre&#45;order order.">
<polygon fill="white" stroke="#666666" points="255.5,-30.5 157,-30.5 157,0 255.5,0 255.5,-30.5"/>
<text text-anchor="start" x="165" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="206.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_preorder</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M121.21,-15.25C129.38,-15.25 137.76,-15.25 145.92,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="145.87,-18.75 155.87,-15.25 145.87,-11.75 145.87,-18.75"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M180.42,-30.99C175.15,-40.06 183.76,-48.5 206.25,-48.5 218.9,-48.5 227.16,-45.83 231.02,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="234.6,-42.28 232.08,-31.99 227.63,-41.6 234.6,-42.28"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.5 KiB

6
d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.map
View File

@@ -1,4 +1,6 @@
<map id="binary_search_tree::get_elements_postorder" name="binary_search_tree::get_elements_postorder">
<area shape="rect" id="node1" title="Get all values of the BST in post&#45;order order." alt="" coords="5,29,174,70"/>
<area shape="rect" id="node2" href="$d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362" title="Recursive function to traverse the tree in post&#45;order order." alt="" coords="222,29,359,70"/>
<area shape="rect" id="Node000001" title="Get all values of the BST in post&#45;order order." alt="" coords="5,29,174,70"/>
<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362" title="Recursive function to traverse the tree in post&#45;order order." alt="" coords="222,29,359,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="174,47,207,47,207,52,174,52"/>
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="252,29,250,19,257,10,270,5,290,3,313,5,326,12,323,17,311,10,290,8,271,10,260,15,255,20,257,28"/>
</map>

2
d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.md5
View File

@@ -1 +1 @@
65cf22aa66aff15158f6c46d2fa922bc
eeafe46063f867880c85af66dd8628d4

43
d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::get_elements_postorder Pages: 1 -->
<svg width="273pt" height="57pt"
viewBox="0.00 0.00 273.25 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::get_elements_postorder</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Get all values of the BST in post&#45;order order.">
<g id="a_Node000001"><a xlink:title="Get all values of the BST in post&#45;order order.">
<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_postorder</text>
@@ -19,9 +29,9 @@
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362" target="_top" xlink:title="Recursive function to traverse the tree in post&#45;order order.">
<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362" target="_top" xlink:title="Recursive function to traverse the tree in post&#45;order order.">
<polygon fill="white" stroke="#666666" points="265.25,-30.5 162.25,-30.5 162.25,0 265.25,0 265.25,-30.5"/>
<text text-anchor="start" x="170.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="213.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_postorder</text>
@@ -29,16 +39,37 @@
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M126.72,-15.25C134.8,-15.25 143.06,-15.25 151.11,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="150.94,-18.75 160.94,-15.25 150.94,-11.75 150.94,-18.75"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M187.06,-30.99C181.61,-40.06 190.51,-48.5 213.75,-48.5 226.82,-48.5 235.36,-45.83 239.35,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="242.93,-42.28 240.44,-31.99 235.96,-41.59 242.93,-42.28"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.3 KiB

After

Width:  |  Height:  |  Size: 3.3 KiB

50
d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph_org.svg Normal file
View File

@@ -0,0 +1,50 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::get_elements_postorder Pages: 1 -->
<svg width="273pt" height="57pt"
viewBox="0.00 0.00 273.25 56.50" 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 52.5)">
<title>binary_search_tree::get_elements_postorder</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Get all values of the BST in post&#45;order order.">
<polygon fill="#999999" stroke="#666666" points="126.25,-30.5 0,-30.5 0,0 126.25,0 126.25,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="63.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::get_elements_postorder</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362" target="_top" xlink:title="Recursive function to traverse the tree in post&#45;order order.">
<polygon fill="white" stroke="#666666" points="265.25,-30.5 162.25,-30.5 162.25,0 265.25,0 265.25,-30.5"/>
<text text-anchor="start" x="170.25" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="213.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_postorder</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M126.72,-15.25C134.8,-15.25 143.06,-15.25 151.11,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="150.94,-18.75 160.94,-15.25 150.94,-11.75 150.94,-18.75"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M187.06,-30.99C181.61,-40.06 190.51,-48.5 213.75,-48.5 226.82,-48.5 235.36,-45.83 239.35,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="242.93,-42.28 240.44,-31.99 235.96,-41.59 242.93,-42.28"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.5 KiB

3
d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.map
View File

@@ -1,3 +1,4 @@
<map id="binary_search_tree::contains" name="binary_search_tree::contains">
<area shape="rect" id="node1" title="Check if a value is in the BST." alt="" coords="5,29,137,70"/>
<area shape="rect" id="Node000001" title="Check if a value is in the BST." alt="" coords="5,29,137,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,92,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
</map>

2
d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.md5
View File

@@ -1 +1 @@
9e3ee954ef6edefe61109234f91ccee8
28674d48e1c2e722423b179c61936ff5

34
d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::contains Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::contains</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Check if a value is in the BST.">
<g id="a_Node000001"><a xlink:title="Check if a value is in the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
@@ -19,10 +29,28 @@
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.3 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

31
d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph_org.svg Normal file
View File

@@ -0,0 +1,31 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::contains Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" 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 52.5)">
<title>binary_search_tree::contains</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Check if a value is in the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.4 KiB

3
d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.map
View File

@@ -1,3 +1,4 @@
<map id="binary_search_tree::find_max" name="binary_search_tree::find_max">
<area shape="rect" id="node1" title="Recursive function to find the maximum value in the BST." alt="" coords="5,29,137,70"/>
<area shape="rect" id="Node000001" title="Recursive function to find the maximum value in the BST." alt="" coords="5,29,137,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,92,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
</map>

2
d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.md5
View File

@@ -1 +1 @@
4dfa5b4ecd335c5145298ccf36d619fe
8ffc926120dd3bf299ef6bde45a3269a

34
d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::find_max Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::find_max</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Recursive function to find the maximum value in the BST.">
<g id="a_Node000001"><a xlink:title="Recursive function to find the maximum value in the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
@@ -19,10 +29,28 @@
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.3 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

31
d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph_org.svg Normal file
View File

@@ -0,0 +1,31 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::find_max Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" 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 52.5)">
<title>binary_search_tree::find_max</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Recursive function to find the maximum value in the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.4 KiB

6
d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.map
View File

@@ -1,4 +1,6 @@
<map id="binary_search_tree::insert" name="binary_search_tree::insert">
<area shape="rect" id="node1" title="Insert a new value into the BST." alt="" coords="5,29,137,70"/>
<area shape="rect" id="node2" href="$d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" title="Recursive function to insert a value into the BST." alt="" coords="185,29,316,70"/>
<area shape="rect" id="Node000001" title="Insert a new value into the BST." alt="" coords="5,29,137,70"/>
<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" title="Recursive function to insert a value into the BST." alt="" coords="185,29,316,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,47,170,47,170,52,137,52"/>
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="216,29,214,19,220,10,232,5,250,3,270,5,282,12,279,16,269,10,250,8,234,10,223,14,220,20,221,28"/>
</map>

2
d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.md5
View File

@@ -1 +1 @@
26c53451f9da6894d988be1fb7421fb9
080e7b67ba287b77252c55e83a217f60

43
d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::insert Pages: 1 -->
<svg width="241pt" height="57pt"
viewBox="0.00 0.00 241.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::insert</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Insert a new value into the BST.">
<g id="a_Node000001"><a xlink:title="Insert a new value into the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
@@ -19,9 +29,9 @@
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
<polygon fill="white" stroke="#666666" points="233,-30.5 134.5,-30.5 134.5,0 233,0 233,-30.5"/>
<text text-anchor="start" x="142.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
@@ -29,16 +39,37 @@
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M98.84,-15.25C106.76,-15.25 115.04,-15.25 123.19,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="123.17,-18.75 133.17,-15.25 123.17,-11.75 123.17,-18.75"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M159.92,-30.99C155.05,-40.06 163,-48.5 183.75,-48.5 195.42,-48.5 203.04,-45.83 206.61,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="210.18,-42.26 207.58,-31.99 203.21,-41.64 210.18,-42.26"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 2.2 KiB

After

Width:  |  Height:  |  Size: 3.2 KiB

50
d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph_org.svg Normal file
View File

@@ -0,0 +1,50 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::insert Pages: 1 -->
<svg width="241pt" height="57pt"
viewBox="0.00 0.00 241.00 56.50" 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 52.5)">
<title>binary_search_tree::insert</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Insert a new value into the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778" target="_top" xlink:title="Recursive function to insert a value into the BST.">
<polygon fill="white" stroke="#666666" points="233,-30.5 134.5,-30.5 134.5,0 233,0 233,-30.5"/>
<text text-anchor="start" x="142.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M98.84,-15.25C106.76,-15.25 115.04,-15.25 123.19,-15.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="123.17,-18.75 133.17,-15.25 123.17,-11.75 123.17,-18.75"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M159.92,-30.99C155.05,-40.06 163,-48.5 183.75,-48.5 195.42,-48.5 203.04,-45.83 206.61,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="210.18,-42.26 207.58,-31.99 203.21,-41.64 210.18,-42.26"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 2.4 KiB

3
d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.map
View File

@@ -1,3 +1,4 @@
<map id="binary_search_tree::traverse_postorder" name="binary_search_tree::traverse_postorder">
<area shape="rect" id="node1" title="Recursive function to traverse the tree in post&#45;order order." alt="" coords="5,29,143,70"/>
<area shape="rect" id="Node000001" title="Recursive function to traverse the tree in post&#45;order order." alt="" coords="5,29,143,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="47,29,46,20,50,11,60,5,74,3,90,5,99,12,96,16,88,10,74,8,61,10,54,14,51,20,52,28"/>
</map>

2
d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.md5
View File

@@ -1 +1 @@
edb080d221cd5b62c48b3a4f78a6f3f0
6cb06dd2e2f53fad3f0f8f3b20452652

34
d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::traverse_postorder Pages: 1 -->
<svg width="111pt" height="57pt"
viewBox="0.00 0.00 111.00 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::traverse_postorder</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Recursive function to traverse the tree in post&#45;order order.">
<g id="a_Node000001"><a xlink:title="Recursive function to traverse the tree in post&#45;order order.">
<polygon fill="#999999" stroke="#666666" points="103,-30.5 0,-30.5 0,0 103,0 103,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_postorder</text>
@@ -19,10 +29,28 @@
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M33.25,-30.99C29.52,-40.06 35.61,-48.5 51.5,-48.5 60.44,-48.5 66.28,-45.83 69.01,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.56,-42.2 69.75,-31.99 65.58,-41.72 72.56,-42.2"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.4 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

31
d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph_org.svg Normal file
View File

@@ -0,0 +1,31 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::traverse_postorder Pages: 1 -->
<svg width="111pt" height="57pt"
viewBox="0.00 0.00 111.00 56.50" 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 52.5)">
<title>binary_search_tree::traverse_postorder</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Recursive function to traverse the tree in post&#45;order order.">
<polygon fill="#999999" stroke="#666666" points="103,-30.5 0,-30.5 0,0 103,0 103,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="51.5" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_postorder</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M33.25,-30.99C29.52,-40.06 35.61,-48.5 51.5,-48.5 60.44,-48.5 66.28,-45.83 69.01,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="72.56,-42.2 69.75,-31.99 65.58,-41.72 72.56,-42.2"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.5 KiB

13
d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.map
View File

@@ -1,6 +1,11 @@
<map id="binary_search_tree::remove" name="binary_search_tree::remove">
<area shape="rect" id="node1" title="Remove a specified value from the BST." alt="" coords="5,59,137,99"/>
<area shape="rect" id="node2" href="$d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153" title="Recursive function to remove a value from the BST." alt="" coords="185,59,316,99"/>
<area shape="rect" id="node3" href="$d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" title="Recursive function to find the maximum value in the BST." alt="" coords="364,29,495,70"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="390,94,469,120"/>
<area shape="rect" id="Node000001" title="Remove a specified value from the BST." alt="" coords="5,59,137,99"/>
<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153" title="Recursive function to remove a value from the BST." alt="" coords="185,59,316,99"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,76,170,76,170,82,137,82"/>
<area shape="poly" id="edge5_Node000002_Node000002" title=" " alt="" coords="216,59,214,49,220,40,232,34,250,32,270,35,282,41,279,46,269,40,250,37,234,39,223,44,220,50,221,58"/>
<area shape="rect" id="Node000003" href="$d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" title="Recursive function to find the maximum value in the BST." alt="" coords="364,29,495,70"/>
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="316,66,349,60,350,65,317,71"/>
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="390,94,469,120"/>
<area shape="poly" id="edge4_Node000002_Node000004" title=" " alt="" coords="317,87,376,96,375,101,316,92"/>
<area shape="poly" id="edge3_Node000003_Node000003" title=" " alt="" coords="395,29,394,19,399,10,411,5,430,3,450,5,461,12,459,16,448,10,430,8,413,10,403,14,399,20,401,28"/>
</map>

2
d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.md5
View File

@@ -1 +1 @@
954a712b31da91f9801f3973666332be
57246ae55ac34f923eacdd7a9b26c28d

66
d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::remove Pages: 1 -->
<svg width="376pt" height="94pt"
viewBox="0.00 0.00 375.50 93.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.88)">
<title>binary_search_tree::remove</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Remove a specified value from the BST.">
<g id="a_Node000001"><a xlink:title="Remove a specified value from the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-45.88 0,-45.88 0,-15.37 98.5,-15.37 98.5,-45.88"/>
<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
@@ -19,9 +29,9 @@
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153" target="_top" xlink:title="Recursive function to remove a value from the BST.">
<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153" target="_top" xlink:title="Recursive function to remove a value from the BST.">
<polygon fill="white" stroke="#666666" points="233,-45.88 134.5,-45.88 134.5,-15.37 233,-15.37 233,-45.88"/>
<text text-anchor="start" x="142.5" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="183.75" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
@@ -29,21 +39,27 @@
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M98.84,-30.62C106.76,-30.62 115.04,-30.62 123.19,-30.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="123.17,-34.13 133.17,-30.62 123.17,-27.13 123.17,-34.13"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge5" class="edge">
<g id="edge5_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge5_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M159.92,-46.36C155.05,-55.43 163,-63.88 183.75,-63.88 195.42,-63.88 203.04,-61.2 206.61,-57.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="210.18,-57.63 207.58,-47.36 203.21,-57.01 210.18,-57.63"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
<polygon fill="white" stroke="#666666" points="367.5,-67.88 269,-67.88 269,-37.38 367.5,-37.38 367.5,-67.88"/>
<text text-anchor="start" x="277" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="318.25" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
@@ -51,31 +67,55 @@
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M233.34,-38.69C241.35,-40.02 249.73,-41.41 257.97,-42.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="257.23,-46.37 267.67,-44.56 258.38,-39.47 257.23,-46.37"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="348,-19.25 288.5,-19.25 288.5,0 348,0 348,-19.25"/>
<text text-anchor="middle" x="318.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge4" class="edge">
<g id="edge4_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M233.34,-22.92C247.91,-20.62 263.7,-18.11 277.62,-15.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="277.99,-19.23 287.32,-14.21 276.9,-12.32 277.99,-19.23"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge3" class="edge">
<g id="edge3_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M294.42,-68.36C289.55,-77.43 297.5,-85.88 318.25,-85.88 329.92,-85.88 337.54,-83.2 341.11,-79.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="344.68,-79.63 342.08,-69.36 337.71,-79.01 344.68,-79.63"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 4.2 KiB

After

Width:  |  Height:  |  Size: 5.5 KiB

96
d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph_org.svg Normal file
View File

@@ -0,0 +1,96 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::remove Pages: 1 -->
<svg width="376pt" height="94pt"
viewBox="0.00 0.00 375.50 93.88" 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 89.88)">
<title>binary_search_tree::remove</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Remove a specified value from the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-45.88 0,-45.88 0,-15.37 98.5,-15.37 98.5,-45.88"/>
<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153" target="_top" xlink:title="Recursive function to remove a value from the BST.">
<polygon fill="white" stroke="#666666" points="233,-45.88 134.5,-45.88 134.5,-15.37 233,-15.37 233,-45.88"/>
<text text-anchor="start" x="142.5" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="183.75" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M98.84,-30.62C106.76,-30.62 115.04,-30.62 123.19,-30.62"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="123.17,-34.13 133.17,-30.62 123.17,-27.13 123.17,-34.13"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge5_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge5_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M159.92,-46.36C155.05,-55.43 163,-63.88 183.75,-63.88 195.42,-63.88 203.04,-61.2 206.61,-57.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="210.18,-57.63 207.58,-47.36 203.21,-57.01 210.18,-57.63"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
<polygon fill="white" stroke="#666666" points="367.5,-67.88 269,-67.88 269,-37.38 367.5,-37.38 367.5,-67.88"/>
<text text-anchor="start" x="277" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="318.25" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2_Node000002_Node000003" class="edge">
<title>Node2&#45;&gt;Node3</title>
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M233.34,-38.69C241.35,-40.02 249.73,-41.41 257.97,-42.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="257.23,-46.37 267.67,-44.56 258.38,-39.47 257.23,-46.37"/>
</a>
</g>
</g>
<!-- Node4 -->
<g id="Node000004" class="node">
<title>Node4</title>
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="348,-19.25 288.5,-19.25 288.5,0 348,0 348,-19.25"/>
<text text-anchor="middle" x="318.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge4_Node000002_Node000004" class="edge">
<title>Node2&#45;&gt;Node4</title>
<g id="a_edge4_Node000002_Node000004"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M233.34,-22.92C247.91,-20.62 263.7,-18.11 277.62,-15.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="277.99,-19.23 287.32,-14.21 276.9,-12.32 277.99,-19.23"/>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node3 -->
<g id="edge3_Node000003_Node000003" class="edge">
<title>Node3&#45;&gt;Node3</title>
<g id="a_edge3_Node000003_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M294.42,-68.36C289.55,-77.43 297.5,-85.88 318.25,-85.88 329.92,-85.88 337.54,-83.2 341.11,-79.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="344.68,-79.63 342.08,-69.36 337.71,-79.01 344.68,-79.63"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 4.7 KiB

3
d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.map
View File

@@ -1,3 +1,4 @@
<map id="binary_search_tree::insert" name="binary_search_tree::insert">
<area shape="rect" id="node1" title="Recursive function to insert a value into the BST." alt="" coords="5,29,137,70"/>
<area shape="rect" id="Node000001" title="Recursive function to insert a value into the BST." alt="" coords="5,29,137,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,92,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
</map>

2
d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.md5
View File

@@ -1 +1 @@
e15a5fbcc498b9c10148ed228ee30360
a2b315f8c7f44346f4bd6c9569afa64c

34
d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::insert Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::insert</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Recursive function to insert a value into the BST.">
<g id="a_Node000001"><a xlink:title="Recursive function to insert a value into the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
@@ -19,10 +29,28 @@
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.3 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

31
d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph_org.svg Normal file
View File

@@ -0,0 +1,31 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::insert Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" 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 52.5)">
<title>binary_search_tree::insert</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Recursive function to insert a value into the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.4 KiB

3
d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.map
View File

@@ -1,3 +1,4 @@
<map id="binary_search_tree::contains" name="binary_search_tree::contains">
<area shape="rect" id="node1" title="Recursive function to check if a value is in the BST." alt="" coords="5,29,137,70"/>
<area shape="rect" id="Node000001" title="Recursive function to check if a value is in the BST." alt="" coords="5,29,137,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,92,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
</map>

2
d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.md5
View File

@@ -1 +1 @@
5786325c14a1034ec33b5e7474c4e16d
653e50a907d5cc12636be440c9003711

34
d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::contains Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::contains</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Recursive function to check if a value is in the BST.">
<g id="a_Node000001"><a xlink:title="Recursive function to check if a value is in the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
@@ -19,10 +29,28 @@
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.3 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

31
d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph_org.svg Normal file
View File

@@ -0,0 +1,31 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::contains Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" 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 52.5)">
<title>binary_search_tree::contains</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Recursive function to check if a value is in the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::contains</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.4 KiB

3
d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.map
View File

@@ -1,3 +1,4 @@
<map id="binary_search_tree::traverse_preorder" name="binary_search_tree::traverse_preorder">
<area shape="rect" id="node1" title="Recursive function to traverse the tree in pre&#45;order order." alt="" coords="5,29,137,70"/>
<area shape="rect" id="Node000001" title="Recursive function to traverse the tree in pre&#45;order order." alt="" coords="5,29,137,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,92,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
</map>

2
d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.md5
View File

@@ -1 +1 @@
befa31cc939b733eaeb424e0f5276cb2
a3a9f2348cd097efdd9727e6a854905b

34
d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::traverse_preorder Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::traverse_preorder</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Recursive function to traverse the tree in pre&#45;order order.">
<g id="a_Node000001"><a xlink:title="Recursive function to traverse the tree in pre&#45;order order.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_preorder</text>
@@ -19,10 +29,28 @@
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.4 KiB

After

Width:  |  Height:  |  Size: 2.3 KiB

31
d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph_org.svg Normal file
View File

@@ -0,0 +1,31 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::traverse_preorder Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" 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 52.5)">
<title>binary_search_tree::traverse_preorder</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Recursive function to traverse the tree in pre&#45;order order.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::traverse_preorder</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.5 KiB

3
d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.map
View File

@@ -1,3 +1,4 @@
<map id="binary_search_tree::find_min" name="binary_search_tree::find_min">
<area shape="rect" id="node1" title="Find the smallest value in the BST." alt="" coords="5,29,137,70"/>
<area shape="rect" id="Node000001" title="Find the smallest value in the BST." alt="" coords="5,29,137,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,92,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
</map>

2
d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.md5
View File

@@ -1 +1 @@
b888dad884cc14fcc4b5755e1848a504
2fbc10be889a7c7f43f67501e4067ad9

34
d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::find_min Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::find_min</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Find the smallest value in the BST.">
<g id="a_Node000001"><a xlink:title="Find the smallest value in the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
@@ -19,10 +29,28 @@
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.3 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

31
d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph_org.svg Normal file
View File

@@ -0,0 +1,31 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::find_min Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" 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 52.5)">
<title>binary_search_tree::find_min</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Find the smallest value in the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.4 KiB

10
d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.map
View File

@@ -1,5 +1,9 @@
<map id="binary_search_tree::remove" name="binary_search_tree::remove">
<area shape="rect" id="node1" title="Recursive function to remove a value from the BST." alt="" coords="5,59,137,99"/>
<area shape="rect" id="node2" href="$d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" title="Recursive function to find the maximum value in the BST." alt="" coords="185,29,316,70"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="211,94,290,120"/>
<area shape="rect" id="Node000001" title="Recursive function to remove a value from the BST." alt="" coords="5,59,137,99"/>
<area shape="poly" id="edge4_Node000001_Node000001" title=" " alt="" coords="37,59,35,49,41,40,53,34,71,32,91,35,103,41,100,46,89,40,71,37,54,39,44,44,40,50,42,58"/>
<area shape="rect" id="Node000002" href="$d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" title="Recursive function to find the maximum value in the BST." alt="" coords="185,29,316,70"/>
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="137,66,170,60,170,65,138,71"/>
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/utility/move.html#" title=" " alt="" coords="211,94,290,120"/>
<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="138,87,197,96,196,101,137,92"/>
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="216,29,214,19,220,10,232,5,250,3,270,5,282,12,279,16,269,10,250,8,234,10,223,14,220,20,221,28"/>
</map>

2
d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.md5
View File

@@ -1 +1 @@
bd0d41a933b42d57f5864c4658094d65
755986238065a3a12feb3908e83fef59

57
d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::remove Pages: 1 -->
<svg width="241pt" height="94pt"
viewBox="0.00 0.00 241.00 93.88" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 89.88)">
<title>binary_search_tree::remove</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Recursive function to remove a value from the BST.">
<g id="a_Node000001"><a xlink:title="Recursive function to remove a value from the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-45.88 0,-45.88 0,-15.37 98.5,-15.37 98.5,-45.88"/>
<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
@@ -19,15 +29,18 @@
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge4" class="edge">
<g id="edge4_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M25.42,-46.36C20.55,-55.43 28.5,-63.88 49.25,-63.88 60.92,-63.88 68.54,-61.2 72.11,-57.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.68,-57.63 73.08,-47.36 68.71,-57.01 75.68,-57.63"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
<polygon fill="white" stroke="#666666" points="233,-67.88 134.5,-67.88 134.5,-37.38 233,-37.38 233,-67.88"/>
<text text-anchor="start" x="142.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="183.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
@@ -35,31 +48,55 @@
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M98.84,-38.69C106.85,-40.02 115.23,-41.41 123.47,-42.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="122.73,-46.37 133.17,-44.56 123.88,-39.47 122.73,-46.37"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="213.5,-19.25 154,-19.25 154,0 213.5,0 213.5,-19.25"/>
<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge3" class="edge">
<g id="edge3_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M98.84,-22.92C113.41,-20.62 129.2,-18.11 143.12,-15.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="143.49,-19.23 152.82,-14.21 142.4,-12.32 143.49,-19.23"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2" class="edge">
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M159.92,-68.36C155.05,-77.43 163,-85.88 183.75,-85.88 195.42,-85.88 203.04,-83.2 206.61,-79.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="210.18,-79.63 207.58,-69.36 203.21,-79.01 210.18,-79.63"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 3.3 KiB

After

Width:  |  Height:  |  Size: 4.5 KiB

77
d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph_org.svg Normal file
View File

@@ -0,0 +1,77 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::remove Pages: 1 -->
<svg width="241pt" height="94pt"
viewBox="0.00 0.00 241.00 93.88" 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 89.88)">
<title>binary_search_tree::remove</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Recursive function to remove a value from the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-45.88 0,-45.88 0,-15.37 98.5,-15.37 98.5,-45.88"/>
<text text-anchor="start" x="8" y="-32.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-21.12" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge4_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge4_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M25.42,-46.36C20.55,-55.43 28.5,-63.88 49.25,-63.88 60.92,-63.88 68.54,-61.2 72.11,-57.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.68,-57.63 73.08,-47.36 68.71,-57.01 75.68,-57.63"/>
</a>
</g>
</g>
<!-- Node2 -->
<g id="Node000002" class="node">
<title>Node2</title>
<g id="a_Node000002"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
<polygon fill="white" stroke="#666666" points="233,-67.88 134.5,-67.88 134.5,-37.38 233,-37.38 233,-67.88"/>
<text text-anchor="start" x="142.5" y="-54.38" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="183.75" y="-43.12" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1_Node000001_Node000002" class="edge">
<title>Node1&#45;&gt;Node2</title>
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M98.84,-38.69C106.85,-40.02 115.23,-41.41 123.47,-42.78"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="122.73,-46.37 133.17,-44.56 123.88,-39.47 122.73,-46.37"/>
</a>
</g>
</g>
<!-- Node3 -->
<g id="Node000003" class="node">
<title>Node3</title>
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
<polygon fill="white" stroke="#666666" points="213.5,-19.25 154,-19.25 154,0 213.5,0 213.5,-19.25"/>
<text text-anchor="middle" x="183.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge3_Node000001_Node000003" class="edge">
<title>Node1&#45;&gt;Node3</title>
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M98.84,-22.92C113.41,-20.62 129.2,-18.11 143.12,-15.91"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="143.49,-19.23 152.82,-14.21 142.4,-12.32 143.49,-19.23"/>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node2 -->
<g id="edge2_Node000002_Node000002" class="edge">
<title>Node2&#45;&gt;Node2</title>
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M159.92,-68.36C155.05,-77.43 163,-85.88 183.75,-85.88 195.42,-85.88 203.04,-83.2 206.61,-79.25"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="210.18,-79.63 207.58,-69.36 203.21,-79.01 210.18,-79.63"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.7 KiB

3
d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.map
View File

@@ -1,3 +1,4 @@
<map id="binary_search_tree::find_min" name="binary_search_tree::find_min">
<area shape="rect" id="node1" title="Recursive function to find the minimum value in the BST." alt="" coords="5,29,137,70"/>
<area shape="rect" id="Node000001" title="Recursive function to find the minimum value in the BST." alt="" coords="5,29,137,70"/>
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="45,29,44,20,48,11,57,5,71,3,86,5,95,12,92,16,84,10,71,8,59,10,52,14,49,20,50,28"/>
</map>

2
d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.md5
View File

@@ -1 +1 @@
8315830451c401effa1f1f35c4b30af2
b1e8a77cfcc4494204bfe90be1f5755e

34
d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.svg
View File

@@ -6,12 +6,22 @@
<!-- Title: binary_search_tree::find_min Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.node, .edge {opacity: 0.7;}
.node.selected, .edge.selected {opacity: 1;}
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
<svg id="graph" class="graph">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 52.5)">
<title>binary_search_tree::find_min</title>
<!-- Node1 -->
<g id="node1" class="node">
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Recursive function to find the minimum value in the BST.">
<g id="a_Node000001"><a xlink:title="Recursive function to find the minimum value in the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
@@ -19,10 +29,28 @@
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
</svg>
<style type='text/css'>
<![CDATA[
[data-mouse-over-selected='false'] { opacity: 0.7; }
[data-mouse-over-selected='true'] { opacity: 1.0; }
]]>
</style>
<script type="application/ecmascript"><![CDATA[
document.addEventListener('DOMContentLoaded', (event) => {
highlightEdges();
highlightAdjacentNodes();
});
]]></script>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 1.3 KiB

After

Width:  |  Height:  |  Size: 2.2 KiB

31
d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph_org.svg Normal file
View File

@@ -0,0 +1,31 @@
<?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 8.0.5 (20230430.1635)
-->
<!-- Title: binary_search_tree::find_min Pages: 1 -->
<svg width="107pt" height="57pt"
viewBox="0.00 0.00 106.50 56.50" 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 52.5)">
<title>binary_search_tree::find_min</title>
<!-- Node1 -->
<g id="Node000001" class="node">
<title>Node1</title>
<g id="a_Node000001"><a xlink:title="Recursive function to find the minimum value in the BST.">
<polygon fill="#999999" stroke="#666666" points="98.5,-30.5 0,-30.5 0,0 98.5,0 98.5,-30.5"/>
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
<text text-anchor="middle" x="49.25" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::find_min</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1_Node000001_Node000001" class="edge">
<title>Node1&#45;&gt;Node1</title>
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
<path fill="none" stroke="#63b8ff" d="M31.8,-30.99C28.23,-40.06 34.05,-48.5 49.25,-48.5 57.8,-48.5 63.38,-45.83 65.99,-41.88"/>
<polygon fill="#63b8ff" stroke="#63b8ff" points="69.55,-42.19 66.7,-31.99 62.56,-41.74 69.55,-42.19"/>
</a>
</g>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.4 KiB

6
d9/dde/structdouble__hashing_1_1_entry.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="generator" content="Doxygen 1.9.7"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: double_hashing::Entry Struct Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.6 -->
<!-- Generated by Doxygen 1.9.7 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -130,7 +130,7 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>key</b></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d0/d65/namespacedouble__hashing.html">double_hashing</a></li><li class="navelem"><a class="el" href="../../d9/dde/structdouble__hashing_1_1_entry.html">Entry</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.6 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.7 </li>
</ul>
</div>
</body>