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

Documentation for 2dadbf73f4

Browse Source
This commit is contained in:
github-actions
2024-02-12 20:07:08 +00:00
parent b5b4d78981
commit a1eb9bd385
1261 changed files with 30404 additions and 29974 deletions
Download Patch File Download Diff File Expand all files Collapse all files

49
de/dcf/binary__exponent_8cpp.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: math/binary_exponent.cpp File Reference</title>
<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="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.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>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('de/dcf/binary__exponent_8cpp.html','../../'); initResizable(); });
$(function(){initNavTree('de/dcf/binary__exponent_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -114,11 +116,11 @@ Include dependency graph for binary_exponent.cpp:</div>
</div><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&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a> (int a, int b)</td></tr>
<tr class="memitem:aeb48dce0725e63d19147944f41843c73" id="r_aeb48dce0725e63d19147944f41843c73"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aeb48dce0725e63d19147944f41843c73">binExpo</a> (int a, int b)</td></tr>
<tr class="separator:aeb48dce0725e63d19147944f41843c73"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a31dbf5f7ceb9c9eec831ef9f7782291f" id="r_a31dbf5f7ceb9c9eec831ef9f7782291f"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dcf/binary__exponent_8cpp.html#a31dbf5f7ceb9c9eec831ef9f7782291f">binExpo_alt</a> (int a, int b)</td></tr>
<tr class="memitem:a31dbf5f7ceb9c9eec831ef9f7782291f" id="r_a31dbf5f7ceb9c9eec831ef9f7782291f"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a31dbf5f7ceb9c9eec831ef9f7782291f">binExpo_alt</a> (int a, int b)</td></tr>
<tr class="separator:a31dbf5f7ceb9c9eec831ef9f7782291f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dcf/binary__exponent_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
<tr class="separator:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -145,19 +147,12 @@ Functions</h2></td></tr>
<tr>
<td class="memname">int binExpo </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>a</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>a</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>b</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -166,14 +161,14 @@ Functions</h2></td></tr>
<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>
<div class="line"><span class="lineno"> 31</span> }</div>
<div class="line"><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"><span class="lineno"> 32</span> <span class="keywordtype">int</span> res = <a class="code hl_function" href="#aeb48dce0725e63d19147944f41843c73">binExpo</a>(a, b / 2);</div>
<div class="line"><span class="lineno"> 33</span> <span class="keywordflow">if</span> (b % 2) {</div>
<div class="line"><span class="lineno"> 34</span> <span class="keywordflow">return</span> res * res * a;</div>
<div class="line"><span class="lineno"> 35</span> } <span class="keywordflow">else</span> {</div>
<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="../../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> binary_exponent.cpp:28</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> binary_exponent.cpp:28</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -191,19 +186,12 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int binExpo_alt </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>a</em>, </td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>a</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>b</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>b</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
@@ -231,8 +219,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void&#160;</td>
<td class="paramname"></td><td>)</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -252,7 +239,7 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 61</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b &lt; 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> &lt;&lt; <span class="stringliteral">&quot;Exponent must be positive !!&quot;</span> &lt;&lt; <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="../../de/dcf/binary__exponent_8cpp.html#aeb48dce0725e63d19147944f41843c73">binExpo</a>(a, b);<span class="comment"></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 &#39;^&#39; denotes exponentiation)</span></div>
@@ -277,7 +264,7 @@ Here is the call graph for this function:</div>
<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.9.8 </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.10.0 </li>
</ul>
</div>
</body>

92
de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html
View File

@@ -3,16 +3,18 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.8"/>
<meta name="generator" content="Doxygen 1.10.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>
<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="../../clipboard.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.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>
@@ -41,7 +43,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.8 -->
<!-- Generated by Doxygen 1.10.0 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -53,7 +55,7 @@ var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
$(function() { init_search(); });
});
/* @license-end */
</script>
@@ -71,7 +73,7 @@ $(function() {
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
$(document).ready(function(){initNavTree('de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html','../../'); initResizable(); });
$(function(){initNavTree('de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
@@ -107,7 +109,7 @@ $(document).ready(function(){initNavTree('de/dcf/classoperations__on__datastruct
<div class="contents">
<p>A Binary Tree class that implements a Binary Search Tree (BST) by default.
<a href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#details">More...</a></p>
<a href="#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for operations_on_datastructures::reverse_binary_tree::BinaryTree:</div>
<div class="dyncontent">
@@ -116,30 +118,30 @@ Collaboration diagram for operations_on_datastructures::reverse_binary_tree::Bin
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:abcb1cc8da7b6759dc92cbe0254697c56" id="r_abcb1cc8da7b6759dc92cbe0254697c56"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abcb1cc8da7b6759dc92cbe0254697c56">BinaryTree</a> ()</td></tr>
<tr class="memitem:abcb1cc8da7b6759dc92cbe0254697c56" id="r_abcb1cc8da7b6759dc92cbe0254697c56"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abcb1cc8da7b6759dc92cbe0254697c56">BinaryTree</a> ()</td></tr>
<tr class="memdesc:abcb1cc8da7b6759dc92cbe0254697c56"><td class="mdescLeft">&#160;</td><td class="mdescRight">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. <br /></td></tr>
<tr class="separator:abcb1cc8da7b6759dc92cbe0254697c56"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abb44646a26a446efae7704c80efc011b" id="r_abb44646a26a446efae7704c80efc011b"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#abb44646a26a446efae7704c80efc011b">BinaryTree</a> (int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memitem:abb44646a26a446efae7704c80efc011b" id="r_abb44646a26a446efae7704c80efc011b"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#abb44646a26a446efae7704c80efc011b">BinaryTree</a> (int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memdesc:abb44646a26a446efae7704c80efc011b"><td class="mdescLeft">&#160;</td><td class="mdescRight">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. <br /></td></tr>
<tr class="separator:abb44646a26a446efae7704c80efc011b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a534645d1aabdf1a7e5897c85376f173d" id="r_a534645d1aabdf1a7e5897c85376f173d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a534645d1aabdf1a7e5897c85376f173d">add</a> (int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memitem:a534645d1aabdf1a7e5897c85376f173d" id="r_a534645d1aabdf1a7e5897c85376f173d"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a534645d1aabdf1a7e5897c85376f173d">add</a> (int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memdesc:a534645d1aabdf1a7e5897c85376f173d"><td class="mdescLeft">&#160;</td><td class="mdescRight">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. <br /></td></tr>
<tr class="separator:a534645d1aabdf1a7e5897c85376f173d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1c0d27198372b36ef71bc58af8336b9c" id="r_a1c0d27198372b36ef71bc58af8336b9c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a1c0d27198372b36ef71bc58af8336b9c">reverse</a> ()</td></tr>
<tr class="memitem:a1c0d27198372b36ef71bc58af8336b9c" id="r_a1c0d27198372b36ef71bc58af8336b9c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a1c0d27198372b36ef71bc58af8336b9c">reverse</a> ()</td></tr>
<tr class="separator:a1c0d27198372b36ef71bc58af8336b9c"><td class="memSeparator" colspan="2">&#160;</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>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a> ()</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>&lt; int64_t &gt;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a> ()</td></tr>
<tr class="memdesc:a2e683b271d8d5cd63e0d09cf8aaa325c"><td class="mdescLeft">&#160;</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">&#160;</td></tr>
<tr class="memitem:a5cf972a2c994a4fa1a89fc77bd5ad503" id="r_a5cf972a2c994a4fa1a89fc77bd5ad503"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a> ()</td></tr>
<tr class="memdesc:a5cf972a2c994a4fa1a89fc77bd5ad503"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints all of the elements in the tree to stdout level-by-level, using the <a class="el" 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....">get_level_order()</a> function. <br /></td></tr>
<tr class="memitem:a5cf972a2c994a4fa1a89fc77bd5ad503" id="r_a5cf972a2c994a4fa1a89fc77bd5ad503"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5cf972a2c994a4fa1a89fc77bd5ad503">print</a> ()</td></tr>
<tr class="memdesc:a5cf972a2c994a4fa1a89fc77bd5ad503"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints all of the elements in the tree to stdout level-by-level, using the <a class="el" href="#a2e683b271d8d5cd63e0d09cf8aaa325c" title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....">get_level_order()</a> function. <br /></td></tr>
<tr class="separator:a5cf972a2c994a4fa1a89fc77bd5ad503"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-methods" name="pri-methods"></a>
Private Member Functions</h2></td></tr>
<tr class="memitem:adb2b6be741b0500ee75d89b6d06b5d50" id="r_adb2b6be741b0500ee75d89b6d06b5d50"><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> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">insert</a> (int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *pivot)</td></tr>
<tr class="memitem:adb2b6be741b0500ee75d89b6d06b5d50" id="r_adb2b6be741b0500ee75d89b6d06b5d50"><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> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a> (int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *pivot)</td></tr>
<tr class="memdesc:adb2b6be741b0500ee75d89b6d06b5d50"><td class="mdescLeft">&#160;</td><td class="mdescRight">inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree. <br /></td></tr>
<tr class="separator:adb2b6be741b0500ee75d89b6d06b5d50"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af6f974381f523fdb981fc2d843bbf4a1" id="r_af6f974381f523fdb981fc2d843bbf4a1"><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> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a> (<a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *pivot)</td></tr>
<tr class="memitem:af6f974381f523fdb981fc2d843bbf4a1" id="r_af6f974381f523fdb981fc2d843bbf4a1"><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> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a> (<a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *pivot)</td></tr>
<tr class="memdesc:af6f974381f523fdb981fc2d843bbf4a1"><td class="mdescLeft">&#160;</td><td class="mdescRight">Reverses a Binary Tree recursively by swapping the left and right subtrees and their children. <br /></td></tr>
<tr class="separator:af6f974381f523fdb981fc2d843bbf4a1"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
@@ -165,7 +167,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -177,8 +179,8 @@ 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>
<div class="fragment"><div class="line"><span class="lineno"> 98</span>{ <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#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="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#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="fragment"><div class="line"><span class="lineno"> 98</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><!-- fragment -->
</div>
</div>
@@ -194,8 +196,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">operations_on_datastructures::reverse_binary_tree::BinaryTree::BinaryTree </td>
<td>(</td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>data</em></td><td>)</td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -207,7 +208,7 @@ 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>
<div class="fragment"><div class="line"><span class="lineno"> 102</span>{ <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#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="fragment"><div class="line"><span class="lineno"> 102</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><!-- fragment -->
@@ -226,8 +227,7 @@ Private Attributes</h2></td></tr>
<tr>
<td class="memname">void operations_on_datastructures::reverse_binary_tree::BinaryTree::add </td>
<td>(</td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>data</em></td><td>)</td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -239,8 +239,8 @@ 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"> 106</span>{ <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#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="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#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 class="fragment"><div class="line"><span class="lineno"> 106</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">
@@ -261,7 +261,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -286,11 +286,11 @@ Here is the call graph for this function:</div>
<p>Add nodes while Tree is not empty</p>
<div class="fragment"><div class="line"><span class="lineno"> 121</span> {</div>
<div class="line"><span class="lineno"> 122</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>; <span class="comment">///&lt; Result vector of int</span></div>
<div class="line"><span class="lineno"> 123</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 123</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"> 124</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>; <span class="comment">///&lt; Return empty vector if root is Invalid</span></div>
<div class="line"><span class="lineno"> 125</span> }</div>
<div class="line"><span class="lineno"> 126</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;Node*&gt;</a> nodes; <span class="comment">///&lt; Queue of the nodes in the tree</span></div>
<div class="line"><span class="lineno"> 127</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="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); <span class="comment">///&lt; Insert root into the queue</span></div>
<div class="line"><span class="lineno"> 127</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">///&lt; Insert root into the queue</span></div>
<div class="line"><span class="lineno"> 128</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"> 129</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">///&lt; Copy the first element</span></div>
<div class="line"><span class="lineno"> 130</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.push_back(temp-&gt;data); <span class="comment">///&lt; Add the element to the data</span></div>
@@ -330,19 +330,12 @@ Here is the call graph for this function:</div>
<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::insert </td>
<td>(</td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>data</em>, </td>
<td class="paramtype">int64_t</td> <td class="paramname"><span class="paramname"><em>data</em>, </span></td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>pivot</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
<td class="paramtype"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *</td> <td class="paramname"><span class="paramname"><em>pivot</em></span>&#160;)</td>
</tr>
</table>
</td>
@@ -370,10 +363,10 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 68</span> }</div>
<div class="line"><span class="lineno"> 69</span> <span class="keywordflow">if</span> (data &lt;= pivot-&gt;<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-&gt;left =</div>
<div class="line"><span class="lineno"> 71</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, pivot-&gt;left); <span class="comment">///&lt; 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-&gt;left); <span class="comment">///&lt; Insert Node to the left</span></div>
<div class="line"><span class="lineno"> 72</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 73</span> pivot-&gt;right =</div>
<div class="line"><span class="lineno"> 74</span> <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, pivot-&gt;right); <span class="comment">///&lt; 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-&gt;right); <span class="comment">///&lt; Insert node to the right</span></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>
@@ -397,7 +390,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::reverse_binary_tree::BinaryTree::print </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -408,18 +401,18 @@ Here is the call graph for this function:</div>
</table>
</div><div class="memdoc">
<p>Prints all of the elements in the tree to stdout level-by-level, using the <a class="el" 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....">get_level_order()</a> function. </p>
<p>Prints all of the elements in the tree to stdout level-by-level, using the <a class="el" href="#a2e683b271d8d5cd63e0d09cf8aaa325c" title="Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....">get_level_order()</a> function. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p>Print each element in the tree</p>
<p>Print newline</p>
<div class="fragment"><div class="line"><span class="lineno"> 146</span> {</div>
<div class="line"><span class="lineno"> 147</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>()) {</div>
<div class="line"><span class="lineno"> 147</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"> 148</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot; &quot;</span>; <span class="comment">/// Print each element in the tree</span></div>
<div class="line"><span class="lineno"> 149</span> }</div>
<div class="line"><span class="lineno"> 150</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;\n&quot;</span>; <span class="comment">/// Print newline</span></div>
<div class="line"><span class="lineno"> 151</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="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#a2e683b271d8d5cd63e0d09cf8aaa325c">operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order</a></div><div class="ttdeci">std::vector&lt; int64_t &gt; 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:121</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&lt; int64_t &gt; 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:121</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -440,7 +433,7 @@ Here is the call graph for this function:</div>
<tr>
<td class="memname">void operations_on_datastructures::reverse_binary_tree::BinaryTree::reverse </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td class="paramname"><span class="paramname"></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -451,8 +444,8 @@ 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"> 110</span>{ <a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(<a class="code hl_variable" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#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="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#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 class="fragment"><div class="line"><span class="lineno"> 110</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">
@@ -473,8 +466,7 @@ Here is the call graph for this function:</div>
<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::reverseBinaryTree </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>pivot</em></td><td>)</td>
<td class="paramtype"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *</td> <td class="paramname"><span class="paramname"><em>pivot</em></span></td><td>)</td>
<td></td>
</tr>
</table>
@@ -502,8 +494,8 @@ Here is the call graph for this function:</div>
<div class="line"><span class="lineno"> 86</span> <span class="keywordflow">return</span> pivot; <span class="comment">///&lt; Base case</span></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-&gt;left; <span class="comment">///&lt; pointer to the left subtree</span></div>
<div class="line"><span class="lineno"> 89</span> pivot-&gt;left = <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(pivot-&gt;right); <span class="comment">///&lt; Swap</span></div>
<div class="line"><span class="lineno"> 90</span> pivot-&gt;right = <a class="code hl_function" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(temp); <span class="comment">///&lt; Swap</span></div>
<div class="line"><span class="lineno"> 89</span> pivot-&gt;left = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(pivot-&gt;right); <span class="comment">///&lt; Swap</span></div>
<div class="line"><span class="lineno"> 90</span> pivot-&gt;right = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(temp); <span class="comment">///&lt; Swap</span></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">
@@ -523,7 +515,7 @@ Here is the call graph for this function:</div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></li><li class="navelem"><b>reverse_binary_tree</b></li><li class="navelem"><a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.8 </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.10.0 </li>
</ul>
</div>
</body>