backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-16 11:32:44 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 6376bf46af

Browse Source
This commit is contained in:
github-actions
2023-09-27 18:42:32 +00:00
parent d28eba1fef
commit b5b4d78981
5708 changed files with 52275 additions and 51112 deletions
Download Patch File Download Diff File Expand all files Collapse all files

55
d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html
View File

@@ -3,7 +3,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.9.7"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: others::recursive_tree_traversals::Node Struct Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.7 -->
<!-- Generated by Doxygen 1.9.8 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -114,17 +114,15 @@ Collaboration diagram for others::recursive_tree_traversals::Node:</div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-attribs" name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:a3b8c7ec2863de75916be027fa5287570"><td class="memItemLeft" align="right" valign="top"><a id="a3b8c7ec2863de75916be027fa5287570" name="a3b8c7ec2863de75916be027fa5287570"></a>
<tr class="memitem:a3b8c7ec2863de75916be027fa5287570" id="r_a3b8c7ec2863de75916be027fa5287570"><td class="memItemLeft" align="right" valign="top"><a id="a3b8c7ec2863de75916be027fa5287570" name="a3b8c7ec2863de75916be027fa5287570"></a>
uint64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b> = 0</td></tr>
<tr class="memdesc:a3b8c7ec2863de75916be027fa5287570"><td class="mdescLeft">&#160;</td><td class="mdescRight">The value/key of the node. <br /></td></tr>
<tr class="separator:a3b8c7ec2863de75916be027fa5287570"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5a8a7bc2d2f847994220ae9e0b60fff3"><td class="memItemLeft" align="right" valign="top"><a id="a5a8a7bc2d2f847994220ae9e0b60fff3" name="a5a8a7bc2d2f847994220ae9e0b60fff3"></a>
struct <a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>left</b> {}</td></tr>
<tr class="memdesc:a5a8a7bc2d2f847994220ae9e0b60fff3"><td class="mdescLeft">&#160;</td><td class="mdescRight">struct pointer to left subtree. <br /></td></tr>
<tr class="memitem:a5a8a7bc2d2f847994220ae9e0b60fff3" id="r_a5a8a7bc2d2f847994220ae9e0b60fff3"><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3">left</a> {}</td></tr>
<tr class="memdesc:a5a8a7bc2d2f847994220ae9e0b60fff3"><td class="mdescLeft">&#160;</td><td class="mdescRight">struct pointer to left subtree. <br /></td></tr>
<tr class="separator:a5a8a7bc2d2f847994220ae9e0b60fff3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab875304781a4eb9661c0931a6f1fae83"><td class="memItemLeft" align="right" valign="top"><a id="ab875304781a4eb9661c0931a6f1fae83" name="ab875304781a4eb9661c0931a6f1fae83"></a>
struct <a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>right</b> {}</td></tr>
<tr class="memdesc:ab875304781a4eb9661c0931a6f1fae83"><td class="mdescLeft">&#160;</td><td class="mdescRight">struct pointer to right subtree. <br /></td></tr>
<tr class="memitem:ab875304781a4eb9661c0931a6f1fae83" id="r_ab875304781a4eb9661c0931a6f1fae83"><td class="memItemLeft" align="right" valign="top">struct <a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83">right</a> {}</td></tr>
<tr class="memdesc:ab875304781a4eb9661c0931a6f1fae83"><td class="mdescLeft">&#160;</td><td class="mdescRight">struct pointer to right subtree. <br /></td></tr>
<tr class="separator:ab875304781a4eb9661c0931a6f1fae83"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
@@ -137,7 +135,42 @@ struct <a class="el" href="../../d9/df7/structothers_1_1recursive__tree__travers
</table>
</dd>
</dl>
</div><hr/>The documentation for this struct was generated from the following file:<ul>
</div><h2 class="groupheader">Member Data Documentation</h2>
<a id="a5a8a7bc2d2f847994220ae9e0b60fff3" name="a5a8a7bc2d2f847994220ae9e0b60fff3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5a8a7bc2d2f847994220ae9e0b60fff3">&#9670;&#160;</a></span>left</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">struct <a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a>* others::recursive_tree_traversals::Node::left {}</td>
</tr>
</table>
</div><div class="memdoc">
<p>struct pointer to left subtree. </p>
<div class="fragment"><div class="line"><span class="lineno"> 80</span>{}; <span class="comment">///&lt; struct pointer to left subtree.</span></div>
</div><!-- fragment -->
</div>
</div>
<a id="ab875304781a4eb9661c0931a6f1fae83" name="ab875304781a4eb9661c0931a6f1fae83"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab875304781a4eb9661c0931a6f1fae83">&#9670;&#160;</a></span>right</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">struct <a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">Node</a>* others::recursive_tree_traversals::Node::right {}</td>
</tr>
</table>
</div><div class="memdoc">
<p>struct pointer to right subtree. </p>
<div class="fragment"><div class="line"><span class="lineno"> 81</span>{}; <span class="comment">///&lt; struct pointer to right subtree.</span></div>
</div><!-- fragment -->
</div>
</div>
<hr/>The documentation for this struct was generated from the following file:<ul>
<li>others/<a class="el" href="../../dc/de1/recursive__tree__traversal_8cpp.html">recursive_tree_traversal.cpp</a></li>
</ul>
</div><!-- contents -->
@@ -146,7 +179,7 @@ struct <a class="el" href="../../d9/df7/structothers_1_1recursive__tree__travers
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../d0/d6f/namespaceothers.html">others</a></li><li class="navelem"><b>recursive_tree_traversals</b></li><li class="navelem"><a class="el" href="../../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html">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.9.7 </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.8 </li>
</ul>
</div>
</body>