backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-29 21:14:35 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 60fc753f7f

Browse Source
This commit is contained in:
github-actions
2022-09-09 23:38:59 +00:00
parent 766f10286e
commit 334755ad2b
8 changed files with 374 additions and 374 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
dd/db6/structbinary__search__tree_1_1bst__node.html
View File

@@ -163,14 +163,14 @@ template&lt;class T &gt; </div>
</table>
</dd>
</dl>
<div class="fragment"><div class="line"><span class="lineno"> 34</span> {</div>
<div class="line"><span class="lineno"> 35</span> <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29">value</a> = _value;</div>
<div class="line"><span class="lineno"> 36</span> <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788">left</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 37</span> <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df">right</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 38</span> }</div>
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a05f3a7aa6c31622f855ce4b5a95e91df"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#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> binary_search_tree2.cpp:27</div></div>
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a09da9e5b801ede4764bc812975ff7f29"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29">binary_search_tree::bst_node::value</a></div><div class="ttdeci">T value</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:25</div></div>
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a55c165b9e0e5b50a23104e0604dcc788"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#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> binary_search_tree2.cpp:26</div></div>
<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="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29">value</a> = _value;</div>
<div class="line"><span class="lineno"> 37</span> <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788">left</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 38</span> <a class="code hl_variable" href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df">right</a> = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 39</span> }</div>
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a05f3a7aa6c31622f855ce4b5a95e91df"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#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> binary_search_tree2.cpp:28</div></div>
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a09da9e5b801ede4764bc812975ff7f29"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#a09da9e5b801ede4764bc812975ff7f29">binary_search_tree::bst_node::value</a></div><div class="ttdeci">T value</div><div class="ttdef"><b>Definition:</b> binary_search_tree2.cpp:26</div></div>
<div class="ttc" id="astructbinary__search__tree_1_1bst__node_html_a55c165b9e0e5b50a23104e0604dcc788"><div class="ttname"><a href="../../dd/db6/structbinary__search__tree_1_1bst__node.html#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> binary_search_tree2.cpp:27</div></div>
</div><!-- fragment -->
</div>
</div>