diff --git a/d0/d6f/namespaceothers.html b/d0/d6f/namespaceothers.html index d59bddccd..690cdd57f 100644 --- a/d0/d6f/namespaceothers.html +++ b/d0/d6f/namespaceothers.html @@ -134,7 +134,7 @@ Functions

Other algorithms

for assert for IO Operations for std::list

Other algorithms

-

for assert for I/O operations

+

for assert for std::uint64_t for I/O operations

Other algorithms

Function Documentation

diff --git a/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html b/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html index 435bca685..e314cd25d 100644 --- a/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html +++ b/d5/d8b/structothers_1_1recursive__tree__traversals_1_1_node-members.html @@ -110,7 +110,7 @@ $(function(){initNavTree('d9/df7/structothers_1_1recursive__tree__traversals_1_1

This is the complete list of members for others::recursive_tree_traversals::Node, including all inherited members.

- +
dataothers::recursive_tree_traversals::Node
dataothers::recursive_tree_traversals::Node
leftothers::recursive_tree_traversals::Node
rightothers::recursive_tree_traversals::Node
diff --git a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.map b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.map index 795187a59..b3ca3cd93 100644 --- a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.map +++ b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.map @@ -1,7 +1,7 @@ - - - - - + + + + + diff --git a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.md5 b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.md5 index 0f027935d..db250a296 100644 --- a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.md5 +++ b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.md5 @@ -1 +1 @@ -2880b3aa9ee00232a5736ff0d0e07193 \ No newline at end of file +13d3d40813e2172af70fc2fd9d91ca6b \ No newline at end of file diff --git a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg index 1d65855cb..ffb704a01 100644 --- a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg +++ b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph.svg @@ -4,8 +4,8 @@ - + @@ -23,9 +23,9 @@ Node1 - -others::recursive_tree -_traversals::BT + +others::recursive_tree +_traversals::BT @@ -33,8 +33,8 @@ Node2 - -std::vector< uint64_t > + +std::vector< std::uint64_t > @@ -42,20 +42,20 @@ Node2->Node1 - - + + - inorder_result -postorder_result -preorder_result + inorder_result +postorder_result +preorder_result Node3 - -std::uint64_t + +std::uint64_t @@ -63,11 +63,11 @@ Node3->Node2 - - + + - elements + elements diff --git a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph_org.svg b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph_org.svg index acbafb1e9..fd9f5c372 100644 --- a/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph_org.svg +++ b/d8/d98/classothers_1_1recursive__tree__traversals_1_1_b_t__coll__graph_org.svg @@ -4,17 +4,17 @@ - + others::recursive_tree_traversals::BT Node1 - -others::recursive_tree -_traversals::BT + +others::recursive_tree +_traversals::BT @@ -22,8 +22,8 @@ Node2 - -std::vector< uint64_t > + +std::vector< std::uint64_t > @@ -31,20 +31,20 @@ Node2->Node1 - - + + - inorder_result -postorder_result -preorder_result + inorder_result +postorder_result +preorder_result Node3 - -std::uint64_t + +std::uint64_t @@ -52,11 +52,11 @@ Node3->Node2 - - + + - elements + elements diff --git a/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html b/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html index 9588664cc..7633b8f76 100644 --- a/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html +++ b/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html @@ -116,15 +116,15 @@ $(function(){initNavTree('d9/df7/structothers_1_1recursive__tree__traversals_1_1
Collaboration diagram for others::recursive_tree_traversals::Node:
-
+
[legend]
- - - + + + @@ -156,7 +156,7 @@ uint64_t 

struct pointer to left subtree.

-
80{}; ///< struct pointer to left subtree.
+
81{}; ///< struct pointer to left subtree.
@@ -173,7 +173,7 @@ uint64_t 

struct pointer to right subtree.

-
81{}; ///< struct pointer to right subtree.
+
82{}; ///< struct pointer to right subtree.
diff --git a/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.js b/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.js index 2b5a05dfd..f09ec82c2 100644 --- a/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.js +++ b/d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.js @@ -1,6 +1,6 @@ var structothers_1_1recursive__tree__traversals_1_1_node = [ - [ "data", "d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a3b8c7ec2863de75916be027fa5287570", null ], + [ "data", "d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade", null ], [ "left", "d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3", null ], [ "right", "d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83", null ] ]; \ No newline at end of file diff --git a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.map b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.map index 310a4980d..395f85cd7 100644 --- a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.map +++ b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.map @@ -1,4 +1,6 @@ - - + + + + diff --git a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.md5 b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.md5 index ad24b7c0e..54ad8b67b 100644 --- a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.md5 +++ b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.md5 @@ -1 +1 @@ -497fc4849cb44b66f75cc66ee5812524 \ No newline at end of file +7fea014a1b03b545b163375d893501b6 \ No newline at end of file diff --git a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg index 8cc33ec93..256fb3742 100644 --- a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg +++ b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph.svg @@ -4,8 +4,8 @@ - + @@ -17,7 +17,7 @@ ]]> - + others::recursive_tree_traversals::Node @@ -30,16 +30,35 @@ - + Node1->Node1 - - - + + + left right + + +Node2 + + +std::uint64_t + + + + + +Node2->Node1 + + + + + + data + diff --git a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph_org.svg b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph_org.svg index 7d5cd176a..24d9889b2 100644 --- a/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph_org.svg +++ b/db/d68/structothers_1_1recursive__tree__traversals_1_1_node__coll__graph_org.svg @@ -4,9 +4,9 @@ - - + + others::recursive_tree_traversals::Node @@ -19,15 +19,34 @@ - + Node1->Node1 - - - + + + left right + + +Node2 + + +std::uint64_t + + + + + +Node2->Node1 + + + + + + data + diff --git a/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html b/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html index a5f90c68d..ea735f53b 100644 --- a/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html +++ b/dc/d5f/classothers_1_1recursive__tree__traversals_1_1_b_t-members.html @@ -110,12 +110,12 @@ $(function(){initNavTree('dd/de1/classothers_1_1recursive__tree__traversals_1_1_

This is the complete list of members for others::recursive_tree_traversals::BT, including all inherited members.

Public Attributes

-uint64_t data = 0
 The value/key of the node.
 
+std::uint64_t data = 0
 The value/key of the node.
 
struct Node * left {}
 struct pointer to left subtree.
 
data = 0 data = 0
- + - + - +
createNewNode(uint64_t)others::recursive_tree_traversals::BT
createNewNode(std::uint64_t)others::recursive_tree_traversals::BT
inorder(Node *) (defined in others::recursive_tree_traversals::BT)others::recursive_tree_traversals::BT
inorder_result (defined in others::recursive_tree_traversals::BT)others::recursive_tree_traversals::BT
postorder(Node *)others::recursive_tree_traversals::BT
postorder(Node *)others::recursive_tree_traversals::BT
postorder_result (defined in others::recursive_tree_traversals::BT)others::recursive_tree_traversals::BT
preorder(Node *)others::recursive_tree_traversals::BT
preorder(Node *)others::recursive_tree_traversals::BT
preorder_result (defined in others::recursive_tree_traversals::BT)others::recursive_tree_traversals::BT
diff --git a/dc/de1/recursive__tree__traversal_8cpp.html b/dc/de1/recursive__tree__traversal_8cpp.html index a049c86a1..ba375592c 100644 --- a/dc/de1/recursive__tree__traversal_8cpp.html +++ b/dc/de1/recursive__tree__traversal_8cpp.html @@ -115,12 +115,13 @@ $(function(){initNavTree('dc/de1/recursive__tree__traversal_8cpp.html','../../')

Recursive version of Inorder, Preorder, and Postorder [Traversal of the Tree] (https://en.wikipedia.org/wiki/Tree_traversal) More...

#include <cassert>
+#include <cstdint>
#include <iostream>
#include <vector>
Include dependency graph for recursive_tree_traversal.cpp:
-
+

@@ -143,6 +144,8 @@ Namespaces

+ + @@ -178,6 +181,30 @@ Iterative Postorder Traversal of a tree

In normal postorder traversal, visit the left subtree before the right subtree. If we visit the right subtree before visiting the left subtree, it is referred to as reverse postorder traversal.

Author
Lajat Manekar

Function Documentation

+ +

◆ deleteAll()

+ +
+
+

Functions

void others::recursive_tree_traversals::deleteAll (const Node *const root)
 
void test1 ()
 1st test-case
 
+ + + + + + +
void others::recursive_tree_traversals::deleteAll (const Node *const root)
+
+
185 {
+
186 if (root) {
+
187 deleteAll(root->left);
+
188 deleteAll(root->right);
+
189 delete root;
+
190 }
+
191}
+
+
+

◆ main()

@@ -195,11 +222,11 @@ Iterative Postorder Traversal of a tree

Main function.

Returns
0 on exit
-
373 {
-
374 tests(); // run self-test implementations
-
375 return 0;
-
376}
-
tests
static void tests()
Self-test implementations.
Definition recursive_tree_traversal.cpp:361
+
398 {
+
399 tests(); // run self-test implementations
+
400 return 0;
+
401}
+
tests
static void tests()
Self-test implementations.
Definition recursive_tree_traversal.cpp:386
Here is the call graph for this function:
@@ -228,66 +255,74 @@ Here is the call graph for this function:

< result stores the inorder traversal of the binary tree

< result stores the preorder traversal of the binary tree

< result stores the postorder traversal of the binary tree

-
191 {
-
192 others::recursive_tree_traversals::BT obj1;
-
193 others::recursive_tree_traversals::Node *root = obj1.createNewNode(2);
-
194 root->left = obj1.createNewNode(7);
-
195 root->right = obj1.createNewNode(5);
-
196 root->left->left = obj1.createNewNode(2);
-
197 root->left->right = obj1.createNewNode(6);
-
198 root->right->right = obj1.createNewNode(9);
-
199 root->left->right->left = obj1.createNewNode(5);
-
200 root->left->right->right = obj1.createNewNode(11);
-
201 root->right->right->left = obj1.createNewNode(4);
-
202
-
203 std::vector<uint64_t> actual_result_inorder{2, 7, 5, 6, 11, 2, 5, 4, 9};
-
204 std::vector<uint64_t> actual_result_preorder{2, 7, 2, 6, 5, 11, 5, 9, 4};
-
205 std::vector<uint64_t> actual_result_postorder{2, 5, 11, 6, 7, 4, 9, 5, 2};
-
206 std::vector<uint64_t> result_inorder; ///< result stores the inorder
-
207 ///< traversal of the binary tree
-
208 std::vector<uint64_t> result_preorder; ///< result stores the preorder
-
209 ///< traversal of the binary tree
-
210 std::vector<uint64_t> result_postorder; ///< result stores the postorder
-
211 ///< traversal of the binary tree
-
212
-
213 uint64_t size = actual_result_inorder.size();
-
214
-
215 // Calling inorder() function by passing a root node,
-
216 // and storing the inorder traversal in result_inorder.
-
217 result_inorder = obj1.inorder(root);
-
218 std::cout << "Testcase #1: Inorder Traversal...";
-
219 for (auto i = 0; i < size; ++i) {
-
220 assert(actual_result_inorder[i] == result_inorder[i]);
-
221 }
-
222 std::cout << "Passed!" << std::endl;
-
223
-
224 // Calling preorder() function by passing a root node,
-
225 // and storing the preorder traversal in result_preorder.
-
226 result_preorder = obj1.preorder(root);
-
227 std::cout << "Testcase #1: Preorder Traversal...";
-
228 for (auto i = 0; i < size; ++i) {
-
229 assert(actual_result_preorder[i] == result_preorder[i]);
-
230 }
-
231 std::cout << "Passed!" << std::endl;
-
232
-
233 // Calling postorder() function by passing a root node,
-
234 // and storing the postorder traversal in result_postorder.
-
235 result_postorder = obj1.postorder(root);
-
236 std::cout << "Testcase #1: Postorder Traversal...";
-
237 for (auto i = 0; i < size; ++i) {
-
238 assert(actual_result_postorder[i] == result_postorder[i]);
-
239 }
-
240 std::cout << "Passed!" << std::endl;
-
241
-
242 std::cout << std::endl;
-
243}
+
201 {
+
202 others::recursive_tree_traversals::BT obj1;
+
203 others::recursive_tree_traversals::Node *root = obj1.createNewNode(2);
+
204 root->left = obj1.createNewNode(7);
+
205 root->right = obj1.createNewNode(5);
+
206 root->left->left = obj1.createNewNode(2);
+
207 root->left->right = obj1.createNewNode(6);
+
208 root->right->right = obj1.createNewNode(9);
+
209 root->left->right->left = obj1.createNewNode(5);
+
210 root->left->right->right = obj1.createNewNode(11);
+
211 root->right->right->left = obj1.createNewNode(4);
+
212
+
213 std::vector<std::uint64_t> actual_result_inorder{2, 7, 5, 6, 11,
+
214 2, 5, 4, 9};
+
215 std::vector<std::uint64_t> actual_result_preorder{2, 7, 2, 6, 5,
+
216 11, 5, 9, 4};
+
217 std::vector<std::uint64_t> actual_result_postorder{2, 5, 11, 6, 7,
+
218 4, 9, 5, 2};
+
219 std::vector<std::uint64_t>
+
220 result_inorder; ///< result stores the inorder
+
221 ///< traversal of the binary tree
+
222 std::vector<std::uint64_t>
+
223 result_preorder; ///< result stores the preorder
+
224 ///< traversal of the binary tree
+
225 std::vector<std::uint64_t>
+
226 result_postorder; ///< result stores the postorder
+
227 ///< traversal of the binary tree
+
228
+
229 std::uint64_t size = actual_result_inorder.size();
+
230
+
231 // Calling inorder() function by passing a root node,
+
232 // and storing the inorder traversal in result_inorder.
+
233 result_inorder = obj1.inorder(root);
+
234 std::cout << "Testcase #1: Inorder Traversal...";
+
235 for (auto i = 0; i < size; ++i) {
+
236 assert(actual_result_inorder[i] == result_inorder[i]);
+
237 }
+
238 std::cout << "Passed!" << std::endl;
+
239
+
240 // Calling preorder() function by passing a root node,
+
241 // and storing the preorder traversal in result_preorder.
+
242 result_preorder = obj1.preorder(root);
+
243 std::cout << "Testcase #1: Preorder Traversal...";
+
244 for (auto i = 0; i < size; ++i) {
+
245 assert(actual_result_preorder[i] == result_preorder[i]);
+
246 }
+
247 std::cout << "Passed!" << std::endl;
+
248
+
249 // Calling postorder() function by passing a root node,
+
250 // and storing the postorder traversal in result_postorder.
+
251 result_postorder = obj1.postorder(root);
+
252 std::cout << "Testcase #1: Postorder Traversal...";
+
253 for (auto i = 0; i < size; ++i) {
+
254 assert(actual_result_postorder[i] == result_postorder[i]);
+
255 }
+
256 std::cout << "Passed!" << std::endl;
+
257
+
258 std::cout << std::endl;
+
259 deleteAll(root);
+
260}
-
others::recursive_tree_traversals::BT
BT used to make the entire structure of the binary tree and the functions associated with the binary ...
Definition recursive_tree_traversal.cpp:87
-
others::recursive_tree_traversals::BT::createNewNode
Node * createNewNode(uint64_t)
will allocate the memory for a node and, along the data and return the node.
Definition recursive_tree_traversal.cpp:116
-
others::recursive_tree_traversals::BT::postorder
std::vector< uint64_t > postorder(Node *)
postorder function that will perform the postorder traversal recursively, and return the result vecto...
Definition recursive_tree_traversal.cpp:170
-
others::recursive_tree_traversals::BT::preorder
std::vector< uint64_t > preorder(Node *)
preorder function that will perform the preorder traversal recursively, and return the resultant vect...
Definition recursive_tree_traversal.cpp:150
+
others::recursive_tree_traversals::BT
BT used to make the entire structure of the binary tree and the functions associated with the binary ...
Definition recursive_tree_traversal.cpp:88
+
others::recursive_tree_traversals::BT::preorder
std::vector< std::uint64_t > preorder(Node *)
preorder function that will perform the preorder traversal recursively, and return the resultant vect...
Definition recursive_tree_traversal.cpp:152
+
others::recursive_tree_traversals::BT::postorder
std::vector< std::uint64_t > postorder(Node *)
postorder function that will perform the postorder traversal recursively, and return the result vecto...
Definition recursive_tree_traversal.cpp:172
+
others::recursive_tree_traversals::BT::createNewNode
Node * createNewNode(std::uint64_t)
will allocate the memory for a node and, along the data and return the node.
Definition recursive_tree_traversal.cpp:118
std::endl
T endl(T... args)
-
others::recursive_tree_traversals::Node
The structure to hold Nodes of the tree.
Definition recursive_tree_traversal.cpp:78
+ +
others::recursive_tree_traversals::Node
The structure to hold Nodes of the tree.
Definition recursive_tree_traversal.cpp:79
Here is the call graph for this function:
@@ -317,58 +352,62 @@ Here is the call graph for this function:

< result stores the inorder traversal of the binary tree

< result stores the preorder traversal of the binary tree

< result stores the postorder traversal of the binary tree

-
249 {
-
250 others::recursive_tree_traversals::BT obj2;
-
251 others::recursive_tree_traversals::Node *root = obj2.createNewNode(1);
-
252 root->left = obj2.createNewNode(2);
-
253 root->right = obj2.createNewNode(3);
-
254 root->left->left = obj2.createNewNode(4);
-
255 root->right->left = obj2.createNewNode(5);
-
256 root->right->right = obj2.createNewNode(6);
-
257 root->right->left->left = obj2.createNewNode(7);
-
258 root->right->left->right = obj2.createNewNode(8);
-
259
-
260 std::vector<uint64_t> actual_result_inorder{4, 2, 1, 7, 5, 8, 3, 6};
-
261 std::vector<uint64_t> actual_result_preorder{1, 2, 4, 3, 5, 7, 8, 6};
-
262 std::vector<uint64_t> actual_result_postorder{4, 2, 7, 8, 5, 6, 3, 1};
-
263 std::vector<uint64_t> result_inorder; ///< result stores the inorder
-
264 ///< traversal of the binary tree
-
265 std::vector<uint64_t> result_preorder; ///< result stores the preorder
-
266 ///< traversal of the binary tree
-
267 std::vector<uint64_t> result_postorder; ///< result stores the postorder
-
268 ///< traversal of the binary tree
-
269
-
270 uint64_t size = actual_result_inorder.size();
-
271
-
272 // Calling inorder() function by passing a root node,
-
273 // and storing the inorder traversal in result_inorder.
-
274 result_inorder = obj2.inorder(root);
-
275 std::cout << "Testcase #2: Inorder Traversal...";
-
276 for (auto i = 0; i < size; ++i) {
-
277 assert(actual_result_inorder[i] == result_inorder[i]);
-
278 }
-
279 std::cout << "Passed!" << std::endl;
-
280
-
281 // Calling preorder() function by passing a root node,
-
282 // and storing the preorder traversal in result_preorder.
-
283 result_preorder = obj2.preorder(root);
-
284 std::cout << "Testcase #2: Preorder Traversal...";
-
285 for (auto i = 0; i < size; ++i) {
-
286 assert(actual_result_preorder[i] == result_preorder[i]);
-
287 }
-
288 std::cout << "Passed!" << std::endl;
-
289
-
290 // Calling postorder() function by passing a root node,
-
291 // and storing the postorder traversal in result_postorder.
-
292 result_postorder = obj2.postorder(root);
-
293 std::cout << "Testcase #2: Postorder Traversal...";
-
294 for (auto i = 0; i < size; ++i) {
-
295 assert(actual_result_postorder[i] == result_postorder[i]);
-
296 }
-
297 std::cout << "Passed!" << std::endl;
-
298
-
299 std::cout << std::endl;
-
300}
+
266 {
+
267 others::recursive_tree_traversals::BT obj2;
+
268 others::recursive_tree_traversals::Node *root = obj2.createNewNode(1);
+
269 root->left = obj2.createNewNode(2);
+
270 root->right = obj2.createNewNode(3);
+
271 root->left->left = obj2.createNewNode(4);
+
272 root->right->left = obj2.createNewNode(5);
+
273 root->right->right = obj2.createNewNode(6);
+
274 root->right->left->left = obj2.createNewNode(7);
+
275 root->right->left->right = obj2.createNewNode(8);
+
276
+
277 std::vector<std::uint64_t> actual_result_inorder{4, 2, 1, 7, 5, 8, 3, 6};
+
278 std::vector<std::uint64_t> actual_result_preorder{1, 2, 4, 3, 5, 7, 8, 6};
+
279 std::vector<std::uint64_t> actual_result_postorder{4, 2, 7, 8, 5, 6, 3, 1};
+
280 std::vector<std::uint64_t>
+
281 result_inorder; ///< result stores the inorder
+
282 ///< traversal of the binary tree
+
283 std::vector<std::uint64_t>
+
284 result_preorder; ///< result stores the preorder
+
285 ///< traversal of the binary tree
+
286 std::vector<std::uint64_t>
+
287 result_postorder; ///< result stores the postorder
+
288 ///< traversal of the binary tree
+
289
+
290 std::uint64_t size = actual_result_inorder.size();
+
291
+
292 // Calling inorder() function by passing a root node,
+
293 // and storing the inorder traversal in result_inorder.
+
294 result_inorder = obj2.inorder(root);
+
295 std::cout << "Testcase #2: Inorder Traversal...";
+
296 for (auto i = 0; i < size; ++i) {
+
297 assert(actual_result_inorder[i] == result_inorder[i]);
+
298 }
+
299 std::cout << "Passed!" << std::endl;
+
300
+
301 // Calling preorder() function by passing a root node,
+
302 // and storing the preorder traversal in result_preorder.
+
303 result_preorder = obj2.preorder(root);
+
304 std::cout << "Testcase #2: Preorder Traversal...";
+
305 for (auto i = 0; i < size; ++i) {
+
306 assert(actual_result_preorder[i] == result_preorder[i]);
+
307 }
+
308 std::cout << "Passed!" << std::endl;
+
309
+
310 // Calling postorder() function by passing a root node,
+
311 // and storing the postorder traversal in result_postorder.
+
312 result_postorder = obj2.postorder(root);
+
313 std::cout << "Testcase #2: Postorder Traversal...";
+
314 for (auto i = 0; i < size; ++i) {
+
315 assert(actual_result_postorder[i] == result_postorder[i]);
+
316 }
+
317 std::cout << "Passed!" << std::endl;
+
318
+
319 std::cout << std::endl;
+
320 deleteAll(root);
+
321}
Here is the call graph for this function:
@@ -397,56 +436,60 @@ Here is the call graph for this function:

< result stores the inorder traversal of the binary tree

< result stores the preorder traversal of the binary tree

< result stores the postorder traversal of the binary tree

-
306 {
-
307 others::recursive_tree_traversals::BT obj3;
-
308 others::recursive_tree_traversals::Node *root = obj3.createNewNode(1);
-
309 root->left = obj3.createNewNode(2);
-
310 root->right = obj3.createNewNode(3);
-
311 root->left->left = obj3.createNewNode(4);
-
312 root->left->right = obj3.createNewNode(5);
-
313
-
314 std::vector<uint64_t> actual_result_inorder{4, 2, 5, 1, 3};
-
315 std::vector<uint64_t> actual_result_preorder{1, 2, 4, 5, 3};
-
316 std::vector<uint64_t> actual_result_postorder{4, 5, 2, 3, 1};
-
317 std::vector<uint64_t> result_inorder; ///< result stores the inorder
-
318 ///< traversal of the binary tree
-
319 std::vector<uint64_t> result_preorder; ///< result stores the preorder
-
320 ///< traversal of the binary tree
-
321 std::vector<uint64_t> result_postorder; ///< result stores the postorder
-
322 ///< traversal of the binary tree
-
323
-
324 uint64_t size = actual_result_inorder.size();
-
325
-
326 // Calling inorder() function by passing a root node,
-
327 // and storing the inorder traversal in result_inorder.
-
328
-
329 result_inorder = obj3.inorder(root);
-
330 std::cout << "Testcase #3: Inorder Traversal...";
-
331 for (auto i = 0; i < size; ++i) {
-
332 assert(actual_result_inorder[i] == result_inorder[i]);
-
333 }
-
334 std::cout << "Passed!" << std::endl;
-
335
-
336 // Calling preorder() function by passing a root node,
-
337 // and storing the preorder traversal in result_preorder.
-
338 result_preorder = obj3.preorder(root);
-
339 std::cout << "Testcase #3: Preorder Traversal...";
-
340 for (auto i = 0; i < size; ++i) {
-
341 assert(actual_result_preorder[i] == result_preorder[i]);
-
342 }
-
343 std::cout << "Passed!" << std::endl;
-
344
-
345 // Calling postorder() function by passing a root node,
-
346 // and storing the postorder traversal in result_postorder.
-
347 result_postorder = obj3.postorder(root);
-
348 std::cout << "Testcase #3: Postorder Traversal...";
-
349 for (auto i = 0; i < size; ++i) {
-
350 assert(actual_result_postorder[i] == result_postorder[i]);
-
351 }
-
352 std::cout << "Passed!" << std::endl;
-
353
-
354 std::cout << std::endl;
-
355}
+
327 {
+
328 others::recursive_tree_traversals::BT obj3;
+
329 others::recursive_tree_traversals::Node *root = obj3.createNewNode(1);
+
330 root->left = obj3.createNewNode(2);
+
331 root->right = obj3.createNewNode(3);
+
332 root->left->left = obj3.createNewNode(4);
+
333 root->left->right = obj3.createNewNode(5);
+
334
+
335 std::vector<std::uint64_t> actual_result_inorder{4, 2, 5, 1, 3};
+
336 std::vector<std::uint64_t> actual_result_preorder{1, 2, 4, 5, 3};
+
337 std::vector<std::uint64_t> actual_result_postorder{4, 5, 2, 3, 1};
+
338 std::vector<std::uint64_t>
+
339 result_inorder; ///< result stores the inorder
+
340 ///< traversal of the binary tree
+
341 std::vector<std::uint64_t>
+
342 result_preorder; ///< result stores the preorder
+
343 ///< traversal of the binary tree
+
344 std::vector<std::uint64_t>
+
345 result_postorder; ///< result stores the postorder
+
346 ///< traversal of the binary tree
+
347
+
348 std::uint64_t size = actual_result_inorder.size();
+
349
+
350 // Calling inorder() function by passing a root node,
+
351 // and storing the inorder traversal in result_inorder.
+
352
+
353 result_inorder = obj3.inorder(root);
+
354 std::cout << "Testcase #3: Inorder Traversal...";
+
355 for (auto i = 0; i < size; ++i) {
+
356 assert(actual_result_inorder[i] == result_inorder[i]);
+
357 }
+
358 std::cout << "Passed!" << std::endl;
+
359
+
360 // Calling preorder() function by passing a root node,
+
361 // and storing the preorder traversal in result_preorder.
+
362 result_preorder = obj3.preorder(root);
+
363 std::cout << "Testcase #3: Preorder Traversal...";
+
364 for (auto i = 0; i < size; ++i) {
+
365 assert(actual_result_preorder[i] == result_preorder[i]);
+
366 }
+
367 std::cout << "Passed!" << std::endl;
+
368
+
369 // Calling postorder() function by passing a root node,
+
370 // and storing the postorder traversal in result_postorder.
+
371 result_postorder = obj3.postorder(root);
+
372 std::cout << "Testcase #3: Postorder Traversal...";
+
373 for (auto i = 0; i < size; ++i) {
+
374 assert(actual_result_postorder[i] == result_postorder[i]);
+
375 }
+
376 std::cout << "Passed!" << std::endl;
+
377
+
378 std::cout << std::endl;
+
379 deleteAll(root);
+
380}
Here is the call graph for this function:
@@ -480,17 +523,17 @@ Here is the call graph for this function:

Self-test implementations.

Returns
void
-
361 {
-
362 std::cout << "1st test-case" << std::endl;
-
363 test1(); // run 1st test-case
-
364 std::cout << "2nd test-case" << std::endl;
-
365 test2(); // run 2nd test-case
-
366 std::cout << "3rd test-case" << std::endl;
-
367 test3(); // run 3rd test-case
-
368}
-
test2
void test2()
2nd test-case
Definition recursive_tree_traversal.cpp:249
-
test1
void test1()
1st test-case
Definition recursive_tree_traversal.cpp:191
-
test3
void test3()
3rd test-case
Definition recursive_tree_traversal.cpp:306
+
386 {
+
387 std::cout << "1st test-case" << std::endl;
+
388 test1(); // run 1st test-case
+
389 std::cout << "2nd test-case" << std::endl;
+
390 test2(); // run 2nd test-case
+
391 std::cout << "3rd test-case" << std::endl;
+
392 test3(); // run 3rd test-case
+
393}
+
test2
void test2()
2nd test-case
Definition recursive_tree_traversal.cpp:266
+
test1
void test1()
1st test-case
Definition recursive_tree_traversal.cpp:201
+
test3
void test3()
3rd test-case
Definition recursive_tree_traversal.cpp:327
Here is the call graph for this function:
diff --git a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map b/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map index ea0b65eb5..20f9eb75b 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map +++ b/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.map @@ -1,12 +1,12 @@ - + - + - + diff --git a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 b/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 index 5030a52a8..907d214db 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 +++ b/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.md5 @@ -1 +1 @@ -0b5bc193bdb810aa8fe0cfa6d7b9334e \ No newline at end of file +c7072df08cb5f99034991db3e499a77f \ No newline at end of file diff --git a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg index a88bbbb71..148c3730f 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg +++ b/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg @@ -31,7 +31,7 @@ Node2 - + others::recursive_tree _traversals::BT::createNewNode @@ -68,7 +68,7 @@ Node4 - + others::recursive_tree _traversals::BT::postorder @@ -87,7 +87,7 @@ Node5 - + others::recursive_tree _traversals::BT::preorder diff --git a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg index 57f46642c..854e9d15c 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg +++ b/dc/de1/recursive__tree__traversal_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg @@ -20,7 +20,7 @@ Node2 - + others::recursive_tree _traversals::BT::createNewNode @@ -57,7 +57,7 @@ Node4 - + others::recursive_tree _traversals::BT::postorder @@ -76,7 +76,7 @@ Node5 - + others::recursive_tree _traversals::BT::preorder diff --git a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map b/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map index 27f98d16e..a6eb006c1 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map +++ b/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.map @@ -1,12 +1,12 @@ - + - + - + diff --git a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 b/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 index 0259d085d..ada41932b 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 +++ b/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.md5 @@ -1 +1 @@ -8ff9455b3c103bbf869010f5c5b8fefb \ No newline at end of file +1b5ce80b47cd8b7f1d354d18b309e180 \ No newline at end of file diff --git a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg b/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg index f89e86751..f7373df85 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg +++ b/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph.svg @@ -31,7 +31,7 @@ Node2 - + others::recursive_tree _traversals::BT::createNewNode @@ -68,7 +68,7 @@ Node4 - + others::recursive_tree _traversals::BT::postorder @@ -87,7 +87,7 @@ Node5 - + others::recursive_tree _traversals::BT::preorder diff --git a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg b/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg index ffd31dcf1..4ae80b76f 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg +++ b/dc/de1/recursive__tree__traversal_8cpp_a1440a7779ac56f47a3f355ce4a8c7da0_cgraph_org.svg @@ -20,7 +20,7 @@ Node2 - + others::recursive_tree _traversals::BT::createNewNode @@ -57,7 +57,7 @@ Node4 - + others::recursive_tree _traversals::BT::postorder @@ -76,7 +76,7 @@ Node5 - + others::recursive_tree _traversals::BT::preorder diff --git a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map b/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map index bdb81a7ac..8d9dc0ecb 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map +++ b/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.map @@ -9,11 +9,11 @@ - + - + - + diff --git a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 b/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 index 6a51b39f1..0a8194218 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 +++ b/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.md5 @@ -1 +1 @@ -b04e038c7f1c7786c2d04a2a6b0ff779 \ No newline at end of file +d7adf2d125e93032f623b2d5accdde46 \ No newline at end of file diff --git a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg b/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg index 5a1a0214e..cf986e823 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg +++ b/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph.svg @@ -112,7 +112,7 @@ Node4 - + others::recursive_tree _traversals::BT::createNewNode @@ -131,7 +131,7 @@ Node5 - + others::recursive_tree _traversals::BT::postorder @@ -150,7 +150,7 @@ Node6 - + others::recursive_tree _traversals::BT::preorder diff --git a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg b/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg index 28b06bf07..25ee9ee71 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg +++ b/dc/de1/recursive__tree__traversal_8cpp_a483bb8ccf42aaf7375a83e91490eda1e_cgraph_org.svg @@ -101,7 +101,7 @@ Node4 - + others::recursive_tree _traversals::BT::createNewNode @@ -120,7 +120,7 @@ Node5 - + others::recursive_tree _traversals::BT::postorder @@ -139,7 +139,7 @@ Node6 - + others::recursive_tree _traversals::BT::preorder diff --git a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map b/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map index 9cf835e2b..ec28e293e 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map +++ b/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.map @@ -1,12 +1,12 @@ - + - + - + diff --git a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 b/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 index 945b2c179..0b62cf031 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 +++ b/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.md5 @@ -1 +1 @@ -8ea68ec079c1fb7f486fff24ad6a0b99 \ No newline at end of file +17089c21be1c8ab9e9937872bbc0da11 \ No newline at end of file diff --git a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg b/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg index 74f96575c..4ad20a4bb 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg +++ b/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph.svg @@ -31,7 +31,7 @@ Node2 - + others::recursive_tree _traversals::BT::createNewNode @@ -68,7 +68,7 @@ Node4 - + others::recursive_tree _traversals::BT::postorder @@ -87,7 +87,7 @@ Node5 - + others::recursive_tree _traversals::BT::preorder diff --git a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg b/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg index d771854c8..6c7f45a47 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg +++ b/dc/de1/recursive__tree__traversal_8cpp_a6d0455dd5c30adda100e95f0423c786e_cgraph_org.svg @@ -20,7 +20,7 @@ Node2 - + others::recursive_tree _traversals::BT::createNewNode @@ -57,7 +57,7 @@ Node4 - + others::recursive_tree _traversals::BT::postorder @@ -76,7 +76,7 @@ Node5 - + others::recursive_tree _traversals::BT::preorder diff --git a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map b/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map index 2d998e22a..5b53668a4 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map +++ b/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.map @@ -11,11 +11,11 @@ - + - + - + diff --git a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 b/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 index 0896ab94a..90514afb1 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 +++ b/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.md5 @@ -1 +1 @@ -c321b22c372c70b212591c4f6e6a111f \ No newline at end of file +6eae5e53b0353c094f1a38ef294ecd52 \ No newline at end of file diff --git a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg b/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg index 082fdb05d..f10e81d81 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg +++ b/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg @@ -166,7 +166,7 @@ var sectionId = 'dynsection-1'; Node5 - + others::recursive_tree _traversals::BT::createNewNode @@ -185,7 +185,7 @@ var sectionId = 'dynsection-1'; Node6 - + others::recursive_tree _traversals::BT::postorder @@ -204,7 +204,7 @@ var sectionId = 'dynsection-1'; Node7 - + others::recursive_tree _traversals::BT::preorder diff --git a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg b/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg index 2c6e603d0..683b98fde 100644 --- a/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg +++ b/dc/de1/recursive__tree__traversal_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph_org.svg @@ -119,7 +119,7 @@ Node5 - + others::recursive_tree _traversals::BT::createNewNode @@ -138,7 +138,7 @@ Node6 - + others::recursive_tree _traversals::BT::postorder @@ -157,7 +157,7 @@ Node7 - + others::recursive_tree _traversals::BT::preorder diff --git a/dd/dae/recursive__tree__traversal_8cpp__incl.map b/dd/dae/recursive__tree__traversal_8cpp__incl.map index 0d59482e1..2937afe4f 100644 --- a/dd/dae/recursive__tree__traversal_8cpp__incl.map +++ b/dd/dae/recursive__tree__traversal_8cpp__incl.map @@ -1,9 +1,11 @@ - + - - - - - + + + + + + + diff --git a/dd/dae/recursive__tree__traversal_8cpp__incl.md5 b/dd/dae/recursive__tree__traversal_8cpp__incl.md5 index 71079bf27..1ce7dec9a 100644 --- a/dd/dae/recursive__tree__traversal_8cpp__incl.md5 +++ b/dd/dae/recursive__tree__traversal_8cpp__incl.md5 @@ -1 +1 @@ -131f593b666abee697c3e7196b59f990 \ No newline at end of file +3de8a7bc149f9f6c66145097af2c74f1 \ No newline at end of file diff --git a/dd/dae/recursive__tree__traversal_8cpp__incl.svg b/dd/dae/recursive__tree__traversal_8cpp__incl.svg index cdc6e230e..d98af6bea 100644 --- a/dd/dae/recursive__tree__traversal_8cpp__incl.svg +++ b/dd/dae/recursive__tree__traversal_8cpp__incl.svg @@ -4,8 +4,8 @@ - + @@ -23,9 +23,9 @@ Node1 - -others/recursive_tree -_traversal.cpp + +others/recursive_tree +_traversal.cpp @@ -42,8 +42,8 @@ Node1->Node2 - - + + @@ -51,8 +51,8 @@ Node3 - -iostream + +cstdint @@ -60,8 +60,8 @@ Node1->Node3 - - + + @@ -69,8 +69,8 @@ Node4 - -vector + +iostream @@ -78,8 +78,26 @@ Node1->Node4 - - + + + + + + + +Node5 + + +vector + + + + + +Node1->Node5 + + + diff --git a/dd/dae/recursive__tree__traversal_8cpp__incl_org.svg b/dd/dae/recursive__tree__traversal_8cpp__incl_org.svg index 0f75f6647..954926162 100644 --- a/dd/dae/recursive__tree__traversal_8cpp__incl_org.svg +++ b/dd/dae/recursive__tree__traversal_8cpp__incl_org.svg @@ -4,17 +4,17 @@ - + others/recursive_tree_traversal.cpp Node1 - -others/recursive_tree -_traversal.cpp + +others/recursive_tree +_traversal.cpp @@ -31,8 +31,8 @@ Node1->Node2 - - + + @@ -40,8 +40,8 @@ Node3 - -iostream + +cstdint @@ -49,8 +49,8 @@ Node1->Node3 - - + + @@ -58,8 +58,8 @@ Node4 - -vector + +iostream @@ -67,8 +67,26 @@ Node1->Node4 - - + + + + + + + +Node5 + + +vector + + + + + +Node1->Node5 + + + diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html index 804881c26..99fb1f9e6 100644 --- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html +++ b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html @@ -117,40 +117,40 @@ $(function(){initNavTree('dd/de1/classothers_1_1recursive__tree__traversals_1_1_
Collaboration diagram for others::recursive_tree_traversals::BT:
-
+
[legend]
- - - - - - - - - - - + + + + + + + + + + +

Public Member Functions

Node * createNewNode (uint64_t)
 will allocate the memory for a node and, along the data and return the node.
 
std::vector< uint64_t > inorder (Node *)
 
std::vector< uint64_t > preorder (Node *)
 preorder function that will perform the preorder traversal recursively, and return the resultant vector that contain the preorder traversal of a tree.
 
std::vector< uint64_t > postorder (Node *)
 postorder function that will perform the postorder traversal recursively, and return the result vector that contain the postorder traversal of a tree.
 
Node * createNewNode (std::uint64_t)
 will allocate the memory for a node and, along the data and return the node.
 
std::vector< std::uint64_t > inorder (Node *)
 
std::vector< std::uint64_t > preorder (Node *)
 preorder function that will perform the preorder traversal recursively, and return the resultant vector that contain the preorder traversal of a tree.
 
std::vector< std::uint64_t > postorder (Node *)
 postorder function that will perform the postorder traversal recursively, and return the result vector that contain the postorder traversal of a tree.
 
- - - - - - + + + + + +

Public Attributes

-std::vector< uint64_t > inorder_result
 
-std::vector< uint64_t > preorder_result
 
-std::vector< uint64_t > postorder_result
 
+std::vector< std::uint64_t > inorder_result
 
+std::vector< std::uint64_t > preorder_result
 
+std::vector< std::uint64_t > postorder_result
 

Detailed Description

BT used to make the entire structure of the binary tree and the functions associated with the binary tree.

Member Function Documentation

- -

◆ createNewNode()

+ +

◆ createNewNode()

@@ -158,7 +158,7 @@ Public Attributes Node * others::recursive_tree_traversals::BT::createNewNode ( - uint64_t data) + std::uint64_t data) @@ -172,12 +172,12 @@ Public Attributes
Returns
pointer to the newly created node with assigned data.
-
116 {
-
117 Node *node = new Node();
-
118 node->data = data;
-
119 node->left = node->right = nullptr;
-
120 return node;
-
121}
+
118 {
+
119 Node *node = new Node();
+
120 node->data = data;
+
121 node->left = node->right = nullptr;
+
122 return node;
+
123}
node
struct node { int data; int height; struct node *left; struct node *right;} node
for std::queue
Definition avltree.cpp:13
data
int data[MAX]
test data
Definition hash_search.cpp:24
Node
Definition linkedlist_implentation_usingarray.cpp:14
@@ -185,43 +185,43 @@ Public Attributes
- -

◆ inorder()

+ +

◆ inorder()

- +
std::vector< uint64_t > others::recursive_tree_traversals::BT::inorder std::vector< std::uint64_t > others::recursive_tree_traversals::BT::inorder ( Node * root)
-
130 {
-
131 if (root == nullptr) { // return if the current node is empty
-
132 return {};
-
133 }
-
134
-
135 inorder(root->left); // Traverse the left subtree
-
136 BT::inorder_result.push_back(
-
137 root->data); // Display the data part of the root (or current node)
-
138 inorder(root->right); // Traverse the right subtree
-
139
-
140 return inorder_result;
-
141}
+
132 {
+
133 if (root == nullptr) { // return if the current node is empty
+
134 return {};
+
135 }
+
136
+
137 inorder(root->left); // Traverse the left subtree
+
138 BT::inorder_result.push_back(
+
139 root->data); // Display the data part of the root (or current node)
+
140 inorder(root->right); // Traverse the right subtree
+
141
+
142 return inorder_result;
+
143}
- -

◆ postorder()

+ +

◆ postorder()

- + @@ -237,35 +237,35 @@ Public Attributes
Returns
result that is containing the postorder traversal of a tree
-
170 {
-
171 if (root == nullptr) { // if the current node is empty
-
172 return {};
-
173 }
-
174
-
175 postorder(root->left); // Traverse the left subtree
-
176 postorder(root->right); // Traverse the right subtree
-
177 BT::postorder_result.push_back(
-
178 root->data); // Display the data part of the root (or current node)
-
179
-
180 return postorder_result;
-
181}
-
others::recursive_tree_traversals::BT::postorder
std::vector< uint64_t > postorder(Node *)
postorder function that will perform the postorder traversal recursively, and return the result vecto...
Definition recursive_tree_traversal.cpp:170
+
172 {
+
173 if (root == nullptr) { // if the current node is empty
+
174 return {};
+
175 }
+
176
+
177 postorder(root->left); // Traverse the left subtree
+
178 postorder(root->right); // Traverse the right subtree
+
179 BT::postorder_result.push_back(
+
180 root->data); // Display the data part of the root (or current node)
+
181
+
182 return postorder_result;
+
183}
+
others::recursive_tree_traversals::BT::postorder
std::vector< std::uint64_t > postorder(Node *)
postorder function that will perform the postorder traversal recursively, and return the result vecto...
Definition recursive_tree_traversal.cpp:172
Here is the call graph for this function:
-
+
- -

◆ preorder()

+ +

◆ preorder()

std::vector< uint64_t > others::recursive_tree_traversals::BT::postorder std::vector< std::uint64_t > others::recursive_tree_traversals::BT::postorder ( Node * root)
- + @@ -281,23 +281,23 @@ Here is the call graph for this function:
Returns
result that is containing the preorder traversal of a tree
-
150 {
-
151 if (root == nullptr) { // if the current node is empty
-
152 return {};
-
153 }
-
154
-
155 BT::preorder_result.push_back(
-
156 root->data); // Display the data part of the root (or current node)
-
157 preorder(root->left); // Traverse the left subtree
-
158 preorder(root->right); // Traverse the right subtree
-
159
-
160 return preorder_result;
-
161}
-
others::recursive_tree_traversals::BT::preorder
std::vector< uint64_t > preorder(Node *)
preorder function that will perform the preorder traversal recursively, and return the resultant vect...
Definition recursive_tree_traversal.cpp:150
+
152 {
+
153 if (root == nullptr) { // if the current node is empty
+
154 return {};
+
155 }
+
156
+
157 BT::preorder_result.push_back(
+
158 root->data); // Display the data part of the root (or current node)
+
159 preorder(root->left); // Traverse the left subtree
+
160 preorder(root->right); // Traverse the right subtree
+
161
+
162 return preorder_result;
+
163}
+
others::recursive_tree_traversals::BT::preorder
std::vector< std::uint64_t > preorder(Node *)
preorder function that will perform the preorder traversal recursively, and return the resultant vect...
Definition recursive_tree_traversal.cpp:152
Here is the call graph for this function:
-
+
diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.js b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.js index 4239abb37..e4756db86 100644 --- a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.js +++ b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.js @@ -1,6 +1,6 @@ var classothers_1_1recursive__tree__traversals_1_1_b_t = [ - [ "createNewNode", "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154", null ], - [ "postorder", "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5", null ], - [ "preorder", "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb", null ] + [ "createNewNode", "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114", null ], + [ "postorder", "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c", null ], + [ "preorder", "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5", null ] ]; \ No newline at end of file diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph.map b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.map similarity index 100% rename from dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph.map rename to dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.map diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph.md5 b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.md5 similarity index 100% rename from dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph.md5 rename to dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.md5 diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph.svg b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.svg similarity index 100% rename from dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph.svg rename to dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph.svg diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph_org.svg b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph_org.svg similarity index 100% rename from dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_abce10afbf9e16ce4a788af6b58abbebb_cgraph_org.svg rename to dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a6397b78ceec18cb1959a1d159e134da5_cgraph_org.svg diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a5224e6c2ba322b17cc2c3287b77742d5_cgraph.map b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.map similarity index 100% rename from dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a5224e6c2ba322b17cc2c3287b77742d5_cgraph.map rename to dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.map diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a5224e6c2ba322b17cc2c3287b77742d5_cgraph.md5 b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.md5 similarity index 100% rename from dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a5224e6c2ba322b17cc2c3287b77742d5_cgraph.md5 rename to dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.md5 diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a5224e6c2ba322b17cc2c3287b77742d5_cgraph.svg b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.svg similarity index 100% rename from dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a5224e6c2ba322b17cc2c3287b77742d5_cgraph.svg rename to dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph.svg diff --git a/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a5224e6c2ba322b17cc2c3287b77742d5_cgraph_org.svg b/dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph_org.svg similarity index 100% rename from dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_a5224e6c2ba322b17cc2c3287b77742d5_cgraph_org.svg rename to dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t_ac9404b65f407f631915515fa2e08a40c_cgraph_org.svg diff --git a/doxygen_crawl.html b/doxygen_crawl.html index e9a0c4a6c..589da33e7 100644 --- a/doxygen_crawl.html +++ b/doxygen_crawl.html @@ -2803,7 +2803,7 @@ - + @@ -3615,9 +3615,9 @@ - - - + + + diff --git a/functions_c.html b/functions_c.html index 8687a0a0a..c60b9b157 100644 --- a/functions_c.html +++ b/functions_c.html @@ -128,7 +128,7 @@ $(function(){initNavTree('functions_c.html',''); initResizable(true); });
  • contains() : binary_search_tree< T >, data_structures::Bitset, data_structures::BloomFilter< T >
  • Convexhull() : geometry::jarvis::Convexhull
  • count : data_structures::tree_234::Node
    • -
  • createNewNode() : others::iterative_tree_traversals::BinaryTree, others::recursive_tree_traversals::BT
    • +
  • createNewNode() : others::iterative_tree_traversals::BinaryTree, others::recursive_tree_traversals::BT
  • cumulative_distribution() : probability::geometric_dist::geometric_distribution
  • current_size : data_structures::stack_using_queue::Stack
    • diff --git a/functions_d.html b/functions_d.html index c46f14bba..a1846ed49 100644 --- a/functions_d.html +++ b/functions_d.html @@ -107,7 +107,7 @@ $(function(){initNavTree('functions_d.html',''); initResizable(true); });
    Here is a list of all documented class members with links to the class documentation for each member:

    - d -

    diff --git a/functions_func_p.html b/functions_func_p.html index 9d9841f15..919290cf6 100644 --- a/functions_func_p.html +++ b/functions_func_p.html @@ -111,11 +111,11 @@ $(function(){initNavTree('functions_func_p.html',''); initResizable(true); });
  • pop() : data_structures::Stack< T >, data_structures::stack_using_queue::Stack, stack< ValueType >
  • populate_parents() : graph::RootedTree
  • populate_up() : graph::LowestCommonAncestor
    • -
  • postorder() : others::recursive_tree_traversals::BT
    • +
  • postorder() : others::recursive_tree_traversals::BT
  • postOrderIterative() : others::iterative_tree_traversals::BinaryTree
  • predict() : machine_learning::adaline, machine_learning::k_nearest_neighbors::Knn
  • predict_words() : data_structures::trie_using_hashmap::Trie
    • -
  • preorder() : others::recursive_tree_traversals::BT
    • +
  • preorder() : others::recursive_tree_traversals::BT
  • preOrderIterative() : others::iterative_tree_traversals::BinaryTree
  • Print() : data_structures::tree_234::Tree234
  • print() : operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
    • diff --git a/functions_p.html b/functions_p.html index bbaeb2d08..1a9467266 100644 --- a/functions_p.html +++ b/functions_p.html @@ -118,11 +118,11 @@ $(function(){initNavTree('functions_p.html',''); initResizable(true); });
  • pop() : data_structures::Stack< T >, data_structures::stack_using_queue::Stack, stack< ValueType >
  • populate_parents() : graph::RootedTree
  • populate_up() : graph::LowestCommonAncestor
    • -
  • postorder() : others::recursive_tree_traversals::BT
    • +
  • postorder() : others::recursive_tree_traversals::BT
  • postOrderIterative() : others::iterative_tree_traversals::BinaryTree
  • predict() : machine_learning::adaline, machine_learning::k_nearest_neighbors::Knn
  • predict_words() : data_structures::trie_using_hashmap::Trie
    • -
  • preorder() : others::recursive_tree_traversals::BT
    • +
  • preorder() : others::recursive_tree_traversals::BT
  • preOrderIterative() : others::iterative_tree_traversals::BinaryTree
  • Print() : data_structures::tree_234::Tree234
  • print() : operations_on_datastructures::circular_linked_list::CircularLinkedList, operations_on_datastructures::reverse_binary_tree::BinaryTree
    • diff --git a/functions_vars.html b/functions_vars.html index baf9ca77d..de9f56f08 100644 --- a/functions_vars.html +++ b/functions_vars.html @@ -145,7 +145,7 @@ $(function(){initNavTree('functions_vars.html',''); initResizable(true); });

    - d -

      -
    • data : data_structures::Bitset, operations_on_datastructures::circular_linked_list::Node, operations_on_datastructures::inorder_traversal_of_bst::Node, operations_on_datastructures::reverse_binary_tree::Node, others::iterative_tree_traversals::Node, others::recursive_tree_traversals::Node, search::sublist_search::Node
      • +
    • data : data_structures::Bitset, operations_on_datastructures::circular_linked_list::Node, operations_on_datastructures::inorder_traversal_of_bst::Node, operations_on_datastructures::reverse_binary_tree::Node, others::iterative_tree_traversals::Node, others::recursive_tree_traversals::Node, search::sublist_search::Node
    • day : EasterYearMonthDay
    • depth : dsu, machine_learning::aystar_search::AyStarSearch< Puzzle >::Info
    • dist : graph::HKGraph
      • diff --git a/navtreeindex12.js b/navtreeindex12.js index d8cc03c3f..a3272e407 100644 --- a/navtreeindex12.js +++ b/navtreeindex12.js @@ -247,7 +247,7 @@ var NAVTREEINDEX12 = "dd/dca/class_f_c_f_s.html#abb361a612b18bb189aa6d3c49288b793":[10,0,32,1], "dd/dca/class_f_c_f_s.html#af2594e22a867b308e027623940193d46":[10,0,32,3], "dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html":[10,0,13,3,0], -"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154":[10,0,13,3,0,0], -"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5":[10,0,13,3,0,1], -"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb":[10,0,13,3,0,2] +"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5":[10,0,13,3,0,2], +"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c":[10,0,13,3,0,1], +"dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114":[10,0,13,3,0,0] }; diff --git a/navtreeindex9.js b/navtreeindex9.js index a315119b1..67e946e32 100644 --- a/navtreeindex9.js +++ b/navtreeindex9.js @@ -191,7 +191,7 @@ var NAVTREEINDEX9 = "d9/df4/namespacetests.html#abdd77344d4af8fd56d14a5cabbf2f669":[9,0,121,1], "d9/df4/namespacetests.html#af7b81d7a1534216af6a36a80135beb86":[9,0,121,4], "d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html":[10,0,13,3,1], -"d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a3b8c7ec2863de75916be027fa5287570":[10,0,13,3,1,0], +"d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade":[10,0,13,3,1,0], "d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a5a8a7bc2d2f847994220ae9e0b60fff3":[10,0,13,3,1,1], "d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#ab875304781a4eb9661c0931a6f1fae83":[10,0,13,3,1,2], "d9/dfd/comb__sort_8cpp.html":[11,0,22,3], diff --git a/search/all_15.js b/search/all_15.js index 0fd5e2031..b17c10566 100644 --- a/search/all_15.js +++ b/search/all_15.js @@ -84,7 +84,7 @@ var searchData= ['postfix_5fevaluation_81',['postfix_evaluation',['../d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1',1,'others::postfix_expression']]], ['postfix_5fevaluation_2ecpp_82',['postfix_evaluation.cpp',['../d7/d75/postfix__evaluation_8cpp.html',1,'']]], ['postfix_5fexpression_83',['postfix_expression',['../d4/de6/namespacepostfix__expression.html',1,'']]], - ['postorder_84',['postorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5',1,'others::recursive_tree_traversals::BT']]], + ['postorder_84',['postorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c',1,'others::recursive_tree_traversals::BT']]], ['postorder_20traversal_20of_20a_20tree_85',['Postorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md95',1,'Iterative Postorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md102',1,'Iterative Postorder Traversal of a tree']]], ['postorderiterative_86',['postOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25',1,'others::iterative_tree_traversals::BinaryTree']]], ['pow_87',['pow',['http://en.cppreference.com/w/cpp/numeric/math/pow.html',0,'std']]], @@ -101,7 +101,7 @@ var searchData= ['prefix_98',['prefix',['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::match_results::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wsmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::smatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wcmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::cmatch::prefix()']]], ['prefix_5fsum_5farray_99',['prefix_sum_array',['../d7/d88/namespaceprefix__sum__array.html',1,'']]], ['prefix_5fsum_5farray_2ecpp_100',['prefix_sum_array.cpp',['../d1/d9e/prefix__sum__array_8cpp.html',1,'']]], - ['preorder_101',['preorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb',1,'others::recursive_tree_traversals::BT']]], + ['preorder_101',['preorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5',1,'others::recursive_tree_traversals::BT']]], ['preorder_20traversal_20of_20a_20tree_102',['Preorder Traversal of a tree',['../d8/d90/iterative__tree__traversals_8cpp.html#autotoc_md94',1,'Iterative Preorder Traversal of a tree'],['../dc/de1/recursive__tree__traversal_8cpp.html#autotoc_md101',1,'Iterative Preorder Traversal of a tree']]], ['preorderiterative_103',['preOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae',1,'others::iterative_tree_traversals::BinaryTree']]], ['prev_104',['prev',['http://en.cppreference.com/w/cpp/iterator/prev.html',0,'std']]], diff --git a/search/all_1b.js b/search/all_1b.js index 34df21f24..ab8938795 100644 --- a/search/all_1b.js +++ b/search/all_1b.js @@ -32,35 +32,36 @@ var searchData= ['vector_3c_20std_3a_3astring_20_3e_29',['vector< std::string >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20std_3a_3atuple_3c_20int_2c_20int_2c_20int_20_3e_20_3e_30',['vector< std::tuple< int, int, int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_20_3e_31',['vector< std::tuple< S, T, E, double, double, double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avalarray_3c_20double_20_3e_20_3e_32',['vector< std::valarray< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avector_3c_20double_20_3e_20_3e_33',['vector< std::vector< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avector_3c_20int_20_3e_20_3e_34',['vector< std::vector< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e_35',['vector< std::vector< T > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20uint64_5ft_20_3e_36',['vector< uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20unsigned_20char_20_3e_37',['vector< unsigned char >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20unsigned_20int_20_3e_38',['vector< unsigned int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20x_20_3e_39',['vector< X >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_5fcross_40',['vector_cross',['../d4/d91/namespacevector__cross.html',1,'']]], - ['vector_5fcross_5fproduct_2ecpp_41',['vector_cross_product.cpp',['../df/d66/vector__cross__product_8cpp.html',1,'']]], - ['vector_5fdot_42',['vector_dot',['../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec',1,'qr_algorithm']]], - ['vector_5fimportant_5ffunctions_2ecpp_43',['vector_important_functions.cpp',['../d3/d61/vector__important__functions_8cpp.html',1,'']]], - ['vector_5fmag_44',['vector_mag',['../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f',1,'qr_algorithm']]], - ['vector_5fops_2ehpp_45',['vector_ops.hpp',['../d8/d95/vector__ops_8hpp.html',1,'']]], - ['vector_5fproj_46',['vector_proj',['../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc',1,'qr_algorithm']]], - ['vfprintf_47',['vfprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], - ['vfscanf_48',['vfscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], - ['vfwprintf_49',['vfwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], - ['vfwscanf_50',['vfwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]], - ['vigenere_51',['vigenere',['../d6/da2/namespacevigenere.html',1,'']]], - ['vigenere_5fcipher_2ecpp_52',['vigenere_cipher.cpp',['../dd/d12/vigenere__cipher_8cpp.html',1,'']]], - ['volume_2ecpp_53',['volume.cpp',['../da/d39/volume_8cpp.html',1,'']]], - ['vprintf_54',['vprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], - ['vscanf_55',['vscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], - ['vsnprintf_56',['vsnprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], - ['vsprintf_57',['vsprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], - ['vsscanf_58',['vsscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], - ['vswprintf_59',['vswprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], - ['vswscanf_60',['vswscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]], - ['vwprintf_61',['vwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], - ['vwscanf_62',['vwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]] + ['vector_3c_20std_3a_3auint64_5ft_20_3e_32',['vector< std::uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avalarray_3c_20double_20_3e_20_3e_33',['vector< std::valarray< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avector_3c_20double_20_3e_20_3e_34',['vector< std::vector< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avector_3c_20int_20_3e_20_3e_35',['vector< std::vector< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e_36',['vector< std::vector< T > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20uint64_5ft_20_3e_37',['vector< uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20unsigned_20char_20_3e_38',['vector< unsigned char >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20unsigned_20int_20_3e_39',['vector< unsigned int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20x_20_3e_40',['vector< X >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_5fcross_41',['vector_cross',['../d4/d91/namespacevector__cross.html',1,'']]], + ['vector_5fcross_5fproduct_2ecpp_42',['vector_cross_product.cpp',['../df/d66/vector__cross__product_8cpp.html',1,'']]], + ['vector_5fdot_43',['vector_dot',['../d2/d3b/namespaceqr__algorithm.html#a8ea313a1a1b5f9d0e3e332c29c6446ec',1,'qr_algorithm']]], + ['vector_5fimportant_5ffunctions_2ecpp_44',['vector_important_functions.cpp',['../d3/d61/vector__important__functions_8cpp.html',1,'']]], + ['vector_5fmag_45',['vector_mag',['../d2/d3b/namespaceqr__algorithm.html#ad16da2183db22378435042f26af43d5f',1,'qr_algorithm']]], + ['vector_5fops_2ehpp_46',['vector_ops.hpp',['../d8/d95/vector__ops_8hpp.html',1,'']]], + ['vector_5fproj_47',['vector_proj',['../d2/d3b/namespaceqr__algorithm.html#a6d3c7dce1f142141f509d09f6c0e25dc',1,'qr_algorithm']]], + ['vfprintf_48',['vfprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vfscanf_49',['vfscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], + ['vfwprintf_50',['vfwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], + ['vfwscanf_51',['vfwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]], + ['vigenere_52',['vigenere',['../d6/da2/namespacevigenere.html',1,'']]], + ['vigenere_5fcipher_2ecpp_53',['vigenere_cipher.cpp',['../dd/d12/vigenere__cipher_8cpp.html',1,'']]], + ['volume_2ecpp_54',['volume.cpp',['../da/d39/volume_8cpp.html',1,'']]], + ['vprintf_55',['vprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vscanf_56',['vscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], + ['vsnprintf_57',['vsnprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vsprintf_58',['vsprintf',['http://en.cppreference.com/w/cpp/io/c/vfprintf.html',0,'std']]], + ['vsscanf_59',['vsscanf',['http://en.cppreference.com/w/cpp/io/c/vfscanf.html',0,'std']]], + ['vswprintf_60',['vswprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], + ['vswscanf_61',['vswscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]], + ['vwprintf_62',['vwprintf',['http://en.cppreference.com/w/cpp/io/c/vfwprintf.html',0,'std']]], + ['vwscanf_63',['vwscanf',['http://en.cppreference.com/w/cpp/io/c/vfwscanf.html',0,'std']]] ]; diff --git a/search/all_8.js b/search/all_8.js index bc38abbc5..a35f9065c 100644 --- a/search/all_8.js +++ b/search/all_8.js @@ -162,7 +162,7 @@ var searchData= ['create_5fmatrix_159',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]], ['create_5fmessage_5fschedule_5farray_160',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]], ['create_5frandom_5farray_161',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'insertion_sort.cpp']]], - ['createnewnode_162',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154',1,'others::recursive_tree_traversals::BT::createNewNode()']]], + ['createnewnode_162',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114',1,'others::recursive_tree_traversals::BT::createNewNode()']]], ['createnode_163',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]], ['createset_164',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]], ['cref_165',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], diff --git a/search/all_9.js b/search/all_9.js index 83081bf0f..56c798c3c 100644 --- a/search/all_9.js +++ b/search/all_9.js @@ -1,6 +1,6 @@ var searchData= [ - ['data_0',['data',['../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73',1,'data_structures::Bitset::data'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1',1,'operations_on_datastructures::circular_linked_list::Node::data'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::data'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f',1,'operations_on_datastructures::reverse_binary_tree::Node::data'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f',1,'others::iterative_tree_traversals::Node::data'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a3b8c7ec2863de75916be027fa5287570',1,'others::recursive_tree_traversals::Node::data'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b',1,'search::sublist_search::Node::data'],['http://en.cppreference.com/w/cpp/container/dynarray/data.html',0,'std::dynarray::data()'],['http://en.cppreference.com/w/cpp/container/vector/data.html',0,'std::vector::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::basic_string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::wstring::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u16string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u32string::data()'],['http://en.cppreference.com/w/cpp/container/array/data.html',0,'std::array::data()'],['../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243',1,'data: hash_search.cpp']]], + ['data_0',['data',['../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73',1,'data_structures::Bitset::data'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1',1,'operations_on_datastructures::circular_linked_list::Node::data'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::data'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f',1,'operations_on_datastructures::reverse_binary_tree::Node::data'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f',1,'others::iterative_tree_traversals::Node::data'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade',1,'others::recursive_tree_traversals::Node::data'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b',1,'search::sublist_search::Node::data'],['http://en.cppreference.com/w/cpp/container/dynarray/data.html',0,'std::dynarray::data()'],['http://en.cppreference.com/w/cpp/container/vector/data.html',0,'std::vector::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::basic_string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::wstring::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u16string::data()'],['http://en.cppreference.com/w/cpp/string/basic_string/data.html',0,'std::u32string::data()'],['http://en.cppreference.com/w/cpp/container/array/data.html',0,'std::array::data()'],['../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243',1,'data: hash_search.cpp']]], ['data_20structure_20used_1',['Data Structure used',['../d3/db3/lru__cache_8cpp.html#autotoc_md99',1,'']]], ['data_20structures_2',['Data Structures',['../d5/d88/md__d_i_r_e_c_t_o_r_y.html#autotoc_md49',1,'']]], ['data_5fstructures_3',['data_structures',['../d5/d3c/namespacedata__structures.html',1,'']]], diff --git a/search/classes_15.js b/search/classes_15.js index 658306288..88a83cf5c 100644 --- a/search/classes_15.js +++ b/search/classes_15.js @@ -23,12 +23,13 @@ var searchData= ['vector_3c_20std_3a_3astring_20_3e_20',['vector< std::string >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20std_3a_3atuple_3c_20int_2c_20int_2c_20int_20_3e_20_3e_21',['vector< std::tuple< int, int, int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], ['vector_3c_20std_3a_3atuple_3c_20s_2c_20t_2c_20e_2c_20double_2c_20double_2c_20double_20_3e_20_3e_22',['vector< std::tuple< S, T, E, double, double, double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avalarray_3c_20double_20_3e_20_3e_23',['vector< std::valarray< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avector_3c_20double_20_3e_20_3e_24',['vector< std::vector< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avector_3c_20int_20_3e_20_3e_25',['vector< std::vector< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e_26',['vector< std::vector< T > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20uint64_5ft_20_3e_27',['vector< uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20unsigned_20char_20_3e_28',['vector< unsigned char >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20unsigned_20int_20_3e_29',['vector< unsigned int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], - ['vector_3c_20x_20_3e_30',['vector< X >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]] + ['vector_3c_20std_3a_3auint64_5ft_20_3e_23',['vector< std::uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avalarray_3c_20double_20_3e_20_3e_24',['vector< std::valarray< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avector_3c_20double_20_3e_20_3e_25',['vector< std::vector< double > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avector_3c_20int_20_3e_20_3e_26',['vector< std::vector< int > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20std_3a_3avector_3c_20t_20_3e_20_3e_27',['vector< std::vector< T > >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20uint64_5ft_20_3e_28',['vector< uint64_t >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20unsigned_20char_20_3e_29',['vector< unsigned char >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20unsigned_20int_20_3e_30',['vector< unsigned int >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]], + ['vector_3c_20x_20_3e_31',['vector< X >',['http://en.cppreference.com/w/cpp/container/vector.html',0,'std']]] ]; diff --git a/search/functions_10.js b/search/functions_10.js index ee8b67dc4..f166d483a 100644 --- a/search/functions_10.js +++ b/search/functions_10.js @@ -45,7 +45,7 @@ var searchData= ['position_42',['position',['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::match_results::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wsmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::smatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::wcmatch::position()'],['http://en.cppreference.com/w/cpp/regex/match_results/position.html',0,'std::cmatch::position()']]], ['positive_5fsign_43',['positive_sign',['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct_byname::positive_sign()'],['http://en.cppreference.com/w/cpp/locale/moneypunct/positive_sign.html',0,'std::moneypunct::positive_sign()']]], ['postfix_5fevaluation_44',['postfix_evaluation',['../d7/d75/postfix__evaluation_8cpp.html#ae38bd3a177a6d61da3859a281233bbe1',1,'others::postfix_expression']]], - ['postorder_45',['postorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a5224e6c2ba322b17cc2c3287b77742d5',1,'others::recursive_tree_traversals::BT']]], + ['postorder_45',['postorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#ac9404b65f407f631915515fa2e08a40c',1,'others::recursive_tree_traversals::BT']]], ['postorderiterative_46',['postOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a636a07c90b7f312bb86d2ec104efca25',1,'others::iterative_tree_traversals::BinaryTree']]], ['pow_47',['pow',['http://en.cppreference.com/w/cpp/numeric/math/pow.html',0,'std']]], ['power_48',['power',['../de/dc3/fibonacci__sum_8cpp.html#a7cf5feaf168b88e74544da59ed830311',1,'math::fibonacci_sum::power()'],['../df/d72/modular__division_8cpp.html#a66cdf93153cbd1408bd74ac68961d179',1,'math::modular_division::power()'],['../dd/d47/namespacemath.html#afcd07701d73ed65cd616bcba02737f3d',1,'math::power()'],['../df/def/power__for__huge__numbers_8cpp.html#ae249a2af508aa94266023ce8aa81426f',1,'power(int x, int n): power_for_huge_numbers.cpp'],['../d7/d35/matrix__exponentiation_8cpp.html#a702a9fc90e79b05b863cc4efa26ae2ec',1,'power(const vector< vector< ll > > &A, ll p): matrix_exponentiation.cpp']]], @@ -56,7 +56,7 @@ var searchData= ['predict_5fols_5fregressor_53',['predict_OLS_regressor',['../dc/d38/ordinary__least__squares__regressor_8cpp.html#ade6e463f37878fe2a219f927c65b5493',1,'ordinary_least_squares_regressor.cpp']]], ['predict_5fwords_54',['predict_words',['../d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html#ae15fdc7f2b5023992d87a711d78566c4',1,'data_structures::trie_using_hashmap::Trie']]], ['prefix_55',['prefix',['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::match_results::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wsmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::smatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::wcmatch::prefix()'],['http://en.cppreference.com/w/cpp/regex/match_results/prefix.html',0,'std::cmatch::prefix()']]], - ['preorder_56',['preorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#abce10afbf9e16ce4a788af6b58abbebb',1,'others::recursive_tree_traversals::BT']]], + ['preorder_56',['preorder',['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a6397b78ceec18cb1959a1d159e134da5',1,'others::recursive_tree_traversals::BT']]], ['preorderiterative_57',['preOrderIterative',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#ad4c6a8e67fb8267a65439b035666b5ae',1,'others::iterative_tree_traversals::BinaryTree']]], ['prev_58',['prev',['http://en.cppreference.com/w/cpp/iterator/prev.html',0,'std']]], ['prev_5fpermutation_59',['prev_permutation',['http://en.cppreference.com/w/cpp/algorithm/prev_permutation.html',0,'std']]], diff --git a/search/functions_3.js b/search/functions_3.js index f3fb9fdbc..5a17acdda 100644 --- a/search/functions_3.js +++ b/search/functions_3.js @@ -87,7 +87,7 @@ var searchData= ['create_5fmatrix_84',['create_matrix',['../de/d75/qr__eigen__values_8cpp.html#a9bbf469d5525a816b0d6ca812119093d',1,'qr_eigen_values.cpp']]], ['create_5fmessage_5fschedule_5farray_85',['create_message_schedule_array',['../d4/d08/sha256_8cpp.html#a525531b3939ed44fbf01674e21931b3a',1,'hashing::sha256']]], ['create_5frandom_5farray_86',['create_random_array',['../dd/d0d/insertion__sort_8cpp.html#a59914553f24088342c139645a02a8a49',1,'insertion_sort.cpp']]], - ['createnewnode_87',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#a08711eb2d741f4b51d980cff03b53154',1,'others::recursive_tree_traversals::BT::createNewNode()']]], + ['createnewnode_87',['createNewNode',['../d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html#a3078a5ccf45d6a7031dcf46e43de65b6',1,'others::iterative_tree_traversals::BinaryTree::createNewNode()'],['../dd/de1/classothers_1_1recursive__tree__traversals_1_1_b_t.html#af16da5fe0f5c54d31778d71d5a042114',1,'others::recursive_tree_traversals::BT::createNewNode()']]], ['createnode_88',['createNode',['../d8/dee/avltree_8cpp.html#a48d897353aeb6a721dbc6b6c57e035e6',1,'avltree.cpp']]], ['createset_89',['CreateSet',['../de/d23/disjoint__set_8cpp.html#a010965fc5f16cca5a62506afab24e4ec',1,'disjoint_set.cpp']]], ['cref_90',['cref',['http://en.cppreference.com/w/cpp/utility/functional/ref.html',0,'std']]], diff --git a/search/variables_4.js b/search/variables_4.js index 9058a0479..16f2caf14 100644 --- a/search/variables_4.js +++ b/search/variables_4.js @@ -1,6 +1,6 @@ var searchData= [ - ['data_0',['data',['../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73',1,'data_structures::Bitset::data'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1',1,'operations_on_datastructures::circular_linked_list::Node::data'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::data'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f',1,'operations_on_datastructures::reverse_binary_tree::Node::data'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f',1,'others::iterative_tree_traversals::Node::data'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a3b8c7ec2863de75916be027fa5287570',1,'others::recursive_tree_traversals::Node::data'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b',1,'search::sublist_search::Node::data'],['../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243',1,'data: hash_search.cpp']]], + ['data_0',['data',['../d9/dae/classdata__structures_1_1_bitset.html#ae86688cf99b77342deedb75149573e73',1,'data_structures::Bitset::data'],['../da/d16/structoperations__on__datastructures_1_1circular__linked__list_1_1_node.html#a7461292b8b91aed86404d0ab019dfdd1',1,'operations_on_datastructures::circular_linked_list::Node::data'],['../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2',1,'operations_on_datastructures::inorder_traversal_of_bst::Node::data'],['../d8/dfd/structoperations__on__datastructures_1_1reverse__binary__tree_1_1_node.html#ae54953a75091532303bb08d55087077f',1,'operations_on_datastructures::reverse_binary_tree::Node::data'],['../d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f',1,'others::iterative_tree_traversals::Node::data'],['../d9/df7/structothers_1_1recursive__tree__traversals_1_1_node.html#a59cc94ba784aeaefec2e915ddfdb1ade',1,'others::recursive_tree_traversals::Node::data'],['../da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b',1,'search::sublist_search::Node::data'],['../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243',1,'data: hash_search.cpp']]], ['day_1',['day',['../d1/df6/class_easter_year_month_day.html#ade0b934e5b1af24e19ff959673b2ec51',1,'EasterYearMonthDay']]], ['depth_2',['depth',['../dd/d1f/classdsu.html#a4bf54d33fba178998dbbe4c57f2e9429',1,'dsu::depth'],['../da/d70/structmachine__learning_1_1aystar__search_1_1_ay_star_search_1_1_info.html#a003a30bb165be50ce503c17df90c128d',1,'machine_learning::aystar_search::AyStarSearch::Info::depth']]], ['dist_3',['dist',['../d8/d69/classgraph_1_1_h_k_graph.html#a6a0228bbba3818447fcf6b56128b552a',1,'graph::HKGraph']]],
    std::vector< uint64_t > others::recursive_tree_traversals::BT::preorder std::vector< std::uint64_t > others::recursive_tree_traversals::BT::preorder ( Node * root)