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

Documentation for 53a6c16730

Browse Source
This commit is contained in:
github-actions
2022-01-16 16:05:19 +00:00
parent 778f1be9e5
commit 2cab28c905
3620 changed files with 52045 additions and 41188 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
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.2"/>
<meta name="generator" content="Doxygen 1.9.3"/>
<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"/>
@@ -30,8 +30,8 @@ MathJax.Hub.Config({
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.2 -->
<!-- Generated by Doxygen 1.9.3 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
@@ -159,11 +159,11 @@ int64_t&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
<p >&lt; Set value of <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> data</p>
<p >&lt; Initialize left child to NULL</p>
<p >&lt; Initialize right child to NULL</p>
<div class="fragment"><div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> {</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">data</a> = _data; <span class="comment">///&lt; Set value of Node data</span></div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a> = <span class="keyword">nullptr</span>; <span class="comment">///&lt; Initialize left child to NULL</span></div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a> = <span class="keyword">nullptr</span>; <span class="comment">///&lt; Initialize right child to NULL</span></div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> }</div>
<div class="fragment"><div class="line"><span class="lineno"> 41</span> {</div>
<div class="line"><span class="lineno"> 42</span> <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">data</a> = _data; <span class="comment">///&lt; Set value of Node data</span></div>
<div class="line"><span class="lineno"> 43</span> <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">left</a> = <span class="keyword">nullptr</span>; <span class="comment">///&lt; Initialize left child to NULL</span></div>
<div class="line"><span class="lineno"> 44</span> <a class="code hl_variable" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">right</a> = <span class="keyword">nullptr</span>; <span class="comment">///&lt; Initialize right child to NULL</span></div>
<div class="line"><span class="lineno"> 45</span> }</div>
<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_ab13a4dd92d54c11eca86edde3ef32256"><div class="ttname"><a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ab13a4dd92d54c11eca86edde3ef32256">operations_on_datastructures::reverse_binary_tree::Node::right</a></div><div class="ttdeci">Node * right</div><div class="ttdoc">The Node's right child.</div><div class="ttdef"><b>Definition:</b> reverse_binary_tree.cpp:37</div></div>
<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_ae54953a75091532303bb08d55087077f"><div class="ttname"><a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f">operations_on_datastructures::reverse_binary_tree::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The value of the Node.</div><div class="ttdef"><b>Definition:</b> reverse_binary_tree.cpp:35</div></div>
<div class="ttc" id="astructoperations__on__datastructures_1_1reverse__binary__tree_1_1_node_html_aeb01a65e51df1e3bc5296cde8477c352"><div class="ttname"><a href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#aeb01a65e51df1e3bc5296cde8477c352">operations_on_datastructures::reverse_binary_tree::Node::left</a></div><div class="ttdeci">Node * left</div><div class="ttdoc">The Node's left child.</div><div class="ttdef"><b>Definition:</b> reverse_binary_tree.cpp:36</div></div>
@@ -179,7 +179,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.2 </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.3 </li>
</ul>
</div>
</body>