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

Documentation for af6e2c8991

Browse Source
This commit is contained in:
realstealthninja
2026-09-21 04:13:18 +00:00
parent fa852a6801
commit cc04e74d11
2789 changed files with 66741 additions and 46802 deletions
Download Patch File Download Diff File Expand all files Collapse all files

83
df/d42/binary__search__tree2_8cpp.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.14.0"/>
<meta name="generator" content="Doxygen 1.18.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: data_structures/binary_search_tree2.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -59,22 +59,47 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<!-- Generated by Doxygen 1.18.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
let searchBox = new SearchBox("searchBox", "../../search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
document.addEventListener('DOMContentLoaded', codefold.init);
</script>
<script type="application/json" id="doxygen-config">
{
"relPath": "../../",
"generateTreeView": true,
"searchEngine": true,
"serverBasedSearch": false,
"disableIndex": false,
"dynamicMenus": true,
"fullSidebar": false
}
</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 id="main-nav-mobile">
<div class="sm sm-dox"><input id="main-menu-state" type="checkbox"/>
<label class="main-menu-btn" for="main-menu-state">
<span class="main-menu-btn-icon"></span> Toggle main menu visibility</label>
<span id="searchBoxPos1"></span>
</div>
</div><!-- main-nav-mobile -->
<div id="main-nav">
<ul class="sm sm-dox" id="main-menu">
<li id="searchBoxPos2">
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<span id="MSearchSelect" class="search-icon"><span class="search-icon-dropdown"></span></span>
<input type="text" id="MSearchField" value="" placeholder="Search" accesskey="S"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><div id="MSearchCloseImg" class="close-icon"></div></a>
</span>
</div>
</li>
</ul>
</div><!-- main-nav -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
@@ -82,20 +107,16 @@ $(function() {
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
<div id="splitbar" class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(function(){initNavTree('df/d42/binary__search__tree2_8cpp.html','../../',''); });
document.addEventListener('DOMContentLoaded',() => { initNavTree('df/d42/binary__search__tree2_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 id="MSearchSelectWindow">
</div>
<!-- iframe showing the search results (closed by default) -->
@@ -134,30 +155,30 @@ Include dependency graph for binary_search_tree2.cpp:</div>
<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:binary_5Fsearch_5Ftree_3C_20T_20_3E" id="r_binary_5Fsearch_5Ftree_3C_20T_20_3E"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt; T &gt;</a></td></tr>
<tr class="memitem:binary_5Fsearch_5Ftree_3C_20T_20_3E" id="r_binary_5Fsearch_5Ftree_3C_20T_20_3E"><td class="memItemLeft">class &#160;</td><td class="memItemRight"><a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree&lt; T &gt;</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">The Binary Search Tree class. <a href="../../d9/dde/classbinary__search__tree.html#details">More...</a><br /></td></tr>
<tr class="memitem:binary_5Fsearch_5Ftree_3C_20T_20_3E_3A_3Abst_5Fnode" id="r_binary_5Fsearch_5Ftree_3C_20T_20_3E_3A_3Abst_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">binary_search_tree&lt; T &gt;::bst_node</a></td></tr>
<tr class="memitem:binary_5Fsearch_5Ftree_3C_20T_20_3E_3A_3Abst_5Fnode" id="r_binary_5Fsearch_5Ftree_3C_20T_20_3E_3A_3Abst_5Fnode"><td class="memItemLeft">struct &#160;</td><td class="memItemRight"><a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">binary_search_tree&lt; T &gt;::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>
</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:a8c882f43e1e52948a7841a8bfb091350" id="r_a8c882f43e1e52948a7841a8bfb091350"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a8c882f43e1e52948a7841a8bfb091350">test_insert</a> ()</td></tr>
<tr class="memitem:a8c882f43e1e52948a7841a8bfb091350" id="r_a8c882f43e1e52948a7841a8bfb091350"><td class="memItemLeft">static void&#160;</td><td class="memItemRight"><a class="el" href="#a8c882f43e1e52948a7841a8bfb091350">test_insert</a> ()</td></tr>
<tr class="memdesc:a8c882f43e1e52948a7841a8bfb091350"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing <a class="el" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b" title="inserts a new element into AVL tree">insert()</a>. <br /></td></tr>
<tr class="memitem:ab1333c3ea06dcad896ee204bbd407c4e" id="r_ab1333c3ea06dcad896ee204bbd407c4e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab1333c3ea06dcad896ee204bbd407c4e">test_remove</a> ()</td></tr>
<tr class="memitem:ab1333c3ea06dcad896ee204bbd407c4e" id="r_ab1333c3ea06dcad896ee204bbd407c4e"><td class="memItemLeft">static void&#160;</td><td class="memItemRight"><a class="el" href="#ab1333c3ea06dcad896ee204bbd407c4e">test_remove</a> ()</td></tr>
<tr class="memdesc:ab1333c3ea06dcad896ee204bbd407c4e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing remove(). <br /></td></tr>
<tr class="memitem:a1d42876440ac5346e2850a32497385c3" id="r_a1d42876440ac5346e2850a32497385c3"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1d42876440ac5346e2850a32497385c3">test_contains</a> ()</td></tr>
<tr class="memitem:a1d42876440ac5346e2850a32497385c3" id="r_a1d42876440ac5346e2850a32497385c3"><td class="memItemLeft">static void&#160;</td><td class="memItemRight"><a class="el" href="#a1d42876440ac5346e2850a32497385c3">test_contains</a> ()</td></tr>
<tr class="memdesc:a1d42876440ac5346e2850a32497385c3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing contains(). <br /></td></tr>
<tr class="memitem:af2847a901160fd45b4044550e9921cb4" id="r_af2847a901160fd45b4044550e9921cb4"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af2847a901160fd45b4044550e9921cb4">test_find_min</a> ()</td></tr>
<tr class="memitem:af2847a901160fd45b4044550e9921cb4" id="r_af2847a901160fd45b4044550e9921cb4"><td class="memItemLeft">static void&#160;</td><td class="memItemRight"><a class="el" href="#af2847a901160fd45b4044550e9921cb4">test_find_min</a> ()</td></tr>
<tr class="memdesc:af2847a901160fd45b4044550e9921cb4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing find_min(). <br /></td></tr>
<tr class="memitem:a9856b68e2cba50d2e26a1cbe374e0365" id="r_a9856b68e2cba50d2e26a1cbe374e0365"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a9856b68e2cba50d2e26a1cbe374e0365">test_find_max</a> ()</td></tr>
<tr class="memitem:a9856b68e2cba50d2e26a1cbe374e0365" id="r_a9856b68e2cba50d2e26a1cbe374e0365"><td class="memItemLeft">static void&#160;</td><td class="memItemRight"><a class="el" href="#a9856b68e2cba50d2e26a1cbe374e0365">test_find_max</a> ()</td></tr>
<tr class="memdesc:a9856b68e2cba50d2e26a1cbe374e0365"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing find_max(). <br /></td></tr>
<tr class="memitem:a06f35064850e891d6fda0093c0d9ee6e" id="r_a06f35064850e891d6fda0093c0d9ee6e"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a06f35064850e891d6fda0093c0d9ee6e">test_get_elements_inorder</a> ()</td></tr>
<tr class="memitem:a06f35064850e891d6fda0093c0d9ee6e" id="r_a06f35064850e891d6fda0093c0d9ee6e"><td class="memItemLeft">static void&#160;</td><td class="memItemRight"><a class="el" href="#a06f35064850e891d6fda0093c0d9ee6e">test_get_elements_inorder</a> ()</td></tr>
<tr class="memdesc:a06f35064850e891d6fda0093c0d9ee6e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing get_elements_inorder(). <br /></td></tr>
<tr class="memitem:ab00b8d0f21aeb5fbddb6decf3bcb640a" id="r_ab00b8d0f21aeb5fbddb6decf3bcb640a"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ab00b8d0f21aeb5fbddb6decf3bcb640a">test_get_elements_preorder</a> ()</td></tr>
<tr class="memitem:ab00b8d0f21aeb5fbddb6decf3bcb640a" id="r_ab00b8d0f21aeb5fbddb6decf3bcb640a"><td class="memItemLeft">static void&#160;</td><td class="memItemRight"><a class="el" href="#ab00b8d0f21aeb5fbddb6decf3bcb640a">test_get_elements_preorder</a> ()</td></tr>
<tr class="memdesc:ab00b8d0f21aeb5fbddb6decf3bcb640a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing get_elements_preorder(). <br /></td></tr>
<tr class="memitem:a94b76f781fcbe1ad0e3397ace6bb1965" id="r_a94b76f781fcbe1ad0e3397ace6bb1965"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a94b76f781fcbe1ad0e3397ace6bb1965">test_get_elements_postorder</a> ()</td></tr>
<tr class="memitem:a94b76f781fcbe1ad0e3397ace6bb1965" id="r_a94b76f781fcbe1ad0e3397ace6bb1965"><td class="memItemLeft">static void&#160;</td><td class="memItemRight"><a class="el" href="#a94b76f781fcbe1ad0e3397ace6bb1965">test_get_elements_postorder</a> ()</td></tr>
<tr class="memdesc:a94b76f781fcbe1ad0e3397ace6bb1965"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function for testing get_elements_postorder(). <br /></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="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft">int&#160;</td><td class="memItemRight"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p>A generic <a href="https://en.wikipedia.org/wiki/Binary_search_tree" target="_blank">binary search tree</a> implementation. Here you can find more information about the algorithm: <a href="https://www.scaler.com/topics/data-structures/binary-search-tree/" target="_blank">Scaler - Binary Search tree</a>. </p>
@@ -620,8 +641,8 @@ Functions</h2></td></tr>
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="../../dir_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a href="../../df/d42/binary__search__tree2_8cpp.html">binary_search_tree2.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.14.0 </li>
<li class="navelem"><b>data_structures</b></li><li class="navelem"><a href="../../df/d42/binary__search__tree2_8cpp.html">binary_search_tree2.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.18.0 </li>
</ul>
</div>
</body>