backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 20:31:43 +08:00
Code Issues Projects Releases Wiki Activity
Files
14583a2f33720eba2e2786d75e8e2312b85fa667
C-Plus-Plus/d8/dee/avltree_8cpp.html
realstealthninja 14583a2f33 Documentation for c26eea874d
2025-05-19 11:38:33 +00:00

664 lines
49 KiB
HTML
Raw Blame History

<!-- 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.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: data_structures/avltree.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>
<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">&#160;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.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
/* @license-end */
</script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;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&amp;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&amp;dn=expat.txt MIT */
$(function(){initNavTree('d8/dee/avltree_8cpp.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="summary">
<a href="#typedef-members">Typedefs</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle"><div class="title">avltree.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>A simple tree implementation using nodes.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;algorithm&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;queue&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for avltree.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d2e/avltree_8cpp__incl.svg" width="262" 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>
<p><a href="../../d8/dee/avltree_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="typedef-members" name="typedef-members"></a>
Typedefs</h2></td></tr>
<tr class="memitem:a74f0cf18a0e5b832d9994e2f2d022287" id="r_a74f0cf18a0e5b832d9994e2f2d022287"><td class="memItemLeft" align="right" valign="top">using&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a74f0cf18a0e5b832d9994e2f2d022287">node</a></td></tr>
<tr class="memdesc:a74f0cf18a0e5b832d9994e2f2d022287"><td class="mdescLeft">&#160;</td><td class="mdescRight">for std::queue <br /></td></tr>
<tr class="separator:a74f0cf18a0e5b832d9994e2f2d022287"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><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:a48d897353aeb6a721dbc6b6c57e035e6" id="r_a48d897353aeb6a721dbc6b6c57e035e6"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a48d897353aeb6a721dbc6b6c57e035e6">createNode</a> (int <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memdesc:a48d897353aeb6a721dbc6b6c57e035e6"><td class="mdescLeft">&#160;</td><td class="mdescRight">creates and returns a new node <br /></td></tr>
<tr class="separator:a48d897353aeb6a721dbc6b6c57e035e6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae4a66d8b0c2b0d626aea45977e358c83" id="r_ae4a66d8b0c2b0d626aea45977e358c83"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *root)</td></tr>
<tr class="separator:ae4a66d8b0c2b0d626aea45977e358c83"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aaa457ffec24c9643f2768e7a65e96546" id="r_aaa457ffec24c9643f2768e7a65e96546"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aaa457ffec24c9643f2768e7a65e96546">getBalance</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *root)</td></tr>
<tr class="separator:aaa457ffec24c9643f2768e7a65e96546"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adfc1d482a564c041756719667b955b8c" id="r_adfc1d482a564c041756719667b955b8c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#adfc1d482a564c041756719667b955b8c">rightRotate</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *root)</td></tr>
<tr class="separator:adfc1d482a564c041756719667b955b8c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a473eee1803e4e44a54d685e4b0eef5a6" id="r_a473eee1803e4e44a54d685e4b0eef5a6"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *root)</td></tr>
<tr class="separator:a473eee1803e4e44a54d685e4b0eef5a6"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5fa160a678a34dd51c0aea1c0c00ed5e" id="r_a5fa160a678a34dd51c0aea1c0c00ed5e"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *root)</td></tr>
<tr class="separator:a5fa160a678a34dd51c0aea1c0c00ed5e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2473fe7416332495b2678ebe89652e4b" id="r_a2473fe7416332495b2678ebe89652e4b"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a2473fe7416332495b2678ebe89652e4b">insert</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *root, int item)</td></tr>
<tr class="memdesc:a2473fe7416332495b2678ebe89652e4b"><td class="mdescLeft">&#160;</td><td class="mdescRight">inserts a new element into AVL tree <br /></td></tr>
<tr class="separator:a2473fe7416332495b2678ebe89652e4b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa29a7fdc2db1784f5a6e25025ff7cbf5" id="r_aa29a7fdc2db1784f5a6e25025ff7cbf5"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d5/da1/structnode.html">node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *root, int element)</td></tr>
<tr class="memdesc:aa29a7fdc2db1784f5a6e25025ff7cbf5"><td class="mdescLeft">&#160;</td><td class="mdescRight">removes a given element from AVL tree <br /></td></tr>
<tr class="separator:aa29a7fdc2db1784f5a6e25025ff7cbf5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a82659e9e223e520cf91d7e55c4a3f88c" id="r_a82659e9e223e520cf91d7e55c4a3f88c"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a> (const <a class="el" href="../../d5/da1/structnode.html">node</a> *const root)</td></tr>
<tr class="memdesc:a82659e9e223e520cf91d7e55c4a3f88c"><td class="mdescLeft">&#160;</td><td class="mdescRight">calls delete on every node <br /></td></tr>
<tr class="separator:a82659e9e223e520cf91d7e55c4a3f88c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae197eb50188fb761346952b9b5f6be59" id="r_ae197eb50188fb761346952b9b5f6be59"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae197eb50188fb761346952b9b5f6be59">levelOrder</a> (<a class="el" href="../../d5/da1/structnode.html">node</a> *root)</td></tr>
<tr class="memdesc:ae197eb50188fb761346952b9b5f6be59"><td class="mdescLeft">&#160;</td><td class="mdescRight">prints given tree in the LevelOrder <br /></td></tr>
<tr class="separator:ae197eb50188fb761346952b9b5f6be59"><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="#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>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>A simple tree implementation using nodes. </p>
<dl class="todo"><dt><b><a class="el" href="../../dd/da0/todo.html#_todo000002">Todo</a></b></dt><dd>update code to use C++ STL library features and OO structure </dd></dl>
<dl class="section warning"><dt>Warning</dt><dd>This program is a poor implementation and does not utilize any of the C++ STL features. </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
</div><h2 class="groupheader">Typedef Documentation</h2>
<a id="a74f0cf18a0e5b832d9994e2f2d022287" name="a74f0cf18a0e5b832d9994e2f2d022287"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a74f0cf18a0e5b832d9994e2f2d022287">&#9670;&#160;</a></span>node</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">using node</td>
</tr>
</table>
</div><div class="memdoc">
<b>Initial value:</b><div class="fragment"><div class="line"> <span class="keyword">struct </span>node {</div>
<div class="line"> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
<div class="line"> <span class="keywordtype">int</span> <a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>;</div>
<div class="line"> <span class="keyword">struct </span>node *left;</div>
<div class="line"> <span class="keyword">struct </span>node *right;</div>
<div class="line">}</div>
<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00038">avltree.cpp:38</a></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><!-- fragment -->
<p>for std::queue </p>
<p>for std::max for std::cout </p>
<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00013">13</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 13</span> {</div>
<div class="line"><span class="lineno"> 14</span> <span class="keywordtype">int</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
<div class="line"><span class="lineno"> 15</span> <span class="keywordtype">int</span> <a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>;</div>
<div class="line"><span class="lineno"> 16</span> <span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *left;</div>
<div class="line"><span class="lineno"> 17</span> <span class="keyword">struct </span><a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *right;</div>
<div class="line"><span class="lineno"> 18</span>};</div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition</b> <a href="../../d3/d26/binary__search__tree_8cpp_source.html#l00011">binary_search_tree.cpp:11</a></div></div>
</div><!-- fragment -->
</div>
</div>
<h2 class="groupheader">Function Documentation</h2>
<a id="a48d897353aeb6a721dbc6b6c57e035e6" name="a48d897353aeb6a721dbc6b6c57e035e6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a48d897353aeb6a721dbc6b6c57e035e6">&#9670;&#160;</a></span>createNode()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a> * createNode </td>
<td>(</td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>data</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>creates and returns a new node </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">data</td><td>value stored in the node </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>newly created node </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00025">25</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 25</span> {</div>
<div class="line"><span class="lineno"> 26</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *nn = <span class="keyword">new</span> <a class="code hl_typedef" href="#a74f0cf18a0e5b832d9994e2f2d022287">node</a>();</div>
<div class="line"><span class="lineno"> 27</span> nn-&gt;data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
<div class="line"><span class="lineno"> 28</span> nn-&gt;height = 0;</div>
<div class="line"><span class="lineno"> 29</span> nn-&gt;left = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 30</span> nn-&gt;right = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 31</span> <span class="keywordflow">return</span> nn;</div>
<div class="line"><span class="lineno"> 32</span>}</div>
<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="#a74f0cf18a0e5b832d9994e2f2d022287">node</a></div><div class="ttdeci">struct node { int data; int height; struct node *left; struct node *right;} node</div><div class="ttdoc">for std::queue</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00013">avltree.cpp:13</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a82659e9e223e520cf91d7e55c4a3f88c" name="a82659e9e223e520cf91d7e55c4a3f88c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a82659e9e223e520cf91d7e55c4a3f88c">&#9670;&#160;</a></span>deleteAllNodes()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void deleteAllNodes </td>
<td>(</td>
<td class="paramtype">const <a class="el" href="../../d5/da1/structnode.html">node</a> *const</td> <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>calls delete on every node </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">root</td><td>of the tree </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00151">151</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 151</span> {</div>
<div class="line"><span class="lineno"> 152</span> <span class="keywordflow">if</span> (root) {</div>
<div class="line"><span class="lineno"> 153</span> <a class="code hl_function" href="#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a>(root-&gt;left);</div>
<div class="line"><span class="lineno"> 154</span> <a class="code hl_function" href="#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a>(root-&gt;right);</div>
<div class="line"><span class="lineno"> 155</span> <span class="keyword">delete</span> root;</div>
<div class="line"><span class="lineno"> 156</span> }</div>
<div class="line"><span class="lineno"> 157</span>}</div>
<div class="ttc" id="aavltree_8cpp_html_a82659e9e223e520cf91d7e55c4a3f88c"><div class="ttname"><a href="#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a></div><div class="ttdeci">void deleteAllNodes(const node *const root)</div><div class="ttdoc">calls delete on every node</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00151">avltree.cpp:151</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="aa29a7fdc2db1784f5a6e25025ff7cbf5" name="aa29a7fdc2db1784f5a6e25025ff7cbf5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa29a7fdc2db1784f5a6e25025ff7cbf5">&#9670;&#160;</a></span>deleteNode()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a> * deleteNode </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>element</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>removes a given element from AVL tree </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir"></td><td class="paramname">root</td><td>of the tree </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">element</td><td>the element to be deleted from the tree </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>root of the updated tree </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00122">122</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 122</span> {</div>
<div class="line"><span class="lineno"> 123</span> <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 124</span> <span class="keywordflow">return</span> root;</div>
<div class="line"><span class="lineno"> 125</span> }</div>
<div class="line"><span class="lineno"> 126</span> <span class="keywordflow">if</span> (element &lt; root-&gt;<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
<div class="line"><span class="lineno"> 127</span> root-&gt;left = <a class="code hl_function" href="#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a>(root-&gt;left, element);</div>
<div class="line"><span class="lineno"> 128</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (element &gt; root-&gt;data) {</div>
<div class="line"><span class="lineno"> 129</span> root-&gt;right = <a class="code hl_function" href="#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a>(root-&gt;right, element);</div>
<div class="line"><span class="lineno"> 130</span> </div>
<div class="line"><span class="lineno"> 131</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 132</span> <span class="comment">// Node to be deleted is leaf node or have only one Child</span></div>
<div class="line"><span class="lineno"> 133</span> <span class="keywordflow">if</span> (!root-&gt;right || !root-&gt;left) {</div>
<div class="line"><span class="lineno"> 134</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = !root-&gt;right ? root-&gt;left : root-&gt;right;</div>
<div class="line"><span class="lineno"> 135</span> <span class="keyword">delete</span> root;</div>
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">return</span> temp;</div>
<div class="line"><span class="lineno"> 137</span> }</div>
<div class="line"><span class="lineno"> 138</span> <span class="comment">// Node to be deleted have both left and right subtrees</span></div>
<div class="line"><span class="lineno"> 139</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = <a class="code hl_function" href="#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a>(root-&gt;right);</div>
<div class="line"><span class="lineno"> 140</span> root-&gt;data = temp-&gt;data;</div>
<div class="line"><span class="lineno"> 141</span> root-&gt;right = <a class="code hl_function" href="#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a>(root-&gt;right, temp-&gt;data);</div>
<div class="line"><span class="lineno"> 142</span> }</div>
<div class="line"><span class="lineno"> 143</span> <span class="comment">// Balancing Tree after deletion</span></div>
<div class="line"><span class="lineno"> 144</span> <span class="keywordflow">return</span> root;</div>
<div class="line"><span class="lineno"> 145</span>}</div>
<div class="ttc" id="aavltree_8cpp_html_a5fa160a678a34dd51c0aea1c0c00ed5e"><div class="ttname"><a href="#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a></div><div class="ttdeci">node * minValue(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00079">avltree.cpp:79</a></div></div>
<div class="ttc" id="aavltree_8cpp_html_aa29a7fdc2db1784f5a6e25025ff7cbf5"><div class="ttname"><a href="#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a></div><div class="ttdeci">node * deleteNode(node *root, int element)</div><div class="ttdoc">removes a given element from AVL tree</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00122">avltree.cpp:122</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="aaa457ffec24c9643f2768e7a65e96546" name="aaa457ffec24c9643f2768e7a65e96546"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aaa457ffec24c9643f2768e7a65e96546">&#9670;&#160;</a></span>getBalance()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int getBalance </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>of the tree </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>difference between height of left and right subtree </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00049">49</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 49</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;left) - <a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;right); }</div>
</div><!-- fragment -->
</div>
</div>
<a id="ae4a66d8b0c2b0d626aea45977e358c83" name="ae4a66d8b0c2b0d626aea45977e358c83"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae4a66d8b0c2b0d626aea45977e358c83">&#9670;&#160;</a></span>height()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int height </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>the root of the tree </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>height of tree </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00038">38</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 38</span> {</div>
<div class="line"><span class="lineno"> 39</span> <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 41</span> }</div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">return</span> 1 + std::max(<a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;left), <a class="code hl_function" href="#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;right));</div>
<div class="line"><span class="lineno"> 43</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a2473fe7416332495b2678ebe89652e4b" name="a2473fe7416332495b2678ebe89652e4b"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2473fe7416332495b2678ebe89652e4b">&#9670;&#160;</a></span>insert()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a> * insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int</td> <td class="paramname"><span class="paramname"><em>item</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>inserts a new element into AVL tree </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir"></td><td class="paramname">root</td><td>of the tree </td></tr>
<tr><td class="paramdir">[in]</td><td class="paramname">item</td><td>the element to be insterted into the tree </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>root of the updated tree </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00092">92</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 92</span> {</div>
<div class="line"><span class="lineno"> 93</span> <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a48d897353aeb6a721dbc6b6c57e035e6">createNode</a>(item);</div>
<div class="line"><span class="lineno"> 95</span> }</div>
<div class="line"><span class="lineno"> 96</span> <span class="keywordflow">if</span> (item &lt; root-&gt;<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
<div class="line"><span class="lineno"> 97</span> root-&gt;left = <a class="code hl_function" href="#a2473fe7416332495b2678ebe89652e4b">insert</a>(root-&gt;left, item);</div>
<div class="line"><span class="lineno"> 98</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 99</span> root-&gt;right = <a class="code hl_function" href="#a2473fe7416332495b2678ebe89652e4b">insert</a>(root-&gt;right, item);</div>
<div class="line"><span class="lineno"> 100</span> }</div>
<div class="line"><span class="lineno"> 101</span> <span class="keywordtype">int</span> b = <a class="code hl_function" href="#aaa457ffec24c9643f2768e7a65e96546">getBalance</a>(root);</div>
<div class="line"><span class="lineno"> 102</span> <span class="keywordflow">if</span> (b &gt; 1) {</div>
<div class="line"><span class="lineno"> 103</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#aaa457ffec24c9643f2768e7a65e96546">getBalance</a>(root-&gt;left) &lt; 0) {</div>
<div class="line"><span class="lineno"> 104</span> root-&gt;left = <a class="code hl_function" href="#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a>(root-&gt;left); <span class="comment">// Left-Right Case</span></div>
<div class="line"><span class="lineno"> 105</span> }</div>
<div class="line"><span class="lineno"> 106</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#adfc1d482a564c041756719667b955b8c">rightRotate</a>(root); <span class="comment">// Left-Left Case</span></div>
<div class="line"><span class="lineno"> 107</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b &lt; -1) {</div>
<div class="line"><span class="lineno"> 108</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="#aaa457ffec24c9643f2768e7a65e96546">getBalance</a>(root-&gt;right) &gt; 0) {</div>
<div class="line"><span class="lineno"> 109</span> root-&gt;right = <a class="code hl_function" href="#adfc1d482a564c041756719667b955b8c">rightRotate</a>(root-&gt;right); <span class="comment">// Right-Left Case</span></div>
<div class="line"><span class="lineno"> 110</span> }</div>
<div class="line"><span class="lineno"> 111</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a>(root); <span class="comment">// Right-Right Case</span></div>
<div class="line"><span class="lineno"> 112</span> }</div>
<div class="line"><span class="lineno"> 113</span> <span class="keywordflow">return</span> root;</div>
<div class="line"><span class="lineno"> 114</span>}</div>
<div class="ttc" id="aavltree_8cpp_html_a2473fe7416332495b2678ebe89652e4b"><div class="ttname"><a href="#a2473fe7416332495b2678ebe89652e4b">insert</a></div><div class="ttdeci">node * insert(node *root, int item)</div><div class="ttdoc">inserts a new element into AVL tree</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00092">avltree.cpp:92</a></div></div>
<div class="ttc" id="aavltree_8cpp_html_a473eee1803e4e44a54d685e4b0eef5a6"><div class="ttname"><a href="#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a></div><div class="ttdeci">node * leftRotate(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00067">avltree.cpp:67</a></div></div>
<div class="ttc" id="aavltree_8cpp_html_a48d897353aeb6a721dbc6b6c57e035e6"><div class="ttname"><a href="#a48d897353aeb6a721dbc6b6c57e035e6">createNode</a></div><div class="ttdeci">node * createNode(int data)</div><div class="ttdoc">creates and returns a new node</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00025">avltree.cpp:25</a></div></div>
<div class="ttc" id="aavltree_8cpp_html_aaa457ffec24c9643f2768e7a65e96546"><div class="ttname"><a href="#aaa457ffec24c9643f2768e7a65e96546">getBalance</a></div><div class="ttdeci">int getBalance(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00049">avltree.cpp:49</a></div></div>
<div class="ttc" id="aavltree_8cpp_html_adfc1d482a564c041756719667b955b8c"><div class="ttname"><a href="#adfc1d482a564c041756719667b955b8c">rightRotate</a></div><div class="ttdeci">node * rightRotate(node *root)</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00055">avltree.cpp:55</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a473eee1803e4e44a54d685e4b0eef5a6" name="a473eee1803e4e44a54d685e4b0eef5a6"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a473eee1803e4e44a54d685e4b0eef5a6">&#9670;&#160;</a></span>leftRotate()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a> * leftRotate </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">root</td><td>of the tree to be rotated </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>node after left rotation </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00067">67</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 67</span> {</div>
<div class="line"><span class="lineno"> 68</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = root-&gt;right;</div>
<div class="line"><span class="lineno"> 69</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *u = t-&gt;left;</div>
<div class="line"><span class="lineno"> 70</span> t-&gt;left = root;</div>
<div class="line"><span class="lineno"> 71</span> root-&gt;right = u;</div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">return</span> t;</div>
<div class="line"><span class="lineno"> 73</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="ae197eb50188fb761346952b9b5f6be59" name="ae197eb50188fb761346952b9b5f6be59"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae197eb50188fb761346952b9b5f6be59">&#9670;&#160;</a></span>levelOrder()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void levelOrder </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>prints given tree in the LevelOrder </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramdir">[in]</td><td class="paramname">root</td><td>of the tree </td></tr>
</table>
</dd>
</dl>
<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00163">163</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 163</span> {</div>
<div class="line"><span class="lineno"> 164</span> std::queue&lt;node *&gt; q;</div>
<div class="line"><span class="lineno"> 165</span> q.push(root);</div>
<div class="line"><span class="lineno"> 166</span> <span class="keywordflow">while</span> (!q.empty()) {</div>
<div class="line"><span class="lineno"> 167</span> root = q.front();</div>
<div class="line"><span class="lineno"> 168</span> std::cout &lt;&lt; root-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 169</span> q.pop();</div>
<div class="line"><span class="lineno"> 170</span> <span class="keywordflow">if</span> (root-&gt;left) {</div>
<div class="line"><span class="lineno"> 171</span> q.push(root-&gt;left);</div>
<div class="line"><span class="lineno"> 172</span> }</div>
<div class="line"><span class="lineno"> 173</span> <span class="keywordflow">if</span> (root-&gt;right) {</div>
<div class="line"><span class="lineno"> 174</span> q.push(root-&gt;right);</div>
<div class="line"><span class="lineno"> 175</span> }</div>
<div class="line"><span class="lineno"> 176</span> }</div>
<div class="line"><span class="lineno"> 177</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00183">183</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 183</span> {</div>
<div class="line"><span class="lineno"> 184</span> <span class="comment">// Testing AVL Tree</span></div>
<div class="line"><span class="lineno"> 185</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root = <span class="keyword">nullptr</span>;</div>
<div class="line"><span class="lineno"> 186</span> <span class="keywordtype">int</span> i = 0;</div>
<div class="line"><span class="lineno"> 187</span> <span class="keywordflow">for</span> (i = 1; i &lt;= 7; i++) root = <a class="code hl_function" href="#a2473fe7416332495b2678ebe89652e4b">insert</a>(root, i);</div>
<div class="line"><span class="lineno"> 188</span> std::cout &lt;&lt; <span class="stringliteral">&quot;LevelOrder: &quot;</span>;</div>
<div class="line"><span class="lineno"> 189</span> <a class="code hl_function" href="#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
<div class="line"><span class="lineno"> 190</span> root = <a class="code hl_function" href="#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a>(root, 1); <span class="comment">// Deleting key with value 1</span></div>
<div class="line"><span class="lineno"> 191</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nLevelOrder: &quot;</span>;</div>
<div class="line"><span class="lineno"> 192</span> <a class="code hl_function" href="#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
<div class="line"><span class="lineno"> 193</span> root = <a class="code hl_function" href="#aa29a7fdc2db1784f5a6e25025ff7cbf5">deleteNode</a>(root, 4); <span class="comment">// Deletin key with value 4</span></div>
<div class="line"><span class="lineno"> 194</span> std::cout &lt;&lt; <span class="stringliteral">&quot;\nLevelOrder: &quot;</span>;</div>
<div class="line"><span class="lineno"> 195</span> <a class="code hl_function" href="#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
<div class="line"><span class="lineno"> 196</span> <a class="code hl_function" href="#a82659e9e223e520cf91d7e55c4a3f88c">deleteAllNodes</a>(root);</div>
<div class="line"><span class="lineno"> 197</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 198</span>}</div>
<div class="ttc" id="aavltree_8cpp_html_ae197eb50188fb761346952b9b5f6be59"><div class="ttname"><a href="#ae197eb50188fb761346952b9b5f6be59">levelOrder</a></div><div class="ttdeci">void levelOrder(node *root)</div><div class="ttdoc">prints given tree in the LevelOrder</div><div class="ttdef"><b>Definition</b> <a href="../../d8/dee/avltree_8cpp_source.html#l00163">avltree.cpp:163</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a5fa160a678a34dd51c0aea1c0c00ed5e" name="a5fa160a678a34dd51c0aea1c0c00ed5e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5fa160a678a34dd51c0aea1c0c00ed5e">&#9670;&#160;</a></span>minValue()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a> * minValue </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">root</td><td>of the tree </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>node with minimum value in the tree </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00079">79</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 79</span> {</div>
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">if</span> (root-&gt;left == <span class="keyword">nullptr</span>) {</div>
<div class="line"><span class="lineno"> 81</span> <span class="keywordflow">return</span> root;</div>
<div class="line"><span class="lineno"> 82</span> }</div>
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a>(root-&gt;left);</div>
<div class="line"><span class="lineno"> 84</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="adfc1d482a564c041756719667b955b8c" name="adfc1d482a564c041756719667b955b8c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adfc1d482a564c041756719667b955b8c">&#9670;&#160;</a></span>rightRotate()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../d5/da1/structnode.html">node</a> * rightRotate </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/da1/structnode.html">node</a> *</td> <td class="paramname"><span class="paramname"><em>root</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">root</td><td>of the tree to be rotated </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>node after right rotation </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d8/dee/avltree_8cpp_source.html#l00055">55</a> of file <a class="el" href="../../d8/dee/avltree_8cpp_source.html">avltree.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 55</span> {</div>
<div class="line"><span class="lineno"> 56</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = root-&gt;left;</div>
<div class="line"><span class="lineno"> 57</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *u = t-&gt;right;</div>
<div class="line"><span class="lineno"> 58</span> t-&gt;right = root;</div>
<div class="line"><span class="lineno"> 59</span> root-&gt;left = u;</div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">return</span> t;</div>
<div class="line"><span class="lineno"> 61</span>}</div>
</div><!-- fragment -->
</div>
</div>
</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_2e746e9d06bf2d8ff842208bcc6ebcfc.html">data_structures</a></li><li class="navelem"><a class="el" href="../../d8/dee/avltree_8cpp.html">avltree.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.13.2 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink