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

543 lines
37 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 File Reference</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.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 File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>A simple tree implementation using structured nodes.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;iostream&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for binary_search_tree.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../d4/d0c/binary__search__tree_8cpp__incl.svg" width="162" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
<p><a href="../../d3/d26/binary__search__tree_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-nested-classes" class="groupheader"><a id="nested-classes" name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:node" id="r_node"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/da1/structnode.html">node</a></td></tr>
<tr class="memitem:Queue" id="r_Queue"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a1ca1e6aad9a9e45c1d21a7c8f61bccc3" id="r_a1ca1e6aad9a9e45c1d21a7c8f61bccc3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1ca1e6aad9a9e45c1d21a7c8f61bccc3">enqueue</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="memitem:a11b4c912d85c475c67abab608f86ecce" id="r_a11b4c912d85c475c67abab608f86ecce"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a11b4c912d85c475c67abab608f86ecce">dequeue</a> ()</td></tr>
<tr class="memitem:a521ea77f195e491750e602292c6dc335" id="r_a521ea77f195e491750e602292c6dc335"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a521ea77f195e491750e602292c6dc335">Insert</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n, int x)</td></tr>
<tr class="memitem:a4a1aaff44d949318d93231e1fa5c7863" id="r_a4a1aaff44d949318d93231e1fa5c7863"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4a1aaff44d949318d93231e1fa5c7863">findMaxInLeftST</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="memitem:a4392f2f3d0680befc1a6db07d94d6c5d" id="r_a4392f2f3d0680befc1a6db07d94d6c5d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a4392f2f3d0680befc1a6db07d94d6c5d">Remove</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *p, <a class="el" href="../../d5/da1/structnode.html">node</a> *n, int x)</td></tr>
<tr class="memitem:aa65d9b7fa9bd517ace3d819abc85c8b6" id="r_aa65d9b7fa9bd517ace3d819abc85c8b6"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa65d9b7fa9bd517ace3d819abc85c8b6">BFT</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="memitem:a9e98619e1c6cea9d6c56849a16ecc416" id="r_a9e98619e1c6cea9d6c56849a16ecc416"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9e98619e1c6cea9d6c56849a16ecc416">Pre</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="memitem:adb338121baec7856c9593d79ddeb5e18" id="r_adb338121baec7856c9593d79ddeb5e18"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adb338121baec7856c9593d79ddeb5e18">In</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="memitem:a13dac1586cbb95ebfd63dc47aeeff0e1" id="r_a13dac1586cbb95ebfd63dc47aeeff0e1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a13dac1586cbb95ebfd63dc47aeeff0e1">Post</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-var-members" class="groupheader"><a id="var-members" name="var-members"></a>
Variables</h2></td></tr>
<tr class="memitem:aebb1a5194a2cd7efe7ee7fc417e78293" id="r_aebb1a5194a2cd7efe7ee7fc417e78293"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aebb1a5194a2cd7efe7ee7fc417e78293">queue</a></td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p>A simple tree implementation using structured nodes. </p>
<dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000003">Todo</a></b></dt><dd>update code to use C++ STL library features and OO structure </dd></dl>
<dl class="section warning"><dt>Warning</dt><dd>This program is a poor implementation - C style - and does not utilize any of the C++ STL features. </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
<a id="aa65d9b7fa9bd517ace3d819abc85c8b6" name="aa65d9b7fa9bd517ace3d819abc85c8b6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa65d9b7fa9bd517ace3d819abc85c8b6">&#9670;&#160;</a></span>BFT()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void BFT </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 92</span> {</div>
<div class="line"><span class="lineno"> 93</span> <span class="keywordflow">if</span> (n != NULL) {</div>
<div class="line"><span class="lineno"> 94</span> std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 95</span> enqueue(n-&gt;left);</div>
<div class="line"><span class="lineno"> 96</span> enqueue(n-&gt;right);</div>
<div class="line"><span class="lineno"> 97</span> BFT(dequeue());</div>
<div class="line"><span class="lineno"> 98</span> }</div>
<div class="line"><span class="lineno"> 99</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a11b4c912d85c475c67abab608f86ecce" name="a11b4c912d85c475c67abab608f86ecce"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a11b4c912d85c475c67abab608f86ecce">&#9670;&#160;</a></span>dequeue()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a> * dequeue </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 27</span>{ <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="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><!-- fragment -->
</div>
</div>
<a id="a1ca1e6aad9a9e45c1d21a7c8f61bccc3" name="a1ca1e6aad9a9e45c1d21a7c8f61bccc3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1ca1e6aad9a9e45c1d21a7c8f61bccc3">&#9670;&#160;</a></span>enqueue()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void enqueue </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 25</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>.rear++] = n; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a4a1aaff44d949318d93231e1fa5c7863" name="a4a1aaff44d949318d93231e1fa5c7863"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4a1aaff44d949318d93231e1fa5c7863">&#9670;&#160;</a></span>findMaxInLeftST()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int findMaxInLeftST </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00053">53</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 53</span> {</div>
<div class="line"><span class="lineno"> 54</span> <span class="keywordflow">while</span> (n-&gt;right != NULL) {</div>
<div class="line"><span class="lineno"> 55</span> n = n-&gt;right;</div>
<div class="line"><span class="lineno"> 56</span> }</div>
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">return</span> n-&gt;val;</div>
<div class="line"><span class="lineno"> 58</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="adb338121baec7856c9593d79ddeb5e18" name="adb338121baec7856c9593d79ddeb5e18"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adb338121baec7856c9593d79ddeb5e18">&#9670;&#160;</a></span>In()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void In </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00109">109</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 109</span> {</div>
<div class="line"><span class="lineno"> 110</span> <span class="keywordflow">if</span> (n != NULL) {</div>
<div class="line"><span class="lineno"> 111</span> In(n-&gt;left);</div>
<div class="line"><span class="lineno"> 112</span> std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 113</span> In(n-&gt;right);</div>
<div class="line"><span class="lineno"> 114</span> }</div>
<div class="line"><span class="lineno"> 115</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a521ea77f195e491750e602292c6dc335" name="a521ea77f195e491750e602292c6dc335"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a521ea77f195e491750e602292c6dc335">&#9670;&#160;</a></span>Insert()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void Insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>n</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>x</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00029">29</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 29</span> {</div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">if</span> (x &lt; n-&gt;val) {</div>
<div class="line"><span class="lineno"> 31</span> <span class="keywordflow">if</span> (n-&gt;left == NULL) {</div>
<div class="line"><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"><span class="lineno"> 33</span> temp-&gt;val = x;</div>
<div class="line"><span class="lineno"> 34</span> temp-&gt;left = NULL;</div>
<div class="line"><span class="lineno"> 35</span> temp-&gt;right = NULL;</div>
<div class="line"><span class="lineno"> 36</span> n-&gt;left = temp;</div>
<div class="line"><span class="lineno"> 37</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 38</span> Insert(n-&gt;left, x);</div>
<div class="line"><span class="lineno"> 39</span> }</div>
<div class="line"><span class="lineno"> 40</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">if</span> (n-&gt;right == NULL) {</div>
<div class="line"><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"><span class="lineno"> 43</span> temp-&gt;val = x;</div>
<div class="line"><span class="lineno"> 44</span> temp-&gt;left = NULL;</div>
<div class="line"><span class="lineno"> 45</span> temp-&gt;right = NULL;</div>
<div class="line"><span class="lineno"> 46</span> n-&gt;right = temp;</div>
<div class="line"><span class="lineno"> 47</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 48</span> Insert(n-&gt;right, x);</div>
<div class="line"><span class="lineno"> 49</span> }</div>
<div class="line"><span class="lineno"> 50</span> }</div>
<div class="line"><span class="lineno"> 51</span>}</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>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00125">125</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 125</span> {</div>
<div class="line"><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"><span class="lineno"> 127</span> <a class="code hl_class" href="../../db/da9/classqueue.html">queue</a>.rear = 0;</div>
<div class="line"><span class="lineno"> 128</span> <span class="keywordtype">int</span> value;</div>
<div class="line"><span class="lineno"> 129</span> <span class="keywordtype">int</span> ch;</div>
<div class="line"><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"><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"><span class="lineno"> 132</span> std::cin &gt;&gt; value;</div>
<div class="line"><span class="lineno"> 133</span> root-&gt;val = value;</div>
<div class="line"><span class="lineno"> 134</span> root-&gt;left = NULL;</div>
<div class="line"><span class="lineno"> 135</span> root-&gt;right = NULL;</div>
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">do</span> {</div>
<div class="line"><span class="lineno"> 137</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\n1. Insert&quot;</span></div>
<div class="line"><span class="lineno"> 138</span> &lt;&lt; <span class="stringliteral">&quot;\n2. Delete&quot;</span></div>
<div class="line"><span class="lineno"> 139</span> &lt;&lt; <span class="stringliteral">&quot;\n3. Breadth First&quot;</span></div>
<div class="line"><span class="lineno"> 140</span> &lt;&lt; <span class="stringliteral">&quot;\n4. Preorder Depth First&quot;</span></div>
<div class="line"><span class="lineno"> 141</span> &lt;&lt; <span class="stringliteral">&quot;\n5. Inorder Depth First&quot;</span></div>
<div class="line"><span class="lineno"> 142</span> &lt;&lt; <span class="stringliteral">&quot;\n6. Postorder Depth First&quot;</span>;</div>
<div class="line"><span class="lineno"> 143</span> </div>
<div class="line"><span class="lineno"> 144</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nEnter Your Choice : &quot;</span>;</div>
<div class="line"><span class="lineno"> 145</span> std::cin &gt;&gt; ch;</div>
<div class="line"><span class="lineno"> 146</span> <span class="keywordtype">int</span> x;</div>
<div class="line"><span class="lineno"> 147</span> <span class="keywordflow">switch</span> (ch) {</div>
<div class="line"><span class="lineno"> 148</span> <span class="keywordflow">case</span> 1:</div>
<div class="line"><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"><span class="lineno"> 150</span> std::cin &gt;&gt; x;</div>
<div class="line"><span class="lineno"> 151</span> Insert(root, x);</div>
<div class="line"><span class="lineno"> 152</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 153</span> <span class="keywordflow">case</span> 2:</div>
<div class="line"><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"><span class="lineno"> 155</span> std::cin &gt;&gt; x;</div>
<div class="line"><span class="lineno"> 156</span> Remove(root, root, x);</div>
<div class="line"><span class="lineno"> 157</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 158</span> <span class="keywordflow">case</span> 3:</div>
<div class="line"><span class="lineno"> 159</span> BFT(root);</div>
<div class="line"><span class="lineno"> 160</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 161</span> <span class="keywordflow">case</span> 4:</div>
<div class="line"><span class="lineno"> 162</span> Pre(root);</div>
<div class="line"><span class="lineno"> 163</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 164</span> <span class="keywordflow">case</span> 5:</div>
<div class="line"><span class="lineno"> 165</span> In(root);</div>
<div class="line"><span class="lineno"> 166</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 167</span> <span class="keywordflow">case</span> 6:</div>
<div class="line"><span class="lineno"> 168</span> Post(root);</div>
<div class="line"><span class="lineno"> 169</span> <span class="keywordflow">break</span>;</div>
<div class="line"><span class="lineno"> 170</span> }</div>
<div class="line"><span class="lineno"> 171</span> } <span class="keywordflow">while</span> (ch != 0);</div>
<div class="line"><span class="lineno"> 172</span> </div>
<div class="line"><span class="lineno"> 173</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 174</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a13dac1586cbb95ebfd63dc47aeeff0e1" name="a13dac1586cbb95ebfd63dc47aeeff0e1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a13dac1586cbb95ebfd63dc47aeeff0e1">&#9670;&#160;</a></span>Post()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void Post </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00117">117</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 117</span> {</div>
<div class="line"><span class="lineno"> 118</span> <span class="keywordflow">if</span> (n != NULL) {</div>
<div class="line"><span class="lineno"> 119</span> Post(n-&gt;left);</div>
<div class="line"><span class="lineno"> 120</span> Post(n-&gt;right);</div>
<div class="line"><span class="lineno"> 121</span> std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 122</span> }</div>
<div class="line"><span class="lineno"> 123</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a9e98619e1c6cea9d6c56849a16ecc416" name="a9e98619e1c6cea9d6c56849a16ecc416"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9e98619e1c6cea9d6c56849a16ecc416">&#9670;&#160;</a></span>Pre()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void Pre </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>n</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 101</span> {</div>
<div class="line"><span class="lineno"> 102</span> <span class="keywordflow">if</span> (n != NULL) {</div>
<div class="line"><span class="lineno"> 103</span> std::cout &lt;&lt; n-&gt;val &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 104</span> Pre(n-&gt;left);</div>
<div class="line"><span class="lineno"> 105</span> Pre(n-&gt;right);</div>
<div class="line"><span class="lineno"> 106</span> }</div>
<div class="line"><span class="lineno"> 107</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a4392f2f3d0680befc1a6db07d94d6c5d" name="a4392f2f3d0680befc1a6db07d94d6c5d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4392f2f3d0680befc1a6db07d94d6c5d">&#9670;&#160;</a></span>Remove()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void Remove </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>p</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>n</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>x</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00060">60</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 60</span> {</div>
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">if</span> (n-&gt;val == x) {</div>
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">if</span> (n-&gt;right == NULL &amp;&amp; n-&gt;left == NULL) {</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">if</span> (x &lt; p-&gt;val) {</div>
<div class="line"><span class="lineno"> 64</span> p-&gt;right = NULL;</div>
<div class="line"><span class="lineno"> 65</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 66</span> p-&gt;left = NULL;</div>
<div class="line"><span class="lineno"> 67</span> }</div>
<div class="line"><span class="lineno"> 68</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (n-&gt;right == NULL) {</div>
<div class="line"><span class="lineno"> 69</span> <span class="keywordflow">if</span> (x &lt; p-&gt;val) {</div>
<div class="line"><span class="lineno"> 70</span> p-&gt;right = n-&gt;left;</div>
<div class="line"><span class="lineno"> 71</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 72</span> p-&gt;left = n-&gt;left;</div>
<div class="line"><span class="lineno"> 73</span> }</div>
<div class="line"><span class="lineno"> 74</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (n-&gt;left == NULL) {</div>
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">if</span> (x &lt; p-&gt;val) {</div>
<div class="line"><span class="lineno"> 76</span> p-&gt;right = n-&gt;right;</div>
<div class="line"><span class="lineno"> 77</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 78</span> p-&gt;left = n-&gt;right;</div>
<div class="line"><span class="lineno"> 79</span> }</div>
<div class="line"><span class="lineno"> 80</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 81</span> <span class="keywordtype">int</span> y = findMaxInLeftST(n-&gt;left);</div>
<div class="line"><span class="lineno"> 82</span> n-&gt;val = y;</div>
<div class="line"><span class="lineno"> 83</span> Remove(n, n-&gt;right, y);</div>
<div class="line"><span class="lineno"> 84</span> }</div>
<div class="line"><span class="lineno"> 85</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (x &lt; n-&gt;val) {</div>
<div class="line"><span class="lineno"> 86</span> Remove(n, n-&gt;left, x);</div>
<div class="line"><span class="lineno"> 87</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 88</span> Remove(n, n-&gt;right, x);</div>
<div class="line"><span class="lineno"> 89</span> }</div>
<div class="line"><span class="lineno"> 90</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a name="doc-var-members" id="doc-var-members"></a><h2 id="header-doc-var-members" class="groupheader">Variable Documentation</h2>
<a id="aebb1a5194a2cd7efe7ee7fc417e78293" name="aebb1a5194a2cd7efe7ee7fc417e78293"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aebb1a5194a2cd7efe7ee7fc417e78293">&#9670;&#160;</a></span>queue</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../dc/db5/struct_queue.html">Queue</a> queue</td>
</tr>
</table>
</div><div class="memdoc">
<p class="definition">Definition at line <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html#l00023">23</a> of file <a class="el" href="../../d3/d26/binary__search__tree_8cpp_source.html">binary_search_tree.cpp</a>.</p>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</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