backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-09 05:27:00 +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

14
d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_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++: operations_on_datastructures::reverse_binary_tree::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');
@@ -115,21 +115,21 @@ Collaboration diagram for operations_on_datastructures::reverse_binary_tree::Nod
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a15dd7a0a7d9b1e8b2012c5161aecd6e3"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3">Node</a> (int64_t _data)</td></tr>
<tr class="memitem:a15dd7a0a7d9b1e8b2012c5161aecd6e3" id="r_a15dd7a0a7d9b1e8b2012c5161aecd6e3"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#a15dd7a0a7d9b1e8b2012c5161aecd6e3">Node</a> (int64_t _data)</td></tr>
<tr class="memdesc:a15dd7a0a7d9b1e8b2012c5161aecd6e3"><td class="mdescLeft">&#160;</td><td class="mdescRight">Creates a new <a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> with some initial data. <br /></td></tr>
<tr class="separator:a15dd7a0a7d9b1e8b2012c5161aecd6e3"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><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:ae54953a75091532303bb08d55087077f"><td class="memItemLeft" align="right" valign="top"><a id="ae54953a75091532303bb08d55087077f" name="ae54953a75091532303bb08d55087077f"></a>
<tr class="memitem:ae54953a75091532303bb08d55087077f" id="r_ae54953a75091532303bb08d55087077f"><td class="memItemLeft" align="right" valign="top"><a id="ae54953a75091532303bb08d55087077f" name="ae54953a75091532303bb08d55087077f"></a>
int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
<tr class="memdesc:ae54953a75091532303bb08d55087077f"><td class="mdescLeft">&#160;</td><td class="mdescRight">The value of the <a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a>. <br /></td></tr>
<tr class="separator:ae54953a75091532303bb08d55087077f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aeb01a65e51df1e3bc5296cde8477c352"><td class="memItemLeft" align="right" valign="top"><a id="aeb01a65e51df1e3bc5296cde8477c352" name="aeb01a65e51df1e3bc5296cde8477c352"></a>
<tr class="memitem:aeb01a65e51df1e3bc5296cde8477c352" id="r_aeb01a65e51df1e3bc5296cde8477c352"><td class="memItemLeft" align="right" valign="top"><a id="aeb01a65e51df1e3bc5296cde8477c352" name="aeb01a65e51df1e3bc5296cde8477c352"></a>
<a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>left</b></td></tr>
<tr class="memdesc:aeb01a65e51df1e3bc5296cde8477c352"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a>'s left child. <br /></td></tr>
<tr class="separator:aeb01a65e51df1e3bc5296cde8477c352"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab13a4dd92d54c11eca86edde3ef32256"><td class="memItemLeft" align="right" valign="top"><a id="ab13a4dd92d54c11eca86edde3ef32256" name="ab13a4dd92d54c11eca86edde3ef32256"></a>
<tr class="memitem:ab13a4dd92d54c11eca86edde3ef32256" id="r_ab13a4dd92d54c11eca86edde3ef32256"><td class="memItemLeft" align="right" valign="top"><a id="ab13a4dd92d54c11eca86edde3ef32256" name="ab13a4dd92d54c11eca86edde3ef32256"></a>
<a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>right</b></td></tr>
<tr class="memdesc:ab13a4dd92d54c11eca86edde3ef32256"><td class="mdescLeft">&#160;</td><td class="mdescRight">The <a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a>'s right child. <br /></td></tr>
<tr class="separator:ab13a4dd92d54c11eca86edde3ef32256"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -185,7 +185,7 @@ int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></li><li class="navelem"><b>reverse_binary_tree</b></li><li class="navelem"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_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>