dev0/SLikeNet
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Init

Browse Source
This commit is contained in:
dev0
2025-11-24 14:19:51 +05:30
commit f5c1412b28
6734 changed files with 1527575 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

37
Help/Doxygen/html/db/d19/class_data_structures_1_1_binary_search_tree.js Normal file
View File

@ -0,0 +1,37 @@
var class_data_structures_1_1_binary_search_tree =
[
[ "node", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node", [
[ "item", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#aae201835a5764223f821b246ebd3f700", null ],
[ "left", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#ac4f290c3a0db3cbeb593c0fc4e825efc", null ],
[ "right", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a081b81949db193622d3ec9811c1fbaf9", null ]
] ],
[ "Direction_Types", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a84089f536d9c987fff2036cf0e910f3a", [
[ "NOT_FOUND", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a84089f536d9c987fff2036cf0e910f3aa8c936ef6dbd6034f95a39138a685e155", null ],
[ "LEFT", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a84089f536d9c987fff2036cf0e910f3aa46c975096614f0b49bcbba65e8a0a455", null ],
[ "RIGHT", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a84089f536d9c987fff2036cf0e910f3aad9027bdc98a5d303de4aa99ebb6bbe9e", null ],
[ "ROOT", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a84089f536d9c987fff2036cf0e910f3aa96101957d6528addd19368dead6fb76d", null ]
] ],
[ "BinarySearchTree", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#aa2eae4277af5983b79abe2f84c6d5ab6", null ],
[ "~BinarySearchTree", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#aeb7774f9c2928f5796b3ddcf8a19810c", null ],
[ "BinarySearchTree", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a9971027b56966fa5c34075f67dd22bc0", null ],
[ "Add", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#add1e90ecd655a1b28be29813b43f79a8", null ],
[ "Clear", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a2380dab08090b867bb19dbe26bb62dfe", null ],
[ "Del", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a9a29693e4575fc0fe18ab778a75c89b8", null ],
[ "DisplayBreadthFirstSearch", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a718b886877feb30466efba30341c0a82", null ],
[ "DisplayInorder", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a66f82a3176d81b0ef3d1a8362d9e1507", null ],
[ "DisplayPostorder", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a03b31b8c324d813560205b2806775f46", null ],
[ "DisplayPostorderRecursive", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#ae01518754ae96d9df3df3ccd0b65fb15", null ],
[ "DisplayPreorder", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a4b2048b47d3a209de79a185ca29c65e4", null ],
[ "Find", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a0196a589767ca99d7a7caa9b41225817", null ],
[ "FindParent", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#abf40adb877ad2b915da8d05bc603b98d", null ],
[ "FixTree", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#ac9695192b853884f7accb60c157b5ab7", null ],
[ "GetPointerToNode", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#ac7878327f9c37d8b7d63d6f98bb9b35e", null ],
[ "Height", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#aaa31a55fe61ec63cf401e0943a9a3361", null ],
[ "HeightRecursive", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a2b11c7d903e037a726decc1cd866d4e7", null ],
[ "IsIn", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#adca1aa14d6bdeec90248567b05e4c28f", null ],
[ "operator=", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#ab31d3d1c76535e657e24d687a6ac0f3c", null ],
[ "Size", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a95931c3bdd7589cc1696b0ad0b5f78ab", null ],
[ "BinarySearchTree_size", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a4dfb2e2b9a0a8f23e4fc636b58ea4d3f", null ],
[ "direction", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a292e62e2b24b59d393657ff3c69c82ed", null ],
[ "root", "db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a6854050657cfa61442e6189dd0039318", null ]
];

962
Help/Doxygen/html/db/d19/class_data_structures_1_1_binary_search_tree.xhtml Normal file
View File

@ -0,0 +1,962 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>SLikeNet: DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt; Class Template 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>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="../../doxygen.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 style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">SLikeNet
&#160;<span id="projectnumber">0.1.3</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.2 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search",false,'Search');
</script>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="../../index.xhtml"><span>Main&#160;Page</span></a></li>
<li><a href="../../pages.xhtml"><span>Related&#160;Pages</span></a></li>
<li><a href="../../modules.xhtml"><span>Modules</span></a></li>
<li><a href="../../namespaces.xhtml"><span>Namespaces</span></a></li>
<li class="current"><a href="../../annotated.xhtml"><span>Classes</span></a></li>
<li><a href="../../files.xhtml"><span>Files</span></a></li>
<li>
<div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="../../search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="../../search/close.png" alt=""/></a>
</span>
</div>
</li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="../../annotated.xhtml"><span>Class&#160;List</span></a></li>
<li><a href="../../classes.xhtml"><span>Class&#160;Index</span></a></li>
<li><a href="../../inherits.xhtml"><span>Class&#160;Hierarchy</span></a></li>
<li><a href="../../functions.xhtml"><span>Class&#160;Members</span></a></li>
</ul>
</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">
$(document).ready(function(){initNavTree('db/d19/class_data_structures_1_1_binary_search_tree.xhtml','../../');});
</script>
<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)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark">&#160;</span>Macros</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(11)"><span class="SelectionMark">&#160;</span>Groups</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(12)"><span class="SelectionMark">&#160;</span>Pages</a></div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</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="#pro-types">Protected Types</a> &#124;
<a href="#pro-methods">Protected Member Functions</a> &#124;
<a href="#pro-attribs">Protected Attributes</a> &#124;
<a href="../../dc/d13/class_data_structures_1_1_binary_search_tree-members.xhtml">List of all members</a> </div>
<div class="headertitle">
<div class="title">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt; Class Template Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>A binary search tree and an AVL balanced binary search tree.
<a href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#details">More...</a></p>
<p><code>#include &lt;<a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">slikenet/DS_BinarySearchTree.h</a>&gt;</code></p>
<div id="dynsection-0" onclick="return toggleVisibility(this)" class="dynheader closed" style="cursor:pointer;">
<img id="dynsection-0-trigger" src="../../closed.png" alt="+"/> Inheritance diagram for DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;:</div>
<div id="dynsection-0-summary" class="dynsummary" style="display:block;">
</div>
<div id="dynsection-0-content" class="dyncontent" style="display:none;">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../de/d04/class_data_structures_1_1_binary_search_tree__inherit__graph.svg" width="100%" height="600"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:de/d61/struct_data_structures_1_1_binary_search_tree_1_1node"><td class="memItemLeft" align="right" valign="top">struct &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a></td></tr>
<tr class="separator:de/d61/struct_data_structures_1_1_binary_search_tree_1_1node"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:aa2eae4277af5983b79abe2f84c6d5ab6"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#aa2eae4277af5983b79abe2f84c6d5ab6">BinarySearchTree</a> ()</td></tr>
<tr class="separator:aa2eae4277af5983b79abe2f84c6d5ab6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aeb7774f9c2928f5796b3ddcf8a19810c"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#aeb7774f9c2928f5796b3ddcf8a19810c">~BinarySearchTree</a> ()</td></tr>
<tr class="separator:aeb7774f9c2928f5796b3ddcf8a19810c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9971027b56966fa5c34075f67dd22bc0"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a9971027b56966fa5c34075f67dd22bc0">BinarySearchTree</a> (const <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a> &amp;original_type)</td></tr>
<tr class="separator:a9971027b56966fa5c34075f67dd22bc0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab31d3d1c76535e657e24d687a6ac0f3c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#ab31d3d1c76535e657e24d687a6ac0f3c">operator=</a> (const <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a> &amp;original_copy)</td></tr>
<tr class="separator:ab31d3d1c76535e657e24d687a6ac0f3c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a95931c3bdd7589cc1696b0ad0b5f78ab"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a95931c3bdd7589cc1696b0ad0b5f78ab">Size</a> (void)</td></tr>
<tr class="separator:a95931c3bdd7589cc1696b0ad0b5f78ab"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2380dab08090b867bb19dbe26bb62dfe"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a2380dab08090b867bb19dbe26bb62dfe">Clear</a> (const char *file, unsigned int line)</td></tr>
<tr class="separator:a2380dab08090b867bb19dbe26bb62dfe"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aaa31a55fe61ec63cf401e0943a9a3361"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#aaa31a55fe61ec63cf401e0943a9a3361">Height</a> (<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *starting_node=0)</td></tr>
<tr class="separator:aaa31a55fe61ec63cf401e0943a9a3361"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:add1e90ecd655a1b28be29813b43f79a8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#add1e90ecd655a1b28be29813b43f79a8">Add</a> (const BinarySearchTreeType &amp;input, const char *file, unsigned int line)</td></tr>
<tr class="separator:add1e90ecd655a1b28be29813b43f79a8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9a29693e4575fc0fe18ab778a75c89b8"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a9a29693e4575fc0fe18ab778a75c89b8">Del</a> (const BinarySearchTreeType &amp;input, const char *file, unsigned int line)</td></tr>
<tr class="separator:a9a29693e4575fc0fe18ab778a75c89b8"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adca1aa14d6bdeec90248567b05e4c28f"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#adca1aa14d6bdeec90248567b05e4c28f">IsIn</a> (const BinarySearchTreeType &amp;input)</td></tr>
<tr class="separator:adca1aa14d6bdeec90248567b05e4c28f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a66f82a3176d81b0ef3d1a8362d9e1507"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a66f82a3176d81b0ef3d1a8362d9e1507">DisplayInorder</a> (BinarySearchTreeType *return_array)</td></tr>
<tr class="separator:a66f82a3176d81b0ef3d1a8362d9e1507"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4b2048b47d3a209de79a185ca29c65e4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a4b2048b47d3a209de79a185ca29c65e4">DisplayPreorder</a> (BinarySearchTreeType *return_array)</td></tr>
<tr class="separator:a4b2048b47d3a209de79a185ca29c65e4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a03b31b8c324d813560205b2806775f46"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a03b31b8c324d813560205b2806775f46">DisplayPostorder</a> (BinarySearchTreeType *return_array)</td></tr>
<tr class="separator:a03b31b8c324d813560205b2806775f46"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a718b886877feb30466efba30341c0a82"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a718b886877feb30466efba30341c0a82">DisplayBreadthFirstSearch</a> (BinarySearchTreeType *return_array)</td></tr>
<tr class="separator:a718b886877feb30466efba30341c0a82"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac7878327f9c37d8b7d63d6f98bb9b35e"><td class="memItemLeft" align="right" valign="top">BinarySearchTreeType *&amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#ac7878327f9c37d8b7d63d6f98bb9b35e">GetPointerToNode</a> (const BinarySearchTreeType &amp;element)</td></tr>
<tr class="separator:ac7878327f9c37d8b7d63d6f98bb9b35e"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-types"></a>
Protected Types</h2></td></tr>
<tr class="memitem:a84089f536d9c987fff2036cf0e910f3a"><td class="memItemLeft" align="right" valign="top">enum &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a84089f536d9c987fff2036cf0e910f3a">Direction_Types</a> { <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a84089f536d9c987fff2036cf0e910f3aa8c936ef6dbd6034f95a39138a685e155">NOT_FOUND</a>,
<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a84089f536d9c987fff2036cf0e910f3aa46c975096614f0b49bcbba65e8a0a455">LEFT</a>,
<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a84089f536d9c987fff2036cf0e910f3aad9027bdc98a5d303de4aa99ebb6bbe9e">RIGHT</a>,
<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a84089f536d9c987fff2036cf0e910f3aa96101957d6528addd19368dead6fb76d">ROOT</a>
}</td></tr>
<tr class="separator:a84089f536d9c987fff2036cf0e910f3a"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-methods"></a>
Protected Member Functions</h2></td></tr>
<tr class="memitem:a2b11c7d903e037a726decc1cd866d4e7"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a2b11c7d903e037a726decc1cd866d4e7">HeightRecursive</a> (<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *current)</td></tr>
<tr class="separator:a2b11c7d903e037a726decc1cd866d4e7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0196a589767ca99d7a7caa9b41225817"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *&amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a0196a589767ca99d7a7caa9b41225817">Find</a> (const BinarySearchTreeType &amp;element, <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> **parent)</td></tr>
<tr class="separator:a0196a589767ca99d7a7caa9b41225817"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abf40adb877ad2b915da8d05bc603b98d"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *&amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#abf40adb877ad2b915da8d05bc603b98d">FindParent</a> (const BinarySearchTreeType &amp;element)</td></tr>
<tr class="separator:abf40adb877ad2b915da8d05bc603b98d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae01518754ae96d9df3df3ccd0b65fb15"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#ae01518754ae96d9df3df3ccd0b65fb15">DisplayPostorderRecursive</a> (<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *current, BinarySearchTreeType *return_array, unsigned int &amp;index)</td></tr>
<tr class="separator:ae01518754ae96d9df3df3ccd0b65fb15"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac9695192b853884f7accb60c157b5ab7"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#ac9695192b853884f7accb60c157b5ab7">FixTree</a> (<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *current)</td></tr>
<tr class="separator:ac9695192b853884f7accb60c157b5ab7"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pro-attribs"></a>
Protected Attributes</h2></td></tr>
<tr class="memitem:a6854050657cfa61442e6189dd0039318"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a6854050657cfa61442e6189dd0039318">root</a></td></tr>
<tr class="separator:a6854050657cfa61442e6189dd0039318"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a292e62e2b24b59d393657ff3c69c82ed"><td class="memItemLeft" align="right" valign="top">enum <br class="typebreak"/>
<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a84089f536d9c987fff2036cf0e910f3a">DataStructures::BinarySearchTree::Direction_Types</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a292e62e2b24b59d393657ff3c69c82ed">direction</a></td></tr>
<tr class="separator:a292e62e2b24b59d393657ff3c69c82ed"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4dfb2e2b9a0a8f23e4fc636b58ea4d3f"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a4dfb2e2b9a0a8f23e4fc636b58ea4d3f">BinarySearchTree_size</a></td></tr>
<tr class="separator:a4dfb2e2b9a0a8f23e4fc636b58ea4d3f"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><h3>template&lt;class BinarySearchTreeType&gt;<br/>
class DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;</h3>
<p>A binary search tree and an AVL balanced binary search tree. </p>
<p>Initilize with the following structure</p>
<p>BinarySearchTree&lt;TYPE&gt;</p>
<p>OR</p>
<p>AVLBalancedBinarySearchTree&lt;TYPE&gt;</p>
<p>Use the AVL balanced tree if you want the tree to be balanced after every deletion and addition. This avoids the potential worst case scenario where ordered input to a binary search tree gives linear search time results. It's not needed if input will be evenly distributed, in which case the search time is O (log n). The search time for the AVL balanced binary tree is O (log n) irregardless of input.</p>
<p>Has the following member functions unsigned int Height(&lt;index&gt;) - Returns the height of the tree at the optional specified starting index. Default is the root add(element) - adds an element to the <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml" title="A binary search tree and an AVL balanced binary search tree.">BinarySearchTree</a> bool del(element) - deletes the node containing element if the element is in the tree as defined by a comparison with the == operator. Returns true on success, false if the element is not found bool IsInelement) - returns true if element is in the tree as defined by a comparison with the == operator. Otherwise returns false DisplayInorder(array) - Fills an array with an inorder search of the elements in the tree. USER IS REPONSIBLE FOR ALLOCATING THE ARRAY!. DisplayPreorder(array) - Fills an array with an preorder search of the elements in the tree. USER IS REPONSIBLE FOR ALLOCATING THE ARRAY!. DisplayPostorder(array) - Fills an array with an postorder search of the elements in the tree. USER IS REPONSIBLE FOR ALLOCATING THE ARRAY!. DisplayBreadthFirstSearch(array) - Fills an array with a breadth first search of the elements in the tree. USER IS REPONSIBLE FOR ALLOCATING THE ARRAY!. clear - Destroys the tree. Same as calling the destructor unsigned int <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#aaa31a55fe61ec63cf401e0943a9a3361">Height()</a> - Returns the height of the tree unsigned int size() - returns the size of the <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml" title="A binary search tree and an AVL balanced binary search tree.">BinarySearchTree</a> GetPointerToNode(element) - returns a pointer to the comparision element in the tree, allowing for direct modification when necessary with complex data types. Be warned, it is possible to corrupt the tree if the element used for comparisons is modified. Returns NULL if the item is not found</p>
<p>EXAMPLE </p>
<div class="fragment"><div class="line">BinarySearchTree&lt;int&gt; A;</div>
<div class="line">A.Add(10);</div>
<div class="line">A.Add(15);</div>
<div class="line">A.Add(5);</div>
<div class="line"><span class="keywordtype">int</span>* array = SLNet::OP_NEW&lt;int &gt;(A.Size(), <a class="code" href="../../d8/db0/defines_8h.xhtml#a8661ec2137eef33a8cd0cd618a748871">_FILE_AND_LINE_</a> );</div>
<div class="line">A.DisplayInorder(array);</div>
<div class="line">array[0]; <span class="comment">// returns 5</span></div>
<div class="line">array[1]; <span class="comment">// returns 10</span></div>
<div class="line">array[2]; <span class="comment">// returns 15</span></div>
</div><!-- fragment --><p> compress - reallocates memory to fit the number of elements. Best used when the number of elements decreases</p>
<p>clear - empties the <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml" title="A binary search tree and an AVL balanced binary search tree.">BinarySearchTree</a> and returns storage The assignment and copy constructors are defined</p>
<dl class="section note"><dt>Note</dt><dd>The template type must have the copy constructor and assignment operator defined and must work with &gt;, &lt;, and == All elements in the tree MUST be distinct The assignment operator is defined between <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml" title="A binary search tree and an AVL balanced binary search tree.">BinarySearchTree</a> and <a class="el" href="../../dd/d07/class_data_structures_1_1_a_v_l_balanced_binary_search_tree.xhtml" title="An AVLBalancedBinarySearchTree is a binary tree that is always balanced.">AVLBalancedBinarySearchTree</a> as long as they are of the same template type. However, passing a <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml" title="A binary search tree and an AVL balanced binary search tree.">BinarySearchTree</a> to an <a class="el" href="../../dd/d07/class_data_structures_1_1_a_v_l_balanced_binary_search_tree.xhtml" title="An AVLBalancedBinarySearchTree is a binary tree that is always balanced.">AVLBalancedBinarySearchTree</a> will lose its structure unless it happened to be AVL balanced to begin with Requires queue_linked_list.cpp for the breadth first search used in the copy constructor, overloaded assignment operator, and display_breadth_first_search. </dd></dl>
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00097">97</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
</div><hr/><h2 class="groupheader">Class Documentation</h2>
<a name="de/d61/struct_data_structures_1_1_binary_search_tree_1_1node" id="de/d61/struct_data_structures_1_1_binary_search_tree_1_1node"></a>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">struct DataStructures::BinarySearchTree::node</td>
</tr>
</table>
</div><div class="memdoc">
<div class="textblock"><h3>template&lt;class BinarySearchTreeType&gt;<br/>
struct DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node</h3>
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00102">102</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
</div><table class="fieldtable">
<tr><th colspan="3">Class Members</th></tr>
<tr><td class="fieldtype">
<a class="anchor" id="aae201835a5764223f821b246ebd3f700"></a>BinarySearchTreeType *</td>
<td class="fieldname">
item</td>
<td class="fielddoc">
</td></tr>
<tr><td class="fieldtype">
<a class="anchor" id="ac4f290c3a0db3cbeb593c0fc4e825efc"></a><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *</td>
<td class="fieldname">
left</td>
<td class="fielddoc">
</td></tr>
<tr><td class="fieldtype">
<a class="anchor" id="a081b81949db193622d3ec9811c1fbaf9"></a><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *</td>
<td class="fieldname">
right</td>
<td class="fielddoc">
</td></tr>
</table>
</div>
</div>
<h2 class="groupheader">Member Enumeration Documentation</h2>
<a class="anchor" id="a84089f536d9c987fff2036cf0e910f3a"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">enum <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a84089f536d9c987fff2036cf0e910f3a">DataStructures::BinarySearchTree::Direction_Types</a></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<dl><dt><b>Enumerator: </b></dt><dd><table border="0" cellspacing="2" cellpadding="0">
<tr><td valign="top"><em><a class="anchor" id="a84089f536d9c987fff2036cf0e910f3aa8c936ef6dbd6034f95a39138a685e155"></a>NOT_FOUND</em>&nbsp;</td><td>
</td></tr>
<tr><td valign="top"><em><a class="anchor" id="a84089f536d9c987fff2036cf0e910f3aa46c975096614f0b49bcbba65e8a0a455"></a>LEFT</em>&nbsp;</td><td>
</td></tr>
<tr><td valign="top"><em><a class="anchor" id="a84089f536d9c987fff2036cf0e910f3aad9027bdc98a5d303de4aa99ebb6bbe9e"></a>RIGHT</em>&nbsp;</td><td>
</td></tr>
<tr><td valign="top"><em><a class="anchor" id="a84089f536d9c987fff2036cf0e910f3aa96101957d6528addd19368dead6fb76d"></a>ROOT</em>&nbsp;</td><td>
</td></tr>
</table>
</dd>
</dl>
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00129">129</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
</div>
</div>
<h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a class="anchor" id="aa2eae4277af5983b79abe2f84c6d5ab6"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a> </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00420">420</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
</div>
</div>
<a class="anchor" id="aeb7774f9c2928f5796b3ddcf8a19810c"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::~<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a> </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">virtual</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00427">427</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/db0/defines_8h_source.xhtml#l00047">_FILE_AND_LINE_</a>.</p>
</div>
</div>
<a class="anchor" id="a9971027b56966fa5c34075f67dd22bc0"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a> </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a>&lt; BinarySearchTreeType &gt; &amp;&#160;</td>
<td class="paramname"><em>original_type</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00980">980</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/db0/defines_8h_source.xhtml#l00047">_FILE_AND_LINE_</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00134">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::BinarySearchTree_size</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00104">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::item</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00105">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::left</a>, <a class="el" href="../../dc/dd6/_d_s___queue_linked_list_8h_source.xhtml#l00066">DataStructures::QueueLinkedList&lt; QueueType &gt;::Pop()</a>, <a class="el" href="../../dc/dd6/_d_s___queue_linked_list_8h_source.xhtml#l00087">DataStructures::QueueLinkedList&lt; QueueType &gt;::Push()</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00106">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::right</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00127">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::root</a>, and <a class="el" href="../../dc/dd6/_d_s___queue_linked_list_8h_source.xhtml#l00060">DataStructures::QueueLinkedList&lt; QueueType &gt;::Size()</a>.</p>
</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a class="anchor" id="add1e90ecd655a1b28be29813b43f79a8"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> * <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::Add </td>
<td>(</td>
<td class="paramtype">const BinarySearchTreeType &amp;&#160;</td>
<td class="paramname"><em>input</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const char *&#160;</td>
<td class="paramname"><em>file</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned int&#160;</td>
<td class="paramname"><em>line</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00680">680</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00104">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::item</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00105">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::left</a>, and <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00106">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::right</a>.</p>
<p>Referenced by <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00216">DataStructures::AVLBalancedBinarySearchTree&lt; BinarySearchTreeType &gt;::Add()</a>.</p>
</div>
</div>
<a class="anchor" id="a2380dab08090b867bb19dbe26bb62dfe"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::Clear </td>
<td>(</td>
<td class="paramtype">const char *&#160;</td>
<td class="paramname"><em>file</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned int&#160;</td>
<td class="paramname"><em>line</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l01079">1079</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00104">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::item</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00105">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::left</a>, <a class="el" href="../../dd/dc5/memoryoverride_8h_source.xhtml#l00182">SLNet::OP_DELETE()</a>, and <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00106">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::right</a>.</p>
</div>
</div>
<a class="anchor" id="a9a29693e4575fc0fe18ab778a75c89b8"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> * <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::Del </td>
<td>(</td>
<td class="paramtype">const BinarySearchTreeType &amp;&#160;</td>
<td class="paramname"><em>input</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const char *&#160;</td>
<td class="paramname"><em>file</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned int&#160;</td>
<td class="paramname"><em>line</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00542">542</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00104">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::item</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00105">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::left</a>, <a class="el" href="../../dd/dc5/memoryoverride_8h_source.xhtml#l00182">SLNet::OP_DELETE()</a>, and <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00106">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::right</a>.</p>
<p>Referenced by <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00224">DataStructures::AVLBalancedBinarySearchTree&lt; BinarySearchTreeType &gt;::Del()</a>.</p>
</div>
</div>
<a class="anchor" id="a718b886877feb30466efba30341c0a82"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::DisplayBreadthFirstSearch </td>
<td>(</td>
<td class="paramtype">BinarySearchTreeType *&#160;</td>
<td class="paramname"><em>return_array</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00933">933</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00104">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::item</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00105">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::left</a>, <a class="el" href="../../dc/dd6/_d_s___queue_linked_list_8h_source.xhtml#l00066">DataStructures::QueueLinkedList&lt; QueueType &gt;::Pop()</a>, <a class="el" href="../../dc/dd6/_d_s___queue_linked_list_8h_source.xhtml#l00087">DataStructures::QueueLinkedList&lt; QueueType &gt;::Push()</a>, <a class="el" href="../../dc/d0b/_thread_pool_8h_source.xhtml#l00303">return</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00106">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::right</a>, and <a class="el" href="../../dc/dd6/_d_s___queue_linked_list_8h_source.xhtml#l00060">DataStructures::QueueLinkedList&lt; QueueType &gt;::Size()</a>.</p>
</div>
</div>
<a class="anchor" id="a66f82a3176d81b0ef3d1a8362d9e1507"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::DisplayInorder </td>
<td>(</td>
<td class="paramtype">BinarySearchTreeType *&#160;</td>
<td class="paramname"><em>return_array</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00772">772</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00104">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::item</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00105">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::left</a>, <a class="el" href="../../dc/d0b/_thread_pool_8h_source.xhtml#l00303">return</a>, and <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00106">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::right</a>.</p>
</div>
</div>
<a class="anchor" id="a03b31b8c324d813560205b2806775f46"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::DisplayPostorder </td>
<td>(</td>
<td class="paramtype">BinarySearchTreeType *&#160;</td>
<td class="paramname"><em>return_array</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00899">899</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../dc/d0b/_thread_pool_8h_source.xhtml#l00303">return</a>.</p>
</div>
</div>
<a class="anchor" id="ae01518754ae96d9df3df3ccd0b65fb15"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::DisplayPostorderRecursive </td>
<td>(</td>
<td class="paramtype">typename <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *&#160;</td>
<td class="paramname"><em>current</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">BinarySearchTreeType *&#160;</td>
<td class="paramname"><em>return_array</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">unsigned int &amp;&#160;</td>
<td class="paramname"><em>index</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00919">919</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00104">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::item</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00105">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::left</a>, and <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00106">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::right</a>.</p>
</div>
</div>
<a class="anchor" id="a4b2048b47d3a209de79a185ca29c65e4"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::DisplayPreorder </td>
<td>(</td>
<td class="paramtype">BinarySearchTreeType *&#160;</td>
<td class="paramname"><em>return_array</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00843">843</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00104">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::item</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00105">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::left</a>, <a class="el" href="../../dc/d0b/_thread_pool_8h_source.xhtml#l00303">return</a>, and <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00106">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::right</a>.</p>
</div>
</div>
<a class="anchor" id="a0196a589767ca99d7a7caa9b41225817"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *&amp; <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::Find </td>
<td>(</td>
<td class="paramtype">const BinarySearchTreeType &amp;&#160;</td>
<td class="paramname"><em>element</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> **&#160;</td>
<td class="paramname"><em>parent</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00446">446</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00104">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::item</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00105">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::left</a>, and <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00106">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::right</a>.</p>
</div>
</div>
<a class="anchor" id="abf40adb877ad2b915da8d05bc603b98d"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *&amp; <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::FindParent </td>
<td>(</td>
<td class="paramtype">const BinarySearchTreeType &amp;&#160;</td>
<td class="paramname"><em>element</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00502">502</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
</div>
</div>
<a class="anchor" id="ac9695192b853884f7accb60c157b5ab7"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::FixTree </td>
<td>(</td>
<td class="paramtype">typename <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *&#160;</td>
<td class="paramname"><em>current</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00511">511</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00104">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::item</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00105">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::left</a>, and <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00106">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::right</a>.</p>
</div>
</div>
<a class="anchor" id="ac7878327f9c37d8b7d63d6f98bb9b35e"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="memname">
<tr>
<td class="memname">BinarySearchTreeType *&amp; <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::GetPointerToNode </td>
<td>(</td>
<td class="paramtype">const BinarySearchTreeType &amp;&#160;</td>
<td class="paramname"><em>element</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00433">433</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00104">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::item</a>.</p>
</div>
</div>
<a class="anchor" id="aaa31a55fe61ec63cf401e0943a9a3361"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="memname">
<tr>
<td class="memname">unsigned int <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::Height </td>
<td>(</td>
<td class="paramtype">typename <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *&#160;</td>
<td class="paramname"><em>starting_node</em> = <code>0</code></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00390">390</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
</div>
</div>
<a class="anchor" id="a2b11c7d903e037a726decc1cd866d4e7"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">unsigned int <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::HeightRecursive </td>
<td>(</td>
<td class="paramtype">typename <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::<a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a> *&#160;</td>
<td class="paramname"><em>current</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00400">400</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00105">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::left</a>, and <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00106">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::right</a>.</p>
</div>
</div>
<a class="anchor" id="adca1aa14d6bdeec90248567b05e4c28f"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::IsIn </td>
<td>(</td>
<td class="paramtype">const BinarySearchTreeType &amp;&#160;</td>
<td class="paramname"><em>input</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00759">759</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
</div>
</div>
<a class="anchor" id="ab31d3d1c76535e657e24d687a6ac0f3c"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a>&lt; BinarySearchTreeType &gt; &amp; <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::operator= </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a>&lt; BinarySearchTreeType &gt; &amp;&#160;</td>
<td class="paramname"><em>original_copy</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l01025">1025</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>References <a class="el" href="../../d8/db0/defines_8h_source.xhtml#l00047">_FILE_AND_LINE_</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00134">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::BinarySearchTree_size</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00104">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::item</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00105">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::left</a>, <a class="el" href="../../dc/dd6/_d_s___queue_linked_list_8h_source.xhtml#l00066">DataStructures::QueueLinkedList&lt; QueueType &gt;::Pop()</a>, <a class="el" href="../../dc/dd6/_d_s___queue_linked_list_8h_source.xhtml#l00087">DataStructures::QueueLinkedList&lt; QueueType &gt;::Push()</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00106">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::node::right</a>, <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00127">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::root</a>, and <a class="el" href="../../dc/dd6/_d_s___queue_linked_list_8h_source.xhtml#l00060">DataStructures::QueueLinkedList&lt; QueueType &gt;::Size()</a>.</p>
<p>Referenced by <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00152">DataStructures::AVLBalancedBinarySearchTree&lt; BinarySearchTreeType &gt;::operator=()</a>.</p>
</div>
</div>
<a class="anchor" id="a95931c3bdd7589cc1696b0ad0b5f78ab"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType &gt; </div>
<table class="memname">
<tr>
<td class="memname">unsigned int <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::Size </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00384">384</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a class="anchor" id="a4dfb2e2b9a0a8f23e4fc636b58ea4d3f"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">unsigned int <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::BinarySearchTree_size</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00134">134</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>Referenced by <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00980">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::BinarySearchTree()</a>, and <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l01025">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::operator=()</a>.</p>
</div>
</div>
<a class="anchor" id="a292e62e2b24b59d393657ff3c69c82ed"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">enum <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#a84089f536d9c987fff2036cf0e910f3a">DataStructures::BinarySearchTree::Direction_Types</a> <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::direction</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
</div>
</div>
<a class="anchor" id="a6854050657cfa61442e6189dd0039318"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class BinarySearchTreeType&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml#de/d61/struct_data_structures_1_1_binary_search_tree_1_1node">node</a>* <a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">DataStructures::BinarySearchTree</a>&lt; BinarySearchTreeType &gt;::root</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Definition at line <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00127">127</a> of file <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a>.</p>
<p>Referenced by <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l00980">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::BinarySearchTree()</a>, and <a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml#l01025">DataStructures::BinarySearchTree&lt; BinarySearchTreeType &gt;::operator=()</a>.</p>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>Source/include/slikenet/<a class="el" href="../../d8/dfa/_d_s___binary_search_tree_8h_source.xhtml">DS_BinarySearchTree.h</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../da/d80/namespace_data_structures.xhtml">DataStructures</a></li><li class="navelem"><a class="el" href="../../db/d19/class_data_structures_1_1_binary_search_tree.xhtml">BinarySearchTree</a></li>
<li class="footer">Generated on Wed Aug 14 2019 22:09:49 for SLikeNet by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="../../doxygen.png" alt="doxygen"/></a> 1.8.2 </li>
</ul>
</div>
</body>
</html>