diff --git a/annotated.html b/annotated.html
index fc5e39cb2..0b86381e2 100644
--- a/annotated.html
+++ b/annotated.html
@@ -151,63 +151,66 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
| ▼Noperations_on_datastructures | For std::priority_queue |
| ►Ntrie_operations | |
| CTnode | Class defining the structure of trie node and containing the methods to perform operations on them |
-| ▼Nothers | Other algorithms |
-| ►Npostfix_expression | |
-| CStack | Creates an array to be used as stack for storing values |
-| ▼Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
-| CEntry | |
-| ▼Nrange_queries | Algorithms and Data Structures that support range queries and updates |
-| ►Nheavy_light_decomposition | |
-| CTree | A Basic Tree, which supports binary lifting |
-| CSG | Segment Tree, to store heavy chains |
-| CHLD | The Heavy-Light Decomposition class |
-| ►CperSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min |
-| CNode | |
-| ▼Nstatistics | Statistical algorithms |
-| Cstats_computer1 | |
-| Cstats_computer2 | |
-| ▼Nstd | STL namespace |
-| Cis_integral< uint128_t > | |
-| Cis_arithmetic< uint128_t > | |
-| Cis_unsigned< uint128_t > | |
-| Cis_integral< uint256_t > | |
-| Cis_arithmetic< uint256_t > | |
-| Cis_unsigned< uint256_t > | |
-| ▼Cbinary_search_tree | The Binary Search Tree class |
-| Cbst_node | A struct to represent a node in the Binary Search Tree |
-| CBtree | |
-| Ccll | |
-| Ccompare | |
-| CComplex | Class Complex to represent complex numbers as a field |
-| CCycleCheck | |
-| Cdouble_linked_list | |
-| CEdge | |
-| CFenwickTree | |
-| CGraph | |
-| Chash_chain | Chain class with a given modulus |
-| CItem | |
-| Clarge_number | |
-| Clinkedlist | |
-| Clist | |
-| CMinHeap | |
-| CMinHeapNode | |
-| Cmst | |
-| CNode | |
-| Cnode | |
-| CPoint | |
-| Cquery | |
-| CQueue | |
-| Cqueue | |
-| CRBtree | |
-| CSegmentIntersection | |
-| CSolution | |
-| Cstack | |
-| Cstack_linkedList | |
-| Ctower | |
-| ▼CTrie | |
-| CTrieNode | |
-| Cuint128_t | Class for 128-bit unsigned integer |
-| Cuint256_t | Class for 256-bit unsigned integer |
+| ▼Nothers | For assert |
+| ►Niterative_tree_traversals | |
+| CNode | Defines the structure of a node of the tree |
+| CBinaryTree | Defines the functions associated with the binary tree |
+| ►Npostfix_expression | |
+| CStack | Creates an array to be used as stack for storing values |
+| ▼Nquadratic_probing | An implementation of hash table using quadratic probing algorithm |
+| CEntry | |
+| ▼Nrange_queries | Algorithms and Data Structures that support range queries and updates |
+| ►Nheavy_light_decomposition | |
+| CTree | A Basic Tree, which supports binary lifting |
+| CSG | Segment Tree, to store heavy chains |
+| CHLD | The Heavy-Light Decomposition class |
+| ►CperSegTree | Range query here is range sum, but the code can be modified to make different queries like range max or min |
+| CNode | |
+| ▼Nstatistics | Statistical algorithms |
+| Cstats_computer1 | |
+| Cstats_computer2 | |
+| ▼Nstd | STL namespace |
+| Cis_integral< uint128_t > | |
+| Cis_arithmetic< uint128_t > | |
+| Cis_unsigned< uint128_t > | |
+| Cis_integral< uint256_t > | |
+| Cis_arithmetic< uint256_t > | |
+| Cis_unsigned< uint256_t > | |
+| ▼Cbinary_search_tree | The Binary Search Tree class |
+| Cbst_node | A struct to represent a node in the Binary Search Tree |
+| CBtree | |
+| Ccll | |
+| Ccompare | |
+| CComplex | Class Complex to represent complex numbers as a field |
+| CCycleCheck | |
+| Cdouble_linked_list | |
+| CEdge | |
+| CFenwickTree | |
+| CGraph | |
+| Chash_chain | Chain class with a given modulus |
+| CItem | |
+| Clarge_number | |
+| Clinkedlist | |
+| Clist | |
+| CMinHeap | |
+| CMinHeapNode | |
+| Cmst | |
+| Cnode | |
+| CNode | |
+| CPoint | |
+| Cquery | |
+| CQueue | |
+| Cqueue | |
+| CRBtree | |
+| CSegmentIntersection | |
+| CSolution | |
+| Cstack | |
+| Cstack_linkedList | |
+| Ctower | |
+| ▼CTrie | |
+| CTrieNode | |
+| Cuint128_t | Class for 128-bit unsigned integer |
+| Cuint256_t | Class for 256-bit unsigned integer |
diff --git a/annotated_dup.js b/annotated_dup.js
index bc3dccd31..bcf14355b 100644
--- a/annotated_dup.js
+++ b/annotated_dup.js
@@ -76,6 +76,10 @@ var annotated_dup =
] ]
] ],
[ "others", "d0/d6f/namespaceothers.html", [
+ [ "iterative_tree_traversals", null, [
+ [ "Node", "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html", "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node" ],
+ [ "BinaryTree", "d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html", "d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree" ]
+ ] ],
[ "postfix_expression", null, [
[ "Stack", "d5/d8a/classothers_1_1postfix__expression_1_1_stack.html", "d5/d8a/classothers_1_1postfix__expression_1_1_stack" ]
] ]
@@ -121,8 +125,8 @@ var annotated_dup =
[ "MinHeap", "d2/d05/class_min_heap.html", "d2/d05/class_min_heap" ],
[ "MinHeapNode", "d5/d29/struct_min_heap_node.html", "d5/d29/struct_min_heap_node" ],
[ "mst", "d1/d77/structmst.html", "d1/d77/structmst" ],
- [ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ],
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
+ [ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ],
[ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ],
[ "query", "dd/d1b/structquery.html", "dd/d1b/structquery" ],
[ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ],
diff --git a/classes.html b/classes.html
index f227cd9e6..7b16c12ce 100644
--- a/classes.html
+++ b/classes.html
@@ -101,7 +101,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
adaline (machine_learning)AyStarSearch (machine_learning::aystar_search)
- B
-- binary_search_tree
- binary_search_tree::bst_node
- Btree
+binary_search_treeBinaryTree (others::iterative_tree_traversals)binary_search_tree::bst_nodeBtree
- C
- cll
- compare
- AyStarSearch::comparison_operator (machine_learning::aystar_search)
- Complex
- Convexhull (geometry::jarvis)
- CycleCheck
@@ -131,7 +131,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
MinHeapMinHeapNodemst
- N
-- NCRModuloP (math::ncr_modulo_p)
- NeuralNetwork (machine_learning::neural_network)
- Node (data_structures)
- Node (data_structures::tree_234)
- Trie::Node (data_structures::trie_using_hashmap)
- Node
- node
- perSegTree::Node (range_queries)
+NCRModuloP (math::ncr_modulo_p)NeuralNetwork (machine_learning::neural_network)Node (data_structures)Node (data_structures::tree_234)Trie::Node (data_structures::trie_using_hashmap)nodeNodeNode (others::iterative_tree_traversals)perSegTree::Node (range_queries)
- P
- perSegTree (range_queries)
- Point (ciphers::elliptic_curve_key_exchange)
- Point (geometry::jarvis)
- Point
diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
index 6be5d70c2..2deaa4f51 100644
--- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
+++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
@@ -1,7 +1,7 @@
-
diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
index 63e37e444..322676c08 100644
--- a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
+++ b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph_org.svg
@@ -1,7 +1,7 @@
-