mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-21 20:31:43 +08:00
606 lines
99 KiB
HTML
606 lines
99 KiB
HTML
<!-- HTML header for doxygen 1.12.0-->
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
|
<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.14.0"/>
|
|
<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" />
|
|
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../jquery.js"></script>
|
|
<script type="text/javascript" src="../../dynsections.js"></script>
|
|
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
|
<script type="text/javascript">
|
|
DoxygenAwesomeDarkModeToggle.init()
|
|
</script>
|
|
<script type="text/javascript" src="../../clipboard.js"></script>
|
|
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../navtreedata.js"></script>
|
|
<script type="text/javascript" src="../../navtree.js"></script>
|
|
<script type="text/javascript" src="../../cookie.js"></script>
|
|
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
|
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
|
<script type="text/javascript" src="../../search/search.js"></script>
|
|
<script type="text/javascript">
|
|
window.MathJax = {
|
|
options: {
|
|
ignoreHtmlClass: 'tex2jax_ignore',
|
|
processHtmlClass: 'tex2jax_process'
|
|
},
|
|
loader: {
|
|
load: ['[tex]/ams']
|
|
},
|
|
tex: {
|
|
macros: {},
|
|
packages: ['base','configmacros','ams']
|
|
}
|
|
};
|
|
</script>
|
|
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
|
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
|
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
|
</head>
|
|
<body>
|
|
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
|
<div id="titlearea">
|
|
<table cellspacing="0" cellpadding="0">
|
|
<tbody>
|
|
<tr id="projectrow">
|
|
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
|
<td id="projectalign">
|
|
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
|
</div>
|
|
<div id="projectbrief">All the algorithms implemented in C++</div>
|
|
</td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
</div>
|
|
<!-- end header part -->
|
|
<!-- Generated by Doxygen 1.14.0 -->
|
|
<script type="text/javascript">
|
|
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
|
</script>
|
|
<script type="text/javascript">
|
|
$(function() { codefold.init(); });
|
|
</script>
|
|
<script type="text/javascript" src="../../menudata.js"></script>
|
|
<script type="text/javascript" src="../../menu.js"></script>
|
|
<script type="text/javascript">
|
|
$(function() {
|
|
initMenu('../../',true,false,'search.php','Search',true);
|
|
$(function() { init_search(); });
|
|
});
|
|
</script>
|
|
<div id="main-nav"></div>
|
|
</div><!-- top -->
|
|
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
|
<div id="nav-tree">
|
|
<div id="nav-tree-contents">
|
|
<div id="nav-sync" class="sync"></div>
|
|
</div>
|
|
</div>
|
|
<div id="splitbar" style="-moz-user-select:none;"
|
|
class="ui-resizable-handle">
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">
|
|
$(function(){initNavTree('df/d42/binary__search__tree2_8cpp_source.html','../../',''); });
|
|
</script>
|
|
<div id="container">
|
|
<div id="doc-content">
|
|
<!-- window showing the filter options -->
|
|
<div id="MSearchSelectWindow"
|
|
onmouseover="return searchBox.OnSearchSelectShow()"
|
|
onmouseout="return searchBox.OnSearchSelectHide()"
|
|
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
|
</div>
|
|
|
|
<!-- iframe showing the search results (closed by default) -->
|
|
<div id="MSearchResultsWindow">
|
|
<div id="MSearchResults">
|
|
<div class="SRPage">
|
|
<div id="SRIndex">
|
|
<div id="SRResults"></div>
|
|
<div class="SRStatus" id="Loading">Loading...</div>
|
|
<div class="SRStatus" id="Searching">Searching...</div>
|
|
<div class="SRStatus" id="NoMatches">No Matches</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
<div class="header">
|
|
<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>
|
|
<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="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_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_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> <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>
|
|
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> };</div>
|
|
</div>
|
|
<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>
|
|
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right) {</div>
|
|
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> ret_value = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value;</div>
|
|
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> }</div>
|
|
<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="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>
|
|
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left) {</div>
|
|
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> ret_value = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value;</div>
|
|
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> }</div>
|
|
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> </div>
|
|
<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="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>
|
|
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = std::unique_ptr<bst_node>(<span class="keyword">new</span> <a class="code hl_struct" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>(new_value));</div>
|
|
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> }</div>
|
|
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> </div>
|
|
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordflow">if</span> (new_value < node->value) {</div>
|
|
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left) {</div>
|
|
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left = std::unique_ptr<bst_node>(<span class="keyword">new</span> <a class="code hl_struct" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>(new_value));</div>
|
|
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left, new_value);</div>
|
|
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> }</div>
|
|
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (new_value > <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value) {</div>
|
|
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right) {</div>
|
|
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right =</div>
|
|
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> std::unique_ptr<bst_node>(<span class="keyword">new</span> <a class="code hl_struct" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>(new_value));</div>
|
|
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right, new_value);</div>
|
|
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> }</div>
|
|
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<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="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>
|
|
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
|
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> }</div>
|
|
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> </div>
|
|
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value == rm_value) {</div>
|
|
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left && <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right) {</div>
|
|
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> T successor_node_value{};</div>
|
|
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</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>->left, successor_node_value);</div>
|
|
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <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>, successor_node_value);</div>
|
|
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value = successor_node_value;</div>
|
|
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left || <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right) {</div>
|
|
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> std::unique_ptr<bst_node>& non_null =</div>
|
|
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left ? <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left : <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right);</div>
|
|
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> </div>
|
|
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> <span class="keywordflow">if</span> (<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>
|
|
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = std::move(non_null);</div>
|
|
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value < parent->value) {</div>
|
|
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> parent->left = std::move(non_null);</div>
|
|
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> parent->right = std::move(non_null);</div>
|
|
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> }</div>
|
|
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> </div>
|
|
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <span class="keywordflow">if</span> (<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>
|
|
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>.reset(<span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value < parent->value) {</div>
|
|
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> parent->left.reset(<span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> parent->right.reset(<span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> }</div>
|
|
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> </div>
|
|
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> }</div>
|
|
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value < node->value) {</div>
|
|
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</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>->left, rm_value);</div>
|
|
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00165" name="l00165"></a><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>->right, rm_value);</div>
|
|
<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="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>
|
|
<div class="line"><a id="l00179" name="l00179"></a><span class="lineno"> 179</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a id="l00180" name="l00180"></a><span class="lineno"> 180</span> }</div>
|
|
<div class="line"><a id="l00181" name="l00181"></a><span class="lineno"> 181</span> </div>
|
|
<div class="line"><a id="l00182" name="l00182"></a><span class="lineno"> 182</span> <span class="keywordflow">if</span> (value < node->value) {</div>
|
|
<div class="line"><a id="l00183" name="l00183"></a><span class="lineno"> 183</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left, value);</div>
|
|
<div class="line"><a id="l00184" name="l00184"></a><span class="lineno"> 184</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value > <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value) {</div>
|
|
<div class="line"><a id="l00185" name="l00185"></a><span class="lineno"> 185</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right, value);</div>
|
|
<div class="line"><a id="l00186" name="l00186"></a><span class="lineno"> 186</span> } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a id="l00187" name="l00187"></a><span class="lineno"> 187</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<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="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>
|
|
<div class="line"><a id="l00199" name="l00199"></a><span class="lineno"> 199</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
|
<div class="line"><a id="l00200" name="l00200"></a><span class="lineno"> 200</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00201" name="l00201"></a><span class="lineno"> 201</span> }</div>
|
|
<div class="line"><a id="l00202" name="l00202"></a><span class="lineno"> 202</span> </div>
|
|
<div class="line"><a id="l00203" name="l00203"></a><span class="lineno"> 203</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>->left);</div>
|
|
<div class="line"><a id="l00204" name="l00204"></a><span class="lineno"> 204</span> callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value);</div>
|
|
<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="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>
|
|
<div class="line"><a id="l00216" name="l00216"></a><span class="lineno"> 216</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
|
<div class="line"><a id="l00217" name="l00217"></a><span class="lineno"> 217</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00218" name="l00218"></a><span class="lineno"> 218</span> }</div>
|
|
<div class="line"><a id="l00219" name="l00219"></a><span class="lineno"> 219</span> </div>
|
|
<div class="line"><a id="l00220" name="l00220"></a><span class="lineno"> 220</span> callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value);</div>
|
|
<div class="line"><a id="l00221" name="l00221"></a><span class="lineno"> 221</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>->left);</div>
|
|
<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="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>
|
|
<div class="line"><a id="l00233" name="l00233"></a><span class="lineno"> 233</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
|
|
<div class="line"><a id="l00234" name="l00234"></a><span class="lineno"> 234</span> <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a id="l00235" name="l00235"></a><span class="lineno"> 235</span> }</div>
|
|
<div class="line"><a id="l00236" name="l00236"></a><span class="lineno"> 236</span> </div>
|
|
<div class="line"><a id="l00237" name="l00237"></a><span class="lineno"> 237</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->left);</div>
|
|
<div class="line"><a id="l00238" name="l00238"></a><span class="lineno"> 238</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->right);</div>
|
|
<div class="line"><a id="l00239" name="l00239"></a><span class="lineno"> 239</span> callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>->value);</div>
|
|
<div class="line"><a id="l00240" name="l00240"></a><span class="lineno"> 240</span> }</div>
|
|
</div>
|
|
<div class="line"><a id="l00241" name="l00241"></a><span class="lineno"> 241</span> </div>
|
|
<div class="line"><a id="l00242" name="l00242"></a><span class="lineno"> 242</span> <span class="keyword">public</span>:</div>
|
|
<div class="foldopen" id="foldopen00247" data-start="{" data-end="}">
|
|
<div class="line"><a id="l00247" name="l00247"></a><span class="lineno"><a class="line" href="../../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6"> 247</a></span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6">binary_search_tree</a>() {</div>
|
|
<div class="line"><a id="l00248" name="l00248"></a><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"><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="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>
|
|
<div class="line"><a id="l00261" name="l00261"></a><span class="lineno"> 261</span> <span class="keywordflow">if</span> (result) {</div>
|
|
<div class="line"><a id="l00262" name="l00262"></a><span class="lineno"> 262</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>++;</div>
|
|
<div class="line"><a id="l00263" name="l00263"></a><span class="lineno"> 263</span> }</div>
|
|
<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="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>
|
|
<div class="line"><a id="l00276" name="l00276"></a><span class="lineno"> 276</span> <span class="keywordflow">if</span> (result) {</div>
|
|
<div class="line"><a id="l00277" name="l00277"></a><span class="lineno"> 277</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>--;</div>
|
|
<div class="line"><a id="l00278" name="l00278"></a><span class="lineno"> 278</span> }</div>
|
|
<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="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="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="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="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="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>
|
|
<div class="line"><a id="l00323" name="l00323"></a><span class="lineno"> 323</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>([&](T node_value) { result.push_back(node_value); },</div>
|
|
<div class="line"><a id="l00324" name="l00324"></a><span class="lineno"> 324</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
|
|
<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="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>
|
|
<div class="line"><a id="l00335" name="l00335"></a><span class="lineno"> 335</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>([&](T node_value) { result.push_back(node_value); },</div>
|
|
<div class="line"><a id="l00336" name="l00336"></a><span class="lineno"> 336</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
|
|
<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="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>
|
|
<div class="line"><a id="l00347" name="l00347"></a><span class="lineno"> 347</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>([&](T node_value) { result.push_back(node_value); },</div>
|
|
<div class="line"><a id="l00348" name="l00348"></a><span class="lineno"> 348</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
|
|
<div class="line"><a id="l00349" name="l00349"></a><span class="lineno"> 349</span> <span class="keywordflow">return</span> result;</div>
|
|
<div class="line"><a id="l00350" name="l00350"></a><span class="lineno"> 350</span> }</div>
|
|
</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="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>
|
|
<div class="line"><a id="l00360" name="l00360"></a><span class="lineno"> 360</span> </div>
|
|
<div class="line"><a id="l00361" name="l00361"></a><span class="lineno"> 361</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree<int></a> tree;</div>
|
|
<div class="line"><a id="l00362" name="l00362"></a><span class="lineno"> 362</span> <span class="keywordtype">bool</span> res = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
|
|
<div class="line"><a id="l00363" name="l00363"></a><span class="lineno"> 363</span> <span class="keywordtype">int</span> min = -1, max = -1;</div>
|
|
<div class="line"><a id="l00364" name="l00364"></a><span class="lineno"> 364</span> assert(res);</div>
|
|
<div class="line"><a id="l00365" name="l00365"></a><span class="lineno"> 365</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
|
|
<div class="line"><a id="l00366" name="l00366"></a><span class="lineno"> 366</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
|
|
<div class="line"><a id="l00367" name="l00367"></a><span class="lineno"> 367</span> assert(max == 5);</div>
|
|
<div class="line"><a id="l00368" name="l00368"></a><span class="lineno"> 368</span> assert(min == 5);</div>
|
|
<div class="line"><a id="l00369" name="l00369"></a><span class="lineno"> 369</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 1);</div>
|
|
<div class="line"><a id="l00370" name="l00370"></a><span class="lineno"> 370</span> </div>
|
|
<div class="line"><a id="l00371" name="l00371"></a><span class="lineno"> 371</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
|
|
<div class="line"><a id="l00372" name="l00372"></a><span class="lineno"> 372</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
|
|
<div class="line"><a id="l00373" name="l00373"></a><span class="lineno"> 373</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
|
|
<div class="line"><a id="l00374" name="l00374"></a><span class="lineno"> 374</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
|
|
<div class="line"><a id="l00375" name="l00375"></a><span class="lineno"> 375</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
|
|
<div class="line"><a id="l00376" name="l00376"></a><span class="lineno"> 376</span> assert(max == 6);</div>
|
|
<div class="line"><a id="l00377" name="l00377"></a><span class="lineno"> 377</span> assert(min == 3);</div>
|
|
<div class="line"><a id="l00378" name="l00378"></a><span class="lineno"> 378</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 4);</div>
|
|
<div class="line"><a id="l00379" name="l00379"></a><span class="lineno"> 379</span> </div>
|
|
<div class="line"><a id="l00380" name="l00380"></a><span class="lineno"> 380</span> <span class="keywordtype">bool</span> fail_res = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
|
|
<div class="line"><a id="l00381" name="l00381"></a><span class="lineno"> 381</span> assert(!fail_res);</div>
|
|
<div class="line"><a id="l00382" name="l00382"></a><span class="lineno"> 382</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 4);</div>
|
|
<div class="line"><a id="l00383" name="l00383"></a><span class="lineno"> 383</span> </div>
|
|
<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="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>
|
|
<div class="line"><a id="l00394" name="l00394"></a><span class="lineno"> 394</span> </div>
|
|
<div class="line"><a id="l00395" name="l00395"></a><span class="lineno"> 395</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree<int></a> tree;</div>
|
|
<div class="line"><a id="l00396" name="l00396"></a><span class="lineno"> 396</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
|
|
<div class="line"><a id="l00397" name="l00397"></a><span class="lineno"> 397</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
|
|
<div class="line"><a id="l00398" name="l00398"></a><span class="lineno"> 398</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
|
|
<div class="line"><a id="l00399" name="l00399"></a><span class="lineno"> 399</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
|
|
<div class="line"><a id="l00400" name="l00400"></a><span class="lineno"> 400</span> </div>
|
|
<div class="line"><a id="l00401" name="l00401"></a><span class="lineno"> 401</span> <span class="keywordtype">bool</span> res = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(5);</div>
|
|
<div class="line"><a id="l00402" name="l00402"></a><span class="lineno"> 402</span> <span class="keywordtype">int</span> min = -1, max = -1;</div>
|
|
<div class="line"><a id="l00403" name="l00403"></a><span class="lineno"> 403</span> assert(res);</div>
|
|
<div class="line"><a id="l00404" name="l00404"></a><span class="lineno"> 404</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
|
|
<div class="line"><a id="l00405" name="l00405"></a><span class="lineno"> 405</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
|
|
<div class="line"><a id="l00406" name="l00406"></a><span class="lineno"> 406</span> assert(max == 6);</div>
|
|
<div class="line"><a id="l00407" name="l00407"></a><span class="lineno"> 407</span> assert(min == 3);</div>
|
|
<div class="line"><a id="l00408" name="l00408"></a><span class="lineno"> 408</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 3);</div>
|
|
<div class="line"><a id="l00409" name="l00409"></a><span class="lineno"> 409</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(5) == <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00410" name="l00410"></a><span class="lineno"> 410</span> </div>
|
|
<div class="line"><a id="l00411" name="l00411"></a><span class="lineno"> 411</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(4);</div>
|
|
<div class="line"><a id="l00412" name="l00412"></a><span class="lineno"> 412</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(3);</div>
|
|
<div class="line"><a id="l00413" name="l00413"></a><span class="lineno"> 413</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(6);</div>
|
|
<div class="line"><a id="l00414" name="l00414"></a><span class="lineno"> 414</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 0);</div>
|
|
<div class="line"><a id="l00415" name="l00415"></a><span class="lineno"> 415</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(6) == <span class="keyword">false</span>);</div>
|
|
<div class="line"><a id="l00416" name="l00416"></a><span class="lineno"> 416</span> </div>
|
|
<div class="line"><a id="l00417" name="l00417"></a><span class="lineno"> 417</span> <span class="keywordtype">bool</span> fail_res = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(5);</div>
|
|
<div class="line"><a id="l00418" name="l00418"></a><span class="lineno"> 418</span> assert(!fail_res);</div>
|
|
<div class="line"><a id="l00419" name="l00419"></a><span class="lineno"> 419</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a>() == 0);</div>
|
|
<div class="line"><a id="l00420" name="l00420"></a><span class="lineno"> 420</span> </div>
|
|
<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="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>
|
|
<div class="line"><a id="l00431" name="l00431"></a><span class="lineno"> 431</span> </div>
|
|
<div class="line"><a id="l00432" name="l00432"></a><span class="lineno"> 432</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree<int></a> tree;</div>
|
|
<div class="line"><a id="l00433" name="l00433"></a><span class="lineno"> 433</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
|
|
<div class="line"><a id="l00434" name="l00434"></a><span class="lineno"> 434</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
|
|
<div class="line"><a id="l00435" name="l00435"></a><span class="lineno"> 435</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
|
|
<div class="line"><a id="l00436" name="l00436"></a><span class="lineno"> 436</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
|
|
<div class="line"><a id="l00437" name="l00437"></a><span class="lineno"> 437</span> </div>
|
|
<div class="line"><a id="l00438" name="l00438"></a><span class="lineno"> 438</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(5));</div>
|
|
<div class="line"><a id="l00439" name="l00439"></a><span class="lineno"> 439</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(4));</div>
|
|
<div class="line"><a id="l00440" name="l00440"></a><span class="lineno"> 440</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(3));</div>
|
|
<div class="line"><a id="l00441" name="l00441"></a><span class="lineno"> 441</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(6));</div>
|
|
<div class="line"><a id="l00442" name="l00442"></a><span class="lineno"> 442</span> assert(!tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(999));</div>
|
|
<div class="line"><a id="l00443" name="l00443"></a><span class="lineno"> 443</span> </div>
|
|
<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="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>
|
|
<div class="line"><a id="l00454" name="l00454"></a><span class="lineno"> 454</span> </div>
|
|
<div class="line"><a id="l00455" name="l00455"></a><span class="lineno"> 455</span> <span class="keywordtype">int</span> min = 0;</div>
|
|
<div class="line"><a id="l00456" name="l00456"></a><span class="lineno"> 456</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree<int></a> tree;</div>
|
|
<div class="line"><a id="l00457" name="l00457"></a><span class="lineno"> 457</span> assert(!tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
|
|
<div class="line"><a id="l00458" name="l00458"></a><span class="lineno"> 458</span> </div>
|
|
<div class="line"><a id="l00459" name="l00459"></a><span class="lineno"> 459</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
|
|
<div class="line"><a id="l00460" name="l00460"></a><span class="lineno"> 460</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
|
|
<div class="line"><a id="l00461" name="l00461"></a><span class="lineno"> 461</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
|
|
<div class="line"><a id="l00462" name="l00462"></a><span class="lineno"> 462</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
|
|
<div class="line"><a id="l00463" name="l00463"></a><span class="lineno"> 463</span> </div>
|
|
<div class="line"><a id="l00464" name="l00464"></a><span class="lineno"> 464</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(min));</div>
|
|
<div class="line"><a id="l00465" name="l00465"></a><span class="lineno"> 465</span> assert(min == 3);</div>
|
|
<div class="line"><a id="l00466" name="l00466"></a><span class="lineno"> 466</span> </div>
|
|
<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="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>
|
|
<div class="line"><a id="l00477" name="l00477"></a><span class="lineno"> 477</span> </div>
|
|
<div class="line"><a id="l00478" name="l00478"></a><span class="lineno"> 478</span> <span class="keywordtype">int</span> max = 0;</div>
|
|
<div class="line"><a id="l00479" name="l00479"></a><span class="lineno"> 479</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree<int></a> tree;</div>
|
|
<div class="line"><a id="l00480" name="l00480"></a><span class="lineno"> 480</span> assert(!tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
|
|
<div class="line"><a id="l00481" name="l00481"></a><span class="lineno"> 481</span> </div>
|
|
<div class="line"><a id="l00482" name="l00482"></a><span class="lineno"> 482</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
|
|
<div class="line"><a id="l00483" name="l00483"></a><span class="lineno"> 483</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
|
|
<div class="line"><a id="l00484" name="l00484"></a><span class="lineno"> 484</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
|
|
<div class="line"><a id="l00485" name="l00485"></a><span class="lineno"> 485</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
|
|
<div class="line"><a id="l00486" name="l00486"></a><span class="lineno"> 486</span> </div>
|
|
<div class="line"><a id="l00487" name="l00487"></a><span class="lineno"> 487</span> assert(tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(max));</div>
|
|
<div class="line"><a id="l00488" name="l00488"></a><span class="lineno"> 488</span> assert(max == 6);</div>
|
|
<div class="line"><a id="l00489" name="l00489"></a><span class="lineno"> 489</span> </div>
|
|
<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="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>
|
|
<div class="line"><a id="l00500" name="l00500"></a><span class="lineno"> 500</span> </div>
|
|
<div class="line"><a id="l00501" name="l00501"></a><span class="lineno"> 501</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree<int></a> tree;</div>
|
|
<div class="line"><a id="l00502" name="l00502"></a><span class="lineno"> 502</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
|
|
<div class="line"><a id="l00503" name="l00503"></a><span class="lineno"> 503</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
|
|
<div class="line"><a id="l00504" name="l00504"></a><span class="lineno"> 504</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
|
|
<div class="line"><a id="l00505" name="l00505"></a><span class="lineno"> 505</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
|
|
<div class="line"><a id="l00506" name="l00506"></a><span class="lineno"> 506</span> </div>
|
|
<div class="line"><a id="l00507" name="l00507"></a><span class="lineno"> 507</span> std::vector<int> expected = {3, 4, 5, 6};</div>
|
|
<div class="line"><a id="l00508" name="l00508"></a><span class="lineno"> 508</span> std::vector<int> actual = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">get_elements_inorder</a>();</div>
|
|
<div class="line"><a id="l00509" name="l00509"></a><span class="lineno"> 509</span> assert(actual == expected);</div>
|
|
<div class="line"><a id="l00510" name="l00510"></a><span class="lineno"> 510</span> </div>
|
|
<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="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>
|
|
<div class="line"><a id="l00521" name="l00521"></a><span class="lineno"> 521</span> </div>
|
|
<div class="line"><a id="l00522" name="l00522"></a><span class="lineno"> 522</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree<int></a> tree;</div>
|
|
<div class="line"><a id="l00523" name="l00523"></a><span class="lineno"> 523</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
|
|
<div class="line"><a id="l00524" name="l00524"></a><span class="lineno"> 524</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
|
|
<div class="line"><a id="l00525" name="l00525"></a><span class="lineno"> 525</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
|
|
<div class="line"><a id="l00526" name="l00526"></a><span class="lineno"> 526</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
|
|
<div class="line"><a id="l00527" name="l00527"></a><span class="lineno"> 527</span> </div>
|
|
<div class="line"><a id="l00528" name="l00528"></a><span class="lineno"> 528</span> std::vector<int> expected = {5, 4, 3, 6};</div>
|
|
<div class="line"><a id="l00529" name="l00529"></a><span class="lineno"> 529</span> std::vector<int> actual = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13">get_elements_preorder</a>();</div>
|
|
<div class="line"><a id="l00530" name="l00530"></a><span class="lineno"> 530</span> assert(actual == expected);</div>
|
|
<div class="line"><a id="l00531" name="l00531"></a><span class="lineno"> 531</span> </div>
|
|
<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="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>
|
|
<div class="line"><a id="l00542" name="l00542"></a><span class="lineno"> 542</span> </div>
|
|
<div class="line"><a id="l00543" name="l00543"></a><span class="lineno"> 543</span> <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree<int></a> tree;</div>
|
|
<div class="line"><a id="l00544" name="l00544"></a><span class="lineno"> 544</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(5);</div>
|
|
<div class="line"><a id="l00545" name="l00545"></a><span class="lineno"> 545</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(4);</div>
|
|
<div class="line"><a id="l00546" name="l00546"></a><span class="lineno"> 546</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(3);</div>
|
|
<div class="line"><a id="l00547" name="l00547"></a><span class="lineno"> 547</span> tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(6);</div>
|
|
<div class="line"><a id="l00548" name="l00548"></a><span class="lineno"> 548</span> </div>
|
|
<div class="line"><a id="l00549" name="l00549"></a><span class="lineno"> 549</span> std::vector<int> expected = {3, 4, 6, 5};</div>
|
|
<div class="line"><a id="l00550" name="l00550"></a><span class="lineno"> 550</span> std::vector<int> actual = tree.<a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff">get_elements_postorder</a>();</div>
|
|
<div class="line"><a id="l00551" name="l00551"></a><span class="lineno"> 551</span> assert(actual == expected);</div>
|
|
<div class="line"><a id="l00552" name="l00552"></a><span class="lineno"> 552</span> </div>
|
|
<div class="line"><a id="l00553" name="l00553"></a><span class="lineno"> 553</span> std::cout << <span class="stringliteral">"ok"</span> << std::endl;</div>
|
|
<div class="line"><a id="l00554" name="l00554"></a><span class="lineno"> 554</span>}</div>
|
|
</div>
|
|
<div class="line"><a id="l00555" name="l00555"></a><span class="lineno"> 555</span> </div>
|
|
<div class="line"><a id="l00556" name="l00556"></a><span class="lineno"> 556</span><span class="keywordtype">int</span> <a class="code hl_function" href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
|
<div class="line"><a id="l00557" name="l00557"></a><span class="lineno"> 557</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350">test_insert</a>();</div>
|
|
<div class="line"><a id="l00558" name="l00558"></a><span class="lineno"> 558</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">test_remove</a>();</div>
|
|
<div class="line"><a id="l00559" name="l00559"></a><span class="lineno"> 559</span> <a class="code hl_function" href="../../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3">test_contains</a>();</div>
|
|
<div class="line"><a id="l00560" name="l00560"></a><span class="lineno"> 560</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="l00561" name="l00561"></a><span class="lineno"> 561</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="l00562" name="l00562"></a><span class="lineno"> 562</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="l00563" name="l00563"></a><span class="lineno"> 563</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="l00564" name="l00564"></a><span class="lineno"> 564</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="l00565" name="l00565"></a><span class="lineno"> 565</span>}</div>
|
|
<div class="ttc" id="abinary__search__tree2_8cpp_html_a06f35064850e891d6fda0093c0d9ee6e"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#a06f35064850e891d6fda0093c0d9ee6e">test_get_elements_inorder</a></div><div class="ttdeci">static void test_get_elements_inorder()</div><div class="ttdoc">Function for testing get_elements_inorder().</div><div class="ttdef"><b>Definition</b> <a href="#l00498">binary_search_tree2.cpp:498</a></div></div>
|
|
<div class="ttc" id="abinary__search__tree2_8cpp_html_a1d42876440ac5346e2850a32497385c3"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#a1d42876440ac5346e2850a32497385c3">test_contains</a></div><div class="ttdeci">static void test_contains()</div><div class="ttdoc">Function for testing contains().</div><div class="ttdef"><b>Definition</b> <a href="#l00429">binary_search_tree2.cpp:429</a></div></div>
|
|
<div class="ttc" id="abinary__search__tree2_8cpp_html_a8c882f43e1e52948a7841a8bfb091350"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#a8c882f43e1e52948a7841a8bfb091350">test_insert</a></div><div class="ttdeci">static void test_insert()</div><div class="ttdoc">Function for testing insert().</div><div class="ttdef"><b>Definition</b> <a href="#l00358">binary_search_tree2.cpp:358</a></div></div>
|
|
<div class="ttc" id="abinary__search__tree2_8cpp_html_a94b76f781fcbe1ad0e3397ace6bb1965"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#a94b76f781fcbe1ad0e3397ace6bb1965">test_get_elements_postorder</a></div><div class="ttdeci">static void test_get_elements_postorder()</div><div class="ttdoc">Function for testing get_elements_postorder().</div><div class="ttdef"><b>Definition</b> <a href="#l00540">binary_search_tree2.cpp:540</a></div></div>
|
|
<div class="ttc" id="abinary__search__tree2_8cpp_html_a9856b68e2cba50d2e26a1cbe374e0365"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#a9856b68e2cba50d2e26a1cbe374e0365">test_find_max</a></div><div class="ttdeci">static void test_find_max()</div><div class="ttdoc">Function for testing find_max().</div><div class="ttdef"><b>Definition</b> <a href="#l00475">binary_search_tree2.cpp:475</a></div></div>
|
|
<div class="ttc" id="abinary__search__tree2_8cpp_html_ab00b8d0f21aeb5fbddb6decf3bcb640a"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#ab00b8d0f21aeb5fbddb6decf3bcb640a">test_get_elements_preorder</a></div><div class="ttdeci">static void test_get_elements_preorder()</div><div class="ttdoc">Function for testing get_elements_preorder().</div><div class="ttdef"><b>Definition</b> <a href="#l00519">binary_search_tree2.cpp:519</a></div></div>
|
|
<div class="ttc" id="abinary__search__tree2_8cpp_html_ab1333c3ea06dcad896ee204bbd407c4e"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#ab1333c3ea06dcad896ee204bbd407c4e">test_remove</a></div><div class="ttdeci">static void test_remove()</div><div class="ttdoc">Function for testing remove().</div><div class="ttdef"><b>Definition</b> <a href="#l00392">binary_search_tree2.cpp:392</a></div></div>
|
|
<div class="ttc" id="abinary__search__tree2_8cpp_html_af2847a901160fd45b4044550e9921cb4"><div class="ttname"><a href="../../df/d42/binary__search__tree2_8cpp.html#af2847a901160fd45b4044550e9921cb4">test_find_min</a></div><div class="ttdeci">static void test_find_min()</div><div class="ttdoc">Function for testing find_min().</div><div class="ttdef"><b>Definition</b> <a href="#l00452">binary_search_tree2.cpp:452</a></div></div>
|
|
<div class="ttc" id="aclassbinary__search__tree_html"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a></div><div class="ttdoc">The Binary Search Tree class.</div><div class="ttdef"><b>Definition</b> <a href="#l00020">binary_search_tree2.cpp:20</a></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> <a href="#l00043">binary_search_tree2.cpp:43</a></div></div>
|
|
<div class="ttc" id="aclassbinary__search__tree_html_a1f23830316204664514f396a4eb5275a"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a1f23830316204664514f396a4eb5275a">binary_search_tree::get_elements_inorder</a></div><div class="ttdeci">std::vector< T > get_elements_inorder()</div><div class="ttdoc">Get all values of the BST in in-order order.</div><div class="ttdef"><b>Definition</b> <a href="#l00321">binary_search_tree2.cpp:321</a></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< void(T)> callback, std::unique_ptr< bst_node > &node)</div><div class="ttdoc">Recursive function to traverse the tree in in-order order.</div><div class="ttdef"><b>Definition</b> <a href="#l00197">binary_search_tree2.cpp:197</a></div></div>
|
|
<div class="ttc" id="aclassbinary__search__tree_html_a42b16f26928b5e994925100594a167a0"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0">binary_search_tree::find_max</a></div><div class="ttdeci">bool find_max(T &ret_value)</div><div class="ttdoc">Find the largest value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00307">binary_search_tree2.cpp:307</a></div></div>
|
|
<div class="ttc" id="aclassbinary__search__tree_html_a564fe43e7e8f7ecb6f10667a70fbc6f3"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">binary_search_tree::size</a></div><div class="ttdeci">std::size_t size()</div><div class="ttdoc">Get the number of values in the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00314">binary_search_tree2.cpp:314</a></div></div>
|
|
<div class="ttc" id="aclassbinary__search__tree_html_a5764c1cf848f84a5b77462036a6d8c13"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a5764c1cf848f84a5b77462036a6d8c13">binary_search_tree::get_elements_preorder</a></div><div class="ttdeci">std::vector< T > get_elements_preorder()</div><div class="ttdoc">Get all values of the BST in pre-order order.</div><div class="ttdef"><b>Definition</b> <a href="#l00333">binary_search_tree2.cpp:333</a></div></div>
|
|
<div class="ttc" id="aclassbinary__search__tree_html_a5c011e1b0863d79c3a7c11a0426bdcff"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a5c011e1b0863d79c3a7c11a0426bdcff">binary_search_tree::get_elements_postorder</a></div><div class="ttdeci">std::vector< T > get_elements_postorder()</div><div class="ttdoc">Get all values of the BST in post-order order.</div><div class="ttdef"><b>Definition</b> <a href="#l00345">binary_search_tree2.cpp:345</a></div></div>
|
|
<div class="ttc" id="aclassbinary__search__tree_html_a6bf5b410299df2320ddf2709dda61f63"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63">binary_search_tree::contains</a></div><div class="ttdeci">bool contains(T value)</div><div class="ttdoc">Check if a value is in the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00289">binary_search_tree2.cpp:289</a></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< bst_node > &node, T &ret_value)</div><div class="ttdoc">Recursive function to find the maximum value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00053">binary_search_tree2.cpp:53</a></div></div>
|
|
<div class="ttc" id="aclassbinary__search__tree_html_a8168edf29316f2b436eac1fc416c52e0"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0">binary_search_tree::insert</a></div><div class="ttdeci">bool insert(T new_value)</div><div class="ttdoc">Insert a new value into the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00259">binary_search_tree2.cpp:259</a></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< void(T)> callback, std::unique_ptr< bst_node > &node)</div><div class="ttdoc">Recursive function to traverse the tree in post-order order.</div><div class="ttdef"><b>Definition</b> <a href="#l00231">binary_search_tree2.cpp:231</a></div></div>
|
|
<div class="ttc" id="aclassbinary__search__tree_html_a99771c2e1353e8ddfd4bb9d30b7a98fb"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb">binary_search_tree::remove</a></div><div class="ttdeci">bool remove(T rm_value)</div><div class="ttdoc">Remove a specified value from the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00274">binary_search_tree2.cpp:274</a></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< bst_node > &node, T new_value)</div><div class="ttdoc">Recursive function to insert a value into the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00090">binary_search_tree2.cpp:90</a></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< bst_node > root_</div><div class="ttdef"><b>Definition</b> <a href="#l00042">binary_search_tree2.cpp:42</a></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< bst_node > &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> <a href="#l00177">binary_search_tree2.cpp:177</a></div></div>
|
|
<div class="ttc" id="aclassbinary__search__tree_html_aa67321ed575ca313cd71d833d91234a6"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#aa67321ed575ca313cd71d833d91234a6">binary_search_tree::binary_search_tree</a></div><div class="ttdeci">binary_search_tree()</div><div class="ttdoc">Construct a new Binary Search Tree object.</div><div class="ttdef"><b>Definition</b> <a href="#l00247">binary_search_tree2.cpp:247</a></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< void(T)> callback, std::unique_ptr< bst_node > &node)</div><div class="ttdoc">Recursive function to traverse the tree in pre-order order.</div><div class="ttdef"><b>Definition</b> <a href="#l00214">binary_search_tree2.cpp:214</a></div></div>
|
|
<div class="ttc" id="aclassbinary__search__tree_html_ad9912e8574538e86f9bd2c38e7e63d03"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03">binary_search_tree::find_min</a></div><div class="ttdeci">bool find_min(T &ret_value)</div><div class="ttdoc">Find the smallest value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00298">binary_search_tree2.cpp:298</a></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< bst_node > &parent, std::unique_ptr< bst_node > &node, T rm_value)</div><div class="ttdoc">Recursive function to remove a value from the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00125">binary_search_tree2.cpp:125</a></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< bst_node > &node, T &ret_value)</div><div class="ttdoc">Recursive function to find the minimum value in the BST.</div><div class="ttdef"><b>Definition</b> <a href="#l00071">binary_search_tree2.cpp:71</a></div></div>
|
|
<div class="ttc" id="agenerate__parentheses_8cpp_html_gae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../dd/d1e/generate__parentheses_8cpp.html#gae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="../../dd/d1e/generate__parentheses_8cpp_source.html#l00110">generate_parentheses.cpp:110</a></div></div>
|
|
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">binary_search_tree::bst_node</a></div><div class="ttdoc">A struct to represent a node in the Binary Search Tree.</div><div class="ttdef"><b>Definition</b> <a href="#l00025">binary_search_tree2.cpp:25</a></div></div>
|
|
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a05f3a7aa6c31622f855ce4b5a95e91df"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df">binary_search_tree::bst_node::right</a></div><div class="ttdeci">std::unique_ptr< bst_node > right</div><div class="ttdef"><b>Definition</b> <a href="#l00028">binary_search_tree2.cpp:28</a></div></div>
|
|
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a09da9e5b801ede4764bc812975ff7f29"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29">binary_search_tree::bst_node::value</a></div><div class="ttdeci">T value</div><div class="ttdef"><b>Definition</b> <a href="#l00026">binary_search_tree2.cpp:26</a></div></div>
|
|
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a51dd9bd6dd32bce3b74dd64557306778"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a51dd9bd6dd32bce3b74dd64557306778">binary_search_tree::bst_node::bst_node</a></div><div class="ttdeci">bst_node(T _value)</div><div class="ttdef"><b>Definition</b> <a href="#l00035">binary_search_tree2.cpp:35</a></div></div>
|
|
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a55c165b9e0e5b50a23104e0604dcc788"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788">binary_search_tree::bst_node::left</a></div><div class="ttdeci">std::unique_ptr< bst_node > left</div><div class="ttdef"><b>Definition</b> <a href="#l00027">binary_search_tree2.cpp:27</a></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> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
|
|
</div><!-- fragment --></div><!-- contents -->
|
|
</div><!-- doc-content -->
|
|
</div><!-- container -->
|
|
<!-- start footer part -->
|
|
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
|
<ul>
|
|
<li class="navelem"><a href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a 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.14.0 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|