mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-22 04:42:10 +08:00
1202 lines
92 KiB
HTML
1202 lines
92 KiB
HTML
<!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">
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
|
|
<meta name="generator" content="Doxygen 1.9.1"/>
|
|
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
|
<title>Algorithms_in_C++: binary_search_tree< T > 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 style="height: 56px;">
|
|
<td id="projectalign" style="padding-left: 0.5em;">
|
|
<div id="projectname">Algorithms_in_C++
|
|
 <span id="projectnumber">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.1 -->
|
|
<script type="text/javascript">
|
|
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
var searchBox = new SearchBox("searchBox", "../../search",false,'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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(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:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
|
|
$(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">
|
|
<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> |
|
|
<a href="#pub-methods">Public Member Functions</a> |
|
|
<a href="#pri-methods">Private Member Functions</a> |
|
|
<a href="#pri-attribs">Private Attributes</a> |
|
|
<a href="../../d3/d05/classbinary__search__tree-members.html">List of all members</a> </div>
|
|
<div class="headertitle">
|
|
<div class="title">binary_search_tree< T > 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< T >:</div>
|
|
<div class="dyncontent">
|
|
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d3/da6/classbinary__search__tree__coll__graph.svg" width="288" height="142"><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 name="nested-classes"></a>
|
|
Classes</h2></td></tr>
|
|
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">struct  </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"> </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"> </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:aa67321ed575ca313cd71d833d91234a6"><td class="memItemLeft" align="right" valign="top"><a id="aa67321ed575ca313cd71d833d91234a6"></a>
|
|
 </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"> </td><td class="mdescRight">Construct a new Binary Search Tree object. <br /></td></tr>
|
|
<tr class="separator:aa67321ed575ca313cd71d833d91234a6"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a8168edf29316f2b436eac1fc416c52e0"><td class="memItemLeft" align="right" valign="top">bool </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"> </td><td class="mdescRight">Insert a new value into the BST. <a href="../../d9/dde/classbinary__search__tree.html#a8168edf29316f2b436eac1fc416c52e0">More...</a><br /></td></tr>
|
|
<tr class="separator:a8168edf29316f2b436eac1fc416c52e0"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a99771c2e1353e8ddfd4bb9d30b7a98fb"><td class="memItemLeft" align="right" valign="top">bool </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"> </td><td class="mdescRight">Remove a specified value from the BST. <a href="../../d9/dde/classbinary__search__tree.html#a99771c2e1353e8ddfd4bb9d30b7a98fb">More...</a><br /></td></tr>
|
|
<tr class="separator:a99771c2e1353e8ddfd4bb9d30b7a98fb"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a6bf5b410299df2320ddf2709dda61f63"><td class="memItemLeft" align="right" valign="top">bool </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"> </td><td class="mdescRight">Check if a value is in the BST. <a href="../../d9/dde/classbinary__search__tree.html#a6bf5b410299df2320ddf2709dda61f63">More...</a><br /></td></tr>
|
|
<tr class="separator:a6bf5b410299df2320ddf2709dda61f63"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ad9912e8574538e86f9bd2c38e7e63d03"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03">find_min</a> (T &ret_value)</td></tr>
|
|
<tr class="memdesc:ad9912e8574538e86f9bd2c38e7e63d03"><td class="mdescLeft"> </td><td class="mdescRight">Find the smallest value in the BST. <a href="../../d9/dde/classbinary__search__tree.html#ad9912e8574538e86f9bd2c38e7e63d03">More...</a><br /></td></tr>
|
|
<tr class="separator:ad9912e8574538e86f9bd2c38e7e63d03"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a42b16f26928b5e994925100594a167a0"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0">find_max</a> (T &ret_value)</td></tr>
|
|
<tr class="memdesc:a42b16f26928b5e994925100594a167a0"><td class="mdescLeft"> </td><td class="mdescRight">Find the largest value in the BST. <a href="../../d9/dde/classbinary__search__tree.html#a42b16f26928b5e994925100594a167a0">More...</a><br /></td></tr>
|
|
<tr class="separator:a42b16f26928b5e994925100594a167a0"><td class="memSeparator" colspan="2"> </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> </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"> </td><td class="mdescRight">Get the number of values in the BST. <a href="../../d9/dde/classbinary__search__tree.html#a564fe43e7e8f7ecb6f10667a70fbc6f3">More...</a><br /></td></tr>
|
|
<tr class="separator:a564fe43e7e8f7ecb6f10667a70fbc6f3"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a06a863442c165503ac189f7b47599ec8"><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>< T > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#a06a863442c165503ac189f7b47599ec8">get_elements_inorder</a> ()</td></tr>
|
|
<tr class="memdesc:a06a863442c165503ac189f7b47599ec8"><td class="mdescLeft"> </td><td class="mdescRight">Get all values of the BST in in-order order. <a href="../../d9/dde/classbinary__search__tree.html#a06a863442c165503ac189f7b47599ec8">More...</a><br /></td></tr>
|
|
<tr class="separator:a06a863442c165503ac189f7b47599ec8"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a53d1bf8e5ef0a952d2817f3cd22546c7"><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>< T > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#a53d1bf8e5ef0a952d2817f3cd22546c7">get_elements_preorder</a> ()</td></tr>
|
|
<tr class="memdesc:a53d1bf8e5ef0a952d2817f3cd22546c7"><td class="mdescLeft"> </td><td class="mdescRight">Get all values of the BST in pre-order order. <a href="../../d9/dde/classbinary__search__tree.html#a53d1bf8e5ef0a952d2817f3cd22546c7">More...</a><br /></td></tr>
|
|
<tr class="separator:a53d1bf8e5ef0a952d2817f3cd22546c7"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a70030b0d7990c6fd450256d27b8f6c7b"><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>< T > </td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/dde/classbinary__search__tree.html#a70030b0d7990c6fd450256d27b8f6c7b">get_elements_postorder</a> ()</td></tr>
|
|
<tr class="memdesc:a70030b0d7990c6fd450256d27b8f6c7b"><td class="mdescLeft"> </td><td class="mdescRight">Get all values of the BST in post-order order. <a href="../../d9/dde/classbinary__search__tree.html#a70030b0d7990c6fd450256d27b8f6c7b">More...</a><br /></td></tr>
|
|
<tr class="separator:a70030b0d7990c6fd450256d27b8f6c7b"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-methods"></a>
|
|
Private Member Functions</h2></td></tr>
|
|
<tr class="memitem:a75f897af6aa732a9901454401c869bcb"><td class="memItemLeft" align="right" valign="top">bool </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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > &<a class="el" href="../../d5/da1/structnode.html">node</a>, T &ret_value)</td></tr>
|
|
<tr class="memdesc:a75f897af6aa732a9901454401c869bcb"><td class="mdescLeft"> </td><td class="mdescRight">Recursive function to find the maximum value in the BST. <a href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">More...</a><br /></td></tr>
|
|
<tr class="separator:a75f897af6aa732a9901454401c869bcb"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:af9a2c7c187a7ca3142c77ce342ef3153"><td class="memItemLeft" align="right" valign="top">bool </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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > &<a class="el" href="../../d5/da1/structnode.html">node</a>, T &ret_value)</td></tr>
|
|
<tr class="memdesc:af9a2c7c187a7ca3142c77ce342ef3153"><td class="mdescLeft"> </td><td class="mdescRight">Recursive function to find the minimum value in the BST. <a href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">More...</a><br /></td></tr>
|
|
<tr class="separator:af9a2c7c187a7ca3142c77ce342ef3153"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a9d1e7e10efa74d741bf48cf032df3778"><td class="memItemLeft" align="right" valign="top">bool </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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > &<a class="el" href="../../d5/da1/structnode.html">node</a>, T new_value)</td></tr>
|
|
<tr class="memdesc:a9d1e7e10efa74d741bf48cf032df3778"><td class="mdescLeft"> </td><td class="mdescRight">Recursive function to insert a value into the BST. <a href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">More...</a><br /></td></tr>
|
|
<tr class="separator:a9d1e7e10efa74d741bf48cf032df3778"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:af4a865ce5244608819b169fc78a41153"><td class="memItemLeft" align="right" valign="top">bool </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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > &parent, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > &<a class="el" href="../../d5/da1/structnode.html">node</a>, T rm_value)</td></tr>
|
|
<tr class="memdesc:af4a865ce5244608819b169fc78a41153"><td class="mdescLeft"> </td><td class="mdescRight">Recursive function to remove a value from the BST. <a href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">More...</a><br /></td></tr>
|
|
<tr class="separator:af4a865ce5244608819b169fc78a41153"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:aa4f84b2eec9b9201af1840868ddb5fb2"><td class="memItemLeft" align="right" valign="top">bool </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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > &<a class="el" href="../../d5/da1/structnode.html">node</a>, T value)</td></tr>
|
|
<tr class="memdesc:aa4f84b2eec9b9201af1840868ddb5fb2"><td class="mdescLeft"> </td><td class="mdescRight">Recursive function to check if a value is in the BST. <a href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">More...</a><br /></td></tr>
|
|
<tr class="separator:aa4f84b2eec9b9201af1840868ddb5fb2"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a2fcf37549bd002c174a45b0b4203c2bd"><td class="memItemLeft" align="right" valign="top">void </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>< void(T)> callback, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > &<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
|
|
<tr class="memdesc:a2fcf37549bd002c174a45b0b4203c2bd"><td class="mdescLeft"> </td><td class="mdescRight">Recursive function to traverse the tree in in-order order. <a href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">More...</a><br /></td></tr>
|
|
<tr class="separator:a2fcf37549bd002c174a45b0b4203c2bd"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:ab81edd415324d372632c42dc7dbcb9e1"><td class="memItemLeft" align="right" valign="top">void </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>< void(T)> callback, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > &<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
|
|
<tr class="memdesc:ab81edd415324d372632c42dc7dbcb9e1"><td class="mdescLeft"> </td><td class="mdescRight">Recursive function to traverse the tree in pre-order order. <a href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">More...</a><br /></td></tr>
|
|
<tr class="separator:ab81edd415324d372632c42dc7dbcb9e1"><td class="memSeparator" colspan="2"> </td></tr>
|
|
<tr class="memitem:a87c0a35845d27e0f6fc1f4eaa0333362"><td class="memItemLeft" align="right" valign="top">void </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>< void(T)> callback, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > &<a class="el" href="../../d5/da1/structnode.html">node</a>)</td></tr>
|
|
<tr class="memdesc:a87c0a35845d27e0f6fc1f4eaa0333362"><td class="mdescLeft"> </td><td class="mdescRight">Recursive function to traverse the tree in post-order order. <a href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">More...</a><br /></td></tr>
|
|
<tr class="separator:a87c0a35845d27e0f6fc1f4eaa0333362"><td class="memSeparator" colspan="2"> </td></tr>
|
|
</table><table class="memberdecls">
|
|
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a 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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > </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"> </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> </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"> </td></tr>
|
|
</table>
|
|
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
|
<div class="textblock"><h3>template<class T><br />
|
|
class binary_search_tree< T ></h3>
|
|
|
|
<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">Member Function Documentation</h2>
|
|
<a id="aa4f84b2eec9b9201af1840868ddb5fb2"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aa4f84b2eec9b9201af1840868ddb5fb2">◆ </a></span>contains() <span class="overload">[1/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > & </td>
|
|
<td class="paramname"><em>node</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">T </td>
|
|
<td class="paramname"><em>value</em> </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"><a name="l00176"></a><span class="lineno"> 176</span>  {</div>
|
|
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d5/da1/structnode.html">node</a>) {</div>
|
|
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  }</div>
|
|
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  </div>
|
|
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  <span class="keywordflow">if</span> (value < node->value) {</div>
|
|
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  <span class="keywordflow">return</span> <a class="code" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code" href="../../d5/da1/structnode.html">node</a>->left, value);</div>
|
|
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (value > <a class="code" href="../../d5/da1/structnode.html">node</a>->value) {</div>
|
|
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  <span class="keywordflow">return</span> <a class="code" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code" href="../../d5/da1/structnode.html">node</a>->right, value);</div>
|
|
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  }</div>
|
|
<div class="line"><a name="l00188"></a><span class="lineno"> 188</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< bst_node > &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:176</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> avltree.cpp:13</div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a6bf5b410299df2320ddf2709dda61f63"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a6bf5b410299df2320ddf2709dda61f63">◆ </a></span>contains() <span class="overload">[2/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::contains </td>
|
|
<td>(</td>
|
|
<td class="paramtype">T </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"><a name="l00288"></a><span class="lineno"> 288</span> { <span class="keywordflow">return</span> <a class="code" href="../../d9/dde/classbinary__search__tree.html#aa4f84b2eec9b9201af1840868ddb5fb2">contains</a>(<a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, value); }</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< bst_node > root_</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:41</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_a6bf5b410299df2320ddf2709dda61f63_cgraph.svg" width="143" height="76"><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"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a75f897af6aa732a9901454401c869bcb">◆ </a></span>find_max() <span class="overload">[1/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > & </td>
|
|
<td class="paramname"><em>node</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">T & </td>
|
|
<td class="paramname"><em>ret_value</em> </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"><a name="l00052"></a><span class="lineno"> 52</span>  {</div>
|
|
<div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d5/da1/structnode.html">node</a>) {</div>
|
|
<div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!<a class="code" href="../../d5/da1/structnode.html">node</a>->right) {</div>
|
|
<div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  ret_value = <a class="code" href="../../d5/da1/structnode.html">node</a>->value;</div>
|
|
<div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  }</div>
|
|
<div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="keywordflow">return</span> <a class="code" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code" href="../../d5/da1/structnode.html">node</a>->right, ret_value);</div>
|
|
<div class="line"><a name="l00060"></a><span class="lineno"> 60</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< bst_node > &node, T &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:52</div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a42b16f26928b5e994925100594a167a0"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a42b16f26928b5e994925100594a167a0">◆ </a></span>find_max() <span class="overload">[2/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::find_max </td>
|
|
<td>(</td>
|
|
<td class="paramtype">T & </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"><a name="l00306"></a><span class="lineno"> 306</span> { <span class="keywordflow">return</span> <a class="code" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code" 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="76"><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"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#af9a2c7c187a7ca3142c77ce342ef3153">◆ </a></span>find_min() <span class="overload">[1/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > & </td>
|
|
<td class="paramname"><em>node</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">T & </td>
|
|
<td class="paramname"><em>ret_value</em> </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"><a name="l00070"></a><span class="lineno"> 70</span>  {</div>
|
|
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d5/da1/structnode.html">node</a>) {</div>
|
|
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!<a class="code" href="../../d5/da1/structnode.html">node</a>->left) {</div>
|
|
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  ret_value = <a class="code" href="../../d5/da1/structnode.html">node</a>->value;</div>
|
|
<div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  }</div>
|
|
<div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  </div>
|
|
<div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  <span class="keywordflow">return</span> <a class="code" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(<a class="code" href="../../d5/da1/structnode.html">node</a>->left, ret_value);</div>
|
|
<div class="line"><a name="l00079"></a><span class="lineno"> 79</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< bst_node > &node, T &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:70</div></div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ad9912e8574538e86f9bd2c38e7e63d03"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ad9912e8574538e86f9bd2c38e7e63d03">◆ </a></span>find_min() <span class="overload">[2/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::find_min </td>
|
|
<td>(</td>
|
|
<td class="paramtype">T & </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"><a name="l00297"></a><span class="lineno"> 297</span> { <span class="keywordflow">return</span> <a class="code" href="../../d9/dde/classbinary__search__tree.html#af9a2c7c187a7ca3142c77ce342ef3153">find_min</a>(<a class="code" 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="76"><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="a06a863442c165503ac189f7b47599ec8"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a06a863442c165503ac189f7b47599ec8">◆ </a></span>get_elements_inorder()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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><T> <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>< T >::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<T> List of values, sorted in in-order order. </dd></dl>
|
|
<div class="fragment"><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  {</div>
|
|
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<T></a> <a class="code" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
|
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>([&](T node_value) { <a class="code" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(node_value); },</div>
|
|
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
|
|
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordflow">return</span> <a class="code" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
|
<div class="line"><a name="l00325"></a><span class="lineno"> 325</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< void(T)> callback, std::unique_ptr< bst_node > &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:196</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_a06a863442c165503ac189f7b47599ec8_cgraph.svg" width="346" height="52"><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="a70030b0d7990c6fd450256d27b8f6c7b"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a70030b0d7990c6fd450256d27b8f6c7b">◆ </a></span>get_elements_postorder()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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><T> <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>< T >::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<T> List of values, sorted in post-order order. </dd></dl>
|
|
<div class="fragment"><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  {</div>
|
|
<div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<T></a> <a class="code" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
|
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>([&](T node_value) { <a class="code" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(node_value); },</div>
|
|
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
|
|
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keywordflow">return</span> <a class="code" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
|
<div class="line"><a name="l00349"></a><span class="lineno"> 349</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< void(T)> callback, std::unique_ptr< bst_node > &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:230</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_a70030b0d7990c6fd450256d27b8f6c7b_cgraph.svg" width="367" height="52"><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="a53d1bf8e5ef0a952d2817f3cd22546c7"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a53d1bf8e5ef0a952d2817f3cd22546c7">◆ </a></span>get_elements_preorder()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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><T> <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>< T >::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<T> List of values, sorted in pre-order order. </dd></dl>
|
|
<div class="fragment"><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  {</div>
|
|
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<T></a> <a class="code" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
|
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>([&](T node_value) { <a class="code" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>.push_back(node_value); },</div>
|
|
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>);</div>
|
|
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keywordflow">return</span> <a class="code" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
|
<div class="line"><a name="l00337"></a><span class="lineno"> 337</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< void(T)> callback, std::unique_ptr< bst_node > &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:213</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_a53d1bf8e5ef0a952d2817f3cd22546c7_cgraph.svg" width="354" height="52"><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"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a9d1e7e10efa74d741bf48cf032df3778">◆ </a></span>insert() <span class="overload">[1/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > & </td>
|
|
<td class="paramname"><em>node</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">T </td>
|
|
<td class="paramname"><em>new_value</em> </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"><a name="l00089"></a><span class="lineno"> 89</span>  {</div>
|
|
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> == <a class="code" href="../../d5/da1/structnode.html">node</a> && !<a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
|
|
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr<bst_node></a>(<span class="keyword">new</span> bst_node(new_value));</div>
|
|
<div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  }</div>
|
|
<div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  </div>
|
|
<div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keywordflow">if</span> (new_value < node->value) {</div>
|
|
<div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d5/da1/structnode.html">node</a>->left) {</div>
|
|
<div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  <a class="code" href="../../d5/da1/structnode.html">node</a>->left = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr<bst_node></a>(<span class="keyword">new</span> bst_node(new_value));</div>
|
|
<div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">return</span> <a class="code" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code" href="../../d5/da1/structnode.html">node</a>->left, new_value);</div>
|
|
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  }</div>
|
|
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (new_value > <a class="code" href="../../d5/da1/structnode.html">node</a>->value) {</div>
|
|
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d5/da1/structnode.html">node</a>->right) {</div>
|
|
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <a class="code" href="../../d5/da1/structnode.html">node</a>->right =</div>
|
|
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr<bst_node></a>(<span class="keyword">new</span> bst_node(new_value));</div>
|
|
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordflow">return</span> <a class="code" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code" href="../../d5/da1/structnode.html">node</a>->right, new_value);</div>
|
|
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  }</div>
|
|
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  }</div>
|
|
<div class="line"><a name="l00113"></a><span class="lineno"> 113</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< bst_node > &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:89</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>
|
|
</div>
|
|
<a id="a8168edf29316f2b436eac1fc416c52e0"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a8168edf29316f2b436eac1fc416c52e0">◆ </a></span>insert() <span class="overload">[2/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::insert </td>
|
|
<td>(</td>
|
|
<td class="paramtype">T </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"><a name="l00258"></a><span class="lineno"> 258</span>  {</div>
|
|
<div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordtype">bool</span> <a class="code" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code" href="../../d9/dde/classbinary__search__tree.html#a9d1e7e10efa74d741bf48cf032df3778">insert</a>(<a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, new_value);</div>
|
|
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordflow">if</span> (result) {</div>
|
|
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>++;</div>
|
|
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>  }</div>
|
|
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  <span class="keywordflow">return</span> <a class="code" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
|
<div class="line"><a name="l00264"></a><span class="lineno"> 264</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:42</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_a8168edf29316f2b436eac1fc416c52e0_cgraph.svg" width="323" height="52"><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"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#af4a865ce5244608819b169fc78a41153">◆ </a></span>remove() <span class="overload">[1/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > & </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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > & </td>
|
|
<td class="paramname"><em>node</em>, </td>
|
|
</tr>
|
|
<tr>
|
|
<td class="paramkey"></td>
|
|
<td></td>
|
|
<td class="paramtype">T </td>
|
|
<td class="paramname"><em>rm_value</em> </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"><a name="l00125"></a><span class="lineno"> 125</span>  {</div>
|
|
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d5/da1/structnode.html">node</a>) {</div>
|
|
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
|
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  }</div>
|
|
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  </div>
|
|
<div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d5/da1/structnode.html">node</a>->value == rm_value) {</div>
|
|
<div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d5/da1/structnode.html">node</a>->left && <a class="code" href="../../d5/da1/structnode.html">node</a>->right) {</div>
|
|
<div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  T successor_node_value{};</div>
|
|
<div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb">find_max</a>(<a class="code" href="../../d5/da1/structnode.html">node</a>->left, successor_node_value);</div>
|
|
<div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, successor_node_value);</div>
|
|
<div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <a class="code" href="../../d5/da1/structnode.html">node</a>->value = successor_node_value;</div>
|
|
<div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="../../d5/da1/structnode.html">node</a>->left || <a class="code" href="../../d5/da1/structnode.html">node</a>->right) {</div>
|
|
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr<bst_node></a>& non_null =</div>
|
|
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  (<a class="code" href="../../d5/da1/structnode.html">node</a>->left ? <a class="code" href="../../d5/da1/structnode.html">node</a>->left : <a class="code" href="../../d5/da1/structnode.html">node</a>->right);</div>
|
|
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  </div>
|
|
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d5/da1/structnode.html">node</a> == <a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
|
|
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a> = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(non_null);</div>
|
|
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value < parent->value) {</div>
|
|
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  parent->left = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(non_null);</div>
|
|
<div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  parent->right = <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/utility/move.html">std::move</a>(non_null);</div>
|
|
<div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  }</div>
|
|
<div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  </div>
|
|
<div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">if</span> (<a class="code" href="../../d5/da1/structnode.html">node</a> == <a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>) {</div>
|
|
<div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>.reset(<span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00153"></a><span class="lineno"> 153</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value < parent->value) {</div>
|
|
<div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  parent->left.reset(<span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  parent->right.reset(<span class="keyword">nullptr</span>);</div>
|
|
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  }</div>
|
|
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  </div>
|
|
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
|
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  }</div>
|
|
<div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (rm_value < node->value) {</div>
|
|
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keywordflow">return</span> <a class="code" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code" href="../../d5/da1/structnode.html">node</a>, <a class="code" href="../../d5/da1/structnode.html">node</a>->left, rm_value);</div>
|
|
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  } <span class="keywordflow">else</span> {</div>
|
|
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  <span class="keywordflow">return</span> <a class="code" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code" href="../../d5/da1/structnode.html">node</a>, <a class="code" href="../../d5/da1/structnode.html">node</a>->right, rm_value);</div>
|
|
<div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  }</div>
|
|
<div class="line"><a name="l00166"></a><span class="lineno"> 166</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< bst_node > &parent, std::unique_ptr< bst_node > &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:124</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>
|
|
</div>
|
|
<a id="a99771c2e1353e8ddfd4bb9d30b7a98fb"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a99771c2e1353e8ddfd4bb9d30b7a98fb">◆ </a></span>remove() <span class="overload">[2/2]</span></h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::remove </td>
|
|
<td>(</td>
|
|
<td class="paramtype">T </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"><a name="l00273"></a><span class="lineno"> 273</span>  {</div>
|
|
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  <span class="keywordtype">bool</span> <a class="code" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a> = <a class="code" href="../../d9/dde/classbinary__search__tree.html#af4a865ce5244608819b169fc78a41153">remove</a>(<a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, <a class="code" href="../../d9/dde/classbinary__search__tree.html#aa08f65f6f3bfcb14f8c3d1e65305ae50">root_</a>, rm_value);</div>
|
|
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  <span class="keywordflow">if</span> (result) {</div>
|
|
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>--;</div>
|
|
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  }</div>
|
|
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="keywordflow">return</span> <a class="code" href="../../de/dc3/fibonacci__sum_8cpp.html#aadb40ac4c74a7efc0680b83eeee138aa">result</a>;</div>
|
|
<div class="line"><a name="l00279"></a><span class="lineno"> 279</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="323" height="52"><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"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a564fe43e7e8f7ecb6f10667a70fbc6f3">◆ </a></span>size()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::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"><a name="l00313"></a><span class="lineno"> 313</span> { <span class="keywordflow">return</span> <a class="code" href="../../d9/dde/classbinary__search__tree.html#a07ba32ce1a2af6e357600ac8c8e98dbc">size_</a>; }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a2fcf37549bd002c174a45b0b4203c2bd"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a2fcf37549bd002c174a45b0b4203c2bd">◆ </a></span>traverse_inorder()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::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>< void(T)> </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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > & </td>
|
|
<td class="paramname"><em>node</em> </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"><a name="l00197"></a><span class="lineno"> 197</span>  {</div>
|
|
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d5/da1/structnode.html">node</a>) {</div>
|
|
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  }</div>
|
|
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  </div>
|
|
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(callback, <a class="code" href="../../d5/da1/structnode.html">node</a>->left);</div>
|
|
<div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  callback(<a class="code" href="../../d5/da1/structnode.html">node</a>->value);</div>
|
|
<div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#a2fcf37549bd002c174a45b0b4203c2bd">traverse_inorder</a>(callback, <a class="code" href="../../d5/da1/structnode.html">node</a>->right);</div>
|
|
<div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="a87c0a35845d27e0f6fc1f4eaa0333362"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a87c0a35845d27e0f6fc1f4eaa0333362">◆ </a></span>traverse_postorder()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::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>< void(T)> </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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > & </td>
|
|
<td class="paramname"><em>node</em> </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"><a name="l00231"></a><span class="lineno"> 231</span>  {</div>
|
|
<div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d5/da1/structnode.html">node</a>) {</div>
|
|
<div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  }</div>
|
|
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  </div>
|
|
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(callback, <a class="code" href="../../d5/da1/structnode.html">node</a>->left);</div>
|
|
<div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#a87c0a35845d27e0f6fc1f4eaa0333362">traverse_postorder</a>(callback, <a class="code" href="../../d5/da1/structnode.html">node</a>->right);</div>
|
|
<div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  callback(<a class="code" href="../../d5/da1/structnode.html">node</a>->value);</div>
|
|
<div class="line"><a name="l00239"></a><span class="lineno"> 239</span>  }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<a id="ab81edd415324d372632c42dc7dbcb9e1"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#ab81edd415324d372632c42dc7dbcb9e1">◆ </a></span>traverse_preorder()</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::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>< void(T)> </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>< <a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a> > & </td>
|
|
<td class="paramname"><em>node</em> </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"><a name="l00214"></a><span class="lineno"> 214</span>  {</div>
|
|
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordflow">if</span> (!<a class="code" href="../../d5/da1/structnode.html">node</a>) {</div>
|
|
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">return</span>;</div>
|
|
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  }</div>
|
|
<div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  </div>
|
|
<div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  callback(<a class="code" href="../../d5/da1/structnode.html">node</a>->value);</div>
|
|
<div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(callback, <a class="code" href="../../d5/da1/structnode.html">node</a>->left);</div>
|
|
<div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <a class="code" href="../../d9/dde/classbinary__search__tree.html#ab81edd415324d372632c42dc7dbcb9e1">traverse_preorder</a>(callback, <a class="code" href="../../d5/da1/structnode.html">node</a>->right);</div>
|
|
<div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  }</div>
|
|
</div><!-- fragment -->
|
|
</div>
|
|
</div>
|
|
<h2 class="groupheader">Member Data Documentation</h2>
|
|
<a id="aa08f65f6f3bfcb14f8c3d1e65305ae50"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#aa08f65f6f3bfcb14f8c3d1e65305ae50">◆ </a></span>root_</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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><<a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</a>> <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>< T >::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"></a>
|
|
<h2 class="memtitle"><span class="permalink"><a href="#a07ba32ce1a2af6e357600ac8c8e98dbc">◆ </a></span>size_</h2>
|
|
|
|
<div class="memitem">
|
|
<div class="memproto">
|
|
<div class="memtemplate">
|
|
template<class T > </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>< T >::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.1 </li>
|
|
</ul>
|
|
</div>
|
|
</body>
|
|
</html>
|