backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-22 04:42:10 +08:00
Code Issues Projects Releases Wiki Activity
Files
0ae0c4f573312caad776317847aa5dcb5ebbe9ee
C-Plus-Plus/d9/dde/classbinary__search__tree.html
github-actions 92f94c36e1 Documentation for cc33efd3b6
2023-02-04 00:45:19 +00:00

1287 lines
93 KiB
HTML
Raw Blame History

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.6"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: binary_search_tree&lt; T &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="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></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 id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.6 -->
<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" 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');
$(document).ready(function() { init_search(); });
});
/* @license-end */
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('d9/dde/classbinary__search__tree.html','../../'); initResizable(); });
/* @license-end */
</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)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="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">
<p>The Binary Search Tree class.
<a href="../../d9/dde/classbinary__search__tree.html#details">More...</a></p>
<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="339" height="168"><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>
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="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>
Public Member Functions</h2></td></tr>
<tr class="memitem:aa67321ed575ca313cd71d833d91234a6"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#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"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#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"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#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"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#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"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#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"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#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"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#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"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#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"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#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"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#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>
Private Member Functions</h2></td></tr>
<tr class="memitem:a75f897af6aa732a9901454401c869bcb"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&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"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&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"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&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"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;parent, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&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"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&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"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; void(T)&gt; callback, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&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"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; void(T)&gt; callback, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&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"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a> (<a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; void(T)&gt; callback, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&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>
Private Attributes</h2></td></tr>
<tr class="memitem:aa08f65f6f3bfcb14f8c3d1e65305ae50"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&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="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a></td></tr>
<tr class="separator:aa08f65f6f3bfcb14f8c3d1e65305ae50"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a07ba32ce1a2af6e357600ac8c8e98dbc"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#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>
<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>
<table class="tparams">
<tr><td class="paramname">T</td><td>The type of the binary search tree key. </td></tr>
</table>
</dd>
</dl>
</div><h2 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>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;<a class="el" href="../../d9/dde/classbinary__search__tree.html">::binary_search_tree</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">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Construct a new Binary Search Tree object. </p>
<div class="fragment"><div class="line"><span class="lineno"> 247</span> {</div>
<div class="line"><span class="lineno"> 248</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 249</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a> = 0;</div>
<div class="line"><span class="lineno"> 250</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_a07ba32ce1a2af6e357600ac8c8e98dbc"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">binary_search_tree::size_</a></div><div class="ttdeci">std::size_t size_</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:43</div></div>
<div class="ttc" id="aclassbinary__search__tree_html_aa08f65f6f3bfcb14f8c3d1e65305ae50"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">binary_search_tree::root_</a></div><div class="ttdeci">std::unique_ptr&lt; bst_node &gt; root_</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:42</div></div>
</div><!-- fragment -->
</div>
</div>
<h2 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>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::contains </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>node</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T&#160;</td>
<td class="paramname"><em>value</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 class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Recursive function to check if a value is in the BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">node</td><td>The node to search from. </td></tr>
<tr><td class="paramname">value</td><td>The value to find. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true If the value was found in the BST. </dd>
<dd>
false Otherwise. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 177</span> {</div>
<div class="line"><span class="lineno"> 178</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
<div class="line"><span class="lineno"> 179</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 180</span> }</div>
<div class="line"><span class="lineno"> 181</span> </div>
<div class="line"><span class="lineno"> 182</span> <span class="keywordflow">if</span> (value &lt; node-&gt;value) {</div>
<div class="line"><span class="lineno"> 183</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left, value);</div>
<div class="line"><span class="lineno"> 184</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value &gt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value) {</div>
<div class="line"><span class="lineno"> 185</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right, value);</div>
<div class="line"><span class="lineno"> 186</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 187</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 188</span> }</div>
<div class="line"><span class="lineno"> 189</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_aa4f84b2eec9b9201af1840868ddb5fb2"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">binary_search_tree::contains</a></div><div class="ttdeci">bool contains(std::unique_ptr&lt; bst_node &gt; &amp;node, T value)</div><div class="ttdoc">Recursive function to check if a value is in the BST.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:177</div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition:</b> binary_search_tree.cpp:11</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_aa4f84b2eec9b9201af1840868ddb5fb2_cgraph.svg" width="143" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a6bf5b410299df2320ddf2709dda61f63" name="a6bf5b410299df2320ddf2709dda61f63"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6bf5b410299df2320ddf2709dda61f63">&#9670;&#160;</a></span>contains() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::contains </td>
<td>(</td>
<td class="paramtype">T&#160;</td>
<td class="paramname"><em>value</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>Check if a value is in the BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">value</td><td>The value to find. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true If value is in the BST. </dd>
<dd>
false Otherwise. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 289</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, value); }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a6bf5b410299df2320ddf2709dda61f63_cgraph.svg" width="143" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a75f897af6aa732a9901454401c869bcb" name="a75f897af6aa732a9901454401c869bcb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a75f897af6aa732a9901454401c869bcb">&#9670;&#160;</a></span>find_max() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::find_max </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>node</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T &amp;&#160;</td>
<td class="paramname"><em>ret_value</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 class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Recursive function to find the maximum value in the BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">node</td><td>The node to search from. </td></tr>
<tr><td class="paramname">ret_value</td><td>Variable to hold the maximum value. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true If the maximum value was successfully found. </dd>
<dd>
false Otherwise. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 53</span> {</div>
<div class="line"><span class="lineno"> 54</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 56</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right) {</div>
<div class="line"><span class="lineno"> 57</span> ret_value = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value;</div>
<div class="line"><span class="lineno"> 58</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 59</span> }</div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right, ret_value);</div>
<div class="line"><span class="lineno"> 61</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_a75f897af6aa732a9901454401c869bcb"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">binary_search_tree::find_max</a></div><div class="ttdeci">bool find_max(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the maximum value in the BST.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:53</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a75f897af6aa732a9901454401c869bcb_cgraph.svg" width="143" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a42b16f26928b5e994925100594a167a0" name="a42b16f26928b5e994925100594a167a0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a42b16f26928b5e994925100594a167a0">&#9670;&#160;</a></span>find_max() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::find_max </td>
<td>(</td>
<td class="paramtype">T &amp;&#160;</td>
<td class="paramname"><em>ret_value</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>Find the largest value in the BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">ret_value</td><td>Variable to hold the maximum value. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true If maximum value was successfully found. </dd>
<dd>
false Otherwise. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 307</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, ret_value); }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a42b16f26928b5e994925100594a167a0_cgraph.svg" width="143" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="af9a2c7c187a7ca3142c77ce342ef3153" name="af9a2c7c187a7ca3142c77ce342ef3153"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af9a2c7c187a7ca3142c77ce342ef3153">&#9670;&#160;</a></span>find_min() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::find_min </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>node</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T &amp;&#160;</td>
<td class="paramname"><em>ret_value</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 class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Recursive function to find the minimum value in the BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">node</td><td>The node to search from. </td></tr>
<tr><td class="paramname">ret_value</td><td>Variable to hold the minimum value. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true If the minimum value was successfully found. </dd>
<dd>
false Otherwise. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 71</span> {</div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 74</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left) {</div>
<div class="line"><span class="lineno"> 75</span> ret_value = <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value;</div>
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 77</span> }</div>
<div class="line"><span class="lineno"> 78</span> </div>
<div class="line"><span class="lineno"> 79</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left, ret_value);</div>
<div class="line"><span class="lineno"> 80</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_af9a2c7c187a7ca3142c77ce342ef3153"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">binary_search_tree::find_min</a></div><div class="ttdeci">bool find_min(std::unique_ptr&lt; bst_node &gt; &amp;node, T &amp;ret_value)</div><div class="ttdoc">Recursive function to find the minimum value in the BST.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:71</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_af9a2c7c187a7ca3142c77ce342ef3153_cgraph.svg" width="143" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="ad9912e8574538e86f9bd2c38e7e63d03" name="ad9912e8574538e86f9bd2c38e7e63d03"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad9912e8574538e86f9bd2c38e7e63d03">&#9670;&#160;</a></span>find_min() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::find_min </td>
<td>(</td>
<td class="paramtype">T &amp;&#160;</td>
<td class="paramname"><em>ret_value</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>Find the smallest value in the BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">ret_value</td><td>Variable to hold the minimum value. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true If minimum value was successfully found. </dd>
<dd>
false Otherwise. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 298</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, ret_value); }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_ad9912e8574538e86f9bd2c38e7e63d03_cgraph.svg" width="143" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a1f23830316204664514f396a4eb5275a" name="a1f23830316204664514f396a4eb5275a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a1f23830316204664514f396a4eb5275a">&#9670;&#160;</a></span>get_elements_inorder()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::get_elements_inorder </td>
<td>(</td>
<td class="paramname"></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>Get all values of the BST in in-order order. </p>
<dl class="section return"><dt>Returns</dt><dd>std::vector&lt;T&gt; List of values, sorted in in-order order. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 321</span> {</div>
<div class="line"><span class="lineno"> 322</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 323</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>([&amp;](T node_value) { <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(node_value); },</div>
<div class="line"><span class="lineno"> 324</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
<div class="line"><span class="lineno"> 325</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 326</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_a2fcf37549bd002c174a45b0b4203c2bd"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">binary_search_tree::traverse_inorder</a></div><div class="ttdeci">void traverse_inorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in in-order order.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:197</div></div>
<div class="ttc" id="afibonacci__sum_8cpp_html_aadb40ac4c74a7efc0680b83eeee138aa"><div class="ttname"><a href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">math::fibonacci_sum::result</a></div><div class="ttdeci">uint64_t result(uint64_t n)</div><div class="ttdef"><b>Definition:</b> fibonacci_sum.cpp:76</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a1f23830316204664514f396a4eb5275a_cgraph.svg" width="346" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a5c011e1b0863d79c3a7c11a0426bdcff" name="a5c011e1b0863d79c3a7c11a0426bdcff"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5c011e1b0863d79c3a7c11a0426bdcff">&#9670;&#160;</a></span>get_elements_postorder()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::get_elements_postorder </td>
<td>(</td>
<td class="paramname"></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>Get all values of the BST in post-order order. </p>
<dl class="section return"><dt>Returns</dt><dd>std::vector&lt;T&gt; List of values, sorted in post-order order. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 345</span> {</div>
<div class="line"><span class="lineno"> 346</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 347</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>([&amp;](T node_value) { <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(node_value); },</div>
<div class="line"><span class="lineno"> 348</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
<div class="line"><span class="lineno"> 349</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 350</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_a87c0a35845d27e0f6fc1f4eaa0333362"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">binary_search_tree::traverse_postorder</a></div><div class="ttdeci">void traverse_postorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in post-order order.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:231</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a5c011e1b0863d79c3a7c11a0426bdcff_cgraph.svg" width="367" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a5764c1cf848f84a5b77462036a6d8c13" name="a5764c1cf848f84a5b77462036a6d8c13"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5764c1cf848f84a5b77462036a6d8c13">&#9670;&#160;</a></span>get_elements_preorder()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; T &gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::get_elements_preorder </td>
<td>(</td>
<td class="paramname"></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>Get all values of the BST in pre-order order. </p>
<dl class="section return"><dt>Returns</dt><dd>std::vector&lt;T&gt; List of values, sorted in pre-order order. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 333</span> {</div>
<div class="line"><span class="lineno"> 334</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;T&gt;</a> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 335</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>([&amp;](T node_value) { <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(node_value); },</div>
<div class="line"><span class="lineno"> 336</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
<div class="line"><span class="lineno"> 337</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 338</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_ab81edd415324d372632c42dc7dbcb9e1"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">binary_search_tree::traverse_preorder</a></div><div class="ttdeci">void traverse_preorder(std::function&lt; void(T)&gt; callback, std::unique_ptr&lt; bst_node &gt; &amp;node)</div><div class="ttdoc">Recursive function to traverse the tree in pre-order order.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:214</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a5764c1cf848f84a5b77462036a6d8c13_cgraph.svg" width="354" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a9d1e7e10efa74d741bf48cf032df3778" name="a9d1e7e10efa74d741bf48cf032df3778"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9d1e7e10efa74d741bf48cf032df3778">&#9670;&#160;</a></span>insert() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::insert </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>node</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T&#160;</td>
<td class="paramname"><em>new_value</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 class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Recursive function to insert a value into the BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">node</td><td>The node to search from. </td></tr>
<tr><td class="paramname">new_value</td><td>The value to insert. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true If the insert operation was successful. </dd>
<dd>
false Otherwise. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 90</span> {</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> == <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> &amp;&amp; !<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
<div class="line"><span class="lineno"> 92</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr&lt;bst_node&gt;</a>(<span class="keyword">new</span> bst_node(new_value));</div>
<div class="line"><span class="lineno"> 93</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 94</span> }</div>
<div class="line"><span class="lineno"> 95</span> </div>
<div class="line"><span class="lineno"> 96</span> <span class="keywordflow">if</span> (new_value &lt; node-&gt;value) {</div>
<div class="line"><span class="lineno"> 97</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left) {</div>
<div class="line"><span class="lineno"> 98</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr&lt;bst_node&gt;</a>(<span class="keyword">new</span> bst_node(new_value));</div>
<div class="line"><span class="lineno"> 99</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 100</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 101</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left, new_value);</div>
<div class="line"><span class="lineno"> 102</span> }</div>
<div class="line"><span class="lineno"> 103</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (new_value &gt; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value) {</div>
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right) {</div>
<div class="line"><span class="lineno"> 105</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right =</div>
<div class="line"><span class="lineno"> 106</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr&lt;bst_node&gt;</a>(<span class="keyword">new</span> bst_node(new_value));</div>
<div class="line"><span class="lineno"> 107</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 108</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 109</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right, new_value);</div>
<div class="line"><span class="lineno"> 110</span> }</div>
<div class="line"><span class="lineno"> 111</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 112</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 113</span> }</div>
<div class="line"><span class="lineno"> 114</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_a9d1e7e10efa74d741bf48cf032df3778"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">binary_search_tree::insert</a></div><div class="ttdeci">bool insert(std::unique_ptr&lt; bst_node &gt; &amp;node, T new_value)</div><div class="ttdoc">Recursive function to insert a value into the BST.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:90</div></div>
<div class="ttc" id="aunique_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a9d1e7e10efa74d741bf48cf032df3778_cgraph.svg" width="143" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a8168edf29316f2b436eac1fc416c52e0" name="a8168edf29316f2b436eac1fc416c52e0"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a8168edf29316f2b436eac1fc416c52e0">&#9670;&#160;</a></span>insert() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::insert </td>
<td>(</td>
<td class="paramtype">T&#160;</td>
<td class="paramname"><em>new_value</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>Insert a new value into the BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">new_value</td><td>The value to insert into the BST. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true If the insertion was successful. </dd>
<dd>
false Otherwise. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 259</span> {</div>
<div class="line"><span class="lineno"> 260</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, new_value);</div>
<div class="line"><span class="lineno"> 261</span> <span class="keywordflow">if</span> (result) {</div>
<div class="line"><span class="lineno"> 262</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>++;</div>
<div class="line"><span class="lineno"> 263</span> }</div>
<div class="line"><span class="lineno"> 264</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 265</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a8168edf29316f2b436eac1fc416c52e0_cgraph.svg" width="323" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="af4a865ce5244608819b169fc78a41153" name="af4a865ce5244608819b169fc78a41153"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af4a865ce5244608819b169fc78a41153">&#9670;&#160;</a></span>remove() <span class="overload">[1/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::remove </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>parent</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>node</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">T&#160;</td>
<td class="paramname"><em>rm_value</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 class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Recursive function to remove a value from the BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">parent</td><td>The parent node of node. </td></tr>
<tr><td class="paramname">node</td><td>The node to search from. </td></tr>
<tr><td class="paramname">rm_value</td><td>The value to remove. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true If the removal operation was successful. </dd>
<dd>
false Otherwise. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 126</span> {</div>
<div class="line"><span class="lineno"> 127</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
<div class="line"><span class="lineno"> 128</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 129</span> }</div>
<div class="line"><span class="lineno"> 130</span> </div>
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value == rm_value) {</div>
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left &amp;&amp; <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right) {</div>
<div class="line"><span class="lineno"> 133</span> T successor_node_value{};</div>
<div class="line"><span class="lineno"> 134</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left, successor_node_value);</div>
<div class="line"><span class="lineno"> 135</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, successor_node_value);</div>
<div class="line"><span class="lineno"> 136</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value = successor_node_value;</div>
<div class="line"><span class="lineno"> 137</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 138</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left || <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right) {</div>
<div class="line"><span class="lineno"> 139</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr&lt;bst_node&gt;</a>&amp; non_null =</div>
<div class="line"><span class="lineno"> 140</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left ? <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left : <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right);</div>
<div class="line"><span class="lineno"> 141</span> </div>
<div class="line"><span class="lineno"> 142</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> == <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
<div class="line"><span class="lineno"> 143</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(non_null);</div>
<div class="line"><span class="lineno"> 144</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value &lt; parent-&gt;value) {</div>
<div class="line"><span class="lineno"> 145</span> parent-&gt;left = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(non_null);</div>
<div class="line"><span class="lineno"> 146</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 147</span> parent-&gt;right = <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(non_null);</div>
<div class="line"><span class="lineno"> 148</span> }</div>
<div class="line"><span class="lineno"> 149</span> </div>
<div class="line"><span class="lineno"> 150</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 151</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 152</span> <span class="keywordflow">if</span> (<a class="code hl_class" href="../../d5/da1/structnode.html">node</a> == <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
<div class="line"><span class="lineno"> 153</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>.reset(<span class="keyword">nullptr</span>);</div>
<div class="line"><span class="lineno"> 154</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value &lt; parent-&gt;value) {</div>
<div class="line"><span class="lineno"> 155</span> parent-&gt;left.reset(<span class="keyword">nullptr</span>);</div>
<div class="line"><span class="lineno"> 156</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 157</span> parent-&gt;right.reset(<span class="keyword">nullptr</span>);</div>
<div class="line"><span class="lineno"> 158</span> }</div>
<div class="line"><span class="lineno"> 159</span> </div>
<div class="line"><span class="lineno"> 160</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 161</span> }</div>
<div class="line"><span class="lineno"> 162</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value &lt; node-&gt;value) {</div>
<div class="line"><span class="lineno"> 163</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left, rm_value);</div>
<div class="line"><span class="lineno"> 164</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 165</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right, rm_value);</div>
<div class="line"><span class="lineno"> 166</span> }</div>
<div class="line"><span class="lineno"> 167</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html_af4a865ce5244608819b169fc78a41153"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">binary_search_tree::remove</a></div><div class="ttdeci">bool remove(std::unique_ptr&lt; bst_node &gt; &amp;parent, std::unique_ptr&lt; bst_node &gt; &amp;node, T rm_value)</div><div class="ttdoc">Recursive function to remove a value from the BST.</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:125</div></div>
<div class="ttc" id="amove_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a></div><div class="ttdeci">T move(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_af4a865ce5244608819b169fc78a41153_cgraph.svg" width="323" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a99771c2e1353e8ddfd4bb9d30b7a98fb" name="a99771c2e1353e8ddfd4bb9d30b7a98fb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a99771c2e1353e8ddfd4bb9d30b7a98fb">&#9670;&#160;</a></span>remove() <span class="overload">[2/2]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">bool <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::remove </td>
<td>(</td>
<td class="paramtype">T&#160;</td>
<td class="paramname"><em>rm_value</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>Remove a specified value from the BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">rm_value</td><td>The value to remove. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>true If the removal was successful. </dd>
<dd>
false Otherwise. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 274</span> {</div>
<div class="line"><span class="lineno"> 275</span> <span class="keywordtype">bool</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, rm_value);</div>
<div class="line"><span class="lineno"> 276</span> <span class="keywordflow">if</span> (result) {</div>
<div class="line"><span class="lineno"> 277</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>--;</div>
<div class="line"><span class="lineno"> 278</span> }</div>
<div class="line"><span class="lineno"> 279</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
<div class="line"><span class="lineno"> 280</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a99771c2e1353e8ddfd4bb9d30b7a98fb_cgraph.svg" width="503" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a564fe43e7e8f7ecb6f10667a70fbc6f3" name="a564fe43e7e8f7ecb6f10667a70fbc6f3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a564fe43e7e8f7ecb6f10667a70fbc6f3">&#9670;&#160;</a></span>size()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::size </td>
<td>(</td>
<td class="paramname"></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>Get the number of values in the BST. </p>
<dl class="section return"><dt>Returns</dt><dd><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> Number of values in the BST. </dd></dl>
<div class="fragment"><div class="line"><span class="lineno"> 314</span>{ <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>; }</div>
</div><!-- fragment -->
</div>
</div>
<a id="a2fcf37549bd002c174a45b0b4203c2bd" name="a2fcf37549bd002c174a45b0b4203c2bd"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2fcf37549bd002c174a45b0b4203c2bd">&#9670;&#160;</a></span>traverse_inorder()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::traverse_inorder </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; void(T)&gt;&#160;</td>
<td class="paramname"><em>callback</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>node</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 class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Recursive function to traverse the tree in in-order order. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">callback</td><td>Function that is called when a value needs to processed. </td></tr>
<tr><td class="paramname">node</td><td>The node to traverse from. </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 198</span> {</div>
<div class="line"><span class="lineno"> 199</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
<div class="line"><span class="lineno"> 200</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 201</span> }</div>
<div class="line"><span class="lineno"> 202</span> </div>
<div class="line"><span class="lineno"> 203</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left);</div>
<div class="line"><span class="lineno"> 204</span> callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value);</div>
<div class="line"><span class="lineno"> 205</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right);</div>
<div class="line"><span class="lineno"> 206</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a2fcf37549bd002c174a45b0b4203c2bd_cgraph.svg" width="143" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a87c0a35845d27e0f6fc1f4eaa0333362" name="a87c0a35845d27e0f6fc1f4eaa0333362"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a87c0a35845d27e0f6fc1f4eaa0333362">&#9670;&#160;</a></span>traverse_postorder()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::traverse_postorder </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; void(T)&gt;&#160;</td>
<td class="paramname"><em>callback</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>node</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 class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Recursive function to traverse the tree in post-order order. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">callback</td><td>Function that is called when a value needs to processed. </td></tr>
<tr><td class="paramname">node</td><td>The node to traverse from. </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 232</span> {</div>
<div class="line"><span class="lineno"> 233</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
<div class="line"><span class="lineno"> 234</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 235</span> }</div>
<div class="line"><span class="lineno"> 236</span> </div>
<div class="line"><span class="lineno"> 237</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left);</div>
<div class="line"><span class="lineno"> 238</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right);</div>
<div class="line"><span class="lineno"> 239</span> callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value);</div>
<div class="line"><span class="lineno"> 240</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_a87c0a35845d27e0f6fc1f4eaa0333362_cgraph.svg" width="150" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="ab81edd415324d372632c42dc7dbcb9e1" name="ab81edd415324d372632c42dc7dbcb9e1"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab81edd415324d372632c42dc7dbcb9e1">&#9670;&#160;</a></span>traverse_preorder()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::traverse_preorder </td>
<td>(</td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/functional/function.html">std::function</a>&lt; void(T)&gt;&#160;</td>
<td class="paramname"><em>callback</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt; <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> &gt; &amp;&#160;</td>
<td class="paramname"><em>node</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 class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Recursive function to traverse the tree in pre-order order. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">callback</td><td>Function that is called when a value needs to processed. </td></tr>
<tr><td class="paramname">node</td><td>The node to traverse from. </td></tr>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 215</span> {</div>
<div class="line"><span class="lineno"> 216</span> <span class="keywordflow">if</span> (!<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>) {</div>
<div class="line"><span class="lineno"> 217</span> <span class="keywordflow">return</span>;</div>
<div class="line"><span class="lineno"> 218</span> }</div>
<div class="line"><span class="lineno"> 219</span> </div>
<div class="line"><span class="lineno"> 220</span> callback(<a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;value);</div>
<div class="line"><span class="lineno"> 221</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;left);</div>
<div class="line"><span class="lineno"> 222</span> <a class="code hl_function" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(callback, <a class="code hl_class" href="../../d5/da1/structnode.html">node</a>-&gt;right);</div>
<div class="line"><span class="lineno"> 223</span> }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d9/dde/classbinary__search__tree_ab81edd415324d372632c42dc7dbcb9e1_cgraph.svg" width="143" height="75"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<h2 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>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>&lt;<a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>&gt; <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::root_</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Pointer to the root of the BST. </p>
</div>
</div>
<a id="a07ba32ce1a2af6e357600ac8c8e98dbc" name="a07ba32ce1a2af6e357600ac8c8e98dbc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a07ba32ce1a2af6e357600ac8c8e98dbc">&#9670;&#160;</a></span>size_</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/size_t.html">std::size_t</a> <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::size_ = 0</td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Number of elements/nodes in the BST. </p>
</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>data_structures/<a class="el" href="../../df/d42/binary__search__tree2_8cpp.html">binary_search_tree2.cpp</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="../../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.9.6 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink