backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 06:12:11 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for f1eddf4d65

Browse Source
This commit is contained in:
realstealthninja
2025-07-09 10:53:16 +00:00
parent e7edde96ab
commit b41207008f
2497 changed files with 31270 additions and 40283 deletions
Download Patch File Download Diff File Expand all files Collapse all files

77
d9/dde/classbinary__search__tree.html
View File

@@ -4,7 +4,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="generator" content="Doxygen 1.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: binary_search_tree&lt; T &gt; Class Template Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -19,7 +19,6 @@
<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="../../resize.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>
@@ -60,26 +59,20 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.13.2 -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() { codefold.init(1); });
/* @license-end */
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
@@ -94,10 +87,9 @@ $(function() {
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function(){initNavTree('d9/dde/classbinary__search__tree.html','../../'); initResizable(true); });
/* @license-end */
$(function(){initNavTree('d9/dde/classbinary__search__tree.html','../../','d3/d05/classbinary__search__tree-members'); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
@@ -121,12 +113,6 @@ $(function(){initNavTree('d9/dde/classbinary__search__tree.html','../../'); init
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pri-methods">Private Member Functions</a> &#124;
<a href="#pri-attribs">Private Attributes</a> &#124;
<a href="../../d3/d05/classbinary__search__tree-members.html">List of all members</a> </div>
<div class="headertitle"><div class="title">binary_search_tree&lt; T &gt; Class Template Reference</div></div>
</div><!--header-->
<div class="contents">
@@ -136,83 +122,62 @@ $(function(){initNavTree('d9/dde/classbinary__search__tree.html','../../'); init
<div class="dynheader">
Collaboration diagram for binary_search_tree&lt; T &gt;:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/da6/classbinary__search__tree__coll__graph.svg" width="331" height="171"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../d3/da6/classbinary__search__tree__coll__graph.svg" width="331" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
<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:"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a></td></tr>
<tr class="memitem:bst_5Fnode" id="r_bst_5Fnode"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A struct to represent a node in the Binary Search Tree. <a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
<tr class="heading"><td colspan="2"><h2 id="header-pub-methods" class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:aa67321ed575ca313cd71d833d91234a6" id="r_aa67321ed575ca313cd71d833d91234a6"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa67321ed575ca313cd71d833d91234a6">binary_search_tree</a> ()</td></tr>
<tr class="memdesc:aa67321ed575ca313cd71d833d91234a6"><td class="mdescLeft">&#160;</td><td class="mdescRight">Construct a new Binary Search Tree object. <br /></td></tr>
<tr class="separator:aa67321ed575ca313cd71d833d91234a6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8168edf29316f2b436eac1fc416c52e0" id="r_a8168edf29316f2b436eac1fc416c52e0"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8168edf29316f2b436eac1fc416c52e0">insert</a> (T new_value)</td></tr>
<tr class="memdesc:a8168edf29316f2b436eac1fc416c52e0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Insert a new value into the BST. <br /></td></tr>
<tr class="separator:a8168edf29316f2b436eac1fc416c52e0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a99771c2e1353e8ddfd4bb9d30b7a98fb" id="r_a99771c2e1353e8ddfd4bb9d30b7a98fb"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a99771c2e1353e8ddfd4bb9d30b7a98fb">remove</a> (T rm_value)</td></tr>
<tr class="memdesc:a99771c2e1353e8ddfd4bb9d30b7a98fb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Remove a specified value from the BST. <br /></td></tr>
<tr class="separator:a99771c2e1353e8ddfd4bb9d30b7a98fb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6bf5b410299df2320ddf2709dda61f63" id="r_a6bf5b410299df2320ddf2709dda61f63"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a6bf5b410299df2320ddf2709dda61f63">contains</a> (T value)</td></tr>
<tr class="memdesc:a6bf5b410299df2320ddf2709dda61f63"><td class="mdescLeft">&#160;</td><td class="mdescRight">Check if a value is in the BST. <br /></td></tr>
<tr class="separator:a6bf5b410299df2320ddf2709dda61f63"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad9912e8574538e86f9bd2c38e7e63d03" id="r_ad9912e8574538e86f9bd2c38e7e63d03"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ad9912e8574538e86f9bd2c38e7e63d03">find_min</a> (T &amp;ret_value)</td></tr>
<tr class="memdesc:ad9912e8574538e86f9bd2c38e7e63d03"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find the smallest value in the BST. <br /></td></tr>
<tr class="separator:ad9912e8574538e86f9bd2c38e7e63d03"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a42b16f26928b5e994925100594a167a0" id="r_a42b16f26928b5e994925100594a167a0"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a42b16f26928b5e994925100594a167a0">find_max</a> (T &amp;ret_value)</td></tr>
<tr class="memdesc:a42b16f26928b5e994925100594a167a0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Find the largest value in the BST. <br /></td></tr>
<tr class="separator:a42b16f26928b5e994925100594a167a0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a564fe43e7e8f7ecb6f10667a70fbc6f3" id="r_a564fe43e7e8f7ecb6f10667a70fbc6f3"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a564fe43e7e8f7ecb6f10667a70fbc6f3">size</a> ()</td></tr>
<tr class="memdesc:a564fe43e7e8f7ecb6f10667a70fbc6f3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get the number of values in the BST. <br /></td></tr>
<tr class="separator:a564fe43e7e8f7ecb6f10667a70fbc6f3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1f23830316204664514f396a4eb5275a" id="r_a1f23830316204664514f396a4eb5275a"><td class="memItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1f23830316204664514f396a4eb5275a">get_elements_inorder</a> ()</td></tr>
<tr class="memdesc:a1f23830316204664514f396a4eb5275a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get all values of the BST in in-order order. <br /></td></tr>
<tr class="separator:a1f23830316204664514f396a4eb5275a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5764c1cf848f84a5b77462036a6d8c13" id="r_a5764c1cf848f84a5b77462036a6d8c13"><td class="memItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5764c1cf848f84a5b77462036a6d8c13">get_elements_preorder</a> ()</td></tr>
<tr class="memdesc:a5764c1cf848f84a5b77462036a6d8c13"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get all values of the BST in pre-order order. <br /></td></tr>
<tr class="separator:a5764c1cf848f84a5b77462036a6d8c13"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5c011e1b0863d79c3a7c11a0426bdcff" id="r_a5c011e1b0863d79c3a7c11a0426bdcff"><td class="memItemLeft" align="right" valign="top">std::vector&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5c011e1b0863d79c3a7c11a0426bdcff">get_elements_postorder</a> ()</td></tr>
<tr class="memdesc:a5c011e1b0863d79c3a7c11a0426bdcff"><td class="mdescLeft">&#160;</td><td class="mdescRight">Get all values of the BST in post-order order. <br /></td></tr>
<tr class="separator:a5c011e1b0863d79c3a7c11a0426bdcff"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
<tr class="heading"><td colspan="2"><h2 id="header-pri-methods" class="groupheader"><a id="pri-methods" name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:a75f897af6aa732a9901454401c869bcb" id="r_a75f897af6aa732a9901454401c869bcb"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a75f897af6aa732a9901454401c869bcb">find_max</a> (std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T &amp;ret_value)</td></tr>
<tr class="memdesc:a75f897af6aa732a9901454401c869bcb"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to find the maximum value in the BST. <br /></td></tr>
<tr class="separator:a75f897af6aa732a9901454401c869bcb"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af9a2c7c187a7ca3142c77ce342ef3153" id="r_af9a2c7c187a7ca3142c77ce342ef3153"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a> (std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T &amp;ret_value)</td></tr>
<tr class="memdesc:af9a2c7c187a7ca3142c77ce342ef3153"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to find the minimum value in the BST. <br /></td></tr>
<tr class="separator:af9a2c7c187a7ca3142c77ce342ef3153"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9d1e7e10efa74d741bf48cf032df3778" id="r_a9d1e7e10efa74d741bf48cf032df3778"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9d1e7e10efa74d741bf48cf032df3778">insert</a> (std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T new_value)</td></tr>
<tr class="memdesc:a9d1e7e10efa74d741bf48cf032df3778"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to insert a value into the BST. <br /></td></tr>
<tr class="separator:a9d1e7e10efa74d741bf48cf032df3778"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af4a865ce5244608819b169fc78a41153" id="r_af4a865ce5244608819b169fc78a41153"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af4a865ce5244608819b169fc78a41153">remove</a> (std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;parent, std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T rm_value)</td></tr>
<tr class="memdesc:af4a865ce5244608819b169fc78a41153"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to remove a value from the BST. <br /></td></tr>
<tr class="separator:af4a865ce5244608819b169fc78a41153"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa4f84b2eec9b9201af1840868ddb5fb2" id="r_aa4f84b2eec9b9201af1840868ddb5fb2"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a> (std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>, T value)</td></tr>
<tr class="memdesc:aa4f84b2eec9b9201af1840868ddb5fb2"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to check if a value is in the BST. <br /></td></tr>
<tr class="separator:aa4f84b2eec9b9201af1840868ddb5fb2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2fcf37549bd002c174a45b0b4203c2bd" id="r_a2fcf37549bd002c174a45b0b4203c2bd"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a> (std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
<tr class="memdesc:a2fcf37549bd002c174a45b0b4203c2bd"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to traverse the tree in in-order order. <br /></td></tr>
<tr class="separator:a2fcf37549bd002c174a45b0b4203c2bd"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab81edd415324d372632c42dc7dbcb9e1" id="r_ab81edd415324d372632c42dc7dbcb9e1"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a> (std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
<tr class="memdesc:ab81edd415324d372632c42dc7dbcb9e1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to traverse the tree in pre-order order. <br /></td></tr>
<tr class="separator:ab81edd415324d372632c42dc7dbcb9e1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a87c0a35845d27e0f6fc1f4eaa0333362" id="r_a87c0a35845d27e0f6fc1f4eaa0333362"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a> (std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
<tr class="memdesc:a87c0a35845d27e0f6fc1f4eaa0333362"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive function to traverse the tree in post-order order. <br /></td></tr>
<tr class="separator:a87c0a35845d27e0f6fc1f4eaa0333362"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
<tr class="heading"><td colspan="2"><h2 id="header-pri-attribs" class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
Private Attributes</h2></td></tr>
<tr class="memitem:aa08f65f6f3bfcb14f8c3d1e65305ae50" id="r_aa08f65f6f3bfcb14f8c3d1e65305ae50"><td class="memItemLeft" align="right" valign="top">std::unique_ptr&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a></td></tr>
<tr class="separator:aa08f65f6f3bfcb14f8c3d1e65305ae50"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a07ba32ce1a2af6e357600ac8c8e98dbc" id="r_a07ba32ce1a2af6e357600ac8c8e98dbc"><td class="memItemLeft" align="right" valign="top">std::size_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a> = 0</td></tr>
<tr class="separator:a07ba32ce1a2af6e357600ac8c8e98dbc"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><div class="compoundTemplParams">template&lt;class T&gt;<br />
class binary_search_tree&lt; T &gt;</div><p>The Binary Search Tree class. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
@@ -223,7 +188,7 @@ class binary_search_tree&lt; T &gt;</div><p>The Binary Search Tree class. </p>
</dl>
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00020">20</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
</div><a name="doc-constructors" id="doc-constructors"></a><h2 id="header-doc-constructors" class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="aa67321ed575ca313cd71d833d91234a6" name="aa67321ed575ca313cd71d833d91234a6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa67321ed575ca313cd71d833d91234a6">&#9670;&#160;</a></span>binary_search_tree()</h2>
@@ -261,7 +226,7 @@ template&lt;class T&gt; </div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Member Function Documentation</h2>
<a id="aa4f84b2eec9b9201af1840868ddb5fb2" name="aa4f84b2eec9b9201af1840868ddb5fb2"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa4f84b2eec9b9201af1840868ddb5fb2">&#9670;&#160;</a></span>contains() <span class="overload">[1/2]</span></h2>
@@ -1119,7 +1084,7 @@ template&lt;class T&gt; </div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a name="doc-variable-members" id="doc-variable-members"></a><h2 id="header-doc-variable-members" class="groupheader">Member Data Documentation</h2>
<a id="aa08f65f6f3bfcb14f8c3d1e65305ae50" name="aa08f65f6f3bfcb14f8c3d1e65305ae50"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">&#9670;&#160;</a></span>root_</h2>
@@ -1179,11 +1144,19 @@ template&lt;class T&gt; </div>
</ul>
</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 class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</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.13.2 </li>
<li class="navelem"><a href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</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>