backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-23 13:22:47 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 2dadbf73f4

Browse Source
This commit is contained in:
github-actions
2024-02-12 20:07:08 +00:00
parent b5b4d78981
commit a1eb9bd385
1261 changed files with 30404 additions and 29974 deletions
Download Patch File Download Diff File Expand all files Collapse all files

89
d3/d26/binary__search__tree_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures/binary_search_tree.cpp File Reference</title>
<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="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<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>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d3/d26/binary__search__tree_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('d3/d26/binary__search__tree_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -123,25 +125,25 @@ Classes</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 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="../../d3/d26/binary__search__tree_8cpp.html#a1ca1e6aad9a9e45c1d21a7c8f61bccc3">enqueue</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</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="separator:a1ca1e6aad9a9e45c1d21a7c8f61bccc3"><td class="memSeparator" colspan="2">&#160;</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="../../d3/d26/binary__search__tree_8cpp.html#a11b4c912d85c475c67abab608f86ecce">dequeue</a> ()</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="separator:a11b4c912d85c475c67abab608f86ecce"><td class="memSeparator" colspan="2">&#160;</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="../../d3/d26/binary__search__tree_8cpp.html#a521ea77f195e491750e602292c6dc335">Insert</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n, int x)</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="separator:a521ea77f195e491750e602292c6dc335"><td class="memSeparator" colspan="2">&#160;</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="../../d3/d26/binary__search__tree_8cpp.html#a4a1aaff44d949318d93231e1fa5c7863">findMaxInLeftST</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</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="separator:a4a1aaff44d949318d93231e1fa5c7863"><td class="memSeparator" colspan="2">&#160;</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="../../d3/d26/binary__search__tree_8cpp.html#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: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="separator:a4392f2f3d0680befc1a6db07d94d6c5d"><td class="memSeparator" colspan="2">&#160;</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="../../d3/d26/binary__search__tree_8cpp.html#aa65d9b7fa9bd517ace3d819abc85c8b6">BFT</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *n)</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="separator:aa65d9b7fa9bd517ace3d819abc85c8b6"><td class="memSeparator" colspan="2">&#160;</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="../../d3/d26/binary__search__tree_8cpp.html#a9e98619e1c6cea9d6c56849a16ecc416">Pre</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="separator:a9e98619e1c6cea9d6c56849a16ecc416"><td class="memSeparator" colspan="2">&#160;</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="../../d3/d26/binary__search__tree_8cpp.html#adb338121baec7856c9593d79ddeb5e18">In</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="separator:adb338121baec7856c9593d79ddeb5e18"><td class="memSeparator" colspan="2">&#160;</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="../../d3/d26/binary__search__tree_8cpp.html#a13dac1586cbb95ebfd63dc47aeeff0e1">Post</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="separator:a13dac1586cbb95ebfd63dc47aeeff0e1"><td class="memSeparator" colspan="2">&#160;</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="../../d3/d26/binary__search__tree_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</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>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="var-members" name="var-members"></a>
@@ -152,7 +154,7 @@ Variables</h2></td></tr>
</table>
<a name="details" id="details"></a><h2 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="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>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="aa65d9b7fa9bd517ace3d819abc85c8b6" name="aa65d9b7fa9bd517ace3d819abc85c8b6"></a>
@@ -164,8 +166,7 @@ Variables</h2></td></tr>
<tr>
<td class="memname">void BFT </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>n</em></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>
@@ -191,7 +192,7 @@ Variables</h2></td></tr>
<tr>
<td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a> * dequeue </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -211,8 +212,7 @@ Variables</h2></td></tr>
<tr>
<td class="memname">void enqueue </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>n</em></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>
@@ -230,8 +230,7 @@ Variables</h2></td></tr>
<tr>
<td class="memname">int findMaxInLeftST </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>n</em></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>
@@ -254,8 +253,7 @@ Variables</h2></td></tr>
<tr>
<td class="memname">void In </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>n</em></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>
@@ -279,26 +277,19 @@ Variables</h2></td></tr>
<tr>
<td class="memname">void Insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>n</em>, </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&#160;</td>
<td class="paramname"><em>x</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></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">
<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"> 32</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">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>
@@ -308,7 +299,7 @@ Variables</h2></td></tr>
<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"> 42</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">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>
@@ -318,6 +309,7 @@ Variables</h2></td></tr>
<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="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> avltree.cpp:13</div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> binary_search_tree.cpp:11</div></div>
</div><!-- fragment -->
</div>
@@ -331,8 +323,7 @@ Variables</h2></td></tr>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -342,7 +333,7 @@ Variables</h2></td></tr>
<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"> 130</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
<div class="line"><span class="lineno"> 131</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\nEnter the value of root node :&quot;</span>;</div>
<div class="line"><span class="lineno"> 132</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> &gt;&gt; value;</div>
<div class="line"><span class="lineno"> 133</span> root-&gt;val = value;</div>
@@ -400,8 +391,7 @@ Variables</h2></td></tr>
<tr>
<td class="memname">void Post </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>n</em></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>
@@ -425,8 +415,7 @@ Variables</h2></td></tr>
<tr>
<td class="memname">void Pre </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>n</em></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>
@@ -450,25 +439,17 @@ Variables</h2></td></tr>
<tr>
<td class="memname">void Remove </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td>
<td class="paramname"><em>p</em>, </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> *&#160;</td>
<td class="paramname"><em>n</em>, </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&#160;</td>
<td class="paramname"><em>x</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></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">
@@ -512,7 +493,7 @@ Variables</h2></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../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.9.8 </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.10.0 </li>
</ul>
</div>
</body>