mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-05-05 00:35:30 +08:00
Documentation for 8b1eab204b
This commit is contained in:
realstealthninja
@@ -1,3 +1,4 @@
|
||||
<!-- HTML header for doxygen 1.12.0-->
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
||||
<head>
|
||||
@@ -5,10 +6,15 @@
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||||
<meta name="generator" content="Doxygen 1.12.0"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: math/binary_exponent.cpp File Reference</title>
|
||||
<title>TheAlgorithms/C++: math/binary_exponent.cpp File Reference</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
||||
<script type="text/javascript">
|
||||
DoxygenAwesomeDarkModeToggle.init()
|
||||
</script>
|
||||
<script type="text/javascript" src="../../clipboard.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
@@ -18,14 +24,24 @@
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
<script type="text/javascript">
|
||||
window.MathJax = {
|
||||
options: {
|
||||
ignoreHtmlClass: 'tex2jax_ignore',
|
||||
processHtmlClass: 'tex2jax_process'
|
||||
},
|
||||
loader: {
|
||||
load: ['[tex]/ams']
|
||||
},
|
||||
tex: {
|
||||
macros: {},
|
||||
packages: ['base','configmacros','ams']
|
||||
}
|
||||
};
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr id="projectrow">
|
||||
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
||||
<td id="projectalign">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
<div id="projectbrief">All the algorithms implemented in C++</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
@@ -118,7 +135,9 @@ Include dependency graph for binary_exponent.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/d36/binary__exponent_8cpp__incl.svg" width="186" height="111"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
</div><table class="memberdecls">
|
||||
</div>
|
||||
<p><a href="../../de/dcf/binary__exponent_8cpp_source.html">Go to the source code of this file.</a></p>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
|
||||
Functions</h2></td></tr>
|
||||
<tr class="memitem:aeb48dce0725e63d19147944f41843c73" id="r_aeb48dce0725e63d19147944f41843c73"><td class="memItemLeft" align="right" valign="top">int </td><td class="memItemRight" valign="bottom"><a class="el" href="#aeb48dce0725e63d19147944f41843c73">binExpo</a> (int a, int b)</td></tr>
|
||||
@@ -142,6 +161,8 @@ Functions</h2></td></tr>
|
||||
\end{eqnarray*}
|
||||
</p>
|
||||
<p> Hence to calculate 2^10 we only need to multiply \(2^8\) and \(2^2\) skipping \(2^1\) and \(2^4\). </p>
|
||||
|
||||
<p class="definition">Definition in file <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html">binary_exponent.cpp</a>.</p>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="aeb48dce0725e63d19147944f41843c73" name="aeb48dce0725e63d19147944f41843c73"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#aeb48dce0725e63d19147944f41843c73">◆ </a></span>binExpo()</h2>
|
||||
@@ -162,6 +183,8 @@ Functions</h2></td></tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Recursive function to calculate exponent in \(O(\log(n))\) using binary exponent. </p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html#l00028">28</a> of file <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html">binary_exponent.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 28</span> {</div>
|
||||
<div class="line"><span class="lineno"> 29</span> <span class="keywordflow">if</span> (b == 0) {</div>
|
||||
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">return</span> 1;</div>
|
||||
@@ -173,13 +196,8 @@ Functions</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 36</span> <span class="keywordflow">return</span> res * res;</div>
|
||||
<div class="line"><span class="lineno"> 37</span> }</div>
|
||||
<div class="line"><span class="lineno"> 38</span>}</div>
|
||||
<div class="ttc" id="abinary__exponent_8cpp_html_aeb48dce0725e63d19147944f41843c73"><div class="ttname"><a href="#aeb48dce0725e63d19147944f41843c73">binExpo</a></div><div class="ttdeci">int binExpo(int a, int b)</div><div class="ttdef"><b>Definition</b> binary_exponent.cpp:28</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/binary__exponent_8cpp_aeb48dce0725e63d19147944f41843c73_cgraph.svg" width="79" height="60"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
<div class="ttc" id="abinary__exponent_8cpp_html_aeb48dce0725e63d19147944f41843c73"><div class="ttname"><a href="#aeb48dce0725e63d19147944f41843c73">binExpo</a></div><div class="ttdeci">int binExpo(int a, int b)</div><div class="ttdef"><b>Definition</b> <a href="../../de/dcf/binary__exponent_8cpp_source.html#l00028">binary_exponent.cpp:28</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a31dbf5f7ceb9c9eec831ef9f7782291f" name="a31dbf5f7ceb9c9eec831ef9f7782291f"></a>
|
||||
@@ -201,6 +219,8 @@ Here is the call graph for this function:</div>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Iterative function to calculate exponent in \(O(\log(n))\) using binary exponent. </p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html#l00042">42</a> of file <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html">binary_exponent.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 42</span> {</div>
|
||||
<div class="line"><span class="lineno"> 43</span> <span class="keywordtype">int</span> res = 1;</div>
|
||||
<div class="line"><span class="lineno"> 44</span> <span class="keywordflow">while</span> (b > 0) {</div>
|
||||
@@ -234,33 +254,23 @@ Here is the call graph for this function:</div>
|
||||
<p>Give two numbers a, b</p>
|
||||
<p>int resIterate = binExpo_alt(a, b);</p>
|
||||
<p>Result of a^b (where '^' denotes exponentiation)</p>
|
||||
<p><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << resIterate << <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 55</span> {</div>
|
||||
<div class="line"><span class="lineno"> 56</span> <span class="keywordtype">int</span> a, b;<span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 57</span><span class="comment"> /// Give two numbers a, b</span></div>
|
||||
<div class="line"><span class="lineno"> 58</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a> >> a >> b;</div>
|
||||
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">if</span> (a == 0 && b == 0) {</div>
|
||||
<div class="line"><span class="lineno"> 60</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Math error"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 61</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b < 0) {</div>
|
||||
<div class="line"><span class="lineno"> 62</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"Exponent must be positive !!"</span> << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
|
||||
<div class="line"><span class="lineno"> 63</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 64</span> <span class="keywordtype">int</span> resRecurse = <a class="code hl_function" href="#aeb48dce0725e63d19147944f41843c73">binExpo</a>(a, b);<span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 65</span><span class="comment"> /// int resIterate = binExpo_alt(a, b);</span></div>
|
||||
<div class="line"><span class="lineno"> 66</span><span class="comment"></span><span class="comment"></span> </div>
|
||||
<div class="line"><span class="lineno"> 67</span><span class="comment"> /// Result of a^b (where '^' denotes exponentiation)</span></div>
|
||||
<div class="line"><span class="lineno"> 68</span><span class="comment"></span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << resRecurse << <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;<span class="comment"></span></div>
|
||||
<div class="line"><span class="lineno"> 69</span><span class="comment"> /// std::cout << resIterate << std::endl;</span></div>
|
||||
<div class="line"><span class="lineno"> 70</span><span class="comment"></span> }</div>
|
||||
<div class="line"><span class="lineno"> 71</span>}</div>
|
||||
<div class="ttc" id="abasic_istream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_istream.html">std::cin</a></div></div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/binary__exponent_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="180" height="110"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
<p>std::cout << resIterate << std::endl;</p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../de/dcf/binary__exponent_8cpp_source.html">binary_exponent.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 55</span> {</div>
|
||||
<div class="line"><span class="lineno"> 56</span> <span class="keywordtype">int</span> a, b;</div>
|
||||
<div class="line"><span class="lineno"> 58</span> std::cin >> a >> b;</div>
|
||||
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">if</span> (a == 0 && b == 0) {</div>
|
||||
<div class="line"><span class="lineno"> 60</span> std::cout << <span class="stringliteral">"Math error"</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 61</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b < 0) {</div>
|
||||
<div class="line"><span class="lineno"> 62</span> std::cout << <span class="stringliteral">"Exponent must be positive !!"</span> << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 63</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 64</span> <span class="keywordtype">int</span> resRecurse = <a class="code hl_function" href="#aeb48dce0725e63d19147944f41843c73">binExpo</a>(a, b);</div>
|
||||
<div class="line"><span class="lineno"> 66</span> </div>
|
||||
<div class="line"><span class="lineno"> 68</span> std::cout << resRecurse << std::endl;</div>
|
||||
<div class="line"><span class="lineno"> 70</span> }</div>
|
||||
<div class="line"><span class="lineno"> 71</span>}</div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
</div><!-- contents -->
|
||||
|
||||
@@ -1,8 +0,0 @@
|
||||
<map id="main" name="main">
|
||||
<area shape="rect" id="Node000001" title="Main function." alt="" coords="5,55,55,80"/>
|
||||
<area shape="rect" id="Node000002" href="$de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73" title=" " alt="" coords="104,29,172,55"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="55,59,88,51,89,56,56,64"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="103,79,174,104"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000003" title=" " alt="" coords="56,70,88,78,87,83,55,76"/>
|
||||
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="119,30,115,21,118,11,125,5,138,3,152,5,159,12,156,16,150,10,138,8,128,10,122,14,121,20,124,28"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
b35095ec3eb1d71b6f0a99c49cdd27be
|
||||
@@ -1,92 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="135pt" height="82pt"
|
||||
viewBox="0.00 0.00 134.50 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
||||
|
||||
<style type="text/css"><![CDATA[
|
||||
.node, .edge {opacity: 0.7;}
|
||||
.node.selected, .edge.selected {opacity: 1;}
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
|
||||
<title>main</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Main function.">
|
||||
<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
|
||||
<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="125.38,-56.25 74.12,-56.25 74.12,-37 125.38,-37 125.38,-56.25"/>
|
||||
<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">binExpo</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.91,-33.72 53.81,-35.85 62.49,-37.93"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.62,-41.32 72.16,-40.25 63.25,-34.51 61.62,-41.32"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
|
||||
<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge3_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C44.64,-21.91 53.16,-19.98 61.53,-18.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.27,-21.5 71.25,-15.87 60.72,-14.67 62.27,-21.5"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node2 -->
|
||||
<g id="edge2_Node000002_Node000002" class="edge">
|
||||
<title>Node2->Node2</title>
|
||||
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M87.03,-56.54C81.23,-65.15 85.47,-74.25 99.75,-74.25 107.56,-74.25 112.37,-71.53 114.17,-67.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="117.67,-67.39 112.7,-58.03 110.75,-68.45 117.67,-67.39"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
||||
<style type='text/css'>
|
||||
<![CDATA[
|
||||
[data-mouse-over-selected='false'] { opacity: 0.7; }
|
||||
[data-mouse-over-selected='true'] { opacity: 1.0; }
|
||||
]]>
|
||||
</style>
|
||||
<script type="application/ecmascript"><![CDATA[
|
||||
document.addEventListener('DOMContentLoaded', (event) => {
|
||||
highlightEdges();
|
||||
highlightAdjacentNodes();
|
||||
});
|
||||
]]></script>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 3.6 KiB |
@@ -1,66 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: main Pages: 1 -->
|
||||
<svg width="135pt" height="82pt"
|
||||
viewBox="0.00 0.00 134.50 82.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 78.25)">
|
||||
<title>main</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Main function.">
|
||||
<polygon fill="#999999" stroke="#666666" points="37,-37.25 0,-37.25 0,-18 37,-18 37,-37.25"/>
|
||||
<text text-anchor="middle" x="18.5" y="-23.75" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73" target="_top" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="125.38,-56.25 74.12,-56.25 74.12,-37 125.38,-37 125.38,-56.25"/>
|
||||
<text text-anchor="middle" x="99.75" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">binExpo</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M37.48,-31.94C44.91,-33.72 53.81,-35.85 62.49,-37.93"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="61.62,-41.32 72.16,-40.25 63.25,-34.51 61.62,-41.32"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="126.5,-19.25 73,-19.25 73,0 126.5,0 126.5,-19.25"/>
|
||||
<text text-anchor="middle" x="99.75" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge3_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge3_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M37.48,-23.54C44.64,-21.91 53.16,-19.98 61.53,-18.08"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="62.27,-21.5 71.25,-15.87 60.72,-14.67 62.27,-21.5"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node2 -->
|
||||
<g id="edge2_Node000002_Node000002" class="edge">
|
||||
<title>Node2->Node2</title>
|
||||
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M87.03,-56.54C81.23,-65.15 85.47,-74.25 99.75,-74.25 107.56,-74.25 112.37,-71.53 114.17,-67.65"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="117.67,-67.39 112.7,-58.03 110.75,-68.45 117.67,-67.39"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 2.9 KiB |
@@ -1,4 +0,0 @@
|
||||
<map id="binExpo" name="binExpo">
|
||||
<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,74,55"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="26,29,25,12,31,5,40,3,49,6,54,12,49,15,46,10,39,8,34,10,30,14,31,29"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
f26d59230b7e12bd24abc4e72eea9518
|
||||
@@ -1,56 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: binExpo Pages: 1 -->
|
||||
<svg width="59pt" height="45pt"
|
||||
viewBox="0.00 0.00 59.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
||||
|
||||
<style type="text/css"><![CDATA[
|
||||
.node, .edge {opacity: 0.7;}
|
||||
.node.selected, .edge.selected {opacity: 1;}
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
|
||||
<title>binExpo</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title=" ">
|
||||
<polygon fill="#999999" stroke="#666666" points="51.25,-19.25 0,-19.25 0,0 51.25,0 51.25,-19.25"/>
|
||||
<text text-anchor="middle" x="25.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">binExpo</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M17.6,-19.54C13.94,-28.15 16.62,-37.25 25.62,-37.25 30.41,-37.25 33.41,-34.68 34.62,-30.98"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="38.11,-30.71 33.78,-21.05 31.13,-31.31 38.11,-30.71"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
||||
<style type='text/css'>
|
||||
<![CDATA[
|
||||
[data-mouse-over-selected='false'] { opacity: 0.7; }
|
||||
[data-mouse-over-selected='true'] { opacity: 1.0; }
|
||||
]]>
|
||||
</style>
|
||||
<script type="application/ecmascript"><![CDATA[
|
||||
document.addEventListener('DOMContentLoaded', (event) => {
|
||||
highlightEdges();
|
||||
highlightAdjacentNodes();
|
||||
});
|
||||
]]></script>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 2.0 KiB |
@@ -1,30 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: binExpo Pages: 1 -->
|
||||
<svg width="59pt" height="45pt"
|
||||
viewBox="0.00 0.00 59.25 45.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 41.25)">
|
||||
<title>binExpo</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title=" ">
|
||||
<polygon fill="#999999" stroke="#666666" points="51.25,-19.25 0,-19.25 0,0 51.25,0 51.25,-19.25"/>
|
||||
<text text-anchor="middle" x="25.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">binExpo</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M17.6,-19.54C13.94,-28.15 16.62,-37.25 25.62,-37.25 30.41,-37.25 33.41,-34.68 34.62,-30.98"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="38.11,-30.71 33.78,-21.05 31.13,-31.31 38.11,-30.71"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 1.2 KiB |
186
de/dcf/binary__exponent_8cpp_source.html
Normal file
186
de/dcf/binary__exponent_8cpp_source.html
Normal file
@@ -0,0 +1,186 @@
|
||||
<!-- HTML header for doxygen 1.12.0-->
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
||||
<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.12.0"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>TheAlgorithms/C++: math/binary_exponent.cpp Source File</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
||||
<script type="text/javascript">
|
||||
DoxygenAwesomeDarkModeToggle.init()
|
||||
</script>
|
||||
<script type="text/javascript" src="../../clipboard.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
<script type="text/javascript" src="../../navtree.js"></script>
|
||||
<script type="text/javascript" src="../../resize.js"></script>
|
||||
<script type="text/javascript" src="../../cookie.js"></script>
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/javascript">
|
||||
window.MathJax = {
|
||||
options: {
|
||||
ignoreHtmlClass: 'tex2jax_ignore',
|
||||
processHtmlClass: 'tex2jax_process'
|
||||
},
|
||||
loader: {
|
||||
load: ['[tex]/ams']
|
||||
},
|
||||
tex: {
|
||||
macros: {},
|
||||
packages: ['base','configmacros','ams']
|
||||
}
|
||||
};
|
||||
</script>
|
||||
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
<div id="titlearea">
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr id="projectrow">
|
||||
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
||||
<td id="projectalign">
|
||||
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">All the algorithms implemented in C++</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.12.0 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
/* @license-end */
|
||||
</script>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(function() { codefold.init(1); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<script type="text/javascript" src="../../menudata.js"></script>
|
||||
<script type="text/javascript" src="../../menu.js"></script>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(function() {
|
||||
initMenu('../../',true,false,'search.php','Search',true);
|
||||
$(function() { init_search(); });
|
||||
});
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="main-nav"></div>
|
||||
</div><!-- top -->
|
||||
<div id="side-nav" class="ui-resizable side-nav-resizable">
|
||||
<div id="nav-tree">
|
||||
<div id="nav-tree-contents">
|
||||
<div id="nav-sync" class="sync"></div>
|
||||
</div>
|
||||
</div>
|
||||
<div id="splitbar" style="-moz-user-select:none;"
|
||||
class="ui-resizable-handle">
|
||||
</div>
|
||||
</div>
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
$(function(){initNavTree('de/dcf/binary__exponent_8cpp_source.html','../../'); initResizable(true); });
|
||||
/* @license-end */
|
||||
</script>
|
||||
<div id="doc-content">
|
||||
<!-- window showing the filter options -->
|
||||
<div id="MSearchSelectWindow"
|
||||
onmouseover="return searchBox.OnSearchSelectShow()"
|
||||
onmouseout="return searchBox.OnSearchSelectHide()"
|
||||
onkeydown="return searchBox.OnSearchSelectKey(event)">
|
||||
</div>
|
||||
|
||||
<!-- iframe showing the search results (closed by default) -->
|
||||
<div id="MSearchResultsWindow">
|
||||
<div id="MSearchResults">
|
||||
<div class="SRPage">
|
||||
<div id="SRIndex">
|
||||
<div id="SRResults"></div>
|
||||
<div class="SRStatus" id="Loading">Loading...</div>
|
||||
<div class="SRStatus" id="Searching">Searching...</div>
|
||||
<div class="SRStatus" id="NoMatches">No Matches</div>
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
</div>
|
||||
|
||||
<div class="header">
|
||||
<div class="headertitle"><div class="title">binary_exponent.cpp</div></div>
|
||||
</div><!--header-->
|
||||
<div class="contents">
|
||||
<a href="../../de/dcf/binary__exponent_8cpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a id="l00001" name="l00001"></a><span class="lineno"> 1</span> </div>
|
||||
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span><span class="preprocessor">#include <iostream></span></div>
|
||||
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> </div>
|
||||
<div class="foldopen" id="foldopen00028" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"><a class="line" href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73"> 28</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a>(<span class="keywordtype">int</span> a, <span class="keywordtype">int</span> b) {</div>
|
||||
<div class="line"><a id="l00029" name="l00029"></a><span class="lineno"> 29</span> <span class="keywordflow">if</span> (b == 0) {</div>
|
||||
<div class="line"><a id="l00030" name="l00030"></a><span class="lineno"> 30</span> <span class="keywordflow">return</span> 1;</div>
|
||||
<div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> }</div>
|
||||
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keywordtype">int</span> res = <a class="code hl_function" href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a>(a, b / 2);</div>
|
||||
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <span class="keywordflow">if</span> (b % 2) {</div>
|
||||
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="keywordflow">return</span> res * res * a;</div>
|
||||
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00036" name="l00036"></a><span class="lineno"> 36</span> <span class="keywordflow">return</span> res * res;</div>
|
||||
<div class="line"><a id="l00037" name="l00037"></a><span class="lineno"> 37</span> }</div>
|
||||
<div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00039" name="l00039"></a><span class="lineno"> 39</span> </div>
|
||||
<div class="foldopen" id="foldopen00042" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"><a class="line" href="../../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f"> 42</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f">binExpo_alt</a>(<span class="keywordtype">int</span> a, <span class="keywordtype">int</span> b) {</div>
|
||||
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <span class="keywordtype">int</span> res = 1;</div>
|
||||
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> <span class="keywordflow">while</span> (b > 0) {</div>
|
||||
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> <span class="keywordflow">if</span> (b % 2) {</div>
|
||||
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> res = res * a;</div>
|
||||
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span> }</div>
|
||||
<div class="line"><a id="l00048" name="l00048"></a><span class="lineno"> 48</span> a = a * a;</div>
|
||||
<div class="line"><a id="l00049" name="l00049"></a><span class="lineno"> 49</span> b /= 2;</div>
|
||||
<div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> }</div>
|
||||
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <span class="keywordflow">return</span> res;</div>
|
||||
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span>}</div>
|
||||
</div>
|
||||
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> </div>
|
||||
<div class="foldopen" id="foldopen00055" data-start="{" data-end="}">
|
||||
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"><a class="line" href="../../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4"> 55</a></span><span class="keywordtype">int</span> <a class="code hl_function" href="../../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a>() {</div>
|
||||
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span> <span class="keywordtype">int</span> a, b;</div>
|
||||
<div class="line"><a id="l00058" name="l00058"></a><span class="lineno"> 58</span> std::cin >> a >> b;</div>
|
||||
<div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> <span class="keywordflow">if</span> (a == 0 && b == 0) {</div>
|
||||
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> std::cout << <span class="stringliteral">"Math error"</span> << std::endl;</div>
|
||||
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b < 0) {</div>
|
||||
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> std::cout << <span class="stringliteral">"Exponent must be positive !!"</span> << std::endl;</div>
|
||||
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><a id="l00064" name="l00064"></a><span class="lineno"> 64</span> <span class="keywordtype">int</span> resRecurse = <a class="code hl_function" href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a>(a, b);</div>
|
||||
<div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> </div>
|
||||
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> std::cout << resRecurse << std::endl;</div>
|
||||
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</span> }</div>
|
||||
<div class="line"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span>}</div>
|
||||
</div>
|
||||
<div class="ttc" id="abinary__exponent_8cpp_html_a31dbf5f7ceb9c9eec831ef9f7782291f"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f">binExpo_alt</a></div><div class="ttdeci">int binExpo_alt(int a, int b)</div><div class="ttdef"><b>Definition</b> <a href="#l00042">binary_exponent.cpp:42</a></div></div>
|
||||
<div class="ttc" id="abinary__exponent_8cpp_html_ae66f6b31b5ad750f1fe042a706a4e3d4"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a></div><div class="ttdeci">int main()</div><div class="ttdoc">Main function.</div><div class="ttdef"><b>Definition</b> <a href="#l00055">binary_exponent.cpp:55</a></div></div>
|
||||
<div class="ttc" id="abinary__exponent_8cpp_html_aeb48dce0725e63d19147944f41843c73"><div class="ttname"><a href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a></div><div class="ttdeci">int binExpo(int a, int b)</div><div class="ttdef"><b>Definition</b> <a href="#l00028">binary_exponent.cpp:28</a></div></div>
|
||||
</div><!-- fragment --></div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
<!-- start footer part -->
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../dir_296d53ceaeaa7e099814a6def439fe8a.html">math</a></li><li class="navelem"><a class="el" href="../../de/dcf/binary__exponent_8cpp.html">binary_exponent.cpp</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.12.0 </li>
|
||||
</ul>
|
||||
</div>
|
||||
</body>
|
||||
</html>
|
||||
@@ -1,3 +1,4 @@
|
||||
<!-- HTML header for doxygen 1.12.0-->
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
||||
<head>
|
||||
@@ -5,10 +6,15 @@
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||||
<meta name="generator" content="Doxygen 1.12.0"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: operations_on_datastructures::reverse_binary_tree::BinaryTree Class Reference</title>
|
||||
<title>TheAlgorithms/C++: operations_on_datastructures::reverse_binary_tree::BinaryTree Class Reference</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
||||
<script type="text/javascript">
|
||||
DoxygenAwesomeDarkModeToggle.init()
|
||||
</script>
|
||||
<script type="text/javascript" src="../../clipboard.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
@@ -18,14 +24,24 @@
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
<script type="text/javascript">
|
||||
window.MathJax = {
|
||||
options: {
|
||||
ignoreHtmlClass: 'tex2jax_ignore',
|
||||
processHtmlClass: 'tex2jax_process'
|
||||
},
|
||||
loader: {
|
||||
load: ['[tex]/ams']
|
||||
},
|
||||
tex: {
|
||||
macros: {},
|
||||
packages: ['base','configmacros','ams']
|
||||
}
|
||||
};
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr id="projectrow">
|
||||
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
||||
<td id="projectalign">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
<div id="projectbrief">All the algorithms implemented in C++</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
@@ -134,7 +151,7 @@ Public Member Functions</h2></td></tr>
|
||||
<tr class="separator:a534645d1aabdf1a7e5897c85376f173d"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a1c0d27198372b36ef71bc58af8336b9c" id="r_a1c0d27198372b36ef71bc58af8336b9c"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a1c0d27198372b36ef71bc58af8336b9c">reverse</a> ()</td></tr>
|
||||
<tr class="separator:a1c0d27198372b36ef71bc58af8336b9c"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a2e683b271d8d5cd63e0d09cf8aaa325c" id="r_a2e683b271d8d5cd63e0d09cf8aaa325c"><td class="memItemLeft" align="right" valign="top"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int64_t > </td><td class="memItemRight" valign="bottom"><a class="el" href="#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a> ()</td></tr>
|
||||
<tr class="memitem:a2e683b271d8d5cd63e0d09cf8aaa325c" id="r_a2e683b271d8d5cd63e0d09cf8aaa325c"><td class="memItemLeft" align="right" valign="top">std::vector< int64_t > </td><td class="memItemRight" valign="bottom"><a class="el" href="#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a> ()</td></tr>
|
||||
<tr class="memdesc:a2e683b271d8d5cd63e0d09cf8aaa325c"><td class="mdescLeft"> </td><td class="mdescRight">Level order traversal of a tree consists of visiting its elements, top to bottom, left to right. This function performs level order traversal and returns the node datas as a vector. <br /></td></tr>
|
||||
<tr class="separator:a2e683b271d8d5cd63e0d09cf8aaa325c"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:a5cf972a2c994a4fa1a89fc77bd5ad503" id="r_a5cf972a2c994a4fa1a89fc77bd5ad503"><td class="memItemLeft" align="right" valign="top">void </td><td class="memItemRight" valign="bottom"><a class="el" href="#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a> ()</td></tr>
|
||||
@@ -158,13 +175,14 @@ Private Member Functions</h2></td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
|
||||
Private Attributes</h2></td></tr>
|
||||
<tr class="memitem:ab6a17a04aa93aaaef71e038e8cc2edeb" id="r_ab6a17a04aa93aaaef71e038e8cc2edeb"><td class="memItemLeft" align="right" valign="top"><a id="ab6a17a04aa93aaaef71e038e8cc2edeb" name="ab6a17a04aa93aaaef71e038e8cc2edeb"></a>
|
||||
<a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> * </td><td class="memItemRight" valign="bottom"><b>root</b></td></tr>
|
||||
<tr class="memdesc:ab6a17a04aa93aaaef71e038e8cc2edeb"><td class="mdescLeft"> </td><td class="mdescRight">Pointer to root node of Binary Tree. <br /></td></tr>
|
||||
<tr class="memitem:ab6a17a04aa93aaaef71e038e8cc2edeb" id="r_ab6a17a04aa93aaaef71e038e8cc2edeb"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a></td></tr>
|
||||
<tr class="memdesc:ab6a17a04aa93aaaef71e038e8cc2edeb"><td class="mdescLeft"> </td><td class="mdescRight">Pointer to root node of Binary Tree. <br /></td></tr>
|
||||
<tr class="separator:ab6a17a04aa93aaaef71e038e8cc2edeb"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>A Binary Tree class that implements a Binary Search Tree (BST) by default. </p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00052">52</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
|
||||
</div><h2 class="groupheader">Constructor & Destructor Documentation</h2>
|
||||
<a id="abcb1cc8da7b6759dc92cbe0254697c56" name="abcb1cc8da7b6759dc92cbe0254697c56"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#abcb1cc8da7b6759dc92cbe0254697c56">◆ </a></span>BinaryTree() <span class="overload">[1/2]</span></h2>
|
||||
@@ -190,8 +208,10 @@ Private Attributes</h2></td></tr>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Creates a <a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" title="A Binary Tree class that implements a Binary Search Tree (BST) by default.">BinaryTree</a> with a root pointing to NULL. </p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00101">101</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 101</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <span class="keyword">nullptr</span>; }</div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_ab6a17a04aa93aaaef71e038e8cc2edeb"><div class="ttname"><a href="#ab6a17a04aa93aaaef71e038e8cc2edeb">operations_on_datastructures::reverse_binary_tree::BinaryTree::root</a></div><div class="ttdeci">Node * root</div><div class="ttdoc">Pointer to root node of Binary Tree.</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:54</div></div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_ab6a17a04aa93aaaef71e038e8cc2edeb"><div class="ttname"><a href="#ab6a17a04aa93aaaef71e038e8cc2edeb">operations_on_datastructures::reverse_binary_tree::BinaryTree::root</a></div><div class="ttdeci">Node * root</div><div class="ttdoc">Pointer to root node of Binary Tree.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00054">reverse_binary_tree.cpp:54</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -219,9 +239,11 @@ Private Attributes</h2></td></tr>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Creates a <a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" title="A Binary Tree class that implements a Binary Search Tree (BST) by default.">BinaryTree</a> with a root with an initial value. </p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00105">105</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 105</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>); }</div>
|
||||
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
|
||||
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
|
||||
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> <a href="../../d1/df3/hash__search_8cpp_source.html#l00024">hash_search.cpp:24</a></div></div>
|
||||
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/dce/linkedlist__implentation__usingarray_8cpp_source.html#l00014">linkedlist_implentation_usingarray.cpp:14</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -247,24 +269,21 @@ Private Attributes</h2></td></tr>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00107">107</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 107</span> {</div>
|
||||
<div class="line"><span class="lineno"> 108</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Node*></a> nodes;</div>
|
||||
<div class="line"><span class="lineno"> 109</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>);</div>
|
||||
<div class="line"><span class="lineno"> 110</span> <span class="keywordflow">while</span> (!nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/empty.html">empty</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 111</span> <span class="keyword">const</span> <span class="keyword">auto</span> cur_node = nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/back.html">back</a>();</div>
|
||||
<div class="line"><span class="lineno"> 112</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/pop_back.html">pop_back</a>();</div>
|
||||
<div class="line"><span class="lineno"> 108</span> std::vector<Node*> nodes;</div>
|
||||
<div class="line"><span class="lineno"> 109</span> nodes.emplace_back(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>);</div>
|
||||
<div class="line"><span class="lineno"> 110</span> <span class="keywordflow">while</span> (!nodes.empty()) {</div>
|
||||
<div class="line"><span class="lineno"> 111</span> <span class="keyword">const</span> <span class="keyword">auto</span> cur_node = nodes.back();</div>
|
||||
<div class="line"><span class="lineno"> 112</span> nodes.pop_back();</div>
|
||||
<div class="line"><span class="lineno"> 113</span> <span class="keywordflow">if</span> (cur_node) {</div>
|
||||
<div class="line"><span class="lineno"> 114</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(cur_node->left);</div>
|
||||
<div class="line"><span class="lineno"> 115</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(cur_node->right);</div>
|
||||
<div class="line"><span class="lineno"> 114</span> nodes.emplace_back(cur_node->left);</div>
|
||||
<div class="line"><span class="lineno"> 115</span> nodes.emplace_back(cur_node->right);</div>
|
||||
<div class="line"><span class="lineno"> 116</span> <span class="keyword">delete</span> cur_node;</div>
|
||||
<div class="line"><span class="lineno"> 117</span> }</div>
|
||||
<div class="line"><span class="lineno"> 118</span> }</div>
|
||||
<div class="line"><span class="lineno"> 119</span> }</div>
|
||||
<div class="ttc" id="aback_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/back.html">std::vector::back</a></div><div class="ttdeci">T back(T... args)</div></div>
|
||||
<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
|
||||
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/empty.html">std::vector::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
|
||||
<div class="ttc" id="apop_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/pop_back.html">std::vector::pop_back</a></div><div class="ttdeci">T pop_back(T... args)</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
@@ -293,14 +312,11 @@ Private Attributes</h2></td></tr>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Adds 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> to the Binary Tree. </p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 124</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_adb2b6be741b0500ee75d89b6d06b5d50"><div class="ttname"><a href="#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree::insert</a></div><div class="ttdeci">Node * insert(int64_t data, Node *pivot)</div><div class="ttdoc">inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:65</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a534645d1aabdf1a7e5897c85376f173d_cgraph.svg" width="516" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00124">124</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 124</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_adb2b6be741b0500ee75d89b6d06b5d50"><div class="ttname"><a href="#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree::insert</a></div><div class="ttdeci">Node * insert(int64_t data, Node *pivot)</div><div class="ttdoc">inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00065">reverse_binary_tree.cpp:65</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a2e683b271d8d5cd63e0d09cf8aaa325c" name="a2e683b271d8d5cd63e0d09cf8aaa325c"></a>
|
||||
@@ -313,7 +329,7 @@ Here is the call graph for this function:</div>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int64_t > operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order </td>
|
||||
<td class="memname">std::vector< int64_t > operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
||||
<td></td>
|
||||
@@ -338,36 +354,29 @@ Here is the call graph for this function:</div>
|
||||
<p>< Insert left node</p>
|
||||
<p>< Insert right node</p>
|
||||
<p>Add nodes while Tree is not empty</p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00139">139</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 139</span> {</div>
|
||||
<div class="line"><span class="lineno"> 140</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int64_t></a> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>; <span class="comment">///< Result vector of int</span></div>
|
||||
<div class="line"><span class="lineno"> 140</span> std::vector<int64_t> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>; </div>
|
||||
<div class="line"><span class="lineno"> 141</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> == <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 142</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>; <span class="comment">///< Return empty vector if root is Invalid</span></div>
|
||||
<div class="line"><span class="lineno"> 142</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>; </div>
|
||||
<div class="line"><span class="lineno"> 143</span> }</div>
|
||||
<div class="line"><span class="lineno"> 144</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue<Node*></a> nodes; <span class="comment">///< Queue of the nodes in the tree</span></div>
|
||||
<div class="line"><span class="lineno"> 145</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); <span class="comment">///< Insert root into the queue</span></div>
|
||||
<div class="line"><span class="lineno"> 146</span> <span class="keywordflow">while</span> (!nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 147</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>(); <span class="comment">///< Copy the first element</span></div>
|
||||
<div class="line"><span class="lineno"> 148</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.push_back(temp->data); <span class="comment">///< Add the element to the data</span></div>
|
||||
<div class="line"><span class="lineno"> 149</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>(); <span class="comment">///< Remove element</span></div>
|
||||
<div class="line"><span class="lineno"> 144</span> std::queue<Node*> nodes; </div>
|
||||
<div class="line"><span class="lineno"> 145</span> nodes.push(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); </div>
|
||||
<div class="line"><span class="lineno"> 146</span> <span class="keywordflow">while</span> (!nodes.empty()) {</div>
|
||||
<div class="line"><span class="lineno"> 147</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = nodes.front(); </div>
|
||||
<div class="line"><span class="lineno"> 148</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.push_back(temp->data); </div>
|
||||
<div class="line"><span class="lineno"> 149</span> nodes.pop(); </div>
|
||||
<div class="line"><span class="lineno"> 150</span> <span class="keywordflow">if</span> (temp->left != <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 151</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(temp->left); <span class="comment">///< Insert left node</span></div>
|
||||
<div class="line"><span class="lineno"> 151</span> nodes.push(temp->left); </div>
|
||||
<div class="line"><span class="lineno"> 152</span> }</div>
|
||||
<div class="line"><span class="lineno"> 153</span> <span class="keywordflow">if</span> (temp->right != <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 154</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(temp->right); <span class="comment">///< Insert right node</span></div>
|
||||
<div class="line"><span class="lineno"> 154</span> nodes.push(temp->right); </div>
|
||||
<div class="line"><span class="lineno"> 155</span> }</div>
|
||||
<div class="line"><span class="lineno"> 156</span> } <span class="comment">/// Add nodes while Tree is not empty</span></div>
|
||||
<div class="line"><span class="lineno"> 156</span> } </div>
|
||||
<div class="line"><span class="lineno"> 157</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
|
||||
<div class="line"><span class="lineno"> 158</span> }</div>
|
||||
<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/front.html">std::queue::front</a></div><div class="ttdeci">T front(T... args)</div></div>
|
||||
<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
|
||||
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/push.html">std::queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
|
||||
<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a2e683b271d8d5cd63e0d09cf8aaa325c_cgraph.svg" width="400" height="184"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="adb2b6be741b0500ee75d89b6d06b5d50" name="adb2b6be741b0500ee75d89b6d06b5d50"></a>
|
||||
@@ -409,25 +418,22 @@ Here is the call graph for this function:</div>
|
||||
<p>< Create new node</p>
|
||||
<p>< Insert <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> to the left</p>
|
||||
<p>< Insert node to the right</p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00065">65</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 65</span> {</div>
|
||||
<div class="line"><span class="lineno"> 66</span> <span class="keywordflow">if</span> (pivot == <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>); <span class="comment">///< Create new node</span></div>
|
||||
<div class="line"><span class="lineno"> 67</span> <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>); </div>
|
||||
<div class="line"><span class="lineno"> 68</span> }</div>
|
||||
<div class="line"><span class="lineno"> 69</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data <= pivot-></a><a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
|
||||
<div class="line"><span class="lineno"> 70</span> pivot->left =</div>
|
||||
<div class="line"><span class="lineno"> 71</span> <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, pivot->left); <span class="comment">///< Insert Node to the left</span></div>
|
||||
<div class="line"><span class="lineno"> 71</span> <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, pivot->left); </div>
|
||||
<div class="line"><span class="lineno"> 72</span> } <span class="keywordflow">else</span> {</div>
|
||||
<div class="line"><span class="lineno"> 73</span> pivot->right =</div>
|
||||
<div class="line"><span class="lineno"> 74</span> <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, pivot->right); <span class="comment">///< Insert node to the right</span></div>
|
||||
<div class="line"><span class="lineno"> 74</span> <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, pivot->right); </div>
|
||||
<div class="line"><span class="lineno"> 75</span> }</div>
|
||||
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">return</span> pivot;</div>
|
||||
<div class="line"><span class="lineno"> 77</span> }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_adb2b6be741b0500ee75d89b6d06b5d50_cgraph.svg" width="226" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a5cf972a2c994a4fa1a89fc77bd5ad503" name="a5cf972a2c994a4fa1a89fc77bd5ad503"></a>
|
||||
@@ -457,20 +463,16 @@ Here is the call graph for this function:</div>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<p>Print each element in the tree</p>
|
||||
<p>Print newline</p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00164">164</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 164</span> {</div>
|
||||
<div class="line"><span class="lineno"> 165</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : <a class="code hl_function" href="#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 166</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << i << <span class="stringliteral">" "</span>; <span class="comment">/// Print each element in the tree</span></div>
|
||||
<div class="line"><span class="lineno"> 166</span> std::cout << i << <span class="stringliteral">" "</span>; </div>
|
||||
<div class="line"><span class="lineno"> 167</span> }</div>
|
||||
<div class="line"><span class="lineno"> 168</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n"</span>; <span class="comment">/// Print newline</span></div>
|
||||
<div class="line"><span class="lineno"> 168</span> std::cout << <span class="stringliteral">"\n"</span>; </div>
|
||||
<div class="line"><span class="lineno"> 169</span> }</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a2e683b271d8d5cd63e0d09cf8aaa325c"><div class="ttname"><a href="#a2e683b271d8d5cd63e0d09cf8aaa325c">operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order</a></div><div class="ttdeci">std::vector< int64_t > get_level_order()</div><div class="ttdoc">Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:139</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph.svg" width="100%" height="438"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div></div>
|
||||
</div>
|
||||
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a2e683b271d8d5cd63e0d09cf8aaa325c"><div class="ttname"><a href="#a2e683b271d8d5cd63e0d09cf8aaa325c">operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order</a></div><div class="ttdeci">std::vector< int64_t > get_level_order()</div><div class="ttdoc">Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00139">reverse_binary_tree.cpp:139</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a1c0d27198372b36ef71bc58af8336b9c" name="a1c0d27198372b36ef71bc58af8336b9c"></a>
|
||||
@@ -496,14 +498,11 @@ Here is the call graph for this function:</div>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Reverses the Binary Tree </p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 128</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_af6f974381f523fdb981fc2d843bbf4a1"><div class="ttname"><a href="#af6f974381f523fdb981fc2d843bbf4a1">operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree</a></div><div class="ttdeci">Node * reverseBinaryTree(Node *pivot)</div><div class="ttdoc">Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:84</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a1c0d27198372b36ef71bc58af8336b9c_cgraph.svg" width="488" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00128">128</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 128</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_af6f974381f523fdb981fc2d843bbf4a1"><div class="ttname"><a href="#af6f974381f523fdb981fc2d843bbf4a1">operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree</a></div><div class="ttdeci">Node * reverseBinaryTree(Node *pivot)</div><div class="ttdoc">Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.</div><div class="ttdef"><b>Definition</b> <a href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00084">reverse_binary_tree.cpp:84</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="af6f974381f523fdb981fc2d843bbf4a1" name="af6f974381f523fdb981fc2d843bbf4a1"></a>
|
||||
@@ -541,25 +540,49 @@ Here is the call graph for this function:</div>
|
||||
<p>< pointer to the left subtree</p>
|
||||
<p>< Swap</p>
|
||||
<p>< Swap</p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00084">84</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 84</span> {</div>
|
||||
<div class="line"><span class="lineno"> 85</span> <span class="keywordflow">if</span> (pivot == <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">return</span> pivot; <span class="comment">///< Base case</span></div>
|
||||
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">return</span> pivot; </div>
|
||||
<div class="line"><span class="lineno"> 87</span> }</div>
|
||||
<div class="line"><span class="lineno"> 88</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = pivot->left; <span class="comment">///< pointer to the left subtree</span></div>
|
||||
<div class="line"><span class="lineno"> 89</span> pivot->left = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(pivot->right); <span class="comment">///< Swap</span></div>
|
||||
<div class="line"><span class="lineno"> 90</span> pivot->right = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(temp); <span class="comment">///< Swap</span></div>
|
||||
<div class="line"><span class="lineno"> 88</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = pivot->left; </div>
|
||||
<div class="line"><span class="lineno"> 89</span> pivot->left = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(pivot->right); </div>
|
||||
<div class="line"><span class="lineno"> 90</span> pivot->right = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(temp); </div>
|
||||
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">return</span> pivot;</div>
|
||||
<div class="line"><span class="lineno"> 92</span> }</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_af6f974381f523fdb981fc2d843bbf4a1_cgraph.svg" width="226" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<h2 class="groupheader">Member Data Documentation</h2>
|
||||
<a id="ab6a17a04aa93aaaef71e038e8cc2edeb" name="ab6a17a04aa93aaaef71e038e8cc2edeb"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ab6a17a04aa93aaaef71e038e8cc2edeb">◆ </a></span>root</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a>* operations_on_datastructures::reverse_binary_tree::BinaryTree::root</td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Pointer to root node of Binary Tree. </p>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html#l00054">54</a> of file <a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a>.</p>
|
||||
|
||||
</div>
|
||||
</div>
|
||||
<hr/>The documentation for this class was generated from the following file:<ul>
|
||||
<li>operations_on_datastructures/<a class="el" href="../../d4/db6/reverse__binary__tree_8cpp.html">reverse_binary_tree.cpp</a></li>
|
||||
<li>operations_on_datastructures/<a class="el" href="../../d4/db6/reverse__binary__tree_8cpp_source.html">reverse_binary_tree.cpp</a></li>
|
||||
</ul>
|
||||
</div><!-- contents -->
|
||||
</div><!-- doc-content -->
|
||||
|
||||
@@ -1,6 +0,0 @@
|
||||
<map id="operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse" name="operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse">
|
||||
<area shape="rect" id="Node000001" title=" " alt="" coords="5,29,220,85"/>
|
||||
<area shape="rect" id="Node000002" href="$de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1" title="Reverses a Binary Tree recursively by swapping the left and right subtrees and their children." alt="" coords="268,29,482,85"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="220,54,252,54,252,60,220,60"/>
|
||||
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="324,29,324,19,334,10,351,5,375,3,402,5,419,12,417,17,401,10,375,8,352,10,336,15,329,21,329,29"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
9495f5f557a90a421834611c8b85b6b1
|
||||
@@ -1,78 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse Pages: 1 -->
|
||||
<svg width="366pt" height="68pt"
|
||||
viewBox="0.00 0.00 365.50 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
||||
|
||||
<style type="text/css"><![CDATA[
|
||||
.node, .edge {opacity: 0.7;}
|
||||
.node.selected, .edge.selected {opacity: 1;}
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
|
||||
<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title=" ">
|
||||
<polygon fill="#999999" stroke="#666666" points="160.75,-41.75 0,-41.75 0,0 160.75,0 160.75,-41.75"/>
|
||||
<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="80.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1" target="_top" xlink:title="Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.">
|
||||
<polygon fill="white" stroke="#666666" points="357.5,-41.75 196.75,-41.75 196.75,0 357.5,0 357.5,-41.75"/>
|
||||
<text text-anchor="start" x="204.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="204.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="277.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverseBinaryTree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M161.15,-20.88C169.07,-20.88 177.16,-20.88 185.19,-20.88"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="184.96,-24.38 194.96,-20.88 184.96,-17.38 184.96,-24.38"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node2 -->
|
||||
<g id="edge2_Node000002_Node000002" class="edge">
|
||||
<title>Node2->Node2</title>
|
||||
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M240.81,-42.07C237.35,-51.55 249.46,-59.75 277.12,-59.75 293.12,-59.75 303.91,-57.01 309.51,-52.86"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="312.79,-54.08 312.92,-43.49 306.21,-51.69 312.79,-54.08"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
||||
<style type='text/css'>
|
||||
<![CDATA[
|
||||
[data-mouse-over-selected='false'] { opacity: 0.7; }
|
||||
[data-mouse-over-selected='true'] { opacity: 1.0; }
|
||||
]]>
|
||||
</style>
|
||||
<script type="application/ecmascript"><![CDATA[
|
||||
document.addEventListener('DOMContentLoaded', (event) => {
|
||||
highlightEdges();
|
||||
highlightAdjacentNodes();
|
||||
});
|
||||
]]></script>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 3.6 KiB |
@@ -1,52 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse Pages: 1 -->
|
||||
<svg width="366pt" height="68pt"
|
||||
viewBox="0.00 0.00 365.50 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
|
||||
<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title=" ">
|
||||
<polygon fill="#999999" stroke="#666666" points="160.75,-41.75 0,-41.75 0,0 160.75,0 160.75,-41.75"/>
|
||||
<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="80.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1" target="_top" xlink:title="Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.">
|
||||
<polygon fill="white" stroke="#666666" points="357.5,-41.75 196.75,-41.75 196.75,0 357.5,0 357.5,-41.75"/>
|
||||
<text text-anchor="start" x="204.75" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="204.75" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="277.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverseBinaryTree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M161.15,-20.88C169.07,-20.88 177.16,-20.88 185.19,-20.88"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="184.96,-24.38 194.96,-20.88 184.96,-17.38 184.96,-24.38"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node2 -->
|
||||
<g id="edge2_Node000002_Node000002" class="edge">
|
||||
<title>Node2->Node2</title>
|
||||
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M240.81,-42.07C237.35,-51.55 249.46,-59.75 277.12,-59.75 293.12,-59.75 303.91,-57.01 309.51,-52.86"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="312.79,-54.08 312.92,-43.49 306.21,-51.69 312.79,-54.08"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 2.9 KiB |
@@ -1,11 +0,0 @@
|
||||
<map id="operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order" name="operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order">
|
||||
<area shape="rect" id="Node000001" title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right...." alt="" coords="5,65,220,121"/>
|
||||
<area shape="rect" id="Node000002" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/empty.html#" title=" " alt="" coords="268,5,394,31"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="195,62,276,34,277,39,197,67"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/front.html#" title=" " alt="" coords="273,55,389,80"/>
|
||||
<area shape="poly" id="edge2_Node000001_Node000003" title=" " alt="" coords="219,78,257,73,258,79,220,83"/>
|
||||
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/pop.html#" title=" " alt="" coords="275,104,386,130"/>
|
||||
<area shape="poly" id="edge3_Node000001_Node000004" title=" " alt="" coords="220,102,260,106,259,112,219,107"/>
|
||||
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/push.html#" title=" " alt="" coords="272,153,390,179"/>
|
||||
<area shape="poly" id="edge4_Node000001_Node000005" title=" " alt="" coords="198,119,277,145,275,150,196,124"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
0923bb670b528d692e55d871fdd65a65
|
||||
@@ -1,121 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order Pages: 1 -->
|
||||
<svg width="300pt" height="138pt"
|
||||
viewBox="0.00 0.00 299.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
||||
|
||||
<style type="text/css"><![CDATA[
|
||||
.node, .edge {opacity: 0.7;}
|
||||
.node.selected, .edge.selected {opacity: 1;}
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
|
||||
<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....">
|
||||
<polygon fill="#999999" stroke="#666666" points="160.75,-85.5 0,-85.5 0,-43.75 160.75,-43.75 160.75,-85.5"/>
|
||||
<text text-anchor="start" x="8" y="-72" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="8" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="80.38" y="-49.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_level_order</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="291.5,-130.25 196.75,-130.25 196.75,-111 291.5,-111 291.5,-130.25"/>
|
||||
<text text-anchor="middle" x="244.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M142.99,-85.96C163.24,-92.97 185.21,-100.58 203.4,-106.87"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="202.16,-110.15 212.76,-110.11 204.45,-103.53 202.16,-110.15"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="287.75,-93.25 200.5,-93.25 200.5,-74 287.75,-74 287.75,-93.25"/>
|
||||
<text text-anchor="middle" x="244.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M160.83,-73.96C170.38,-75.08 179.95,-76.2 189.02,-77.27"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="188.36,-80.72 198.7,-78.41 189.18,-73.76 188.36,-80.72"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="285.88,-56.25 202.38,-56.25 202.38,-37 285.88,-37 285.88,-56.25"/>
|
||||
<text text-anchor="middle" x="244.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M160.83,-55.78C170.94,-54.66 181.08,-53.53 190.62,-52.47"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="190.85,-55.96 200.4,-51.38 190.08,-49.01 190.85,-55.96"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="288.5,-19.25 199.75,-19.25 199.75,0 288.5,0 288.5,-19.25"/>
|
||||
<text text-anchor="middle" x="244.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4_Node000001_Node000005" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M143.91,-43.36C163.7,-36.63 185.02,-29.38 202.82,-23.33"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="203.9,-26.66 212.24,-20.13 201.64,-20.03 203.9,-26.66"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
||||
<style type='text/css'>
|
||||
<![CDATA[
|
||||
[data-mouse-over-selected='false'] { opacity: 0.7; }
|
||||
[data-mouse-over-selected='true'] { opacity: 1.0; }
|
||||
]]>
|
||||
</style>
|
||||
<script type="application/ecmascript"><![CDATA[
|
||||
document.addEventListener('DOMContentLoaded', (event) => {
|
||||
highlightEdges();
|
||||
highlightAdjacentNodes();
|
||||
});
|
||||
]]></script>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 5.4 KiB |
@@ -1,95 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order Pages: 1 -->
|
||||
<svg width="300pt" height="138pt"
|
||||
viewBox="0.00 0.00 299.50 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
|
||||
<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....">
|
||||
<polygon fill="#999999" stroke="#666666" points="160.75,-85.5 0,-85.5 0,-43.75 160.75,-43.75 160.75,-85.5"/>
|
||||
<text text-anchor="start" x="8" y="-72" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="8" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="80.38" y="-49.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_level_order</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="291.5,-130.25 196.75,-130.25 196.75,-111 291.5,-111 291.5,-130.25"/>
|
||||
<text text-anchor="middle" x="244.12" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M142.99,-85.96C163.24,-92.97 185.21,-100.58 203.4,-106.87"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="202.16,-110.15 212.76,-110.11 204.45,-103.53 202.16,-110.15"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="287.75,-93.25 200.5,-93.25 200.5,-74 287.75,-74 287.75,-93.25"/>
|
||||
<text text-anchor="middle" x="244.12" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node3 -->
|
||||
<g id="edge2_Node000001_Node000003" class="edge">
|
||||
<title>Node1->Node3</title>
|
||||
<g id="a_edge2_Node000001_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M160.83,-73.96C170.38,-75.08 179.95,-76.2 189.02,-77.27"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="188.36,-80.72 198.7,-78.41 189.18,-73.76 188.36,-80.72"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="285.88,-56.25 202.38,-56.25 202.38,-37 285.88,-37 285.88,-56.25"/>
|
||||
<text text-anchor="middle" x="244.12" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node4 -->
|
||||
<g id="edge3_Node000001_Node000004" class="edge">
|
||||
<title>Node1->Node4</title>
|
||||
<g id="a_edge3_Node000001_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M160.83,-55.78C170.94,-54.66 181.08,-53.53 190.62,-52.47"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="190.85,-55.96 200.4,-51.38 190.08,-49.01 190.85,-55.96"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="288.5,-19.25 199.75,-19.25 199.75,0 288.5,0 288.5,-19.25"/>
|
||||
<text text-anchor="middle" x="244.12" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node5 -->
|
||||
<g id="edge4_Node000001_Node000005" class="edge">
|
||||
<title>Node1->Node5</title>
|
||||
<g id="a_edge4_Node000001_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M143.91,-43.36C163.7,-36.63 185.02,-29.38 202.82,-23.33"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="203.9,-26.66 212.24,-20.13 201.64,-20.03 203.9,-26.66"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 4.7 KiB |
@@ -1,6 +0,0 @@
|
||||
<map id="operations_on_datastructures::reverse_binary_tree::BinaryTree::add" name="operations_on_datastructures::reverse_binary_tree::BinaryTree::add">
|
||||
<area shape="rect" id="Node000001" title="Adds a new Node to the Binary Tree." alt="" coords="5,37,249,78"/>
|
||||
<area shape="rect" id="Node000002" href="$de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50" title="inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree." alt="" coords="297,29,511,85"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="249,54,281,54,281,60,249,60"/>
|
||||
<area shape="poly" id="edge2_Node000002_Node000002" title=" " alt="" coords="350,29,351,19,361,10,378,5,404,3,433,5,451,12,449,17,432,11,404,8,379,10,363,15,356,21,355,29"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
8719d3db9afc82bc54b1250c50b4d287
|
||||
@@ -1,77 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::add Pages: 1 -->
|
||||
<svg width="387pt" height="68pt"
|
||||
viewBox="0.00 0.00 387.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
||||
|
||||
<style type="text/css"><![CDATA[
|
||||
.node, .edge {opacity: 0.7;}
|
||||
.node.selected, .edge.selected {opacity: 1;}
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
|
||||
<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::add</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Adds a new Node to the Binary Tree.">
|
||||
<polygon fill="#999999" stroke="#666666" points="182.5,-36.12 0,-36.12 0,-5.62 182.5,-5.62 182.5,-36.12"/>
|
||||
<text text-anchor="start" x="8" y="-22.62" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="middle" x="91.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree::add</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50" target="_top" xlink:title="inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.">
|
||||
<polygon fill="white" stroke="#666666" points="379.25,-41.75 218.5,-41.75 218.5,0 379.25,0 379.25,-41.75"/>
|
||||
<text text-anchor="start" x="226.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="226.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="298.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M182.74,-20.88C190.63,-20.88 198.62,-20.88 206.52,-20.88"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="206.49,-24.38 216.49,-20.88 206.49,-17.38 206.49,-24.38"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node2 -->
|
||||
<g id="edge2_Node000002_Node000002" class="edge">
|
||||
<title>Node2->Node2</title>
|
||||
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M260.55,-42.07C256.9,-51.55 269.68,-59.75 298.88,-59.75 316.21,-59.75 327.76,-56.86 333.51,-52.53"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="336.67,-54.09 336.69,-43.5 330.07,-51.77 336.67,-54.09"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
||||
<style type='text/css'>
|
||||
<![CDATA[
|
||||
[data-mouse-over-selected='false'] { opacity: 0.7; }
|
||||
[data-mouse-over-selected='true'] { opacity: 1.0; }
|
||||
]]>
|
||||
</style>
|
||||
<script type="application/ecmascript"><![CDATA[
|
||||
document.addEventListener('DOMContentLoaded', (event) => {
|
||||
highlightEdges();
|
||||
highlightAdjacentNodes();
|
||||
});
|
||||
]]></script>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 3.5 KiB |
@@ -1,51 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::add Pages: 1 -->
|
||||
<svg width="387pt" height="68pt"
|
||||
viewBox="0.00 0.00 387.25 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
|
||||
<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::add</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Adds a new Node to the Binary Tree.">
|
||||
<polygon fill="#999999" stroke="#666666" points="182.5,-36.12 0,-36.12 0,-5.62 182.5,-5.62 182.5,-36.12"/>
|
||||
<text text-anchor="start" x="8" y="-22.62" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="middle" x="91.25" y="-11.38" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree::add</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50" target="_top" xlink:title="inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.">
|
||||
<polygon fill="white" stroke="#666666" points="379.25,-41.75 218.5,-41.75 218.5,0 379.25,0 379.25,-41.75"/>
|
||||
<text text-anchor="start" x="226.5" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="226.5" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="298.88" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M182.74,-20.88C190.63,-20.88 198.62,-20.88 206.52,-20.88"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="206.49,-24.38 216.49,-20.88 206.49,-17.38 206.49,-24.38"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node2 -->
|
||||
<g id="edge2_Node000002_Node000002" class="edge">
|
||||
<title>Node2->Node2</title>
|
||||
<g id="a_edge2_Node000002_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M260.55,-42.07C256.9,-51.55 269.68,-59.75 298.88,-59.75 316.21,-59.75 327.76,-56.86 333.51,-52.53"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="336.67,-54.09 336.69,-43.5 330.07,-51.77 336.67,-54.09"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 2.8 KiB |
@@ -1,13 +0,0 @@
|
||||
<map id="operations_on_datastructures::reverse_binary_tree::BinaryTree::print" name="operations_on_datastructures::reverse_binary_tree::BinaryTree::print">
|
||||
<area shape="rect" id="Node000001" title="Prints all of the elements in the tree to stdout level-by-level, using the get_level_order() function..." alt="" coords="5,72,253,113"/>
|
||||
<area shape="rect" id="Node000002" href="$de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c" title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right...." alt="" coords="301,65,515,121"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000002" title=" " alt="" coords="253,90,285,90,285,96,253,96"/>
|
||||
<area shape="rect" id="Node000003" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/empty.html#" title=" " alt="" coords="563,5,689,31"/>
|
||||
<area shape="poly" id="edge2_Node000002_Node000003" title=" " alt="" coords="490,62,571,34,573,39,492,67"/>
|
||||
<area shape="rect" id="Node000004" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/front.html#" title=" " alt="" coords="568,55,684,80"/>
|
||||
<area shape="poly" id="edge3_Node000002_Node000004" title=" " alt="" coords="515,78,552,73,553,79,515,83"/>
|
||||
<area shape="rect" id="Node000005" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/pop.html#" title=" " alt="" coords="570,104,682,130"/>
|
||||
<area shape="poly" id="edge4_Node000002_Node000005" title=" " alt="" coords="515,102,555,106,555,112,515,107"/>
|
||||
<area shape="rect" id="Node000006" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/queue/push.html#" title=" " alt="" coords="567,153,685,179"/>
|
||||
<area shape="poly" id="edge5_Node000002_Node000006" title=" " alt="" coords="493,119,572,145,570,150,492,124"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
f6756fb15d3ee26570b025531ed58028
|
||||
@@ -1,197 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::print Pages: 1 -->
|
||||
<!--zoomable 138 -->
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
|
||||
|
||||
<style type="text/css"><![CDATA[
|
||||
.node, .edge {opacity: 0.7;}
|
||||
.node.selected, .edge.selected {opacity: 1;}
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
|
||||
<defs>
|
||||
<circle id="rim" cx="0" cy="0" r="7"/>
|
||||
<circle id="rim2" cx="0" cy="0" r="3.5"/>
|
||||
<g id="zoomPlus">
|
||||
<use xlink:href="#rim" fill="#404040"><set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/></use>
|
||||
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
|
||||
</g>
|
||||
<g id="zoomMin">
|
||||
<use xlink:href="#rim" fill="#404040"><set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/></use>
|
||||
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
|
||||
</g>
|
||||
<g id="arrowUp" transform="translate(30 24)">
|
||||
<use xlink:href="#rim"/>
|
||||
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowRight" transform="rotate(90) translate(36 -43)">
|
||||
<use xlink:href="#rim"/>
|
||||
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowDown" transform="rotate(180) translate(-30 -48)">
|
||||
<use xlink:href="#rim"/>
|
||||
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="arrowLeft" transform="rotate(270) translate(-36 17)">
|
||||
<use xlink:href="#rim"/>
|
||||
<path pointer-events="none" fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
|
||||
</g>
|
||||
<g id="resetDef">
|
||||
<use xlink:href="#rim2" fill="#404040"><set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/></use>
|
||||
</g>
|
||||
</defs>
|
||||
<script type="application/ecmascript">
|
||||
var viewWidth = 521;
|
||||
var viewHeight = 138;
|
||||
var sectionId = 'dynsection-4';
|
||||
</script>
|
||||
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="viewport">
|
||||
<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::print</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Prints all of the elements in the tree to stdout level-by-level, using the get_level_order() function...">
|
||||
<polygon fill="#999999" stroke="#666666" points="185.5,-79.88 0,-79.88 0,-49.38 185.5,-49.38 185.5,-79.88"/>
|
||||
<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="middle" x="92.75" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree::print</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c" target="_top" xlink:title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....">
|
||||
<polygon fill="white" stroke="#666666" points="382.25,-85.5 221.5,-85.5 221.5,-43.75 382.25,-43.75 382.25,-85.5"/>
|
||||
<text text-anchor="start" x="229.5" y="-72" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="229.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="301.88" y="-49.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_level_order</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M185.8,-64.62C193.72,-64.62 201.72,-64.62 209.63,-64.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="209.6,-68.13 219.6,-64.63 209.6,-61.13 209.6,-68.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="513,-130.25 418.25,-130.25 418.25,-111 513,-111 513,-130.25"/>
|
||||
<text text-anchor="middle" x="465.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M364.49,-85.96C384.74,-92.97 406.71,-100.58 424.9,-106.87"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="423.66,-110.15 434.26,-110.11 425.95,-103.53 423.66,-110.15"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="509.25,-93.25 422,-93.25 422,-74 509.25,-74 509.25,-93.25"/>
|
||||
<text text-anchor="middle" x="465.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge3_Node000002_Node000004" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M382.33,-73.96C391.88,-75.08 401.45,-76.2 410.52,-77.27"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="409.86,-80.72 420.2,-78.41 410.68,-73.76 409.86,-80.72"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="507.38,-56.25 423.88,-56.25 423.88,-37 507.38,-37 507.38,-56.25"/>
|
||||
<text text-anchor="middle" x="465.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node5 -->
|
||||
<g id="edge4_Node000002_Node000005" class="edge">
|
||||
<title>Node2->Node5</title>
|
||||
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M382.33,-55.78C392.44,-54.66 402.58,-53.53 412.12,-52.47"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="412.35,-55.96 421.9,-51.38 411.58,-49.01 412.35,-55.96"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="510,-19.25 421.25,-19.25 421.25,0 510,0 510,-19.25"/>
|
||||
<text text-anchor="middle" x="465.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node6 -->
|
||||
<g id="edge5_Node000002_Node000006" class="edge">
|
||||
<title>Node2->Node6</title>
|
||||
<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M365.41,-43.36C385.2,-36.63 406.52,-29.38 424.32,-23.33"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="425.4,-26.66 433.74,-20.13 423.14,-20.03 425.4,-26.66"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
<g id="navigator" transform="translate(0 0)" fill="#404254">
|
||||
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
|
||||
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
|
||||
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
|
||||
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
|
||||
<use id="arrowup" xlink:href="#arrowUp" x="0" y="0" onmousedown="handlePan(0,-1)"/>
|
||||
<use id="arrowright" xlink:href="#arrowRight" x="0" y="0" onmousedown="handlePan(1,0)"/>
|
||||
<use id="arrowdown" xlink:href="#arrowDown" x="0" y="0" onmousedown="handlePan(0,1)"/>
|
||||
<use id="arrowleft" xlink:href="#arrowLeft" x="0" y="0" onmousedown="handlePan(-1,0)"/>
|
||||
</g>
|
||||
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
|
||||
<g id="arrow_out" transform="scale(0.3 0.3)">
|
||||
<a xlink:href="classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_a5cf972a2c994a4fa1a89fc77bd5ad503_cgraph_org.svg" target="_base">
|
||||
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
|
||||
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
|
||||
<path id="arrow"
|
||||
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
|
||||
style="fill:#404040;"/>
|
||||
</a>
|
||||
</g>
|
||||
</svg>
|
||||
|
||||
<style type='text/css'>
|
||||
<![CDATA[
|
||||
[data-mouse-over-selected='false'] { opacity: 0.7; }
|
||||
[data-mouse-over-selected='true'] { opacity: 1.0; }
|
||||
]]>
|
||||
</style>
|
||||
<script type="application/ecmascript"><![CDATA[
|
||||
document.addEventListener('DOMContentLoaded', (event) => {
|
||||
highlightEdges();
|
||||
highlightAdjacentNodes();
|
||||
});
|
||||
]]></script>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 9.7 KiB |
@@ -1,114 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::print Pages: 1 -->
|
||||
<svg width="521pt" height="138pt"
|
||||
viewBox="0.00 0.00 521.00 138.25" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 134.25)">
|
||||
<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::print</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Prints all of the elements in the tree to stdout level-by-level, using the get_level_order() function...">
|
||||
<polygon fill="#999999" stroke="#666666" points="185.5,-79.88 0,-79.88 0,-49.38 185.5,-49.38 185.5,-79.88"/>
|
||||
<text text-anchor="start" x="8" y="-66.38" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="middle" x="92.75" y="-55.12" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree::print</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2 -->
|
||||
<g id="Node000002" class="node">
|
||||
<title>Node2</title>
|
||||
<g id="a_Node000002"><a xlink:href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c" target="_top" xlink:title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....">
|
||||
<polygon fill="white" stroke="#666666" points="382.25,-85.5 221.5,-85.5 221.5,-43.75 382.25,-43.75 382.25,-85.5"/>
|
||||
<text text-anchor="start" x="229.5" y="-72" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="229.5" y="-60.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="301.88" y="-49.5" font-family="Helvetica,sans-Serif" font-size="10.00">::get_level_order</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node2 -->
|
||||
<g id="edge1_Node000001_Node000002" class="edge">
|
||||
<title>Node1->Node2</title>
|
||||
<g id="a_edge1_Node000001_Node000002"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M185.8,-64.62C193.72,-64.62 201.72,-64.62 209.63,-64.62"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="209.6,-68.13 219.6,-64.63 209.6,-61.13 209.6,-68.13"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node3 -->
|
||||
<g id="Node000003" class="node">
|
||||
<title>Node3</title>
|
||||
<g id="a_Node000003"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/empty.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="513,-130.25 418.25,-130.25 418.25,-111 513,-111 513,-130.25"/>
|
||||
<text text-anchor="middle" x="465.62" y="-116.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::empty</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node3 -->
|
||||
<g id="edge2_Node000002_Node000003" class="edge">
|
||||
<title>Node2->Node3</title>
|
||||
<g id="a_edge2_Node000002_Node000003"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M364.49,-85.96C384.74,-92.97 406.71,-100.58 424.9,-106.87"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="423.66,-110.15 434.26,-110.11 425.95,-103.53 423.66,-110.15"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node4 -->
|
||||
<g id="Node000004" class="node">
|
||||
<title>Node4</title>
|
||||
<g id="a_Node000004"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/front.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="509.25,-93.25 422,-93.25 422,-74 509.25,-74 509.25,-93.25"/>
|
||||
<text text-anchor="middle" x="465.62" y="-79.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::front</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node4 -->
|
||||
<g id="edge3_Node000002_Node000004" class="edge">
|
||||
<title>Node2->Node4</title>
|
||||
<g id="a_edge3_Node000002_Node000004"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M382.33,-73.96C391.88,-75.08 401.45,-76.2 410.52,-77.27"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="409.86,-80.72 420.2,-78.41 410.68,-73.76 409.86,-80.72"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node5 -->
|
||||
<g id="Node000005" class="node">
|
||||
<title>Node5</title>
|
||||
<g id="a_Node000005"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/pop.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="507.38,-56.25 423.88,-56.25 423.88,-37 507.38,-37 507.38,-56.25"/>
|
||||
<text text-anchor="middle" x="465.62" y="-42.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::pop</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node5 -->
|
||||
<g id="edge4_Node000002_Node000005" class="edge">
|
||||
<title>Node2->Node5</title>
|
||||
<g id="a_edge4_Node000002_Node000005"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M382.33,-55.78C392.44,-54.66 402.58,-53.53 412.12,-52.47"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="412.35,-55.96 421.9,-51.38 411.58,-49.01 412.35,-55.96"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node6 -->
|
||||
<g id="Node000006" class="node">
|
||||
<title>Node6</title>
|
||||
<g id="a_Node000006"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/queue/push.html#" xlink:title=" ">
|
||||
<polygon fill="white" stroke="#666666" points="510,-19.25 421.25,-19.25 421.25,0 510,0 510,-19.25"/>
|
||||
<text text-anchor="middle" x="465.62" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">std::queue::push</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node2->Node6 -->
|
||||
<g id="edge5_Node000002_Node000006" class="edge">
|
||||
<title>Node2->Node6</title>
|
||||
<g id="a_edge5_Node000002_Node000006"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M365.41,-43.36C385.2,-36.63 406.52,-29.38 424.32,-23.33"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="425.4,-26.66 433.74,-20.13 423.14,-20.03 425.4,-26.66"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 5.8 KiB |
@@ -1,4 +0,0 @@
|
||||
<map id="operations_on_datastructures::reverse_binary_tree::BinaryTree::insert" name="operations_on_datastructures::reverse_binary_tree::BinaryTree::insert">
|
||||
<area shape="rect" id="Node000001" title="inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree." alt="" coords="5,29,220,85"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="70,29,71,19,78,10,92,5,113,3,135,5,149,12,147,17,134,10,112,8,94,10,82,15,76,21,76,29"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
3e60c7ea6430c0e03aabae539b90ff4d
|
||||
@@ -1,58 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::insert Pages: 1 -->
|
||||
<svg width="169pt" height="68pt"
|
||||
viewBox="0.00 0.00 168.75 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
||||
|
||||
<style type="text/css"><![CDATA[
|
||||
.node, .edge {opacity: 0.7;}
|
||||
.node.selected, .edge.selected {opacity: 1;}
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
|
||||
<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::insert</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.">
|
||||
<polygon fill="#999999" stroke="#666666" points="160.75,-41.75 0,-41.75 0,0 160.75,0 160.75,-41.75"/>
|
||||
<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="80.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M50.71,-42.07C47.88,-51.55 57.77,-59.75 80.38,-59.75 93.44,-59.75 102.26,-57.01 106.83,-52.86"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="110.12,-54.1 109.61,-43.52 103.41,-52.11 110.12,-54.1"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
||||
<style type='text/css'>
|
||||
<![CDATA[
|
||||
[data-mouse-over-selected='false'] { opacity: 0.7; }
|
||||
[data-mouse-over-selected='true'] { opacity: 1.0; }
|
||||
]]>
|
||||
</style>
|
||||
<script type="application/ecmascript"><![CDATA[
|
||||
document.addEventListener('DOMContentLoaded', (event) => {
|
||||
highlightEdges();
|
||||
highlightAdjacentNodes();
|
||||
});
|
||||
]]></script>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 2.5 KiB |
@@ -1,32 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::insert Pages: 1 -->
|
||||
<svg width="169pt" height="68pt"
|
||||
viewBox="0.00 0.00 168.75 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
|
||||
<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::insert</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.">
|
||||
<polygon fill="#999999" stroke="#666666" points="160.75,-41.75 0,-41.75 0,0 160.75,0 160.75,-41.75"/>
|
||||
<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="80.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::insert</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M50.71,-42.07C47.88,-51.55 57.77,-59.75 80.38,-59.75 93.44,-59.75 102.26,-57.01 106.83,-52.86"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="110.12,-54.1 109.61,-43.52 103.41,-52.11 110.12,-54.1"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 1.7 KiB |
@@ -1,4 +0,0 @@
|
||||
<map id="operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree" name="operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree">
|
||||
<area shape="rect" id="Node000001" title="Reverses a Binary Tree recursively by swapping the left and right subtrees and their children." alt="" coords="5,29,220,85"/>
|
||||
<area shape="poly" id="edge1_Node000001_Node000001" title=" " alt="" coords="70,29,71,19,78,10,92,5,113,3,135,5,149,12,147,17,134,10,112,8,94,10,82,15,76,21,76,29"/>
|
||||
</map>
|
||||
@@ -1 +0,0 @@
|
||||
6295acb9259ac8d68cd5e1247cb87801
|
||||
@@ -1,58 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree Pages: 1 -->
|
||||
<svg width="169pt" height="68pt"
|
||||
viewBox="0.00 0.00 168.75 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
|
||||
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve">
|
||||
|
||||
<style type="text/css"><![CDATA[
|
||||
.node, .edge {opacity: 0.7;}
|
||||
.node.selected, .edge.selected {opacity: 1;}
|
||||
.edge:hover path { stroke: red; }
|
||||
.edge:hover polygon { stroke: red; fill: red; }
|
||||
]]></style>
|
||||
<script type="application/ecmascript" xlink:href="../../svg.min.js"/>
|
||||
<svg id="graph" class="graph">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
|
||||
<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.">
|
||||
<polygon fill="#999999" stroke="#666666" points="160.75,-41.75 0,-41.75 0,0 160.75,0 160.75,-41.75"/>
|
||||
<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="80.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverseBinaryTree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M50.71,-42.07C47.88,-51.55 57.77,-59.75 80.38,-59.75 93.44,-59.75 102.26,-57.01 106.83,-52.86"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="110.12,-54.1 109.61,-43.52 103.41,-52.11 110.12,-54.1"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
</svg>
|
||||
|
||||
<style type='text/css'>
|
||||
<![CDATA[
|
||||
[data-mouse-over-selected='false'] { opacity: 0.7; }
|
||||
[data-mouse-over-selected='true'] { opacity: 1.0; }
|
||||
]]>
|
||||
</style>
|
||||
<script type="application/ecmascript"><![CDATA[
|
||||
document.addEventListener('DOMContentLoaded', (event) => {
|
||||
highlightEdges();
|
||||
highlightAdjacentNodes();
|
||||
});
|
||||
]]></script>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 2.5 KiB |
@@ -1,32 +0,0 @@
|
||||
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
|
||||
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
|
||||
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
|
||||
<!-- Generated by graphviz version 12.1.2 (20240928.0832)
|
||||
-->
|
||||
<!-- Title: operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree Pages: 1 -->
|
||||
<svg width="169pt" height="68pt"
|
||||
viewBox="0.00 0.00 168.75 67.75" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
|
||||
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 63.75)">
|
||||
<title>operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree</title>
|
||||
<!-- Node1 -->
|
||||
<g id="Node000001" class="node">
|
||||
<title>Node1</title>
|
||||
<g id="a_Node000001"><a xlink:title="Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.">
|
||||
<polygon fill="#999999" stroke="#666666" points="160.75,-41.75 0,-41.75 0,0 160.75,0 160.75,-41.75"/>
|
||||
<text text-anchor="start" x="8" y="-28.25" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
|
||||
<text text-anchor="start" x="8" y="-17" font-family="Helvetica,sans-Serif" font-size="10.00">::reverse_binary_tree::BinaryTree</text>
|
||||
<text text-anchor="middle" x="80.38" y="-5.75" font-family="Helvetica,sans-Serif" font-size="10.00">::reverseBinaryTree</text>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
<!-- Node1->Node1 -->
|
||||
<g id="edge1_Node000001_Node000001" class="edge">
|
||||
<title>Node1->Node1</title>
|
||||
<g id="a_edge1_Node000001_Node000001"><a xlink:title=" ">
|
||||
<path fill="none" stroke="#63b8ff" d="M50.71,-42.07C47.88,-51.55 57.77,-59.75 80.38,-59.75 93.44,-59.75 102.26,-57.01 106.83,-52.86"/>
|
||||
<polygon fill="#63b8ff" stroke="#63b8ff" points="110.12,-54.1 109.61,-43.52 103.41,-52.11 110.12,-54.1"/>
|
||||
</a>
|
||||
</g>
|
||||
</g>
|
||||
</g>
|
||||
</svg>
|
||||
|
Before Width: | Height: | Size: 1.8 KiB |
Reference in New Issue
Block a user