diff --git a/annotated.html b/annotated.html
index 595063c0b..32da9c99f 100644
--- a/annotated.html
+++ b/annotated.html
@@ -136,53 +136,56 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
| ▼Nmath | For IO operations |
| ▼Nncr_modulo_p | |
| CNCRModuloP | Class which contains all methods required for calculating nCr mod p |
-| ▼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 | |
-| ▼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 | |
+| ▼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 | |
+| ▼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 | |
-| CPoint | |
-| Cquery | |
-| CQueue | |
+| CNode | |
+| CPoint | |
+| Cquery | |
| Cqueue | |
-| CSegmentIntersection | |
-| CSolution | |
-| Cstack | |
-| Cstack_linkedList | |
-| Ctower | |
-| ▼CTrie | |
-| CTrieNode | |
+| CQueue | |
+| CSegmentIntersection | |
+| CSolution | |
+| Cstack | |
+| Cstack_linkedList | |
+| Ctower | |
+| ▼CTrie | |
+| CTrieNode | |
diff --git a/annotated_dup.js b/annotated_dup.js
index 805c6690b..7e956dc62 100644
--- a/annotated_dup.js
+++ b/annotated_dup.js
@@ -57,6 +57,11 @@ var annotated_dup =
[ "NCRModuloP", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html", "d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p" ]
] ]
] ],
+ [ "operations_on_datastructures", "da/d6d/namespaceoperations__on__datastructures.html", [
+ [ "trie_operations", null, [
+ [ "Tnode", "d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html", "d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode" ]
+ ] ]
+ ] ],
[ "others", "d0/d6f/namespaceothers.html", [
[ "postfix_expression", null, [
[ "Stack", "d5/d8a/classothers_1_1postfix__expression_1_1_stack.html", "d5/d8a/classothers_1_1postfix__expression_1_1_stack" ]
@@ -95,12 +100,12 @@ 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" ],
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],
+ [ "Queue", "dc/db5/struct_queue.html", "dc/db5/struct_queue" ],
[ "SegmentIntersection", "d4/db4/struct_segment_intersection.html", "d4/db4/struct_segment_intersection" ],
[ "Solution", "dd/d4f/class_solution.html", "dd/d4f/class_solution" ],
[ "stack", "d1/dc2/classstack.html", "d1/dc2/classstack" ],
diff --git a/classes.html b/classes.html
index 36372575c..e3039cf8c 100644
--- a/classes.html
+++ b/classes.html
@@ -131,13 +131,13 @@ $(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)
- Node
- node
- perSegTree::Node (range_queries)
+NCRModuloP (math::ncr_modulo_p)NeuralNetwork (machine_learning::neural_network)Node (data_structures)Node (data_structures::tree_234)nodeNodeperSegTree::Node (range_queries)
- P
- perSegTree (range_queries)
- Point (geometry::jarvis)
- Point
- Q
-- query
- Queue
- queue
- Queue_Array (data_structures::queue_using_array)
+queryqueueQueueQueue_Array (data_structures::queue_using_array)
- R
- RootedTree (graph)
@@ -146,7 +146,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
SegmentIntersectionSG (range_queries::heavy_light_decomposition)SkipList (data_structures)SolutionStack (others::postfix_expression)stackstack_linkedListstats_computer1 (statistics)stats_computer2 (statistics)
- T
-- tower
- Tree (range_queries::heavy_light_decomposition)
- Tree234 (data_structures::tree_234)
- trie (data_structures)
- Trie
- Trie::TrieNode
+Tnode (operations_on_datastructures::trie_operations)towerTree (range_queries::heavy_light_decomposition)Tree234 (data_structures::tree_234)trie (data_structures)TrieTrie::TrieNode
diff --git a/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg b/d0/d01/smallest__circle_8cpp_a0283886819c7c140a023582b7269e2d0_cgraph.svg
index 7fcffa3f1..08028f955 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 3a8b5a505..a7ea5cddd 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 @@
-