mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-04-24 10:33:10 +08:00
Documentation for c26eea874d
This commit is contained in:
@@ -4,7 +4,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.12.0"/>
|
||||
<meta name="generator" content="Doxygen 1.13.2"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>TheAlgorithms/C++: RBtree Class Reference</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
@@ -60,7 +60,7 @@ window.MathJax = {
|
||||
</table>
|
||||
</div>
|
||||
<!-- end header part -->
|
||||
<!-- Generated by Doxygen 1.12.0 -->
|
||||
<!-- Generated by Doxygen 1.13.2 -->
|
||||
<script type="text/javascript">
|
||||
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&dn=expat.txt MIT */
|
||||
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
|
||||
@@ -186,7 +186,7 @@ Private Attributes</h2></td></tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel inline">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -225,10 +225,10 @@ Private Attributes</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 142</span> <span class="keywordtype">int</span> x;</div>
|
||||
<div class="line"><span class="lineno"> 143</span> cout << <span class="stringliteral">"\nEnter the key of the node to be deleted: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 144</span> cin >> x;</div>
|
||||
<div class="line"><span class="lineno"> 145</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p;</div>
|
||||
<div class="line"><span class="lineno"> 145</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a> *p;</div>
|
||||
<div class="line"><span class="lineno"> 146</span> p = root;</div>
|
||||
<div class="line"><span class="lineno"> 147</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *y = NULL;</div>
|
||||
<div class="line"><span class="lineno"> 148</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *q = NULL;</div>
|
||||
<div class="line"><span class="lineno"> 147</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a> *y = NULL;</div>
|
||||
<div class="line"><span class="lineno"> 148</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a> *q = NULL;</div>
|
||||
<div class="line"><span class="lineno"> 149</span> <span class="keywordtype">int</span> found = 0;</div>
|
||||
<div class="line"><span class="lineno"> 150</span> <span class="keywordflow">while</span> (p != NULL && found == 0)</div>
|
||||
<div class="line"><span class="lineno"> 151</span> {</div>
|
||||
@@ -302,7 +302,7 @@ Private Attributes</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 219</span> delfix(q);</div>
|
||||
<div class="line"><span class="lineno"> 220</span> }</div>
|
||||
<div class="line"><span class="lineno"> 221</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 class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#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>
|
||||
@@ -323,7 +323,7 @@ Private Attributes</h2></td></tr>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00223">223</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 224</span>{</div>
|
||||
<div class="line"><span class="lineno"> 225</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *s;</div>
|
||||
<div class="line"><span class="lineno"> 225</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a> *s;</div>
|
||||
<div class="line"><span class="lineno"> 226</span> <span class="keywordflow">while</span> (p != root && p->color == <span class="charliteral">'b'</span>)</div>
|
||||
<div class="line"><span class="lineno"> 227</span> {</div>
|
||||
<div class="line"><span class="lineno"> 228</span> <span class="keywordflow">if</span> (p->parent->left == p)</div>
|
||||
@@ -501,8 +501,8 @@ Private Attributes</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 36</span> <span class="keywordtype">int</span> z, i = 0;</div>
|
||||
<div class="line"><span class="lineno"> 37</span> cout << <span class="stringliteral">"\nEnter key of the node to be inserted: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 38</span> cin >> z;</div>
|
||||
<div class="line"><span class="lineno"> 39</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p, *q;</div>
|
||||
<div class="line"><span class="lineno"> 40</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *t = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
|
||||
<div class="line"><span class="lineno"> 39</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a> *p, *q;</div>
|
||||
<div class="line"><span class="lineno"> 40</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a> *t = <span class="keyword">new</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a>;</div>
|
||||
<div class="line"><span class="lineno"> 41</span> t->key = z;</div>
|
||||
<div class="line"><span class="lineno"> 42</span> t->left = NULL;</div>
|
||||
<div class="line"><span class="lineno"> 43</span> t->right = NULL;</div>
|
||||
@@ -532,7 +532,6 @@ Private Attributes</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 67</span> }</div>
|
||||
<div class="line"><span class="lineno"> 68</span> insertfix(t);</div>
|
||||
<div class="line"><span class="lineno"> 69</span>}</div>
|
||||
<div class="ttc" id="aavltree_8cpp_html_a74f0cf18a0e5b832d9994e2f2d022287"><div class="ttname"><a href="../../d8/dee/avltree_8cpp.html#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>
|
||||
@@ -553,7 +552,7 @@ Private Attributes</h2></td></tr>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00070">70</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 71</span>{</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *u;</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a> *u;</div>
|
||||
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">if</span> (root == t)</div>
|
||||
<div class="line"><span class="lineno"> 74</span> {</div>
|
||||
<div class="line"><span class="lineno"> 75</span> t->color = <span class="charliteral">'b'</span>;</div>
|
||||
@@ -561,7 +560,7 @@ Private Attributes</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 77</span> }</div>
|
||||
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">while</span> (t->parent != NULL && t->parent->color == <span class="charliteral">'r'</span>)</div>
|
||||
<div class="line"><span class="lineno"> 79</span> {</div>
|
||||
<div class="line"><span class="lineno"> 80</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a> = t->parent->parent;</div>
|
||||
<div class="line"><span class="lineno"> 80</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a> *<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a> = t->parent->parent;</div>
|
||||
<div class="line"><span class="lineno"> 81</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>->left == t->parent)</div>
|
||||
<div class="line"><span class="lineno"> 82</span> {</div>
|
||||
<div class="line"><span class="lineno"> 83</span> <span class="keywordflow">if</span> (<a class="code hl_function" href="../../d4/d18/composite__simpson__rule_8cpp.html#a2f67508d5f392b0321772169342c98ad">g</a>->right != NULL)</div>
|
||||
@@ -640,7 +639,7 @@ Private Attributes</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 298</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><span class="lineno"> 299</span> <span class="keywordflow">else</span></div>
|
||||
<div class="line"><span class="lineno"> 300</span> {</div>
|
||||
<div class="line"><span class="lineno"> 301</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *y = p->right;</div>
|
||||
<div class="line"><span class="lineno"> 301</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a> *y = p->right;</div>
|
||||
<div class="line"><span class="lineno"> 302</span> <span class="keywordflow">if</span> (y->left != NULL)</div>
|
||||
<div class="line"><span class="lineno"> 303</span> {</div>
|
||||
<div class="line"><span class="lineno"> 304</span> p->right = y->left;</div>
|
||||
@@ -687,7 +686,7 @@ Private Attributes</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 327</span> <span class="keywordflow">return</span>;</div>
|
||||
<div class="line"><span class="lineno"> 328</span> <span class="keywordflow">else</span></div>
|
||||
<div class="line"><span class="lineno"> 329</span> {</div>
|
||||
<div class="line"><span class="lineno"> 330</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *y = p->left;</div>
|
||||
<div class="line"><span class="lineno"> 330</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a> *y = p->left;</div>
|
||||
<div class="line"><span class="lineno"> 331</span> <span class="keywordflow">if</span> (y->right != NULL)</div>
|
||||
<div class="line"><span class="lineno"> 332</span> {</div>
|
||||
<div class="line"><span class="lineno"> 333</span> p->left = y->right;</div>
|
||||
@@ -738,7 +737,7 @@ Private Attributes</h2></td></tr>
|
||||
<div class="line"><span class="lineno"> 428</span> <span class="keywordtype">int</span> x;</div>
|
||||
<div class="line"><span class="lineno"> 429</span> cout << <span class="stringliteral">"\n Enter key of the node to be searched: "</span>;</div>
|
||||
<div class="line"><span class="lineno"> 430</span> cin >> x;</div>
|
||||
<div class="line"><span class="lineno"> 431</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *p = root;</div>
|
||||
<div class="line"><span class="lineno"> 431</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a> *p = root;</div>
|
||||
<div class="line"><span class="lineno"> 432</span> <span class="keywordtype">int</span> found = 0;</div>
|
||||
<div class="line"><span class="lineno"> 433</span> <span class="keywordflow">while</span> (p != NULL && found == 0)</div>
|
||||
<div class="line"><span class="lineno"> 434</span> {</div>
|
||||
@@ -799,7 +798,7 @@ Private Attributes</h2></td></tr>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html#l00354">354</a> of file <a class="el" href="../../d9/dad/rb__tree_8cpp_source.html">rb_tree.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 355</span>{</div>
|
||||
<div class="line"><span class="lineno"> 356</span> <a class="code hl_class" href="../../d5/da1/structnode.html">node</a> *y = NULL;</div>
|
||||
<div class="line"><span class="lineno"> 356</span> <a class="code hl_typedef" href="../../d8/dee/avltree_8cpp.html#a74f0cf18a0e5b832d9994e2f2d022287">node</a> *y = NULL;</div>
|
||||
<div class="line"><span class="lineno"> 357</span> <span class="keywordflow">if</span> (p->left != NULL)</div>
|
||||
<div class="line"><span class="lineno"> 358</span> {</div>
|
||||
<div class="line"><span class="lineno"> 359</span> y = p->left;</div>
|
||||
@@ -833,7 +832,7 @@ Private Attributes</h2></td></tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -857,7 +856,7 @@ Private Attributes</h2></td></tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">private</span></span> </td>
|
||||
<span class="mlabels"><span class="mlabel private">private</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
@@ -875,7 +874,7 @@ Private Attributes</h2></td></tr>
|
||||
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
|
||||
<ul>
|
||||
<li class="navelem"><a class="el" href="../../d8/d72/class_r_btree.html">RBtree</a></li>
|
||||
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
|
||||
<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>
|
||||
|
||||
Reference in New Issue
Block a user