mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-07-09 13:36:49 +08:00
Documentation for b169269c94
This commit is contained in:
realstealthninja
@@ -149,6 +149,12 @@ Private Member Functions</h2></td></tr>
|
||||
<tr class="memitem:af6f974381f523fdb981fc2d843bbf4a1" id="r_af6f974381f523fdb981fc2d843bbf4a1"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> * </td><td class="memItemRight" valign="bottom"><a class="el" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a> (<a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html">Node</a> *pivot)</td></tr>
|
||||
<tr class="memdesc:af6f974381f523fdb981fc2d843bbf4a1"><td class="mdescLeft"> </td><td class="mdescRight">Reverses a Binary Tree recursively by swapping the left and right subtrees and their children. <br /></td></tr>
|
||||
<tr class="separator:af6f974381f523fdb981fc2d843bbf4a1"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aae585d609d693a4d8f7691e03281478b" id="r_aae585d609d693a4d8f7691e03281478b"><td class="memItemLeft" align="right" valign="top"><a id="aae585d609d693a4d8f7691e03281478b" name="aae585d609d693a4d8f7691e03281478b"></a>
|
||||
 </td><td class="memItemRight" valign="bottom"><b>BinaryTree</b> (const <a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a> &)=delete</td></tr>
|
||||
<tr class="separator:aae585d609d693a4d8f7691e03281478b"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aca917e5d3c73674ee1545c3bb8b5bd50" id="r_aca917e5d3c73674ee1545c3bb8b5bd50"><td class="memItemLeft" align="right" valign="top"><a id="aca917e5d3c73674ee1545c3bb8b5bd50" name="aca917e5d3c73674ee1545c3bb8b5bd50"></a>
|
||||
<a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a> & </td><td class="memItemRight" valign="bottom"><b>operator=</b> (const <a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html">BinaryTree</a> &)=delete</td></tr>
|
||||
<tr class="separator:aca917e5d3c73674ee1545c3bb8b5bd50"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
</table><table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pri-attribs" name="pri-attribs"></a>
|
||||
Private Attributes</h2></td></tr>
|
||||
@@ -184,7 +190,7 @@ Private Attributes</h2></td></tr>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Creates a <a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" title="A Binary Tree class that implements a Binary Search Tree (BST) by default.">BinaryTree</a> with a root pointing to NULL. </p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 98</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <span class="keyword">nullptr</span>; }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 101</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <span class="keyword">nullptr</span>; }</div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_ab6a17a04aa93aaaef71e038e8cc2edeb"><div class="ttname"><a href="#ab6a17a04aa93aaaef71e038e8cc2edeb">operations_on_datastructures::reverse_binary_tree::BinaryTree::root</a></div><div class="ttdeci">Node * root</div><div class="ttdoc">Pointer to root node of Binary Tree.</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:54</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
@@ -213,12 +219,55 @@ Private Attributes</h2></td></tr>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Creates a <a class="el" href="../../de/dcf/classoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree.html" title="A Binary Tree class that implements a Binary Search Tree (BST) by default.">BinaryTree</a> with a root with an initial value. </p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 102</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>); }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 105</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <span class="keyword">new</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>); }</div>
|
||||
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition</b> hash_search.cpp:24</div></div>
|
||||
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition</b> linkedlist_implentation_usingarray.cpp:14</div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a44ce808e3648783e572bc5012d7434a4" name="a44ce808e3648783e572bc5012d7434a4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a44ce808e3648783e572bc5012d7434a4">◆ </a></span>~BinaryTree()</h2>
|
||||
|
||||
<div class="memitem">
|
||||
<div class="memproto">
|
||||
<table class="mlabels">
|
||||
<tr>
|
||||
<td class="mlabels-left">
|
||||
<table class="memname">
|
||||
<tr>
|
||||
<td class="memname">operations_on_datastructures::reverse_binary_tree::BinaryTree::~BinaryTree </td>
|
||||
<td>(</td>
|
||||
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
|
||||
<td></td>
|
||||
</tr>
|
||||
</table>
|
||||
</td>
|
||||
<td class="mlabels-right">
|
||||
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
|
||||
</tr>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 107</span> {</div>
|
||||
<div class="line"><span class="lineno"> 108</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Node*></a> nodes;</div>
|
||||
<div class="line"><span class="lineno"> 109</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>);</div>
|
||||
<div class="line"><span class="lineno"> 110</span> <span class="keywordflow">while</span> (!nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/empty.html">empty</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 111</span> <span class="keyword">const</span> <span class="keyword">auto</span> cur_node = nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/back.html">back</a>();</div>
|
||||
<div class="line"><span class="lineno"> 112</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/pop_back.html">pop_back</a>();</div>
|
||||
<div class="line"><span class="lineno"> 113</span> <span class="keywordflow">if</span> (cur_node) {</div>
|
||||
<div class="line"><span class="lineno"> 114</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(cur_node->left);</div>
|
||||
<div class="line"><span class="lineno"> 115</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">emplace_back</a>(cur_node->right);</div>
|
||||
<div class="line"><span class="lineno"> 116</span> <span class="keyword">delete</span> cur_node;</div>
|
||||
<div class="line"><span class="lineno"> 117</span> }</div>
|
||||
<div class="line"><span class="lineno"> 118</span> }</div>
|
||||
<div class="line"><span class="lineno"> 119</span> }</div>
|
||||
<div class="ttc" id="aback_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/back.html">std::vector::back</a></div><div class="ttdeci">T back(T... args)</div></div>
|
||||
<div class="ttc" id="aemplace_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/emplace_back.html">std::vector::emplace_back</a></div><div class="ttdeci">T emplace_back(T... args)</div></div>
|
||||
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/empty.html">std::vector::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
|
||||
<div class="ttc" id="apop_back_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/pop_back.html">std::vector::pop_back</a></div><div class="ttdeci">T pop_back(T... args)</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<h2 class="groupheader">Member Function Documentation</h2>
|
||||
<a id="a534645d1aabdf1a7e5897c85376f173d" name="a534645d1aabdf1a7e5897c85376f173d"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#a534645d1aabdf1a7e5897c85376f173d">◆ </a></span>add()</h2>
|
||||
@@ -244,7 +293,7 @@ Private Attributes</h2></td></tr>
|
||||
</div><div class="memdoc">
|
||||
|
||||
<p>Adds a new <a class="el" href="../../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html" title="A Node struct that represents a single node in a Binary Tree.">Node</a> to the Binary Tree. </p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 106</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 124</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="#adb2b6be741b0500ee75d89b6d06b5d50">insert</a>(<a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>, <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_adb2b6be741b0500ee75d89b6d06b5d50"><div class="ttname"><a href="#adb2b6be741b0500ee75d89b6d06b5d50">operations_on_datastructures::reverse_binary_tree::BinaryTree::insert</a></div><div class="ttdeci">Node * insert(int64_t data, Node *pivot)</div><div class="ttdoc">inserts a node in the Binary Tree, with the behaviouur of a Binary Search Tree.</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:65</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
@@ -289,32 +338,30 @@ Here is the call graph for this function:</div>
|
||||
<p>< Insert left node</p>
|
||||
<p>< Insert right node</p>
|
||||
<p>Add nodes while Tree is not empty</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 121</span> {</div>
|
||||
<div class="line"><span class="lineno"> 122</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int64_t></a> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>; <span class="comment">///< Result vector of int</span></div>
|
||||
<div class="line"><span class="lineno"> 123</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> == <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 124</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>; <span class="comment">///< Return empty vector if root is Invalid</span></div>
|
||||
<div class="line"><span class="lineno"> 125</span> }</div>
|
||||
<div class="line"><span class="lineno"> 126</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue<Node*></a> nodes; <span class="comment">///< Queue of the nodes in the tree</span></div>
|
||||
<div class="line"><span class="lineno"> 127</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); <span class="comment">///< Insert root into the queue</span></div>
|
||||
<div class="line"><span class="lineno"> 128</span> <span class="keywordflow">while</span> (!nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 129</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>(); <span class="comment">///< Copy the first element</span></div>
|
||||
<div class="line"><span class="lineno"> 130</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.push_back(temp->data); <span class="comment">///< Add the element to the data</span></div>
|
||||
<div class="line"><span class="lineno"> 131</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>(); <span class="comment">///< Remove element</span></div>
|
||||
<div class="line"><span class="lineno"> 132</span> <span class="keywordflow">if</span> (temp->left != <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 133</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(temp->left); <span class="comment">///< Insert left node</span></div>
|
||||
<div class="line"><span class="lineno"> 134</span> }</div>
|
||||
<div class="line"><span class="lineno"> 135</span> <span class="keywordflow">if</span> (temp->right != <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 136</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(temp->right); <span class="comment">///< Insert right node</span></div>
|
||||
<div class="line"><span class="lineno"> 137</span> }</div>
|
||||
<div class="line"><span class="lineno"> 138</span> } <span class="comment">/// Add nodes while Tree is not empty</span></div>
|
||||
<div class="line"><span class="lineno"> 139</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
|
||||
<div class="line"><span class="lineno"> 140</span> }</div>
|
||||
<div class="ttc" id="aempty_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/empty.html">std::queue::empty</a></div><div class="ttdeci">T empty(T... args)</div></div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 139</span> {</div>
|
||||
<div class="line"><span class="lineno"> 140</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int64_t></a> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>; <span class="comment">///< Result vector of int</span></div>
|
||||
<div class="line"><span class="lineno"> 141</span> <span class="keywordflow">if</span> (<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> == <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 142</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>; <span class="comment">///< Return empty vector if root is Invalid</span></div>
|
||||
<div class="line"><span class="lineno"> 143</span> }</div>
|
||||
<div class="line"><span class="lineno"> 144</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue<Node*></a> nodes; <span class="comment">///< Queue of the nodes in the tree</span></div>
|
||||
<div class="line"><span class="lineno"> 145</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); <span class="comment">///< Insert root into the queue</span></div>
|
||||
<div class="line"><span class="lineno"> 146</span> <span class="keywordflow">while</span> (!nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/empty.html">empty</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 147</span> <a class="code hl_class" href="../../db/d8b/struct_node.html">Node</a>* temp = nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/front.html">front</a>(); <span class="comment">///< Copy the first element</span></div>
|
||||
<div class="line"><span class="lineno"> 148</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>.push_back(temp->data); <span class="comment">///< Add the element to the data</span></div>
|
||||
<div class="line"><span class="lineno"> 149</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/pop.html">pop</a>(); <span class="comment">///< Remove element</span></div>
|
||||
<div class="line"><span class="lineno"> 150</span> <span class="keywordflow">if</span> (temp->left != <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 151</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(temp->left); <span class="comment">///< Insert left node</span></div>
|
||||
<div class="line"><span class="lineno"> 152</span> }</div>
|
||||
<div class="line"><span class="lineno"> 153</span> <span class="keywordflow">if</span> (temp->right != <span class="keyword">nullptr</span>) {</div>
|
||||
<div class="line"><span class="lineno"> 154</span> nodes.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/queue/push.html">push</a>(temp->right); <span class="comment">///< Insert right node</span></div>
|
||||
<div class="line"><span class="lineno"> 155</span> }</div>
|
||||
<div class="line"><span class="lineno"> 156</span> } <span class="comment">/// Add nodes while Tree is not empty</span></div>
|
||||
<div class="line"><span class="lineno"> 157</span> <span class="keywordflow">return</span> <a class="code hl_variable" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>;</div>
|
||||
<div class="line"><span class="lineno"> 158</span> }</div>
|
||||
<div class="ttc" id="afront_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/front.html">std::queue::front</a></div><div class="ttdeci">T front(T... args)</div></div>
|
||||
<div class="ttc" id="apop_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/pop.html">std::queue::pop</a></div><div class="ttdeci">T pop(T... args)</div></div>
|
||||
<div class="ttc" id="apush_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue/push.html">std::queue::push</a></div><div class="ttdeci">T push(T... args)</div></div>
|
||||
<div class="ttc" id="aqueue_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/queue.html">std::queue</a></div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -410,14 +457,14 @@ Here is the call graph for this function:</div>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
<p>Print each element in the tree</p>
|
||||
<p>Print newline</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 146</span> {</div>
|
||||
<div class="line"><span class="lineno"> 147</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : <a class="code hl_function" href="#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 148</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << i << <span class="stringliteral">" "</span>; <span class="comment">/// Print each element in the tree</span></div>
|
||||
<div class="line"><span class="lineno"> 149</span> }</div>
|
||||
<div class="line"><span class="lineno"> 150</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n"</span>; <span class="comment">/// Print newline</span></div>
|
||||
<div class="line"><span class="lineno"> 151</span> }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 164</span> {</div>
|
||||
<div class="line"><span class="lineno"> 165</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i : <a class="code hl_function" href="#a2e683b271d8d5cd63e0d09cf8aaa325c">get_level_order</a>()) {</div>
|
||||
<div class="line"><span class="lineno"> 166</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << i << <span class="stringliteral">" "</span>; <span class="comment">/// Print each element in the tree</span></div>
|
||||
<div class="line"><span class="lineno"> 167</span> }</div>
|
||||
<div class="line"><span class="lineno"> 168</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"\n"</span>; <span class="comment">/// Print newline</span></div>
|
||||
<div class="line"><span class="lineno"> 169</span> }</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a2e683b271d8d5cd63e0d09cf8aaa325c"><div class="ttname"><a href="#a2e683b271d8d5cd63e0d09cf8aaa325c">operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order</a></div><div class="ttdeci">std::vector< int64_t > get_level_order()</div><div class="ttdoc">Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:121</div></div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_a2e683b271d8d5cd63e0d09cf8aaa325c"><div class="ttname"><a href="#a2e683b271d8d5cd63e0d09cf8aaa325c">operations_on_datastructures::reverse_binary_tree::BinaryTree::get_level_order</a></div><div class="ttdeci">std::vector< int64_t > get_level_order()</div><div class="ttdoc">Level order traversal of a tree consists of visiting its elements, top to bottom, left to right....</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:139</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
@@ -449,7 +496,7 @@ Here is the call graph for this function:</div>
|
||||
</table>
|
||||
</div><div class="memdoc">
|
||||
<p>Reverses the Binary Tree </p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 110</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 128</span>{ <a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a> = <a class="code hl_function" href="#af6f974381f523fdb981fc2d843bbf4a1">reverseBinaryTree</a>(<a class="code hl_variable" href="#ab6a17a04aa93aaaef71e038e8cc2edeb">root</a>); }</div>
|
||||
<div class="ttc" id="aclassoperations__on__datastructures_1_1reverse__binary__tree_1_1_binary_tree_html_af6f974381f523fdb981fc2d843bbf4a1"><div class="ttname"><a href="#af6f974381f523fdb981fc2d843bbf4a1">operations_on_datastructures::reverse_binary_tree::BinaryTree::reverseBinaryTree</a></div><div class="ttdeci">Node * reverseBinaryTree(Node *pivot)</div><div class="ttdoc">Reverses a Binary Tree recursively by swapping the left and right subtrees and their children.</div><div class="ttdef"><b>Definition</b> reverse_binary_tree.cpp:84</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
|
||||
Reference in New Issue
Block a user