backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 12:23:13 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for d4b54b8294

Browse Source
This commit is contained in:
github-actions
2020-09-23 18:27:27 +00:00
parent ee4b1fa14f
commit cd4079d931
279 changed files with 4507 additions and 4827 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
db/d8b/struct_node.html
View File

@@ -101,15 +101,12 @@ $(document).ready(function(){initNavTree('db/d8b/struct_node.html','../../'); in
<div class="dynheader">
Collaboration diagram for Node:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/ddc/struct_node__coll__graph.svg" width="114" height="55"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/ddc/struct_node__coll__graph.svg" width="118" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:aa7b07e6131a6c2e88c3d47cee4bc10fa"><td class="memItemLeft" align="right" valign="top"><a id="aa7b07e6131a6c2e88c3d47cee4bc10fa"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>Node</b> (int val)</td></tr>
<tr class="separator:aa7b07e6131a6c2e88c3d47cee4bc10fa"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a66af34de5f6c4d108abd948f341e6470"><td class="memItemLeft" align="right" valign="top"><a id="a66af34de5f6c4d108abd948f341e6470"></a>
&#160;</td><td class="memItemRight" valign="bottom"><b>Node</b> (int v, <a class="el" href="../../db/d8b/struct_node.html">Node</a> *n)</td></tr>
<tr class="separator:a66af34de5f6c4d108abd948f341e6470"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -122,12 +119,6 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>data</b></td></tr>
<tr class="memitem:a80be4538a9184fa43c1dee17641e819b"><td class="memItemLeft" align="right" valign="top"><a id="a80be4538a9184fa43c1dee17641e819b"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>next</b></td></tr>
<tr class="separator:a80be4538a9184fa43c1dee17641e819b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab8c667ac8fdb120ed4c031682a9cdaee"><td class="memItemLeft" align="right" valign="top"><a id="ab8c667ac8fdb120ed4c031682a9cdaee"></a>
<a class="el" href="../../db/d8b/struct_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>left</b></td></tr>
<tr class="separator:ab8c667ac8fdb120ed4c031682a9cdaee"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7328862eaa6dea28018326549b3294d3"><td class="memItemLeft" align="right" valign="top"><a id="a7328862eaa6dea28018326549b3294d3"></a>
<a class="el" href="../../db/d8b/struct_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><b>right</b></td></tr>
<tr class="separator:a7328862eaa6dea28018326549b3294d3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab1d228a881cf7465b2d42ea135781427"><td class="memItemLeft" align="right" valign="top"><a id="ab1d228a881cf7465b2d42ea135781427"></a>
int&#160;</td><td class="memItemRight" valign="bottom"><b>val</b></td></tr>
<tr class="separator:ab1d228a881cf7465b2d42ea135781427"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -137,7 +128,6 @@ int&#160;</td><td class="memItemRight" valign="bottom"><b>val</b></td></tr>
</table>
<hr/>The documentation for this class was generated from the following files:<ul>
<li>data_structures/<a class="el" href="../../d3/dce/linkedlist__implentation__usingarray_8cpp.html">linkedlist_implentation_usingarray.cpp</a></li>
<li>dynamic_programming/largestbst_in_binary_tree.cpp</li>
<li>operations_on_datastructures/get_size_of_linked_list.cpp</li>
</ul>
</div><!-- contents -->