mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 12:23:13 +08:00
Documentation for c26eea874d
This commit is contained in:
realstealthninja
@@ -4,7 +4,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.12.0"/>
|
||||
<meta name="generator" content="Doxygen 1.13.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>TheAlgorithms/C++: data_structures/binary_search_tree2.cpp Source File</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
@@ -60,7 +60,7 @@ window.MathJax = {
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.12.0 -->
|
||||
<!-- Generated by Doxygen 1.13.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
@@ -124,26 +124,28 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="headertitle"><div class="title">binary_search_tree2.cpp</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<a href="../../df/d42/binary__search__tree2_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span> </div>
|
||||
<a href="../../df/d42/binary__search__tree2_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span></div>
|
||||
<div class="line"><a id="l00007" name="l00007"></a><span class="lineno"> 7</span> </div>
|
||||
<div class="line"><a id="l00008" name="l00008"></a><span class="lineno"> 8</span><span class="preprocessor">#include <cassert></span></div>
|
||||
<div class="line"><a id="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="preprocessor">#include <functional></span></div>
|
||||
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span><span class="preprocessor">#include <iostream></span></div>
|
||||
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"> 11</span><span class="preprocessor">#include <memory></span></div>
|
||||
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span><span class="preprocessor">#include <vector></span></div>
|
||||
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> </div>
|
||||
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span></div>
|
||||
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span><span class="keyword">template</span> <<span class="keyword">class</span> T></div>
|
||||
<div class="foldopen" id="foldopen00020" data-start="{" data-end="};">
|
||||
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html"> 20</a></span><span class="keyword">class </span><a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a> {</div>
|
||||
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html"> 20</a></span><span class="keyword">class </span><a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6">binary_search_tree</a> {</div>
|
||||
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> <span class="keyword">private</span>:</div>
|
||||
<div class="foldopen" id="foldopen00025" data-start="{" data-end="};">
|
||||
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html"> 25</a></span> <span class="keyword">struct </span><a class="code hl_struct" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> {</div>
|
||||
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"><a class="line" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html"> 25</a></span> <span class="keyword">struct </span><a class="code hl_function" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778">bst_node</a> {</div>
|
||||
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"><a class="line" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29"> 26</a></span> T <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29">value</a>; </div>
|
||||
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"><a class="line" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788"> 27</a></span> std::unique_ptr<bst_node> <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788">left</a>; </div>
|
||||
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df"> 28</a></span> std::unique_ptr<bst_node> <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df">right</a>; </div>
|
||||
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span></div>
|
||||
<div class="foldopen" id="foldopen00035" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"><a class="line" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778"> 35</a></span> <span class="keyword">explicit</span> <a class="code hl_function" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778">bst_node</a>(T _value) {</div>
|
||||
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29">value</a> = _value;</div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> left = <span class="keyword">nullptr</span>;</div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788">left</a> = <span class="keyword">nullptr</span>;</div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df">right</a> = <span class="keyword">nullptr</span>;</div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> }</div>
|
||||
</div>
|
||||
@@ -152,6 +154,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> </div>
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50"> 42</a></span> std::unique_ptr<bst_node> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>; </div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc"> 43</a></span> std::size_t <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a> = 0; </div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span></div>
|
||||
<div class="foldopen" id="foldopen00053" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb"> 53</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(std::unique_ptr<bst_node>& <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, T& ret_value) {</div>
|
||||
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
||||
@@ -163,7 +166,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00060" name="l00060"></a><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>->right, ret_value);</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> </div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span></div>
|
||||
<div class="foldopen" id="foldopen00071" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153"> 71</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(std::unique_ptr<bst_node>& <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, T& ret_value) {</div>
|
||||
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
||||
@@ -176,7 +179,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00079" name="l00079"></a><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>->left, ret_value);</div>
|
||||
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> </div>
|
||||
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span></div>
|
||||
<div class="foldopen" id="foldopen00090" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778"> 90</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(std::unique_ptr<bst_node>& <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, T new_value) {</div>
|
||||
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> == <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> && !<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
|
||||
@@ -204,7 +207,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> }</div>
|
||||
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> </div>
|
||||
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span></div>
|
||||
<div class="foldopen" id="foldopen00125" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153"> 125</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(std::unique_ptr<bst_node>& parent,</div>
|
||||
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> std::unique_ptr<bst_node>& <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, T rm_value) {</div>
|
||||
@@ -250,7 +253,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> }</div>
|
||||
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> </div>
|
||||
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span></div>
|
||||
<div class="foldopen" id="foldopen00177" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00177" name="l00177"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2"> 177</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(std::unique_ptr<bst_node>& <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, T value) {</div>
|
||||
<div class="line"><a id="l00178" name="l00178"></a><span class="lineno"> 178</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
||||
@@ -266,7 +269,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00188" name="l00188"></a><span class="lineno"> 188</span> }</div>
|
||||
<div class="line"><a id="l00189" name="l00189"></a><span class="lineno"> 189</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span> </div>
|
||||
<div class="line"><a id="l00190" name="l00190"></a><span class="lineno"> 190</span></div>
|
||||
<div class="foldopen" id="foldopen00197" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00197" name="l00197"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd"> 197</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(std::function<<span class="keywordtype">void</span>(T)> callback,</div>
|
||||
<div class="line"><a id="l00198" name="l00198"></a><span class="lineno"> 198</span> std::unique_ptr<bst_node>& <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
||||
@@ -279,7 +282,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00205" name="l00205"></a><span class="lineno"> 205</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right);</div>
|
||||
<div class="line"><a id="l00206" name="l00206"></a><span class="lineno"> 206</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span> </div>
|
||||
<div class="line"><a id="l00207" name="l00207"></a><span class="lineno"> 207</span></div>
|
||||
<div class="foldopen" id="foldopen00214" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00214" name="l00214"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1"> 214</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(std::function<<span class="keywordtype">void</span>(T)> callback,</div>
|
||||
<div class="line"><a id="l00215" name="l00215"></a><span class="lineno"> 215</span> std::unique_ptr<bst_node>& <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
||||
@@ -292,7 +295,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00222" name="l00222"></a><span class="lineno"> 222</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right);</div>
|
||||
<div class="line"><a id="l00223" name="l00223"></a><span class="lineno"> 223</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span> </div>
|
||||
<div class="line"><a id="l00224" name="l00224"></a><span class="lineno"> 224</span></div>
|
||||
<div class="foldopen" id="foldopen00231" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00231" name="l00231"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362"> 231</a></span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(std::function<<span class="keywordtype">void</span>(T)> callback,</div>
|
||||
<div class="line"><a id="l00232" name="l00232"></a><span class="lineno"> 232</span> std::unique_ptr<bst_node>& <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
||||
@@ -313,7 +316,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00249" name="l00249"></a><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"><a id="l00250" name="l00250"></a><span class="lineno"> 250</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span> </div>
|
||||
<div class="line"><a id="l00251" name="l00251"></a><span class="lineno"> 251</span></div>
|
||||
<div class="foldopen" id="foldopen00259" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00259" name="l00259"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0"> 259</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0">insert</a>(T new_value) {</div>
|
||||
<div class="line"><a id="l00260" name="l00260"></a><span class="lineno"> 260</span> <span class="keywordtype">bool</span> result = <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, new_value);</div>
|
||||
@@ -323,7 +326,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00264" name="l00264"></a><span class="lineno"> 264</span> <span class="keywordflow">return</span> result;</div>
|
||||
<div class="line"><a id="l00265" name="l00265"></a><span class="lineno"> 265</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span> </div>
|
||||
<div class="line"><a id="l00266" name="l00266"></a><span class="lineno"> 266</span></div>
|
||||
<div class="foldopen" id="foldopen00274" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00274" name="l00274"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb"> 274</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb">remove</a>(T rm_value) {</div>
|
||||
<div class="line"><a id="l00275" name="l00275"></a><span class="lineno"> 275</span> <span class="keywordtype">bool</span> result = <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, rm_value);</div>
|
||||
@@ -333,15 +336,15 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00279" name="l00279"></a><span class="lineno"> 279</span> <span class="keywordflow">return</span> result;</div>
|
||||
<div class="line"><a id="l00280" name="l00280"></a><span class="lineno"> 280</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span> </div>
|
||||
<div class="line"><a id="l00281" name="l00281"></a><span class="lineno"> 281</span></div>
|
||||
<div class="line"><a id="l00289" name="l00289"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63"> 289</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63">contains</a>(T value) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63">contains</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, value); }</div>
|
||||
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span> </div>
|
||||
<div class="line"><a id="l00290" name="l00290"></a><span class="lineno"> 290</span></div>
|
||||
<div class="line"><a id="l00298" name="l00298"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03"> 298</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03">find_min</a>(T& ret_value) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03">find_min</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, ret_value); }</div>
|
||||
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span> </div>
|
||||
<div class="line"><a id="l00299" name="l00299"></a><span class="lineno"> 299</span></div>
|
||||
<div class="line"><a id="l00307" name="l00307"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0"> 307</a></span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0">find_max</a>(T& ret_value) { <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0">find_max</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, ret_value); }</div>
|
||||
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span> </div>
|
||||
<div class="line"><a id="l00308" name="l00308"></a><span class="lineno"> 308</span></div>
|
||||
<div class="line"><a id="l00314" name="l00314"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3"> 314</a></span> std::size_t <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() { <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>; }</div>
|
||||
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span> </div>
|
||||
<div class="line"><a id="l00315" name="l00315"></a><span class="lineno"> 315</span></div>
|
||||
<div class="foldopen" id="foldopen00321" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00321" name="l00321"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a"> 321</a></span> std::vector<T> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">get_elements_inorder</a>() {</div>
|
||||
<div class="line"><a id="l00322" name="l00322"></a><span class="lineno"> 322</span> std::vector<T> result;</div>
|
||||
@@ -350,7 +353,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00325" name="l00325"></a><span class="lineno"> 325</span> <span class="keywordflow">return</span> result;</div>
|
||||
<div class="line"><a id="l00326" name="l00326"></a><span class="lineno"> 326</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span> </div>
|
||||
<div class="line"><a id="l00327" name="l00327"></a><span class="lineno"> 327</span></div>
|
||||
<div class="foldopen" id="foldopen00333" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00333" name="l00333"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13"> 333</a></span> std::vector<T> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13">get_elements_preorder</a>() {</div>
|
||||
<div class="line"><a id="l00334" name="l00334"></a><span class="lineno"> 334</span> std::vector<T> result;</div>
|
||||
@@ -359,7 +362,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00337" name="l00337"></a><span class="lineno"> 337</span> <span class="keywordflow">return</span> result;</div>
|
||||
<div class="line"><a id="l00338" name="l00338"></a><span class="lineno"> 338</span> }</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span> </div>
|
||||
<div class="line"><a id="l00339" name="l00339"></a><span class="lineno"> 339</span></div>
|
||||
<div class="foldopen" id="foldopen00345" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00345" name="l00345"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff"> 345</a></span> std::vector<T> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff">get_elements_postorder</a>() {</div>
|
||||
<div class="line"><a id="l00346" name="l00346"></a><span class="lineno"> 346</span> std::vector<T> result;</div>
|
||||
@@ -370,7 +373,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
</div>
|
||||
<div class="line"><a id="l00351" name="l00351"></a><span class="lineno"> 351</span>};</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span> </div>
|
||||
<div class="line"><a id="l00352" name="l00352"></a><span class="lineno"> 352</span></div>
|
||||
<div class="foldopen" id="foldopen00358" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00358" name="l00358"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350"> 358</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350">test_insert</a>() {</div>
|
||||
<div class="line"><a id="l00359" name="l00359"></a><span class="lineno"> 359</span> std::cout << <span class="stringliteral">"Testing BST insert..."</span>;</div>
|
||||
@@ -401,7 +404,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00384" name="l00384"></a><span class="lineno"> 384</span> std::cout << <span class="stringliteral">"ok"</span> << std::endl;</div>
|
||||
<div class="line"><a id="l00385" name="l00385"></a><span class="lineno"> 385</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span> </div>
|
||||
<div class="line"><a id="l00386" name="l00386"></a><span class="lineno"> 386</span></div>
|
||||
<div class="foldopen" id="foldopen00392" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00392" name="l00392"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e"> 392</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">test_remove</a>() {</div>
|
||||
<div class="line"><a id="l00393" name="l00393"></a><span class="lineno"> 393</span> std::cout << <span class="stringliteral">"Testing BST remove..."</span>;</div>
|
||||
@@ -435,7 +438,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00421" name="l00421"></a><span class="lineno"> 421</span> std::cout << <span class="stringliteral">"ok"</span> << std::endl;</div>
|
||||
<div class="line"><a id="l00422" name="l00422"></a><span class="lineno"> 422</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span> </div>
|
||||
<div class="line"><a id="l00423" name="l00423"></a><span class="lineno"> 423</span></div>
|
||||
<div class="foldopen" id="foldopen00429" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00429" name="l00429"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3"> 429</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3">test_contains</a>() {</div>
|
||||
<div class="line"><a id="l00430" name="l00430"></a><span class="lineno"> 430</span> std::cout << <span class="stringliteral">"Testing BST contains..."</span>;</div>
|
||||
@@ -455,7 +458,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00444" name="l00444"></a><span class="lineno"> 444</span> std::cout << <span class="stringliteral">"ok"</span> << std::endl;</div>
|
||||
<div class="line"><a id="l00445" name="l00445"></a><span class="lineno"> 445</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span> </div>
|
||||
<div class="line"><a id="l00446" name="l00446"></a><span class="lineno"> 446</span></div>
|
||||
<div class="foldopen" id="foldopen00452" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00452" name="l00452"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4"> 452</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4">test_find_min</a>() {</div>
|
||||
<div class="line"><a id="l00453" name="l00453"></a><span class="lineno"> 453</span> std::cout << <span class="stringliteral">"Testing BST find_min..."</span>;</div>
|
||||
@@ -475,7 +478,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00467" name="l00467"></a><span class="lineno"> 467</span> std::cout << <span class="stringliteral">"ok"</span> << std::endl;</div>
|
||||
<div class="line"><a id="l00468" name="l00468"></a><span class="lineno"> 468</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span> </div>
|
||||
<div class="line"><a id="l00469" name="l00469"></a><span class="lineno"> 469</span></div>
|
||||
<div class="foldopen" id="foldopen00475" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00475" name="l00475"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365"> 475</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365">test_find_max</a>() {</div>
|
||||
<div class="line"><a id="l00476" name="l00476"></a><span class="lineno"> 476</span> std::cout << <span class="stringliteral">"Testing BST find_max..."</span>;</div>
|
||||
@@ -495,7 +498,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00490" name="l00490"></a><span class="lineno"> 490</span> std::cout << <span class="stringliteral">"ok"</span> << std::endl;</div>
|
||||
<div class="line"><a id="l00491" name="l00491"></a><span class="lineno"> 491</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span> </div>
|
||||
<div class="line"><a id="l00492" name="l00492"></a><span class="lineno"> 492</span></div>
|
||||
<div class="foldopen" id="foldopen00498" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00498" name="l00498"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e"> 498</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e">test_get_elements_inorder</a>() {</div>
|
||||
<div class="line"><a id="l00499" name="l00499"></a><span class="lineno"> 499</span> std::cout << <span class="stringliteral">"Testing BST get_elements_inorder..."</span>;</div>
|
||||
@@ -513,7 +516,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00511" name="l00511"></a><span class="lineno"> 511</span> std::cout << <span class="stringliteral">"ok"</span> << std::endl;</div>
|
||||
<div class="line"><a id="l00512" name="l00512"></a><span class="lineno"> 512</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span> </div>
|
||||
<div class="line"><a id="l00513" name="l00513"></a><span class="lineno"> 513</span></div>
|
||||
<div class="foldopen" id="foldopen00519" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00519" name="l00519"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a"> 519</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a">test_get_elements_preorder</a>() {</div>
|
||||
<div class="line"><a id="l00520" name="l00520"></a><span class="lineno"> 520</span> std::cout << <span class="stringliteral">"Testing BST get_elements_preorder..."</span>;</div>
|
||||
@@ -531,7 +534,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div class="line"><a id="l00532" name="l00532"></a><span class="lineno"> 532</span> std::cout << <span class="stringliteral">"ok"</span> << std::endl;</div>
|
||||
<div class="line"><a id="l00533" name="l00533"></a><span class="lineno"> 533</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span> </div>
|
||||
<div class="line"><a id="l00534" name="l00534"></a><span class="lineno"> 534</span></div>
|
||||
<div class="foldopen" id="foldopen00540" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00540" name="l00540"></a><span class="lineno"><a class="line" href="../../df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965"> 540</a></span><span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965">test_get_elements_postorder</a>() {</div>
|
||||
<div class="line"><a id="l00541" name="l00541"></a><span class="lineno"> 541</span> std::cout << <span class="stringliteral">"Testing BST get_elements_postorder..."</span>;</div>
|
||||
@@ -602,7 +605,7 @@ $(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../df/d42/binary__search__tree2_8cpp.html">binary_search_tree2.cpp</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.12.0 </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.13.2 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
|
||||
Reference in New Issue
Block a user