backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-25 22:32:24 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 53a6c16730

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

231
d8/dee/avltree_8cpp.html
View File

@@ -3,7 +3,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.2"/>
<meta name="generator" content="Doxygen 1.9.3"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: data_structures/avltree.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
@@ -30,8 +30,8 @@ MathJax.Hub.Config({
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<tr id="projectrow">
<td id="projectalign">
<div id="projectname">Algorithms_in_C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
@@ -41,7 +41,7 @@ MathJax.Hub.Config({
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.2 -->
<!-- Generated by Doxygen 1.9.3 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search",'Search','.html');
@@ -165,14 +165,14 @@ Functions</h2></td></tr>
</table>
</div><div class="memdoc">
<p >Create and return a new <a class="el" href="../../db/d8b/struct_node.html">Node</a> </p>
<div class="fragment"><div class="line"><a id="l00021" name="l00021"></a><span class="lineno"> 21</span> {</div>
<div class="line"><a id="l00022" name="l00022"></a><span class="lineno"> 22</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="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a>();</div>
<div class="line"><a id="l00023" name="l00023"></a><span class="lineno"> 23</span> nn-&gt;data = <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
<div class="line"><a id="l00024" name="l00024"></a><span class="lineno"> 24</span> nn-&gt;height = 0;</div>
<div class="line"><a id="l00025" name="l00025"></a><span class="lineno"> 25</span> nn-&gt;left = NULL;</div>
<div class="line"><a id="l00026" name="l00026"></a><span class="lineno"> 26</span> nn-&gt;right = NULL;</div>
<div class="line"><a id="l00027" name="l00027"></a><span class="lineno"> 27</span> <span class="keywordflow">return</span> nn;</div>
<div class="line"><a id="l00028" name="l00028"></a><span class="lineno"> 28</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 21</span> {</div>
<div class="line"><span class="lineno"> 22</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="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a>();</div>
<div class="line"><span class="lineno"> 23</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"> 24</span> nn-&gt;height = 0;</div>
<div class="line"><span class="lineno"> 25</span> nn-&gt;left = NULL;</div>
<div class="line"><span class="lineno"> 26</span> nn-&gt;right = NULL;</div>
<div class="line"><span class="lineno"> 27</span> <span class="keywordflow">return</span> nn;</div>
<div class="line"><span class="lineno"> 28</span>}</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="ahash__search_8cpp_html_a8ca8dcb494104d273679e219e53d0555"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a></div><div class="ttdeci">struct list node</div></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> avltree.cpp:13</div></div>
@@ -205,37 +205,38 @@ Functions</h2></td></tr>
</table>
</div><div class="memdoc">
<p >Balanced Deletion </p>
<div class="fragment"><div class="line"><a id="l00088" name="l00088"></a><span class="lineno"> 88</span> {</div>
<div class="line"><a id="l00089" name="l00089"></a><span class="lineno"> 89</span> <span class="keywordflow">if</span> (root == NULL)</div>
<div class="line"><a id="l00090" name="l00090"></a><span class="lineno"> 90</span> <span class="keywordflow">return</span> root;</div>
<div class="line"><a id="l00091" name="l00091"></a><span class="lineno"> 91</span> <span class="keywordflow">if</span> (key &lt; root-&gt;<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</div>
<div class="line"><a id="l00092" name="l00092"></a><span class="lineno"> 92</span> root-&gt;left = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a9977e004a42fade067836b295a0aa7c1">deleteNode</a>(root-&gt;left, key);</div>
<div class="line"><a id="l00093" name="l00093"></a><span class="lineno"> 93</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (key &gt; root-&gt;data)</div>
<div class="line"><a id="l00094" name="l00094"></a><span class="lineno"> 94</span> root-&gt;right = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a9977e004a42fade067836b295a0aa7c1">deleteNode</a>(root-&gt;right, key);</div>
<div class="line"><a id="l00095" name="l00095"></a><span class="lineno"> 95</span> </div>
<div class="line"><a id="l00096" name="l00096"></a><span class="lineno"> 96</span> <span class="keywordflow">else</span> {</div>
<div class="line"><a id="l00097" name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// Node to be deleted is leaf node or have only one Child</span></div>
<div class="line"><a id="l00098" name="l00098"></a><span class="lineno"> 98</span> <span class="keywordflow">if</span> (!root-&gt;right) {</div>
<div class="line"><a id="l00099" name="l00099"></a><span class="lineno"> 99</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = root-&gt;left;</div>
<div class="line"><a id="l00100" name="l00100"></a><span class="lineno"> 100</span> <span class="keyword">delete</span> (root);</div>
<div class="line"><a id="l00101" name="l00101"></a><span class="lineno"> 101</span> root = NULL;</div>
<div class="line"><a id="l00102" name="l00102"></a><span class="lineno"> 102</span> <span class="keywordflow">return</span> temp;</div>
<div class="line"><a id="l00103" name="l00103"></a><span class="lineno"> 103</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!root-&gt;left) {</div>
<div class="line"><a id="l00104" name="l00104"></a><span class="lineno"> 104</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = root-&gt;right;</div>
<div class="line"><a id="l00105" name="l00105"></a><span class="lineno"> 105</span> <span class="keyword">delete</span> (root);</div>
<div class="line"><a id="l00106" name="l00106"></a><span class="lineno"> 106</span> root = NULL;</div>
<div class="line"><a id="l00107" name="l00107"></a><span class="lineno"> 107</span> <span class="keywordflow">return</span> temp;</div>
<div class="line"><a id="l00108" name="l00108"></a><span class="lineno"> 108</span> }</div>
<div class="line"><a id="l00109" name="l00109"></a><span class="lineno"> 109</span> <span class="comment">// Node to be deleted have both left and right subtrees</span></div>
<div class="line"><a id="l00110" name="l00110"></a><span class="lineno"> 110</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a>(root-&gt;right);</div>
<div class="line"><a id="l00111" name="l00111"></a><span class="lineno"> 111</span> root-&gt;data = temp-&gt;data;</div>
<div class="line"><a id="l00112" name="l00112"></a><span class="lineno"> 112</span> root-&gt;right = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a9977e004a42fade067836b295a0aa7c1">deleteNode</a>(root-&gt;right, temp-&gt;data);</div>
<div class="line"><a id="l00113" name="l00113"></a><span class="lineno"> 113</span> }</div>
<div class="line"><a id="l00114" name="l00114"></a><span class="lineno"> 114</span> <span class="comment">// Balancing Tree after deletion</span></div>
<div class="line"><a id="l00115" name="l00115"></a><span class="lineno"> 115</span> <span class="keywordflow">return</span> root;</div>
<div class="line"><a id="l00116" name="l00116"></a><span class="lineno"> 116</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 88</span> {</div>
<div class="line"><span class="lineno"> 89</span> <span class="keywordflow">if</span> (root == NULL)</div>
<div class="line"><span class="lineno"> 90</span> <span class="keywordflow">return</span> root;</div>
<div class="line"><span class="lineno"> 91</span> <span class="keywordflow">if</span> (key &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"> 92</span> root-&gt;left = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a9977e004a42fade067836b295a0aa7c1">deleteNode</a>(root-&gt;left, key);</div>
<div class="line"><span class="lineno"> 93</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (key &gt; root-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a>)</div>
<div class="line"><span class="lineno"> 94</span> root-&gt;right = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a9977e004a42fade067836b295a0aa7c1">deleteNode</a>(root-&gt;right, key);</div>
<div class="line"><span class="lineno"> 95</span> </div>
<div class="line"><span class="lineno"> 96</span> <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 97</span> <span class="comment">// Node to be deleted is leaf node or have only one Child</span></div>
<div class="line"><span class="lineno"> 98</span> <span class="keywordflow">if</span> (!root-&gt;right) {</div>
<div class="line"><span class="lineno"> 99</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = root-&gt;left;</div>
<div class="line"><span class="lineno"> 100</span> <span class="keyword">delete</span> (root);</div>
<div class="line"><span class="lineno"> 101</span> root = NULL;</div>
<div class="line"><span class="lineno"> 102</span> <span class="keywordflow">return</span> temp;</div>
<div class="line"><span class="lineno"> 103</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!root-&gt;left) {</div>
<div class="line"><span class="lineno"> 104</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = root-&gt;right;</div>
<div class="line"><span class="lineno"> 105</span> <span class="keyword">delete</span> (root);</div>
<div class="line"><span class="lineno"> 106</span> root = NULL;</div>
<div class="line"><span class="lineno"> 107</span> <span class="keywordflow">return</span> temp;</div>
<div class="line"><span class="lineno"> 108</span> }</div>
<div class="line"><span class="lineno"> 109</span> <span class="comment">// Node to be deleted have both left and right subtrees</span></div>
<div class="line"><span class="lineno"> 110</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *temp = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a>(root-&gt;right);</div>
<div class="line"><span class="lineno"> 111</span> root-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a> = temp-&gt;data;</div>
<div class="line"><span class="lineno"> 112</span> root-&gt;right = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a9977e004a42fade067836b295a0aa7c1">deleteNode</a>(root-&gt;right, temp-&gt;data);</div>
<div class="line"><span class="lineno"> 113</span> }</div>
<div class="line"><span class="lineno"> 114</span> <span class="comment">// Balancing Tree after deletion</span></div>
<div class="line"><span class="lineno"> 115</span> <span class="keywordflow">return</span> root;</div>
<div class="line"><span class="lineno"> 116</span>}</div>
<div class="ttc" id="aavltree_8cpp_html_a5fa160a678a34dd51c0aea1c0c00ed5e"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a></div><div class="ttdeci">node * minValue(node *root)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:59</div></div>
<div class="ttc" id="aavltree_8cpp_html_a9977e004a42fade067836b295a0aa7c1"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a9977e004a42fade067836b295a0aa7c1">deleteNode</a></div><div class="ttdeci">node * deleteNode(node *root, int key)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:88</div></div>
<div class="ttc" id="adata_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/data.html">std::vector::data</a></div><div class="ttdeci">T data(T... args)</div></div>
</div><!-- fragment -->
</div>
</div>
@@ -255,7 +256,7 @@ Functions</h2></td></tr>
</table>
</div><div class="memdoc">
<p >Returns difference between height of left and right subtree </p>
<div class="fragment"><div class="line"><a id="l00038" name="l00038"></a><span class="lineno"> 38</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;left) - <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;right); }</div>
<div class="fragment"><div class="line"><span class="lineno"> 38</span>{ <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;left) - <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;right); }</div>
<div class="ttc" id="aavltree_8cpp_html_ae4a66d8b0c2b0d626aea45977e358c83"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a></div><div class="ttdeci">int height(node *root)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:31</div></div>
</div><!-- fragment -->
</div>
@@ -276,11 +277,11 @@ Functions</h2></td></tr>
</table>
</div><div class="memdoc">
<p >Returns height of tree </p>
<div class="fragment"><div class="line"><a id="l00031" name="l00031"></a><span class="lineno"> 31</span> {</div>
<div class="line"><a id="l00032" name="l00032"></a><span class="lineno"> 32</span> <span class="keywordflow">if</span> (root == NULL)</div>
<div class="line"><a id="l00033" name="l00033"></a><span class="lineno"> 33</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00034" name="l00034"></a><span class="lineno"> 34</span> <span class="keywordflow">return</span> 1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;left), <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;right));</div>
<div class="line"><a id="l00035" name="l00035"></a><span class="lineno"> 35</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 31</span> {</div>
<div class="line"><span class="lineno"> 32</span> <span class="keywordflow">if</span> (root == NULL)</div>
<div class="line"><span class="lineno"> 33</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 34</span> <span class="keywordflow">return</span> 1 + <a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a>(<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;left), <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae4a66d8b0c2b0d626aea45977e358c83">height</a>(root-&gt;right));</div>
<div class="line"><span class="lineno"> 35</span>}</div>
<div class="ttc" id="amax_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/algorithm/max.html">std::max</a></div><div class="ttdeci">T max(T... args)</div></div>
</div><!-- fragment -->
</div>
@@ -311,26 +312,26 @@ Functions</h2></td></tr>
</table>
</div><div class="memdoc">
<p >Balanced Insertion </p>
<div class="fragment"><div class="line"><a id="l00066" name="l00066"></a><span class="lineno"> 66</span> {</div>
<div class="line"><a id="l00067" name="l00067"></a><span class="lineno"> 67</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *nn = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6">createNode</a>(item);</div>
<div class="line"><a id="l00068" name="l00068"></a><span class="lineno"> 68</span> <span class="keywordflow">if</span> (root == NULL)</div>
<div class="line"><a id="l00069" name="l00069"></a><span class="lineno"> 69</span> <span class="keywordflow">return</span> nn;</div>
<div class="line"><a id="l00070" name="l00070"></a><span class="lineno"> 70</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"><a id="l00071" name="l00071"></a><span class="lineno"> 71</span> root-&gt;left = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(root-&gt;left, item);</div>
<div class="line"><a id="l00072" name="l00072"></a><span class="lineno"> 72</span> <span class="keywordflow">else</span></div>
<div class="line"><a id="l00073" name="l00073"></a><span class="lineno"> 73</span> root-&gt;right = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(root-&gt;right, item);</div>
<div class="line"><a id="l00074" name="l00074"></a><span class="lineno"> 74</span> <span class="keywordtype">int</span> b = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">getBalance</a>(root);</div>
<div class="line"><a id="l00075" name="l00075"></a><span class="lineno"> 75</span> <span class="keywordflow">if</span> (b &gt; 1) {</div>
<div class="line"><a id="l00076" name="l00076"></a><span class="lineno"> 76</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">getBalance</a>(root-&gt;left) &lt; 0)</div>
<div class="line"><a id="l00077" name="l00077"></a><span class="lineno"> 77</span> root-&gt;left = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a>(root-&gt;left); <span class="comment">// Left-Right Case</span></div>
<div class="line"><a id="l00078" name="l00078"></a><span class="lineno"> 78</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c">rightRotate</a>(root); <span class="comment">// Left-Left Case</span></div>
<div class="line"><a id="l00079" name="l00079"></a><span class="lineno"> 79</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b &lt; -1) {</div>
<div class="line"><a id="l00080" name="l00080"></a><span class="lineno"> 80</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">getBalance</a>(root-&gt;right) &gt; 0)</div>
<div class="line"><a id="l00081" name="l00081"></a><span class="lineno"> 81</span> root-&gt;right = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c">rightRotate</a>(root-&gt;right); <span class="comment">// Right-Left Case</span></div>
<div class="line"><a id="l00082" name="l00082"></a><span class="lineno"> 82</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a>(root); <span class="comment">// Right-Right Case</span></div>
<div class="line"><a id="l00083" name="l00083"></a><span class="lineno"> 83</span> }</div>
<div class="line"><a id="l00084" name="l00084"></a><span class="lineno"> 84</span> <span class="keywordflow">return</span> root;</div>
<div class="line"><a id="l00085" name="l00085"></a><span class="lineno"> 85</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 66</span> {</div>
<div class="line"><span class="lineno"> 67</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *nn = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6">createNode</a>(item);</div>
<div class="line"><span class="lineno"> 68</span> <span class="keywordflow">if</span> (root == NULL)</div>
<div class="line"><span class="lineno"> 69</span> <span class="keywordflow">return</span> nn;</div>
<div class="line"><span class="lineno"> 70</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"> 71</span> root-&gt;left = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(root-&gt;left, item);</div>
<div class="line"><span class="lineno"> 72</span> <span class="keywordflow">else</span></div>
<div class="line"><span class="lineno"> 73</span> root-&gt;right = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(root-&gt;right, item);</div>
<div class="line"><span class="lineno"> 74</span> <span class="keywordtype">int</span> b = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">getBalance</a>(root);</div>
<div class="line"><span class="lineno"> 75</span> <span class="keywordflow">if</span> (b &gt; 1) {</div>
<div class="line"><span class="lineno"> 76</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">getBalance</a>(root-&gt;left) &lt; 0)</div>
<div class="line"><span class="lineno"> 77</span> root-&gt;left = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a>(root-&gt;left); <span class="comment">// Left-Right Case</span></div>
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c">rightRotate</a>(root); <span class="comment">// Left-Left Case</span></div>
<div class="line"><span class="lineno"> 79</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (b &lt; -1) {</div>
<div class="line"><span class="lineno"> 80</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#aaa457ffec24c9643f2768e7a65e96546">getBalance</a>(root-&gt;right) &gt; 0)</div>
<div class="line"><span class="lineno"> 81</span> root-&gt;right = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#adfc1d482a564c041756719667b955b8c">rightRotate</a>(root-&gt;right); <span class="comment">// Right-Left Case</span></div>
<div class="line"><span class="lineno"> 82</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a>(root); <span class="comment">// Right-Right Case</span></div>
<div class="line"><span class="lineno"> 83</span> }</div>
<div class="line"><span class="lineno"> 84</span> <span class="keywordflow">return</span> root;</div>
<div class="line"><span class="lineno"> 85</span>}</div>
<div class="ttc" id="aavltree_8cpp_html_a2473fe7416332495b2678ebe89652e4b"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a></div><div class="ttdeci">node * insert(node *root, int item)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:66</div></div>
<div class="ttc" id="aavltree_8cpp_html_a473eee1803e4e44a54d685e4b0eef5a6"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a473eee1803e4e44a54d685e4b0eef5a6">leftRotate</a></div><div class="ttdeci">node * leftRotate(node *root)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:50</div></div>
<div class="ttc" id="aavltree_8cpp_html_a48d897353aeb6a721dbc6b6c57e035e6"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6">createNode</a></div><div class="ttdeci">node * createNode(int data)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:21</div></div>
@@ -355,13 +356,13 @@ Functions</h2></td></tr>
</table>
</div><div class="memdoc">
<p >Returns <a class="el" href="../../db/d8b/struct_node.html">Node</a> after Left Rotation </p>
<div class="fragment"><div class="line"><a id="l00050" name="l00050"></a><span class="lineno"> 50</span> {</div>
<div class="line"><a id="l00051" name="l00051"></a><span class="lineno"> 51</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = root-&gt;right;</div>
<div class="line"><a id="l00052" name="l00052"></a><span class="lineno"> 52</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *u = t-&gt;left;</div>
<div class="line"><a id="l00053" name="l00053"></a><span class="lineno"> 53</span> t-&gt;left = root;</div>
<div class="line"><a id="l00054" name="l00054"></a><span class="lineno"> 54</span> root-&gt;right = u;</div>
<div class="line"><a id="l00055" name="l00055"></a><span class="lineno"> 55</span> <span class="keywordflow">return</span> t;</div>
<div class="line"><a id="l00056" name="l00056"></a><span class="lineno"> 56</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 50</span> {</div>
<div class="line"><span class="lineno"> 51</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = root-&gt;right;</div>
<div class="line"><span class="lineno"> 52</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *u = t-&gt;left;</div>
<div class="line"><span class="lineno"> 53</span> t-&gt;left = root;</div>
<div class="line"><span class="lineno"> 54</span> root-&gt;right = u;</div>
<div class="line"><span class="lineno"> 55</span> <span class="keywordflow">return</span> t;</div>
<div class="line"><span class="lineno"> 56</span>}</div>
</div><!-- fragment -->
</div>
</div>
@@ -381,19 +382,19 @@ Functions</h2></td></tr>
</table>
</div><div class="memdoc">
<p >LevelOrder (Breadth First Search) </p>
<div class="fragment"><div class="line"><a id="l00119" name="l00119"></a><span class="lineno"> 119</span> {</div>
<div class="line"><a id="l00120" name="l00120"></a><span class="lineno"> 120</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;node *&gt;</a> q;</div>
<div class="line"><a id="l00121" name="l00121"></a><span class="lineno"> 121</span> q.push(root);</div>
<div class="line"><a id="l00122" name="l00122"></a><span class="lineno"> 122</span> <span class="keywordflow">while</span> (!q.empty()) {</div>
<div class="line"><a id="l00123" name="l00123"></a><span class="lineno"> 123</span> root = q.front();</div>
<div class="line"><a id="l00124" name="l00124"></a><span class="lineno"> 124</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; root-&gt;data &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a id="l00125" name="l00125"></a><span class="lineno"> 125</span> q.pop();</div>
<div class="line"><a id="l00126" name="l00126"></a><span class="lineno"> 126</span> <span class="keywordflow">if</span> (root-&gt;left)</div>
<div class="line"><a id="l00127" name="l00127"></a><span class="lineno"> 127</span> q.push(root-&gt;left);</div>
<div class="line"><a id="l00128" name="l00128"></a><span class="lineno"> 128</span> <span class="keywordflow">if</span> (root-&gt;right)</div>
<div class="line"><a id="l00129" name="l00129"></a><span class="lineno"> 129</span> q.push(root-&gt;right);</div>
<div class="line"><a id="l00130" name="l00130"></a><span class="lineno"> 130</span> }</div>
<div class="line"><a id="l00131" name="l00131"></a><span class="lineno"> 131</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 119</span> {</div>
<div class="line"><span class="lineno"> 120</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue&lt;node *&gt;</a> q;</div>
<div class="line"><span class="lineno"> 121</span> q.push(root);</div>
<div class="line"><span class="lineno"> 122</span> <span class="keywordflow">while</span> (!q.empty()) {</div>
<div class="line"><span class="lineno"> 123</span> root = q.front();</div>
<div class="line"><span class="lineno"> 124</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; root-&gt;<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><span class="lineno"> 125</span> q.pop();</div>
<div class="line"><span class="lineno"> 126</span> <span class="keywordflow">if</span> (root-&gt;left)</div>
<div class="line"><span class="lineno"> 127</span> q.push(root-&gt;left);</div>
<div class="line"><span class="lineno"> 128</span> <span class="keywordflow">if</span> (root-&gt;right)</div>
<div class="line"><span class="lineno"> 129</span> q.push(root-&gt;right);</div>
<div class="line"><span class="lineno"> 130</span> }</div>
<div class="line"><span class="lineno"> 131</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="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
</div><!-- fragment -->
@@ -415,21 +416,21 @@ Functions</h2></td></tr>
</table>
</div><div class="memdoc">
<p >Main function </p>
<div class="fragment"><div class="line"><a id="l00134" name="l00134"></a><span class="lineno"> 134</span> {</div>
<div class="line"><a id="l00135" name="l00135"></a><span class="lineno"> 135</span> <span class="comment">// Testing AVL Tree</span></div>
<div class="line"><a id="l00136" name="l00136"></a><span class="lineno"> 136</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root = NULL;</div>
<div class="line"><a id="l00137" name="l00137"></a><span class="lineno"> 137</span> <span class="keywordtype">int</span> i;</div>
<div class="line"><a id="l00138" name="l00138"></a><span class="lineno"> 138</span> <span class="keywordflow">for</span> (i = 1; i &lt;= 7; i++) root = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(root, i);</div>
<div class="line"><a id="l00139" name="l00139"></a><span class="lineno"> 139</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;LevelOrder: &quot;</span>;</div>
<div class="line"><a id="l00140" name="l00140"></a><span class="lineno"> 140</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
<div class="line"><a id="l00141" name="l00141"></a><span class="lineno"> 141</span> root = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a9977e004a42fade067836b295a0aa7c1">deleteNode</a>(root, 1); <span class="comment">// Deleting key with value 1</span></div>
<div class="line"><a id="l00142" name="l00142"></a><span class="lineno"> 142</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;\nLevelOrder: &quot;</span>;</div>
<div class="line"><a id="l00143" name="l00143"></a><span class="lineno"> 143</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
<div class="line"><a id="l00144" name="l00144"></a><span class="lineno"> 144</span> root = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a9977e004a42fade067836b295a0aa7c1">deleteNode</a>(root, 4); <span class="comment">// Deletin key with value 4</span></div>
<div class="line"><a id="l00145" name="l00145"></a><span class="lineno"> 145</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;\nLevelOrder: &quot;</span>;</div>
<div class="line"><a id="l00146" name="l00146"></a><span class="lineno"> 146</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
<div class="line"><a id="l00147" name="l00147"></a><span class="lineno"> 147</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><a id="l00148" name="l00148"></a><span class="lineno"> 148</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 134</span> {</div>
<div class="line"><span class="lineno"> 135</span> <span class="comment">// Testing AVL Tree</span></div>
<div class="line"><span class="lineno"> 136</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *root = NULL;</div>
<div class="line"><span class="lineno"> 137</span> <span class="keywordtype">int</span> i;</div>
<div class="line"><span class="lineno"> 138</span> <span class="keywordflow">for</span> (i = 1; i &lt;= 7; i++) root = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a2473fe7416332495b2678ebe89652e4b">insert</a>(root, i);</div>
<div class="line"><span class="lineno"> 139</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;LevelOrder: &quot;</span>;</div>
<div class="line"><span class="lineno"> 140</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
<div class="line"><span class="lineno"> 141</span> root = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a9977e004a42fade067836b295a0aa7c1">deleteNode</a>(root, 1); <span class="comment">// Deleting key with value 1</span></div>
<div class="line"><span class="lineno"> 142</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;\nLevelOrder: &quot;</span>;</div>
<div class="line"><span class="lineno"> 143</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
<div class="line"><span class="lineno"> 144</span> root = <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a9977e004a42fade067836b295a0aa7c1">deleteNode</a>(root, 4); <span class="comment">// Deletin key with value 4</span></div>
<div class="line"><span class="lineno"> 145</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;\nLevelOrder: &quot;</span>;</div>
<div class="line"><span class="lineno"> 146</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">levelOrder</a>(root);</div>
<div class="line"><span class="lineno"> 147</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 148</span>}</div>
<div class="ttc" id="aavltree_8cpp_html_ae197eb50188fb761346952b9b5f6be59"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#ae197eb50188fb761346952b9b5f6be59">levelOrder</a></div><div class="ttdeci">void levelOrder(node *root)</div><div class="ttdef"><b>Definition:</b> avltree.cpp:119</div></div>
</div><!-- fragment -->
</div>
@@ -450,11 +451,11 @@ Functions</h2></td></tr>
</table>
</div><div class="memdoc">
<p >Returns node with minimum value in the tree </p>
<div class="fragment"><div class="line"><a id="l00059" name="l00059"></a><span class="lineno"> 59</span> {</div>
<div class="line"><a id="l00060" name="l00060"></a><span class="lineno"> 60</span> <span class="keywordflow">if</span> (root-&gt;left == NULL)</div>
<div class="line"><a id="l00061" name="l00061"></a><span class="lineno"> 61</span> <span class="keywordflow">return</span> root;</div>
<div class="line"><a id="l00062" name="l00062"></a><span class="lineno"> 62</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a>(root-&gt;left);</div>
<div class="line"><a id="l00063" name="l00063"></a><span class="lineno"> 63</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 59</span> {</div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">if</span> (root-&gt;left == NULL)</div>
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">return</span> root;</div>
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">return</span> <a class="code hl_function" href="../../d8/dee/avltree_8cpp.html#a5fa160a678a34dd51c0aea1c0c00ed5e">minValue</a>(root-&gt;left);</div>
<div class="line"><span class="lineno"> 63</span>}</div>
</div><!-- fragment -->
</div>
</div>
@@ -474,13 +475,13 @@ Functions</h2></td></tr>
</table>
</div><div class="memdoc">
<p >Returns <a class="el" href="../../db/d8b/struct_node.html">Node</a> after Right Rotation </p>
<div class="fragment"><div class="line"><a id="l00041" name="l00041"></a><span class="lineno"> 41</span> {</div>
<div class="line"><a id="l00042" name="l00042"></a><span class="lineno"> 42</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = root-&gt;left;</div>
<div class="line"><a id="l00043" name="l00043"></a><span class="lineno"> 43</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *u = t-&gt;right;</div>
<div class="line"><a id="l00044" name="l00044"></a><span class="lineno"> 44</span> t-&gt;right = root;</div>
<div class="line"><a id="l00045" name="l00045"></a><span class="lineno"> 45</span> root-&gt;left = u;</div>
<div class="line"><a id="l00046" name="l00046"></a><span class="lineno"> 46</span> <span class="keywordflow">return</span> t;</div>
<div class="line"><a id="l00047" name="l00047"></a><span class="lineno"> 47</span>}</div>
<div class="fragment"><div class="line"><span class="lineno"> 41</span> {</div>
<div class="line"><span class="lineno"> 42</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = root-&gt;left;</div>
<div class="line"><span class="lineno"> 43</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *u = t-&gt;right;</div>
<div class="line"><span class="lineno"> 44</span> t-&gt;right = root;</div>
<div class="line"><span class="lineno"> 45</span> root-&gt;left = u;</div>
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">return</span> t;</div>
<div class="line"><span class="lineno"> 47</span>}</div>
</div><!-- fragment -->
</div>
</div>
@@ -490,7 +491,7 @@ Functions</h2></td></tr>
<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.9.2 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.3 </li>
</ul>
</div>
</body>