backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 12:23:13 +08:00
Code Issues Projects Releases Wiki Activity
Files
53d5cb127986a932893efaee077fade7bed2a679
C-Plus-Plus/d3/d26/binary__search__tree_8cpp_source.html
realstealthninja b41207008f Documentation for f1eddf4d65
2025-07-09 10:53:16 +00:00

307 lines
30 KiB
HTML
Raw Blame History

<!-- 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_tree.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">&#160;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('d3/d26/binary__search__tree_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_tree.cpp</div></div>
</div><!--header-->
<div class="contents">
<a href="../../d3/d26/binary__search__tree_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="l00009" name="l00009"></a><span class="lineno"> 9</span><span class="preprocessor">#include &lt;iostream&gt;</span></div>
<div class="line"><a id="l00010" name="l00010"></a><span class="lineno"> 10</span> </div>
<div class="foldopen" id="foldopen00011" data-start="{" data-end="};">
<div class="line"><a id="l00011" name="l00011"></a><span class="lineno"><a class="line" href="../../d5/da1/structnode.html"> 11</a></span><span class="keyword">struct </span>node {</div>
<div class="line"><a id="l00012" name="l00012"></a><span class="lineno"> 12</span> <span class="keywordtype">int</span> val;</div>
<div class="line"><a id="l00013" name="l00013"></a><span class="lineno"> 13</span> node *left;</div>
<div class="line"><a id="l00014" name="l00014"></a><span class="lineno"> 14</span> node *right;</div>
<div class="line"><a id="l00015" name="l00015"></a><span class="lineno"> 15</span>};</div>
</div>
<div class="line"><a id="l00016" name="l00016"></a><span class="lineno"> 16</span> </div>
<div class="foldopen" id="foldopen00017" data-start="{" data-end="};">
<div class="line"><a id="l00017" name="l00017"></a><span class="lineno"><a class="line" href="../../dc/db5/struct_queue.html"> 17</a></span><span class="keyword">struct </span>Queue {</div>
<div class="line"><a id="l00018" name="l00018"></a><span class="lineno"> 18</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t[100];</div>
<div class="line"><a id="l00019" name="l00019"></a><span class="lineno"> 19</span> <span class="keywordtype">int</span> front;</div>
<div class="line"><a id="l00020" name="l00020"></a><span class="lineno"> 20</span> <span class="keywordtype">int</span> rear;</div>
<div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span>};</div>
</div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</span> </div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span><a class="code hl_class" href="../../dc/db5/struct_queue.html">Queue</a> <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>;</div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> </div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span><span class="keywordtype">void</span> enqueue(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) { <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.t[<a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.rear++] = n; }</div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> </div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *dequeue() { <span class="keywordflow">return</span> (<a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.t[<a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.<a class="code hl_function" href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">front</a>++]); }</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span> </div>
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span><span class="keywordtype">void</span> Insert(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n, <span class="keywordtype">int</span> x) {</div>
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> <span class="keywordflow">if</span> (x &lt; n-&gt;val) {</div>
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> <span class="keywordflow">if</span> (n-&gt;left == NULL) {</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = <span class="keyword">new</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> temp-&gt;val = x;</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> temp-&gt;left = NULL;</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> temp-&gt;right = NULL;</div>
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> n-&gt;left = temp;</div>
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span> Insert(n-&gt;left, x);</div>
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> }</div>
<div class="line"><a id="l00040" name="l00040"></a><span class="lineno"> 40</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> <span class="keywordflow">if</span> (n-&gt;right == NULL) {</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = <span class="keyword">new</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> temp-&gt;val = x;</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> temp-&gt;left = NULL;</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> temp-&gt;right = NULL;</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> n-&gt;right = temp;</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> Insert(n-&gt;right, x);</div>
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> }</div>
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> }</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span>}</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> </div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span><span class="keywordtype">int</span> findMaxInLeftST(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> <span class="keywordflow">while</span> (n-&gt;right != NULL) {</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> n = n-&gt;right;</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> }</div>
<div class="line"><a id="l00057" name="l00057"></a><span class="lineno"> 57</span> <span class="keywordflow">return</span> n-&gt;val;</div>
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</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="keywordtype">void</span> Remove(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n, <span class="keywordtype">int</span> x) {</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordflow">if</span> (n-&gt;val == x) {</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">if</span> (n-&gt;right == NULL &amp;&amp; n-&gt;left == NULL) {</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> <span class="keywordflow">if</span> (x &lt; p-&gt;val) {</div>
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> p-&gt;right = NULL;</div>
<div class="line"><a id="l00065" name="l00065"></a><span class="lineno"> 65</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> p-&gt;left = NULL;</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> }</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (n-&gt;right == NULL) {</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">if</span> (x &lt; p-&gt;val) {</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> p-&gt;right = n-&gt;left;</div>
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> p-&gt;left = n-&gt;left;</div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</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> (n-&gt;left == NULL) {</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">if</span> (x &lt; p-&gt;val) {</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> p-&gt;right = n-&gt;right;</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> p-&gt;left = n-&gt;right;</div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> }</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> <span class="keywordtype">int</span> y = findMaxInLeftST(n-&gt;left);</div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> n-&gt;val = y;</div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> Remove(n, n-&gt;right, y);</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> }</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x &lt; n-&gt;val) {</div>
<div class="line"><a id="l00086" name="l00086"></a><span class="lineno"> 86</span> Remove(n, n-&gt;left, x);</div>
<div class="line"><a id="l00087" name="l00087"></a><span class="lineno"> 87</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> Remove(n, n-&gt;right, x);</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> }</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span>}</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> </div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span><span class="keywordtype">void</span> BFT(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">if</span> (n != NULL) {</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> enqueue(n-&gt;left);</div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> enqueue(n-&gt;right);</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> BFT(dequeue());</div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> }</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span>}</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> </div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span><span class="keywordtype">void</span> Pre(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordflow">if</span> (n != NULL) {</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> Pre(n-&gt;left);</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> Pre(n-&gt;right);</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> }</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span>}</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> </div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span><span class="keywordtype">void</span> In(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <span class="keywordflow">if</span> (n != NULL) {</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> In(n-&gt;left);</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> In(n-&gt;right);</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> }</div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span>}</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span> </div>
<div class="line"><a id="l00117" name="l00117"></a><span class="lineno"> 117</span><span class="keywordtype">void</span> Post(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *n) {</div>
<div class="line"><a id="l00118" name="l00118"></a><span class="lineno"> 118</span> <span class="keywordflow">if</span> (n != NULL) {</div>
<div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> Post(n-&gt;left);</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> Post(n-&gt;right);</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> }</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span>}</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> </div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</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="l00126" name="l00126"></a><span class="lineno"> 126</span> <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.<a class="code hl_function" href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">front</a> = 0;</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.rear = 0;</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="keywordtype">int</span> value;</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> <span class="keywordtype">int</span> ch;</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root = <span class="keyword">new</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>;</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the value of root node :&quot;</span>;</div>
<div class="line"><a id="l00132" name="l00132"></a><span class="lineno"> 132</span> std::cin &gt;&gt; value;</div>
<div class="line"><a id="l00133" name="l00133"></a><span class="lineno"> 133</span> root-&gt;val = value;</div>
<div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> root-&gt;left = NULL;</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> root-&gt;right = NULL;</div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <span class="keywordflow">do</span> {</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\n1. Insert&quot;</span></div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> &lt;&lt; <span class="stringliteral">&quot;\n2. Delete&quot;</span></div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</span> &lt;&lt; <span class="stringliteral">&quot;\n3. Breadth First&quot;</span></div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> &lt;&lt; <span class="stringliteral">&quot;\n4. Preorder Depth First&quot;</span></div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> &lt;&lt; <span class="stringliteral">&quot;\n5. Inorder Depth First&quot;</span></div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</span> &lt;&lt; <span class="stringliteral">&quot;\n6. Postorder Depth First&quot;</span>;</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> </div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter Your Choice : &quot;</span>;</div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</span> std::cin &gt;&gt; ch;</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <span class="keywordtype">int</span> x;</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keywordflow">switch</span> (ch) {</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span> <span class="keywordflow">case</span> 1:</div>
<div class="line"><a id="l00149" name="l00149"></a><span class="lineno"> 149</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the value to be Inserted : &quot;</span>;</div>
<div class="line"><a id="l00150" name="l00150"></a><span class="lineno"> 150</span> std::cin &gt;&gt; x;</div>
<div class="line"><a id="l00151" name="l00151"></a><span class="lineno"> 151</span> Insert(root, x);</div>
<div class="line"><a id="l00152" name="l00152"></a><span class="lineno"> 152</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00153" name="l00153"></a><span class="lineno"> 153</span> <span class="keywordflow">case</span> 2:</div>
<div class="line"><a id="l00154" name="l00154"></a><span class="lineno"> 154</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter the value to be Deleted : &quot;</span>;</div>
<div class="line"><a id="l00155" name="l00155"></a><span class="lineno"> 155</span> std::cin &gt;&gt; x;</div>
<div class="line"><a id="l00156" name="l00156"></a><span class="lineno"> 156</span> Remove(root, root, x);</div>
<div class="line"><a id="l00157" name="l00157"></a><span class="lineno"> 157</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00158" name="l00158"></a><span class="lineno"> 158</span> <span class="keywordflow">case</span> 3:</div>
<div class="line"><a id="l00159" name="l00159"></a><span class="lineno"> 159</span> BFT(root);</div>
<div class="line"><a id="l00160" name="l00160"></a><span class="lineno"> 160</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00161" name="l00161"></a><span class="lineno"> 161</span> <span class="keywordflow">case</span> 4:</div>
<div class="line"><a id="l00162" name="l00162"></a><span class="lineno"> 162</span> Pre(root);</div>
<div class="line"><a id="l00163" name="l00163"></a><span class="lineno"> 163</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00164" name="l00164"></a><span class="lineno"> 164</span> <span class="keywordflow">case</span> 5:</div>
<div class="line"><a id="l00165" name="l00165"></a><span class="lineno"> 165</span> In(root);</div>
<div class="line"><a id="l00166" name="l00166"></a><span class="lineno"> 166</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00167" name="l00167"></a><span class="lineno"> 167</span> <span class="keywordflow">case</span> 6:</div>
<div class="line"><a id="l00168" name="l00168"></a><span class="lineno"> 168</span> Post(root);</div>
<div class="line"><a id="l00169" name="l00169"></a><span class="lineno"> 169</span> <span class="keywordflow">break</span>;</div>
<div class="line"><a id="l00170" name="l00170"></a><span class="lineno"> 170</span> }</div>
<div class="line"><a id="l00171" name="l00171"></a><span class="lineno"> 171</span> } <span class="keywordflow">while</span> (ch != 0);</div>
<div class="line"><a id="l00172" name="l00172"></a><span class="lineno"> 172</span> </div>
<div class="line"><a id="l00173" name="l00173"></a><span class="lineno"> 173</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00174" name="l00174"></a><span class="lineno"> 174</span>}</div>
<div class="ttc" id="aclassqueue_html"><div class="ttname"><a href="../../db/da9/classqueue.html">queue</a></div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00009">queue.hpp:9</a></div></div>
<div class="ttc" id="aclassqueue_html_a75e231798bc706b8b0773a07f78713e7"><div class="ttname"><a href="../../db/da9/classqueue.html#a75e231798bc706b8b0773a07f78713e7">queue::front</a></div><div class="ttdeci">value_type front() const</div><div class="ttdef"><b>Definition</b> <a href="../../d7/ded/queue_8hpp_source.html#l00072">queue.hpp:72</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="astruct_queue_html"><div class="ttname"><a href="../../dc/db5/struct_queue.html">Queue</a></div><div class="ttdef"><b>Definition</b> <a href="#l00017">binary_search_tree.cpp:17</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="#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="../../d3/d26/binary__search__tree_8cpp.html">binary_search_tree.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>
Reference in New Issue View Git Blame Copy Permalink