backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-24 05:42:59 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for c26eea874d

Browse Source
This commit is contained in:
realstealthninja
2025-05-19 11:38:33 +00:00
parent c7a9a42397
commit 14583a2f33
2829 changed files with 30266 additions and 21669 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
dd/db6/structbinary__search__tree_1_1bst__node.html
View File

@@ -4,7 +4,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: binary_search_tree&lt; T &gt;::bst_node Struct Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -60,7 +60,7 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<!-- Generated by Doxygen 1.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -163,7 +163,7 @@ struct binary_search_tree&lt; T &gt;::bst_node</div><p>A struct to represent a n
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
template&lt;class T&gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
@@ -177,7 +177,7 @@ template&lt;class T &gt; </div>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">explicit</span></span> </td>
<span class="mlabels"><span class="mlabel inline">inline</span><span class="mlabel explicit">explicit</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -190,12 +190,14 @@ template&lt;class T &gt; </div>
<p class="definition">Definition at line <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html#l00035">35</a> of file <a class="el" href="../../df/d42/binary__search__tree2_8cpp_source.html">binary_search_tree2.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 35</span> {</div>
<div class="line"><span class="lineno"> 36</span> <a class="code hl_variable" href="#a09da9e5b801ede4764bc812975ff7f29">value</a> = _value;</div>
<div class="line"><span class="lineno"> 37</span> left = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 36</span> <a class="code hl_variable" href="#a09da9e5b801ede4764bc812975ff7f29">value</a> = <a class="code hl_class" href="../../d9/dde/classbinary__search__tree.html">_value</a>;</div>
<div class="line"><span class="lineno"> 37</span> <a class="code hl_variable" href="#a55c165b9e0e5b50a23104e0604dcc788">left</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 38</span> <a class="code hl_variable" href="#a05f3a7aa6c31622f855ce4b5a95e91df">right</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 39</span> }</div>
<div class="ttc" id="aclassbinary__search__tree_html"><div class="ttname"><a href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a></div><div class="ttdoc">The Binary Search Tree class.</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00020">binary_search_tree2.cpp:20</a></div></div>
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a05f3a7aa6c31622f855ce4b5a95e91df"><div class="ttname"><a href="#a05f3a7aa6c31622f855ce4b5a95e91df">binary_search_tree::bst_node::right</a></div><div class="ttdeci">std::unique_ptr&lt; bst_node &gt; right</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00028">binary_search_tree2.cpp:28</a></div></div>
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a09da9e5b801ede4764bc812975ff7f29"><div class="ttname"><a href="#a09da9e5b801ede4764bc812975ff7f29">binary_search_tree::bst_node::value</a></div><div class="ttdeci">T value</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00026">binary_search_tree2.cpp:26</a></div></div>
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a55c165b9e0e5b50a23104e0604dcc788"><div class="ttname"><a href="#a55c165b9e0e5b50a23104e0604dcc788">binary_search_tree::bst_node::left</a></div><div class="ttdeci">std::unique_ptr&lt; bst_node &gt; left</div><div class="ttdef"><b>Definition</b> <a href="../../df/d42/binary__search__tree2_8cpp_source.html#l00027">binary_search_tree2.cpp:27</a></div></div>
</div><!-- fragment -->
</div>
</div>
@@ -206,7 +208,7 @@ template&lt;class T &gt; </div>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
template&lt;class T&gt; </div>
<table class="memname">
<tr>
<td class="memname">std::unique_ptr&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;::bst_node::left</td>
@@ -225,7 +227,7 @@ template&lt;class T &gt; </div>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
template&lt;class T&gt; </div>
<table class="memname">
<tr>
<td class="memname">std::unique_ptr&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;::bst_node::right</td>
@@ -244,7 +246,7 @@ template&lt;class T &gt; </div>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;class T &gt; </div>
template&lt;class T&gt; </div>
<table class="memname">
<tr>
<td class="memname">T <a class="el" href="../../d9/dde/classbinary__search__tree.html">binary_search_tree</a>&lt; T &gt;::bst_node::value</td>
@@ -266,7 +268,7 @@ template&lt;class T &gt; </div>
<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="navelem"><a class="el" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html">bst_node</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.12.0 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
</ul>
</div>
</body>