backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 20:31:43 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 652c2d2650

Browse Source
This commit is contained in:
github-actions
2021-07-18 05:07:11 +00:00
parent 364c891304
commit cbca3ec1a9
374 changed files with 9709 additions and 7357 deletions
Download Patch File Download Diff File Expand all files Collapse all files

136
annotated.html
View File

@@ -148,73 +148,75 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
<tr id="row_7_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_7_" class="arrow" onclick="toggleFolder('7_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d47/namespacemath.html" target="_self">math</a></td><td class="desc">For IO operations </td></tr>
<tr id="row_7_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_7_0_" class="arrow" onclick="toggleFolder('7_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>ncr_modulo_p</b></td><td class="desc"></td></tr>
<tr id="row_7_0_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html" target="_self">NCRModuloP</a></td><td class="desc">Class which contains all methods required for calculating nCr mod p </td></tr>
<tr id="row_8_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/d6d/namespaceoperations__on__datastructures.html" target="_self">operations_on_datastructures</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a> </td></tr>
<tr id="row_8_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_8_0_" class="arrow" onclick="toggleFolder('8_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>trie_operations</b></td><td class="desc"></td></tr>
<tr id="row_8_0_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_9_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d6f/namespaceothers.html" target="_self">others</a></td><td class="desc">For <code>assert</code> </td></tr>
<tr id="row_9_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_9_0_" class="arrow" onclick="toggleFolder('9_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>iterative_tree_traversals</b></td><td class="desc"></td></tr>
<tr id="row_9_0_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
<tr id="row_9_0_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html" target="_self">BinaryTree</a></td><td class="desc">Defines the functions associated with the binary tree </td></tr>
<tr id="row_9_1_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_9_1_" class="arrow" onclick="toggleFolder('9_1_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>postfix_expression</b></td><td class="desc"></td></tr>
<tr id="row_9_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_10_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/dd2/namespacequadratic__probing.html" target="_self">quadratic_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Quadratic_probing">quadratic probing</a> algorithm </td></tr>
<tr id="row_10_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
<tr id="row_11_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_11_" class="arrow" onclick="toggleFolder('11_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d69/namespacerange__queries.html" target="_self">range_queries</a></td><td class="desc">Algorithms and Data Structures that support range queries and updates </td></tr>
<tr id="row_11_0_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_11_0_" class="arrow" onclick="toggleFolder('11_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>heavy_light_decomposition</b></td><td class="desc"></td></tr>
<tr id="row_11_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">Tree</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
<tr id="row_11_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">SG</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_11_0_2_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">HLD</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_11_1_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_11_1_" class="arrow" onclick="toggleFolder('11_1_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
<tr id="row_11_1_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_12_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_12_" class="arrow" onclick="toggleFolder('12_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</a></td><td class="desc">Search algorithms </td></tr>
<tr id="row_12_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_12_0_" class="arrow" onclick="toggleFolder('12_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>sublist_search</b></td><td class="desc"></td></tr>
<tr id="row_12_0_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_13_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_13_" class="arrow" onclick="toggleFolder('13_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
<tr id="row_13_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
<tr id="row_13_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr>
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dcc/namespacestd.html" target="_self">std</a></td><td class="desc">STL namespace </td></tr>
<tr id="row_14_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_4_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_15_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_15_" class="arrow" onclick="toggleFolder('15_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/classbinary__search__tree.html" target="_self">binary_search_tree</a></td><td class="desc">The Binary Search Tree class </td></tr>
<tr id="row_15_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html" target="_self">bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </td></tr>
<tr id="row_16_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr>
<tr id="row_17_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr>
<tr id="row_18_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_19_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
<tr id="row_20_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
<tr id="row_21_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
<tr id="row_22_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
<tr id="row_23_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
<tr id="row_24_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_25_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
<tr id="row_26_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
<tr id="row_27_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
<tr id="row_28_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
<tr id="row_29_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_30_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
<tr id="row_31_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_32_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
<tr id="row_33_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
<tr id="row_34_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_35_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_36_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_37_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
<tr id="row_38_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_39_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_40_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_41_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_42_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc"></td></tr>
<tr id="row_43_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_44_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_45_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_46_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_46_" class="arrow" onclick="toggleFolder('46_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_46_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_47_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_48_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_8_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_8_" class="arrow" onclick="toggleFolder('8_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="da/d6d/namespaceoperations__on__datastructures.html" target="_self">operations_on_datastructures</a></td><td class="desc">For <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </td></tr>
<tr id="row_8_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_8_0_" class="arrow" onclick="toggleFolder('8_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>inorder_traversal_of_bst</b></td><td class="desc"></td></tr>
<tr id="row_8_0_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST </td></tr>
<tr id="row_8_1_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_8_1_" class="arrow" onclick="toggleFolder('8_1_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>trie_operations</b></td><td class="desc"></td></tr>
<tr id="row_8_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_9_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_9_" class="arrow" onclick="toggleFolder('9_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d0/d6f/namespaceothers.html" target="_self">others</a></td><td class="desc">For <code>assert</code> </td></tr>
<tr id="row_9_0_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_9_0_" class="arrow" onclick="toggleFolder('9_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>iterative_tree_traversals</b></td><td class="desc"></td></tr>
<tr id="row_9_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
<tr id="row_9_0_1_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d12/classothers_1_1iterative__tree__traversals_1_1_binary_tree.html" target="_self">BinaryTree</a></td><td class="desc">Defines the functions associated with the binary tree </td></tr>
<tr id="row_9_1_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_9_1_" class="arrow" onclick="toggleFolder('9_1_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>postfix_expression</b></td><td class="desc"></td></tr>
<tr id="row_9_1_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_10_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_10_" class="arrow" onclick="toggleFolder('10_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d4/dd2/namespacequadratic__probing.html" target="_self">quadratic_probing</a></td><td class="desc">An implementation of hash table using <a href="https://en.wikipedia.org/wiki/Quadratic_probing">quadratic probing</a> algorithm </td></tr>
<tr id="row_10_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/dd1/structquadratic__probing_1_1_entry.html" target="_self">Entry</a></td><td class="desc"></td></tr>
<tr id="row_11_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_11_" class="arrow" onclick="toggleFolder('11_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="dd/d69/namespacerange__queries.html" target="_self">range_queries</a></td><td class="desc">Algorithms and Data Structures that support range queries and updates </td></tr>
<tr id="row_11_0_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_11_0_" class="arrow" onclick="toggleFolder('11_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>heavy_light_decomposition</b></td><td class="desc"></td></tr>
<tr id="row_11_0_0_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">Tree</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
<tr id="row_11_0_1_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">SG</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_11_0_2_" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">HLD</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_11_1_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_11_1_" class="arrow" onclick="toggleFolder('11_1_')">&#9658;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
<tr id="row_11_1_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_12_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_12_" class="arrow" onclick="toggleFolder('12_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d9/dca/namespacesearch.html" target="_self">search</a></td><td class="desc">Search algorithms </td></tr>
<tr id="row_12_0_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span id="arr_12_0_" class="arrow" onclick="toggleFolder('12_0_')">&#9658;</span><span class="icona"><span class="icon">N</span></span><b>sublist_search</b></td><td class="desc"></td></tr>
<tr id="row_12_0_0_" class="even" style="display:none;"><td class="entry"><span style="width:48px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_13_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_13_" class="arrow" onclick="toggleFolder('13_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d2/dcf/namespacestatistics.html" target="_self">statistics</a></td><td class="desc">Statistical algorithms </td></tr>
<tr id="row_13_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">stats_computer1</a></td><td class="desc"></td></tr>
<tr id="row_13_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">stats_computer2</a></td><td class="desc"></td></tr>
<tr id="row_14_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">&#9660;</span><span class="icona"><span class="icon">N</span></span><a class="el" href="d8/dcc/namespacestd.html" target="_self">std</a></td><td class="desc">STL namespace </td></tr>
<tr id="row_14_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_3_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_4_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_14_5_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_15_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_15_" class="arrow" onclick="toggleFolder('15_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dde/classbinary__search__tree.html" target="_self">binary_search_tree</a></td><td class="desc">The Binary Search Tree class </td></tr>
<tr id="row_15_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html" target="_self">bst_node</a></td><td class="desc">A struct to represent a node in the Binary Search Tree </td></tr>
<tr id="row_16_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d90/struct_btree.html" target="_self">Btree</a></td><td class="desc"></td></tr>
<tr id="row_17_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d15/classcll.html" target="_self">cll</a></td><td class="desc"></td></tr>
<tr id="row_18_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/db3/structcompare.html" target="_self">compare</a></td><td class="desc"></td></tr>
<tr id="row_19_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d5a/class_complex.html" target="_self">Complex</a></td><td class="desc">Class <a class="el" href="da/d5a/class_complex.html" title="Class Complex to represent complex numbers as a field.">Complex</a> to represent complex numbers as a field </td></tr>
<tr id="row_20_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/dbb/class_cycle_check.html" target="_self">CycleCheck</a></td><td class="desc"></td></tr>
<tr id="row_21_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/dee/classdouble__linked__list.html" target="_self">double_linked_list</a></td><td class="desc"></td></tr>
<tr id="row_22_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d77/class_edge.html" target="_self">Edge</a></td><td class="desc"></td></tr>
<tr id="row_23_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d91/class_fenwick_tree.html" target="_self">FenwickTree</a></td><td class="desc"></td></tr>
<tr id="row_24_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d9a/class_graph.html" target="_self">Graph</a></td><td class="desc"></td></tr>
<tr id="row_25_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1c/classhash__chain.html" target="_self">hash_chain</a></td><td class="desc">Chain class with a given modulus </td></tr>
<tr id="row_26_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d66/struct_item.html" target="_self">Item</a></td><td class="desc"></td></tr>
<tr id="row_27_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d82/classlarge__number.html" target="_self">large_number</a></td><td class="desc"></td></tr>
<tr id="row_28_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/dff/structlinkedlist.html" target="_self">linkedlist</a></td><td class="desc"></td></tr>
<tr id="row_29_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d10/structlist.html" target="_self">list</a></td><td class="desc"></td></tr>
<tr id="row_30_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d05/class_min_heap.html" target="_self">MinHeap</a></td><td class="desc"></td></tr>
<tr id="row_31_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d29/struct_min_heap_node.html" target="_self">MinHeapNode</a></td><td class="desc"></td></tr>
<tr id="row_32_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d77/structmst.html" target="_self">mst</a></td><td class="desc"></td></tr>
<tr id="row_33_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_34_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node</a></td><td class="desc"></td></tr>
<tr id="row_35_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_36_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_37_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue</a></td><td class="desc"></td></tr>
<tr id="row_38_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_39_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_40_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_41_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_42_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack</a></td><td class="desc"></td></tr>
<tr id="row_43_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_44_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_45_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_46_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_46_" class="arrow" onclick="toggleFolder('46_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_46_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_47_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_48_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

5
annotated_dup.js
View File

@@ -71,6 +71,9 @@ var annotated_dup =
] ]
] ],
[ "operations_on_datastructures", "da/d6d/namespaceoperations__on__datastructures.html", [
[ "inorder_traversal_of_bst", null, [
[ "Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node" ]
] ],
[ "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" ]
] ]
@@ -130,8 +133,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", "d5/da1/structnode.html", "d5/da1/structnode" ],
[ "Node", "db/d8b/struct_node.html", "db/d8b/struct_node" ],
[ "node", "d5/da1/structnode.html", "d5/da1/structnode" ],
[ "Point", "d8/dc8/struct_point.html", "d8/dc8/struct_point" ],
[ "query", "dd/d1b/structquery.html", "dd/d1b/structquery" ],
[ "queue", "db/da9/classqueue.html", "db/da9/classqueue" ],

2
classes.html
View File

@@ -131,7 +131,7 @@ $(document).ready(function(){initNavTree('classes.html',''); initResizable(); })
<dd><a class="el" href="d2/d05/class_min_heap.html">MinHeap</a></dd><dd><a class="el" href="d5/d29/struct_min_heap_node.html">MinHeapNode</a></dd><dd><a class="el" href="d1/d77/structmst.html">mst</a></dd></dl>
<dl class="classindex odd">
<dt class="alphachar"><a name="letter_N">N</a></dt>
<dd><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">NCRModuloP</a> (math::ncr_modulo_p)</dd><dd><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)</dd><dd><a class="el" href="d9/d49/structdata__structures_1_1_node.html">Node</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> (data_structures::tree_234)</dd><dd><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Trie::Node</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="d5/da1/structnode.html">node</a></dd><dd><a class="el" href="db/d8b/struct_node.html">Node</a></dd><dd><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">perSegTree::Node</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> (search::sublist_search)</dd></dl>
<dd><a class="el" href="d6/dc1/classmath_1_1ncr__modulo__p_1_1_n_c_r_modulo_p.html">NCRModuloP</a> (math::ncr_modulo_p)</dd><dd><a class="el" href="d4/df4/classmachine__learning_1_1neural__network_1_1_neural_network.html">NeuralNetwork</a> (machine_learning::neural_network)</dd><dd><a class="el" href="d9/d49/structdata__structures_1_1_node.html">Node</a> (<a class="el" href="d5/d3c/namespacedata__structures.html">data_structures</a>)</dd><dd><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html">Node</a> (data_structures::tree_234)</dd><dd><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html">Trie::Node</a> (data_structures::trie_using_hashmap)</dd><dd><a class="el" href="db/d8b/struct_node.html">Node</a></dd><dd><a class="el" href="d5/da1/structnode.html">node</a></dd><dd><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> (operations_on_datastructures::inorder_traversal_of_bst)</dd><dd><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html">Node</a> (others::iterative_tree_traversals)</dd><dd><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html">perSegTree::Node</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html">Node</a> (search::sublist_search)</dd></dl>
<dl class="classindex even">
<dt class="alphachar"><a name="letter_P">P</a></dt>
<dd><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html">perSegTree</a> (<a class="el" href="dd/d69/namespacerange__queries.html">range_queries</a>)</dd><dd><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html">Point</a> (<a class="el" href="df/d6b/namespaceciphers_1_1elliptic__curve__key__exchange.html">ciphers::elliptic_curve_key_exchange</a>)</dd><dd><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html">Point</a> (geometry::jarvis)</dd><dd><a class="el" href="d8/dc8/struct_point.html">Point</a></dd></dl>

12
d1/daa/random__pivot__quick__sort_8cpp.html
View File

@@ -164,19 +164,19 @@ Functions</h2></td></tr>
<li>Where in quick sort is fast, but still can give you the time complexity of O(n^2) in worst case.</li>
<li>To avoid hitting the time complexity of O(n^2), we use the logic of randomize the selection process of pivot element.</li>
</ul>
<h3><a class="anchor" id="autotoc_md88"></a>
<h3><a class="anchor" id="autotoc_md92"></a>
Logic</h3>
<ul>
<li>The logic is pretty simple, the only change is in the partitioning algorithm, which is selecting the pivot element.</li>
<li>Instead of selecting the last or the first element from array for pivot we use a random index to select pivot element.</li>
<li>This avoids hitting the O(n^2) time complexity in practical use cases.</li>
</ul>
<h3><a class="anchor" id="autotoc_md89"></a>
<h3><a class="anchor" id="autotoc_md93"></a>
Partition Logic</h3>
<ul>
<li>Partitions are done such as numbers lower than the "pivot" element is arranged on the left side of the "pivot", and number larger than the "pivot" element are arranged on the right part of the array.</li>
</ul>
<h3><a class="anchor" id="autotoc_md90"></a>
<h3><a class="anchor" id="autotoc_md94"></a>
Algorithm</h3>
<ul>
<li>Select the pivot element randomly using <a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp.html#aac5657b4fe2251cd21073f44233f6ea5" title="Takes the start and end indices of an array and returns a random int64_teger between the range of tho...">getRandomIndex()</a> function from this namespace.</li>
@@ -607,12 +607,12 @@ Here is the call graph for this function:</div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html">TestCases</a> tc = <a class="code" href="../../d5/d58/class_test_cases.html">TestCases</a>();</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160; tc.<a class="code" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>();</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160;}</div>
<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:153</div></div>
<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:171</div></div>
<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:225</div></div>
<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:243</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="443"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="442"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>

7
d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
View File

@@ -1,12 +1,11 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Main function." alt="" coords="5,55,56,81"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="863,43,935,69"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="816,43,888,69"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/array/size.html#" title=" " alt="" coords="104,55,213,81"/>
<area shape="rect" id="node4" href="$d1/daa/random__pivot__quick__sort_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="137,131,181,157"/>
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="261,137,404,164"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="682,144,791,171"/>
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, Only contains one element." alt="" coords="452,144,611,171"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="659,144,768,171"/>
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="452,144,611,171"/>
<area shape="rect" id="node8" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="452,195,611,221"/>
<area shape="rect" id="node9" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="452,245,611,272"/>
<area shape="rect" id="node10" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="659,245,815,272"/>
</map>

2
d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
View File

@@ -1 +1 @@
6573e351d172d8b938d1a6d0851eb3ae
9b085284bdb446d13903a4e92d32bbd2

57
d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
View File

@@ -46,7 +46,7 @@ if (edges && edges.length) {
</defs>
<script type="text/javascript">
var viewWidth = 705;
var viewWidth = 670;
var viewHeight = 208;
var sectionId = 'dynsection-3';
</script>
@@ -54,7 +54,7 @@ var sectionId = 'dynsection-3';
<svg id="graph" class="graph">
<g id="viewport">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-204 701,-204 701,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-204 666,-204 666,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
@@ -68,16 +68,16 @@ var sectionId = 'dynsection-3';
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="643,-152.5 643,-171.5 697,-171.5 697,-152.5 643,-152.5"/>
<text text-anchor="middle" x="670" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="black" points="608,-152.5 608,-171.5 662,-171.5 662,-152.5 608,-152.5"/>
<text text-anchor="middle" x="635" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.25,-160.32C48.6,-164.24 61.87,-168.9 74,-172 148.4,-191.04 167.71,-200 244.5,-200 244.5,-200 244.5,-200 395.5,-200 481.16,-200 580.49,-181.49 632.67,-170.3"/>
<polygon fill="midnightblue" stroke="midnightblue" points="633.74,-173.65 642.77,-168.11 632.25,-166.81 633.74,-173.65"/>
<path fill="none" stroke="midnightblue" d="M38.25,-160.32C48.6,-164.24 61.87,-168.9 74,-172 148.4,-191.04 167.71,-200 244.5,-200 244.5,-200 244.5,-200 395.5,-200 468,-200 551.38,-182.66 597.86,-171.41"/>
<polygon fill="midnightblue" stroke="midnightblue" points="598.88,-174.76 607.75,-168.97 597.2,-167.97 598.88,-174.76"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
@@ -127,28 +127,28 @@ var sectionId = 'dynsection-3';
<!-- Node5&#45;&gt;Node2 -->
<g id="edge5" class="edge">
<title>Node5&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M270.53,-100.64C288.12,-107.32 312.7,-115.91 335,-121 441.6,-145.34 570.87,-156.01 632.67,-159.98"/>
<polygon fill="midnightblue" stroke="midnightblue" points="632.5,-163.48 642.7,-160.61 632.94,-156.49 632.5,-163.48"/>
<path fill="none" stroke="midnightblue" d="M270.55,-100.54C288.15,-107.18 312.74,-115.75 335,-121 428.18,-142.97 540.67,-154.47 597.44,-159.25"/>
<polygon fill="midnightblue" stroke="midnightblue" points="597.44,-162.76 607.7,-160.09 598.02,-155.78 597.44,-162.76"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="507.5,-76.5 507.5,-95.5 589.5,-95.5 589.5,-76.5 507.5,-76.5"/>
<text text-anchor="middle" x="548.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
<polygon fill="white" stroke="black" points="490,-76.5 490,-95.5 572,-95.5 572,-76.5 490,-76.5"/>
<text text-anchor="middle" x="531" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M297.82,-100.51C309.96,-102.38 322.9,-104.05 335,-105 387.73,-109.14 401.38,-110.29 454,-105 469,-103.49 485.15,-100.65 499.74,-97.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="500.51,-101.04 509.55,-95.51 499.04,-94.19 500.51,-101.04"/>
<path fill="none" stroke="midnightblue" d="M297.82,-100.51C309.96,-102.38 322.9,-104.05 335,-105 387.73,-109.14 401.51,-111.46 454,-105 465.69,-103.56 478.17,-100.92 489.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="490.48,-101.44 499.26,-95.51 488.7,-94.67 490.48,-101.44"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="335,-76.5 335,-95.5 454,-95.5 454,-76.5 335,-76.5"/>
<text text-anchor="middle" x="394.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
@@ -193,41 +193,26 @@ var sectionId = 'dynsection-3';
<!-- Node6&#45;&gt;Node2 -->
<g id="edge7" class="edge">
<title>Node6&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M564.63,-95.63C585.02,-108.59 621.49,-131.79 645.47,-147.04"/>
<polygon fill="midnightblue" stroke="midnightblue" points="643.67,-150.04 653.99,-152.45 647.43,-144.13 643.67,-150.04"/>
<path fill="none" stroke="midnightblue" d="M544.92,-95.63C562.09,-108.42 592.63,-131.17 613.1,-146.43"/>
<polygon fill="midnightblue" stroke="midnightblue" points="611.08,-149.28 621.19,-152.45 615.26,-143.67 611.08,-149.28"/>
</g>
<!-- Node7&#45;&gt;Node6 -->
<g id="edge9" class="edge">
<title>Node7&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M454.27,-86C468.38,-86 483.33,-86 497.03,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="497.23,-89.5 507.22,-86 497.22,-82.5 497.23,-89.5"/>
<path fill="none" stroke="midnightblue" d="M454.1,-86C462.56,-86 471.21,-86 479.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="479.76,-89.5 489.76,-86 479.76,-82.5 479.76,-89.5"/>
</g>
<!-- Node8&#45;&gt;Node6 -->
<g id="edge11" class="edge">
<title>Node8&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M433.86,-57.59C453.82,-62.58 478.43,-68.73 499.63,-74.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="498.87,-77.45 509.42,-76.48 500.57,-70.66 498.87,-77.45"/>
<path fill="none" stroke="midnightblue" d="M429.44,-57.59C446.72,-62.47 467.93,-68.46 486.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="485.5,-77.06 496.07,-76.41 487.4,-70.33 485.5,-77.06"/>
</g>
<!-- Node9&#45;&gt;Node6 -->
<g id="edge13" class="edge">
<title>Node9&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M429.43,-19.54C437.61,-22.24 446.24,-25.43 454,-29 479.83,-40.87 507.39,-58.32 525.84,-70.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="523.89,-73.69 534.12,-76.45 527.85,-67.92 523.89,-73.69"/>
</g>
<!-- Node10 -->
<g id="node10" class="node">
<title>Node10</title>
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="490,-0.5 490,-19.5 607,-19.5 607,-0.5 490,-0.5"/>
<text text-anchor="middle" x="548.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node10 -->
<g id="edge14" class="edge">
<title>Node9&#45;&gt;Node10</title>
<path fill="none" stroke="midnightblue" d="M454.27,-10C462.58,-10 471.19,-10 479.66,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="479.89,-13.5 489.89,-10 479.89,-6.5 479.89,-13.5"/>
<path fill="none" stroke="midnightblue" d="M431.22,-19.53C438.93,-22.15 446.89,-25.31 454,-29 475.29,-40.05 496.92,-56.95 511.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="509.6,-72.35 519.44,-76.27 514.2,-67.07 509.6,-72.35"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 15 KiB

After

Width:  |  Height:  |  Size: 14 KiB

59
d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
View File

@@ -4,11 +4,11 @@
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: main Pages: 1 -->
<svg width="705pt" height="208pt"
viewBox="0.00 0.00 705.00 208.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="670pt" height="208pt"
viewBox="0.00 0.00 670.00 208.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 204)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-204 701,-204 701,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-204 666,-204 666,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
@@ -22,16 +22,16 @@
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="643,-152.5 643,-171.5 697,-171.5 697,-152.5 643,-152.5"/>
<text text-anchor="middle" x="670" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="black" points="608,-152.5 608,-171.5 662,-171.5 662,-152.5 608,-152.5"/>
<text text-anchor="middle" x="635" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.25,-160.32C48.6,-164.24 61.87,-168.9 74,-172 148.4,-191.04 167.71,-200 244.5,-200 244.5,-200 244.5,-200 395.5,-200 481.16,-200 580.49,-181.49 632.67,-170.3"/>
<polygon fill="midnightblue" stroke="midnightblue" points="633.74,-173.65 642.77,-168.11 632.25,-166.81 633.74,-173.65"/>
<path fill="none" stroke="midnightblue" d="M38.25,-160.32C48.6,-164.24 61.87,-168.9 74,-172 148.4,-191.04 167.71,-200 244.5,-200 244.5,-200 244.5,-200 395.5,-200 468,-200 551.38,-182.66 597.86,-171.41"/>
<polygon fill="midnightblue" stroke="midnightblue" points="598.88,-174.76 607.75,-168.97 597.2,-167.97 598.88,-174.76"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
@@ -81,28 +81,28 @@
<!-- Node5&#45;&gt;Node2 -->
<g id="edge5" class="edge">
<title>Node5&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M270.53,-100.64C288.12,-107.32 312.7,-115.91 335,-121 441.6,-145.34 570.87,-156.01 632.67,-159.98"/>
<polygon fill="midnightblue" stroke="midnightblue" points="632.5,-163.48 642.7,-160.61 632.94,-156.49 632.5,-163.48"/>
<path fill="none" stroke="midnightblue" d="M270.55,-100.54C288.15,-107.18 312.74,-115.75 335,-121 428.18,-142.97 540.67,-154.47 597.44,-159.25"/>
<polygon fill="midnightblue" stroke="midnightblue" points="597.44,-162.76 607.7,-160.09 598.02,-155.78 597.44,-162.76"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="507.5,-76.5 507.5,-95.5 589.5,-95.5 589.5,-76.5 507.5,-76.5"/>
<text text-anchor="middle" x="548.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
<polygon fill="white" stroke="black" points="490,-76.5 490,-95.5 572,-95.5 572,-76.5 490,-76.5"/>
<text text-anchor="middle" x="531" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node5&#45;&gt;Node6 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M297.82,-100.51C309.96,-102.38 322.9,-104.05 335,-105 387.73,-109.14 401.38,-110.29 454,-105 469,-103.49 485.15,-100.65 499.74,-97.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="500.51,-101.04 509.55,-95.51 499.04,-94.19 500.51,-101.04"/>
<path fill="none" stroke="midnightblue" d="M297.82,-100.51C309.96,-102.38 322.9,-104.05 335,-105 387.73,-109.14 401.51,-111.46 454,-105 465.69,-103.56 478.17,-100.92 489.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="490.48,-101.44 499.26,-95.51 488.7,-94.67 490.48,-101.44"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="335,-76.5 335,-95.5 454,-95.5 454,-76.5 335,-76.5"/>
<text text-anchor="middle" x="394.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
@@ -147,41 +147,26 @@
<!-- Node6&#45;&gt;Node2 -->
<g id="edge7" class="edge">
<title>Node6&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M564.63,-95.63C585.02,-108.59 621.49,-131.79 645.47,-147.04"/>
<polygon fill="midnightblue" stroke="midnightblue" points="643.67,-150.04 653.99,-152.45 647.43,-144.13 643.67,-150.04"/>
<path fill="none" stroke="midnightblue" d="M544.92,-95.63C562.09,-108.42 592.63,-131.17 613.1,-146.43"/>
<polygon fill="midnightblue" stroke="midnightblue" points="611.08,-149.28 621.19,-152.45 615.26,-143.67 611.08,-149.28"/>
</g>
<!-- Node7&#45;&gt;Node6 -->
<g id="edge9" class="edge">
<title>Node7&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M454.27,-86C468.38,-86 483.33,-86 497.03,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="497.23,-89.5 507.22,-86 497.22,-82.5 497.23,-89.5"/>
<path fill="none" stroke="midnightblue" d="M454.1,-86C462.56,-86 471.21,-86 479.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="479.76,-89.5 489.76,-86 479.76,-82.5 479.76,-89.5"/>
</g>
<!-- Node8&#45;&gt;Node6 -->
<g id="edge11" class="edge">
<title>Node8&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M433.86,-57.59C453.82,-62.58 478.43,-68.73 499.63,-74.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="498.87,-77.45 509.42,-76.48 500.57,-70.66 498.87,-77.45"/>
<path fill="none" stroke="midnightblue" d="M429.44,-57.59C446.72,-62.47 467.93,-68.46 486.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="485.5,-77.06 496.07,-76.41 487.4,-70.33 485.5,-77.06"/>
</g>
<!-- Node9&#45;&gt;Node6 -->
<g id="edge13" class="edge">
<title>Node9&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M429.43,-19.54C437.61,-22.24 446.24,-25.43 454,-29 479.83,-40.87 507.39,-58.32 525.84,-70.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="523.89,-73.69 534.12,-76.45 527.85,-67.92 523.89,-73.69"/>
</g>
<!-- Node10 -->
<g id="node10" class="node">
<title>Node10</title>
<g id="a_node10"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="490,-0.5 490,-19.5 607,-19.5 607,-0.5 490,-0.5"/>
<text text-anchor="middle" x="548.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node9&#45;&gt;Node10 -->
<g id="edge14" class="edge">
<title>Node9&#45;&gt;Node10</title>
<path fill="none" stroke="midnightblue" d="M454.27,-10C462.58,-10 471.19,-10 479.66,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="479.89,-13.5 489.89,-10 479.89,-6.5 479.89,-13.5"/>
<path fill="none" stroke="midnightblue" d="M431.22,-19.53C438.93,-22.15 446.89,-25.31 454,-29 475.29,-40.05 496.92,-56.95 511.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="509.6,-72.35 519.44,-76.27 514.2,-67.07 509.6,-72.35"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 9.6 KiB

After

Width:  |  Height:  |  Size: 8.9 KiB

15
d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
View File

@@ -1,10 +1,9 @@
<map id="test" name="test">
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,57,49,83"/>
<area shape="rect" id="node2" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="97,57,240,83"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="699,6,771,33"/>
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="518,57,627,83"/>
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, Only contains one element." alt="" coords="288,57,447,83"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="288,107,447,134"/>
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="288,158,447,185"/>
<area shape="rect" id="node8" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="495,158,651,185"/>
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,56,49,83"/>
<area shape="rect" id="node2" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="97,56,240,83"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="652,5,724,32"/>
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="495,56,604,83"/>
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="288,56,447,83"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="288,107,447,133"/>
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="288,157,447,184"/>
</map>

2
d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
View File

@@ -1 +1 @@
59cc849d5912d57ceb7252b3490d7478
8387bcc4b0cc5bb822748e702fc24784

57
d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -4,7 +4,7 @@
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: test Pages: 1 -->
<!--zoomable 143 -->
<!--zoomable 142 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.edge:hover path { stroke: red; }
@@ -46,15 +46,15 @@ if (edges && edges.length) {
</defs>
<script type="text/javascript">
var viewWidth = 582;
var viewHeight = 143;
var viewWidth = 547;
var viewHeight = 142;
var sectionId = 'dynsection-7';
</script>
<script xlink:href="../../svgpan.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<title>test</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138.53 578,-138.53 578,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 543,-138 543,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
@@ -83,36 +83,36 @@ var sectionId = 'dynsection-7';
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="520,-114.5 520,-133.5 574,-133.5 574,-114.5 520,-114.5"/>
<text text-anchor="middle" x="547" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="black" points="485,-114.5 485,-133.5 539,-133.5 539,-114.5 485,-114.5"/>
<text text-anchor="middle" x="512" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M141.88,-95.59C159.37,-104.14 186.7,-116.06 212,-121 318.53,-141.8 447.83,-133.79 509.65,-127.98"/>
<polygon fill="midnightblue" stroke="midnightblue" points="510.08,-131.45 519.69,-127 509.4,-124.48 510.08,-131.45"/>
<path fill="none" stroke="midnightblue" d="M141.88,-95.58C159.37,-104.13 186.71,-116.05 212,-121 305.09,-139.22 417.62,-132.96 474.41,-127.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="475.05,-131.34 484.68,-126.92 474.4,-124.37 475.05,-131.34"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="384.5,-76.5 384.5,-95.5 466.5,-95.5 466.5,-76.5 384.5,-76.5"/>
<text text-anchor="middle" x="425.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
<polygon fill="white" stroke="black" points="367,-76.5 367,-95.5 449,-95.5 449,-76.5 367,-76.5"/>
<text text-anchor="middle" x="408" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 264.59,-110.58 278.38,-110.29 331,-105 346,-103.49 362.15,-100.65 376.74,-97.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="377.51,-101.04 386.55,-95.51 376.04,-94.19 377.51,-101.04"/>
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 264.59,-110.58 278.51,-111.46 331,-105 342.69,-103.56 355.17,-100.92 366.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="367.48,-101.44 376.26,-95.51 365.7,-94.67 367.48,-101.44"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="212,-76.5 212,-95.5 331,-95.5 331,-76.5 212,-76.5"/>
<text text-anchor="middle" x="271.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
@@ -157,41 +157,26 @@ var sectionId = 'dynsection-7';
<!-- Node4&#45;&gt;Node3 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M456.65,-95.59C472.95,-100.77 493.18,-107.21 510.27,-112.64"/>
<polygon fill="midnightblue" stroke="midnightblue" points="509.32,-116.01 519.91,-115.7 511.44,-109.34 509.32,-116.01"/>
<path fill="none" stroke="midnightblue" d="M434.74,-95.59C447.18,-100.22 462.31,-105.86 475.8,-110.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="474.68,-114.2 485.27,-114.41 477.12,-107.64 474.68,-114.2"/>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M331.27,-86C345.38,-86 360.33,-86 374.03,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="374.23,-89.5 384.22,-86 374.22,-82.5 374.23,-89.5"/>
<path fill="none" stroke="midnightblue" d="M331.1,-86C339.56,-86 348.21,-86 356.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="356.76,-89.5 366.76,-86 356.76,-82.5 356.76,-89.5"/>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge8" class="edge">
<title>Node6&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M310.86,-57.59C330.82,-62.58 355.43,-68.73 376.63,-74.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="375.87,-77.45 386.42,-76.48 377.57,-70.66 375.87,-77.45"/>
<path fill="none" stroke="midnightblue" d="M306.44,-57.59C323.72,-62.47 344.93,-68.46 363.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="362.5,-77.06 373.07,-76.41 364.4,-70.33 362.5,-77.06"/>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge10" class="edge">
<title>Node7&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M306.43,-19.54C314.61,-22.24 323.24,-25.43 331,-29 356.83,-40.87 384.39,-58.32 402.84,-70.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="400.89,-73.69 411.12,-76.45 404.85,-67.92 400.89,-73.69"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="367,-0.5 367,-19.5 484,-19.5 484,-0.5 367,-0.5"/>
<text text-anchor="middle" x="425.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge11" class="edge">
<title>Node7&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M331.27,-10C339.58,-10 348.19,-10 356.66,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="356.89,-13.5 366.89,-10 356.89,-6.5 356.89,-13.5"/>
<path fill="none" stroke="midnightblue" d="M308.22,-19.53C315.93,-22.15 323.89,-25.31 331,-29 352.29,-40.05 373.92,-56.95 388.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="386.6,-72.35 396.44,-76.27 391.2,-67.07 386.6,-72.35"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 13 KiB

After

Width:  |  Height:  |  Size: 12 KiB

57
d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
View File

@@ -4,11 +4,11 @@
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: test Pages: 1 -->
<svg width="582pt" height="143pt"
viewBox="0.00 0.00 582.00 142.53" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.53)">
<svg width="547pt" height="142pt"
viewBox="0.00 0.00 547.00 142.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138)">
<title>test</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138.53 578,-138.53 578,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 543,-138 543,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
@@ -37,36 +37,36 @@
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="520,-114.5 520,-133.5 574,-133.5 574,-114.5 520,-114.5"/>
<text text-anchor="middle" x="547" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="black" points="485,-114.5 485,-133.5 539,-133.5 539,-114.5 485,-114.5"/>
<text text-anchor="middle" x="512" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M141.88,-95.59C159.37,-104.14 186.7,-116.06 212,-121 318.53,-141.8 447.83,-133.79 509.65,-127.98"/>
<polygon fill="midnightblue" stroke="midnightblue" points="510.08,-131.45 519.69,-127 509.4,-124.48 510.08,-131.45"/>
<path fill="none" stroke="midnightblue" d="M141.88,-95.58C159.37,-104.13 186.71,-116.05 212,-121 305.09,-139.22 417.62,-132.96 474.41,-127.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="475.05,-131.34 484.68,-126.92 474.4,-124.37 475.05,-131.34"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="384.5,-76.5 384.5,-95.5 466.5,-95.5 466.5,-76.5 384.5,-76.5"/>
<text text-anchor="middle" x="425.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
<polygon fill="white" stroke="black" points="367,-76.5 367,-95.5 449,-95.5 449,-76.5 367,-76.5"/>
<text text-anchor="middle" x="408" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 264.59,-110.58 278.38,-110.29 331,-105 346,-103.49 362.15,-100.65 376.74,-97.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="377.51,-101.04 386.55,-95.51 376.04,-94.19 377.51,-101.04"/>
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 264.59,-110.58 278.51,-111.46 331,-105 342.69,-103.56 355.17,-100.92 366.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="367.48,-101.44 376.26,-95.51 365.7,-94.67 367.48,-101.44"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="212,-76.5 212,-95.5 331,-95.5 331,-76.5 212,-76.5"/>
<text text-anchor="middle" x="271.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
@@ -111,41 +111,26 @@
<!-- Node4&#45;&gt;Node3 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M456.65,-95.59C472.95,-100.77 493.18,-107.21 510.27,-112.64"/>
<polygon fill="midnightblue" stroke="midnightblue" points="509.32,-116.01 519.91,-115.7 511.44,-109.34 509.32,-116.01"/>
<path fill="none" stroke="midnightblue" d="M434.74,-95.59C447.18,-100.22 462.31,-105.86 475.8,-110.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="474.68,-114.2 485.27,-114.41 477.12,-107.64 474.68,-114.2"/>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M331.27,-86C345.38,-86 360.33,-86 374.03,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="374.23,-89.5 384.22,-86 374.22,-82.5 374.23,-89.5"/>
<path fill="none" stroke="midnightblue" d="M331.1,-86C339.56,-86 348.21,-86 356.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="356.76,-89.5 366.76,-86 356.76,-82.5 356.76,-89.5"/>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge8" class="edge">
<title>Node6&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M310.86,-57.59C330.82,-62.58 355.43,-68.73 376.63,-74.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="375.87,-77.45 386.42,-76.48 377.57,-70.66 375.87,-77.45"/>
<path fill="none" stroke="midnightblue" d="M306.44,-57.59C323.72,-62.47 344.93,-68.46 363.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="362.5,-77.06 373.07,-76.41 364.4,-70.33 362.5,-77.06"/>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge10" class="edge">
<title>Node7&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M306.43,-19.54C314.61,-22.24 323.24,-25.43 331,-29 356.83,-40.87 384.39,-58.32 402.84,-70.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="400.89,-73.69 411.12,-76.45 404.85,-67.92 400.89,-73.69"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="367,-0.5 367,-19.5 484,-19.5 484,-0.5 367,-0.5"/>
<text text-anchor="middle" x="425.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge11" class="edge">
<title>Node7&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M331.27,-10C339.58,-10 348.19,-10 356.66,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="356.89,-13.5 366.89,-10 356.89,-6.5 356.89,-13.5"/>
<path fill="none" stroke="midnightblue" d="M308.22,-19.53C315.93,-22.15 323.89,-25.31 331,-29 352.29,-40.05 373.92,-56.95 388.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="386.6,-72.35 396.44,-76.27 391.2,-67.07 386.6,-72.35"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 7.7 KiB

After

Width:  |  Height:  |  Size: 6.9 KiB

112
d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html Normal file
View File

@@ -0,0 +1,112 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: Member List</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">operations_on_datastructures::inorder_traversal_of_bst::Node Member List</div> </div>
</div><!--header-->
<div class="contents">
<p>This is the complete list of members for <a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a>, including all inherited members.</p>
<table class="directory">
<tr class="even"><td class="entry"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a></td><td class="entry"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></td><td class="entry"></td></tr>
<tr><td class="entry"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a">left</a></td><td class="entry"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></td><td class="entry"></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">right</a></td><td class="entry"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></td><td class="entry"></td></tr>
</table></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 </li>
</ul>
</div>
</body>
</html>

2
d2/d26/count__inversions_8cpp.html
View File

@@ -152,7 +152,7 @@ Functions</h2></td></tr>
<p>two elements a[i] and a[j] form an inversion if <code>a[i]</code> &gt; <code>a[j]</code> and i &lt; j</p>
<p>Time Complexity --&gt; <code>O(n.log n)</code></p>
<p>Space Complexity --&gt; <code>O(n)</code> ; additional array <code>temp[1..n]</code> </p>
<h3><a class="anchor" id="autotoc_md87"></a>
<h3><a class="anchor" id="autotoc_md91"></a>
Algorithm</h3>
<ol type="1">
<li>The idea is similar to merge sort, divide the array into two equal or almost equal halves in each step until the base case is reached.</li>

3
d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.map Normal file
View File

@@ -0,0 +1,3 @@
<map id="operations_on_datastructures::inorder_traversal_of_bst::Node" name="operations_on_datastructures::inorder_traversal_of_bst::Node">
<area shape="rect" id="node1" title="A Node structure representing a single node in BST." alt="" coords="5,5,217,47"/>
</map>

1
d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.md5 Normal file
View File

@@ -0,0 +1 @@
ccf01eb6dfd0f28fd3207efa797126cd

31
d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.svg Normal file
View File

@@ -0,0 +1,31 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::Node Pages: 1 -->
<svg width="205pt" height="39pt"
viewBox="0.00 0.00 205.00 39.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 35)">
<title>operations_on_datastructures::inorder_traversal_of_bst::Node</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-35 201,-35 201,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="A Node structure representing a single node in BST.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-30.5 159,-30.5 159,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="79.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst::Node</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="#9a32cd" stroke-dasharray="5,2" d="M169.12,-19.27C174.06,-18.35 177,-17.1 177,-15.5 177,-13.01 169.83,-11.35 159.07,-10.51"/>
<polygon fill="#9a32cd" stroke="#9a32cd" points="168.58,-15.81 159.07,-20.49 169.42,-22.76 168.58,-15.81"/>
<text text-anchor="middle" x="187" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00"> left</text>
<text text-anchor="middle" x="187" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">right</text>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.8 KiB

2
d3/df9/recursive__bubble__sort_8cpp.html
View File

@@ -136,7 +136,7 @@ Functions</h2></td></tr>
<dl class="section author"><dt>Author</dt><dd><a href="https://adityaprakash.tech">Aditya Prakash</a></dd></dl>
<p>The working principle of the Bubble sort algorithm.</p>
<p>Bubble sort is a simple sorting algorithm used to rearrange a set of ascending or descending order elements. Bubble sort gets its name from the fact that data "bubbles" to the top of the dataset.</p>
<h3><a class="anchor" id="autotoc_md91"></a>
<h3><a class="anchor" id="autotoc_md95"></a>
Algorithm</h3>
<p>What is Swap?</p>
<p>Swapping two numbers means that we interchange their values. Often, an additional variable is required for this operation. This is further illustrated in the following:</p>

738
d4/d32/inorder__successor__of__bst_8cpp.html Normal file
View File

@@ -0,0 +1,738 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: operations_on_datastructures/inorder_successor_of_bst.cpp File Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('d4/d32/inorder__successor__of__bst_8cpp.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#namespaces">Namespaces</a> &#124;
<a href="#func-members">Functions</a> </div>
<div class="headertitle">
<div class="title">inorder_successor_of_bst.cpp File Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>An implementation for finding the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA">Inorder successor of a binary search tree</a> Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal.
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for inorder_successor_of_bst.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d7/d66/inorder__successor__of__bst_8cpp__incl.svg" width="258" height="127"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">A <a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST. <a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">class encapsulating the necessary test cases <a href="../../d5/d58/class_test_cases.html#details">More...</a><br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:da/d6d/namespaceoperations__on__datastructures"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></td></tr>
<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:dd/d74/namespaceinorder__successor__of__bst"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d74/namespaceinorder__successor__of__bst.html">inorder_successor_of_bst</a></td></tr>
<tr class="memdesc:dd/d74/namespaceinorder__successor__of__bst"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA">Inorder successor of a binary search tree</a> implementation. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:a4852816cc9f28f7b9def0e5beb4e8545"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d8b/struct_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a4852816cc9f28f7b9def0e5beb4e8545">operations_on_datastructures::inorder_traversal_of_bst::makeNode</a> (int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memdesc:a4852816cc9f28f7b9def0e5beb4e8545"><td class="mdescLeft">&#160;</td><td class="mdescRight">Allocates a new node in heap for given data and returns it's pointer. <a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a4852816cc9f28f7b9def0e5beb4e8545">More...</a><br /></td></tr>
<tr class="separator:a4852816cc9f28f7b9def0e5beb4e8545"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a2153df6265379da9bda259af3f46556a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d8b/struct_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a2153df6265379da9bda259af3f46556a">operations_on_datastructures::inorder_traversal_of_bst::Insert</a> (<a class="el" href="../../db/d8b/struct_node.html">Node</a> *root, int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memdesc:a2153df6265379da9bda259af3f46556a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inserts the given data in BST while maintaining the properties of BST. <a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a2153df6265379da9bda259af3f46556a">More...</a><br /></td></tr>
<tr class="separator:a2153df6265379da9bda259af3f46556a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a744afaca22fa7bb91c92209a26f23e8f"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d8b/struct_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a744afaca22fa7bb91c92209a26f23e8f">operations_on_datastructures::inorder_traversal_of_bst::getNode</a> (<a class="el" href="../../db/d8b/struct_node.html">Node</a> *root, int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memdesc:a744afaca22fa7bb91c92209a26f23e8f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Searches the given data in BST and returns the pointer to the node containing that data. <a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a744afaca22fa7bb91c92209a26f23e8f">More...</a><br /></td></tr>
<tr class="separator:a744afaca22fa7bb91c92209a26f23e8f"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a25667588088eb647887d1c2bff0efa8c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d8b/struct_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a25667588088eb647887d1c2bff0efa8c">operations_on_datastructures::inorder_traversal_of_bst::findMinNode</a> (<a class="el" href="../../db/d8b/struct_node.html">Node</a> *root)</td></tr>
<tr class="memdesc:a25667588088eb647887d1c2bff0efa8c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Finds and return the minimum node in BST. <a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a25667588088eb647887d1c2bff0efa8c">More...</a><br /></td></tr>
<tr class="separator:a25667588088eb647887d1c2bff0efa8c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a5d7266b934ca50c4f53e4f1e725d89a4"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a> (<a class="el" href="../../db/d8b/struct_node.html">Node</a> *root)</td></tr>
<tr class="memdesc:a5d7266b934ca50c4f53e4f1e725d89a4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Prints the BST in inorder traversal using recursion. <a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">More...</a><br /></td></tr>
<tr class="separator:a5d7266b934ca50c4f53e4f1e725d89a4"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad0ca93be4f9576bfb715a4864a30dbee"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d8b/struct_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a> (<a class="el" href="../../db/d8b/struct_node.html">Node</a> *root, const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;<a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memdesc:ad0ca93be4f9576bfb715a4864a30dbee"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function is used in test cases to quickly create BST containing large data instead of hard coding it in code. For a given root, this will add all the nodes containing data passes in data vector. <a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee">More...</a><br /></td></tr>
<tr class="separator:ad0ca93be4f9576bfb715a4864a30dbee"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9aa3fac9aa48a6568ecf89aaee190d43"><td class="memItemLeft" align="right" valign="top"><a class="el" href="../../db/d8b/struct_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a9aa3fac9aa48a6568ecf89aaee190d43">operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor</a> (<a class="el" href="../../db/d8b/struct_node.html">Node</a> *root, int64_t <a class="el" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>)</td></tr>
<tr class="memdesc:a9aa3fac9aa48a6568ecf89aaee190d43"><td class="mdescLeft">&#160;</td><td class="mdescRight">Inorder successor of a node is the next node in inorder traversal of the Binary Tree. This function takes the root node and the data of the node for which we have to find the inorder successor, and returns the inorder successor node. <a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a9aa3fac9aa48a6568ecf89aaee190d43">More...</a><br /></td></tr>
<tr class="separator:a9aa3fac9aa48a6568ecf89aaee190d43"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7b20eb99272665c1777949e26ab59589"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a> (<a class="el" href="../../db/d8b/struct_node.html">Node</a> *rootNode)</td></tr>
<tr class="memdesc:a7b20eb99272665c1777949e26ab59589"><td class="mdescLeft">&#160;</td><td class="mdescRight">This function clears the memory allocated to entire tree recursively. Its just for clean up the memory and not relevant to the actual topic. <a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">More...</a><br /></td></tr>
<tr class="separator:a7b20eb99272665c1777949e26ab59589"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self-test implementations. <a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">More...</a><br /></td></tr>
<tr class="separator:aa8dca7b867074164d5f45b0f3851269d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0ddf1224851353fc92bfbff6f499fa97"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">main</a> (int argc, char *argv[])</td></tr>
<tr class="memdesc:a0ddf1224851353fc92bfbff6f499fa97"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">More...</a><br /></td></tr>
<tr class="separator:a0ddf1224851353fc92bfbff6f499fa97"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>An implementation for finding the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA">Inorder successor of a binary search tree</a> Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal. </p>
<h3><a class="anchor" id="autotoc_md76"></a>
Case 1: The given node has the right node/subtree</h3>
<pre class="fragment"> * In this case, the left-most deepest node in the right subtree will
</pre><p> come just after the given node as we go to left deep in inorder.</p><ul>
<li>Go deep to left most node in right subtree. OR, we can also say in case if BST, find the minimum of the subtree for a given node.</li>
</ul>
<h3><a class="anchor" id="autotoc_md77"></a>
Case 2: The given node does not have a right node/subtree</h3>
<h4><a class="anchor" id="autotoc_md78"></a>
Method 1: Use parent pointer (store the address of parent nodes)</h4>
<ul>
<li>If a node does not have the right subtree, and we already visited the node itself, then the next node will be its parent node according to inorder traversal, and if we are going to parent from left, then the parent would be unvisited.</li>
<li>In other words, go to the nearest ancestor for which given node would be in left subtree.</li>
</ul>
<h4><a class="anchor" id="autotoc_md79"></a>
Method 2: Search from the root node</h4>
<ul>
<li>In case if there is no link from a child node to the parent node, we need to walk down the tree starting from the root node to the given node, by doing so, we are visiting every ancestor of the given node.</li>
<li>In order successor would be the deepest node in this path for which given node is in left subtree.</li>
</ul>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/foo290">Nitin Sharma</a> </dd></dl>
</div><h2 class="groupheader">Function Documentation</h2>
<a id="a7b20eb99272665c1777949e26ab59589"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a7b20eb99272665c1777949e26ab59589">&#9670;&nbsp;</a></span>deallocate()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void operations_on_datastructures::inorder_traversal_of_bst::deallocate </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>rootNode</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>This function clears the memory allocated to entire tree recursively. Its just for clean up the memory and not relevant to the actual topic. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">root</td><td>Root node of the tree. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>&#160; {</div>
<div class="line"><a name="l00211"></a><span class="lineno"> 211</span>&#160; <span class="keywordflow">if</span> (rootNode == <span class="keyword">nullptr</span>) {</div>
<div class="line"><a name="l00212"></a><span class="lineno"> 212</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00213"></a><span class="lineno"> 213</span>&#160; }</div>
<div class="line"><a name="l00214"></a><span class="lineno"> 214</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">deallocate</a>(rootNode-&gt;left);</div>
<div class="line"><a name="l00215"></a><span class="lineno"> 215</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">deallocate</a>(rootNode-&gt;right);</div>
<div class="line"><a name="l00216"></a><span class="lineno"> 216</span>&#160; <span class="keyword">delete</span> (rootNode);</div>
<div class="line"><a name="l00217"></a><span class="lineno"> 217</span>&#160;}</div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7b20eb99272665c1777949e26ab59589"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a></div><div class="ttdeci">void deallocate(Node *rootNode)</div><div class="ttdoc">This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:210</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.svg" width="210" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a25667588088eb647887d1c2bff0efa8c"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a25667588088eb647887d1c2bff0efa8c">&#9670;&nbsp;</a></span>findMinNode()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d8b/struct_node.html">Node</a>* operations_on_datastructures::inorder_traversal_of_bst::findMinNode </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>root</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Finds and return the minimum node in BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">root</td><td>A pointer to root node. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Node* Pointer to the found node </dd></dl>
<div class="fragment"><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>&#160; {</div>
<div class="line"><a name="l00122"></a><span class="lineno"> 122</span>&#160; <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
<div class="line"><a name="l00123"></a><span class="lineno"> 123</span>&#160; <span class="keywordflow">return</span> root;</div>
<div class="line"><a name="l00124"></a><span class="lineno"> 124</span>&#160; }</div>
<div class="line"><a name="l00125"></a><span class="lineno"> 125</span>&#160; <span class="keywordflow">while</span> (root-&gt;left != <span class="keyword">nullptr</span>) {</div>
<div class="line"><a name="l00126"></a><span class="lineno"> 126</span>&#160; root = root-&gt;left;</div>
<div class="line"><a name="l00127"></a><span class="lineno"> 127</span>&#160; }</div>
<div class="line"><a name="l00128"></a><span class="lineno"> 128</span>&#160; <span class="keywordflow">return</span> root;</div>
<div class="line"><a name="l00129"></a><span class="lineno"> 129</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.svg" width="210" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a9aa3fac9aa48a6568ecf89aaee190d43"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a9aa3fac9aa48a6568ecf89aaee190d43">&#9670;&nbsp;</a></span>getInorderSuccessor()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d8b/struct_node.html">Node</a>* operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>root</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>data</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Inorder successor of a node is the next node in inorder traversal of the Binary Tree. This function takes the root node and the data of the node for which we have to find the inorder successor, and returns the inorder successor node. </p>
<p>Search from the root node as we need to walk the tree starting from the root node to the given node, by doing so, we are visiting every ancestor of the given node. In order successor would be the deepest node in this path for which given node is in left subtree. Time complexity O(h) </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">root</td><td>A pointer to the root node of the BST </td></tr>
<tr><td class="paramname">data</td><td>The data (or the data of node) for which we have to find inorder successor. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><a class="el" href="../../db/d8b/struct_node.html">Node</a> pointer to the inorder successor node. </dd></dl>
<div class="fragment"><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>&#160; {</div>
<div class="line"><a name="l00177"></a><span class="lineno"> 177</span>&#160; <a class="code" href="../../db/d8b/struct_node.html">Node</a> *current = <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a744afaca22fa7bb91c92209a26f23e8f">getNode</a>(root, <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; <span class="keywordflow">if</span> (current == <span class="keyword">nullptr</span>) {</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; }</div>
<div class="line"><a name="l00181"></a><span class="lineno"> 181</span>&#160; </div>
<div class="line"><a name="l00182"></a><span class="lineno"> 182</span>&#160; <span class="comment">// Case - 1</span></div>
<div class="line"><a name="l00183"></a><span class="lineno"> 183</span>&#160; <span class="keywordflow">if</span> (current-&gt;right != <span class="keyword">nullptr</span>) {</div>
<div class="line"><a name="l00184"></a><span class="lineno"> 184</span>&#160; <span class="keywordflow">return</span> <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a25667588088eb647887d1c2bff0efa8c">findMinNode</a>(current-&gt;right);</div>
<div class="line"><a name="l00185"></a><span class="lineno"> 185</span>&#160; }</div>
<div class="line"><a name="l00186"></a><span class="lineno"> 186</span>&#160; <span class="comment">// case - 2</span></div>
<div class="line"><a name="l00187"></a><span class="lineno"> 187</span>&#160; <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00188"></a><span class="lineno"> 188</span>&#160; <a class="code" href="../../db/d8b/struct_node.html">Node</a> *successor = <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00189"></a><span class="lineno"> 189</span>&#160; <a class="code" href="../../db/d8b/struct_node.html">Node</a> *ancestor = root;</div>
<div class="line"><a name="l00190"></a><span class="lineno"> 190</span>&#160; </div>
<div class="line"><a name="l00191"></a><span class="lineno"> 191</span>&#160; <span class="keywordflow">while</span> (ancestor != current &amp;&amp; ancestor != <span class="keyword">nullptr</span>) {</div>
<div class="line"><a name="l00192"></a><span class="lineno"> 192</span>&#160; <span class="comment">// This means my current node is in left of the root node</span></div>
<div class="line"><a name="l00193"></a><span class="lineno"> 193</span>&#160; <span class="keywordflow">if</span> (current-&gt;data &lt; ancestor-&gt;data) {</div>
<div class="line"><a name="l00194"></a><span class="lineno"> 194</span>&#160; successor = ancestor;</div>
<div class="line"><a name="l00195"></a><span class="lineno"> 195</span>&#160; ancestor = ancestor-&gt;left; <span class="comment">// keep going left</span></div>
<div class="line"><a name="l00196"></a><span class="lineno"> 196</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00197"></a><span class="lineno"> 197</span>&#160; ancestor = ancestor-&gt;right;</div>
<div class="line"><a name="l00198"></a><span class="lineno"> 198</span>&#160; }</div>
<div class="line"><a name="l00199"></a><span class="lineno"> 199</span>&#160; }</div>
<div class="line"><a name="l00200"></a><span class="lineno"> 200</span>&#160; <span class="keywordflow">return</span> successor; <span class="comment">// Nodes with maximum vales will not have a successor</span></div>
<div class="line"><a name="l00201"></a><span class="lineno"> 201</span>&#160; }</div>
<div class="line"><a name="l00202"></a><span class="lineno"> 202</span>&#160;}</div>
<div class="ttc" id="ahash__search_8cpp_html_a6e1a77282bc65ad359d753d25df23243"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a></div><div class="ttdeci">int data[MAX]</div><div class="ttdoc">test data</div><div class="ttdef"><b>Definition:</b> hash_search.cpp:24</div></div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a25667588088eb647887d1c2bff0efa8c"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a25667588088eb647887d1c2bff0efa8c">operations_on_datastructures::inorder_traversal_of_bst::findMinNode</a></div><div class="ttdeci">Node * findMinNode(Node *root)</div><div class="ttdoc">Finds and return the minimum node in BST.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:121</div></div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a744afaca22fa7bb91c92209a26f23e8f"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a744afaca22fa7bb91c92209a26f23e8f">operations_on_datastructures::inorder_traversal_of_bst::getNode</a></div><div class="ttdeci">Node * getNode(Node *root, int64_t data)</div><div class="ttdoc">Searches the given data in BST and returns the pointer to the node containing that data.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:100</div></div>
<div class="ttc" id="astruct_node_html"><div class="ttname"><a href="../../db/d8b/struct_node.html">Node</a></div><div class="ttdef"><b>Definition:</b> linkedlist_implentation_usingarray.cpp:14</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.svg" width="210" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a744afaca22fa7bb91c92209a26f23e8f"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a744afaca22fa7bb91c92209a26f23e8f">&#9670;&nbsp;</a></span>getNode()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d8b/struct_node.html">Node</a>* operations_on_datastructures::inorder_traversal_of_bst::getNode </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>root</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>data</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Searches the given data in BST and returns the pointer to the node containing that data. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">root</td><td>Pointer to the root node of the BST </td></tr>
<tr><td class="paramname">data</td><td>Data to be Searched. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Node* pointer to the found node </dd></dl>
<p><a class="el" href="../../db/d8b/struct_node.html">Node</a> found!</p>
<p>Traverse right subtree recursively as the given data is greater than the data in root node, data must be present in right subtree.</p>
<p>Traverse left subtree recursively as the given data is less than the data in root node, data must be present in left subtree.</p>
<div class="fragment"><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>&#160; {</div>
<div class="line"><a name="l00101"></a><span class="lineno"> 101</span>&#160; <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
<div class="line"><a name="l00102"></a><span class="lineno"> 102</span>&#160; <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00103"></a><span class="lineno"> 103</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (root-&gt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a> == <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
<div class="line"><a name="l00104"></a><span class="lineno"> 104</span>&#160; <span class="keywordflow">return</span> root; <span class="comment">/// Node found!</span></div>
<div class="line"><a name="l00105"></a><span class="lineno"> 105</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a> &gt; root-&gt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a>) {<span class="comment"></span></div>
<div class="line"><a name="l00106"></a><span class="lineno"> 106</span>&#160;<span class="comment"> /// Traverse right subtree recursively as the given data is greater than</span></div>
<div class="line"><a name="l00107"></a><span class="lineno"> 107</span>&#160;<span class="comment"> /// the data in root node, data must be present in right subtree.</span></div>
<div class="line"><a name="l00108"></a><span class="lineno"> 108</span>&#160;<span class="comment"></span> <span class="keywordflow">return</span> <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a744afaca22fa7bb91c92209a26f23e8f">getNode</a>(root-&gt;right, <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
<div class="line"><a name="l00109"></a><span class="lineno"> 109</span>&#160; } <span class="keywordflow">else</span> {<span class="comment"></span></div>
<div class="line"><a name="l00110"></a><span class="lineno"> 110</span>&#160;<span class="comment"> /// Traverse left subtree recursively as the given data is less than the</span></div>
<div class="line"><a name="l00111"></a><span class="lineno"> 111</span>&#160;<span class="comment"> /// data in root node, data must be present in left subtree.</span></div>
<div class="line"><a name="l00112"></a><span class="lineno"> 112</span>&#160;<span class="comment"></span> <span class="keywordflow">return</span> <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a744afaca22fa7bb91c92209a26f23e8f">getNode</a>(root-&gt;left, <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
<div class="line"><a name="l00113"></a><span class="lineno"> 113</span>&#160; }</div>
<div class="line"><a name="l00114"></a><span class="lineno"> 114</span>&#160;}</div>
<div class="ttc" id="adata_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/data.html">std::vector::data</a></div><div class="ttdeci">T data(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.svg" width="210" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a2153df6265379da9bda259af3f46556a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a2153df6265379da9bda259af3f46556a">&#9670;&nbsp;</a></span>Insert()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d8b/struct_node.html">Node</a>* operations_on_datastructures::inorder_traversal_of_bst::Insert </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>root</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>data</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Inserts the given data in BST while maintaining the properties of BST. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">root</td><td>Pointer to the root node of the BST </td></tr>
<tr><td class="paramname">data</td><td>Data to be inserted. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>Node* Pointer to the root node. </dd></dl>
<div class="fragment"><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>&#160; {</div>
<div class="line"><a name="l00083"></a><span class="lineno"> 83</span>&#160; <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
<div class="line"><a name="l00084"></a><span class="lineno"> 84</span>&#160; root = <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a4852816cc9f28f7b9def0e5beb4e8545">makeNode</a>(<a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
<div class="line"><a name="l00085"></a><span class="lineno"> 85</span>&#160; } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (data &lt;= root-&gt;<a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
<div class="line"><a name="l00086"></a><span class="lineno"> 86</span>&#160; root-&gt;left = Insert(root-&gt;left, <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
<div class="line"><a name="l00087"></a><span class="lineno"> 87</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00088"></a><span class="lineno"> 88</span>&#160; root-&gt;right = Insert(root-&gt;right, <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>);</div>
<div class="line"><a name="l00089"></a><span class="lineno"> 89</span>&#160; }</div>
<div class="line"><a name="l00090"></a><span class="lineno"> 90</span>&#160; <span class="keywordflow">return</span> root;</div>
<div class="line"><a name="l00091"></a><span class="lineno"> 91</span>&#160;}</div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a4852816cc9f28f7b9def0e5beb4e8545"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a4852816cc9f28f7b9def0e5beb4e8545">operations_on_datastructures::inorder_traversal_of_bst::makeNode</a></div><div class="ttdeci">Node * makeNode(int64_t data)</div><div class="ttdoc">Allocates a new node in heap for given data and returns it's pointer.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:68</div></div>
</div><!-- fragment -->
</div>
</div>
<a id="a0ddf1224851353fc92bfbff6f499fa97"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0ddf1224851353fc92bfbff6f499fa97">&#9670;&nbsp;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">int&#160;</td>
<td class="paramname"><em>argc</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">char *&#160;</td>
<td class="paramname"><em>argv</em>[]&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Main function. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">argc</td><td>commandline argument count (ignored) </td></tr>
<tr><td class="paramname">argv</td><td>commandline array of arguments (ignored) </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
<p>&lt; root node of the bst</p>
<p>&lt; Data to add nodes in BST</p>
<p>&lt; An element to find inorder successor for.</p>
<p>&lt; Making BST</p>
<p>memory cleanup!</p>
<div class="fragment"><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>&#160; {</div>
<div class="line"><a name="l00399"></a><span class="lineno"> 399</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><a name="l00400"></a><span class="lineno"> 400</span>&#160; </div>
<div class="line"><a name="l00401"></a><span class="lineno"> 401</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
<div class="line"><a name="l00402"></a><span class="lineno"> 402</span>&#160; <span class="keyword">nullptr</span>; <span class="comment">///&lt; root node of the bst</span></div>
<div class="line"><a name="l00403"></a><span class="lineno"> 403</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_data{3, 4, 5,</div>
<div class="line"><a name="l00404"></a><span class="lineno"> 404</span>&#160; 89, 1, 2}; <span class="comment">///&lt; Data to add nodes in BST</span></div>
<div class="line"><a name="l00405"></a><span class="lineno"> 405</span>&#160; </div>
<div class="line"><a name="l00406"></a><span class="lineno"> 406</span>&#160; int64_t targetElement = 4; <span class="comment">///&lt; An element to find inorder successor for.</span></div>
<div class="line"><a name="l00407"></a><span class="lineno"> 407</span>&#160; root = <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
<div class="line"><a name="l00408"></a><span class="lineno"> 408</span>&#160; root, node_data); <span class="comment">///&lt; Making BST</span></div>
<div class="line"><a name="l00409"></a><span class="lineno"> 409</span>&#160; </div>
<div class="line"><a name="l00410"></a><span class="lineno"> 410</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
<div class="line"><a name="l00411"></a><span class="lineno"> 411</span>&#160; *inorderSuccessor = operations_on_datastructures::</div>
<div class="line"><a name="l00412"></a><span class="lineno"> 412</span>&#160; inorder_traversal_of_bst::getInorderSuccessor(root, targetElement);</div>
<div class="line"><a name="l00413"></a><span class="lineno"> 413</span>&#160; </div>
<div class="line"><a name="l00414"></a><span class="lineno"> 414</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;In-order sequence is : &quot;</span>;</div>
<div class="line"><a name="l00415"></a><span class="lineno"> 415</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(root);</div>
<div class="line"><a name="l00416"></a><span class="lineno"> 416</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00417"></a><span class="lineno"> 417</span>&#160; </div>
<div class="line"><a name="l00418"></a><span class="lineno"> 418</span>&#160; <span class="keywordflow">if</span> (inorderSuccessor == <span class="keyword">nullptr</span>) {</div>
<div class="line"><a name="l00419"></a><span class="lineno"> 419</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inorder successor for last node is NULL&quot;</span> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00420"></a><span class="lineno"> 420</span>&#160; } <span class="keywordflow">else</span> {</div>
<div class="line"><a name="l00421"></a><span class="lineno"> 421</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Target element is : &quot;</span> &lt;&lt; targetElement &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00422"></a><span class="lineno"> 422</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inorder successor for target element is : &quot;</span></div>
<div class="line"><a name="l00423"></a><span class="lineno"> 423</span>&#160; &lt;&lt; inorderSuccessor-&gt;<a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00424"></a><span class="lineno"> 424</span>&#160; }</div>
<div class="line"><a name="l00425"></a><span class="lineno"> 425</span>&#160; </div>
<div class="line"><a name="l00426"></a><span class="lineno"> 426</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">deallocate</a>(root); <span class="comment">/// memory cleanup!</span></div>
<div class="line"><a name="l00427"></a><span class="lineno"> 427</span>&#160; </div>
<div class="line"><a name="l00428"></a><span class="lineno"> 428</span>&#160; <span class="keywordflow">return</span> 0;</div>
<div class="line"><a name="l00429"></a><span class="lineno"> 429</span>&#160;}</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div><div class="ttdoc">A Node structure representing a single node in BST.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:56</div></div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_ae161f3e5ef33ade73429cab9291612e2"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The key/value of the node.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:58</div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a5d7266b934ca50c4f53e4f1e725d89a4"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a></div><div class="ttdeci">void printInorder(Node *root)</div><div class="ttdoc">Prints the BST in inorder traversal using recursion.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:136</div></div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self-test implementations.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:387</div></div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_ad0ca93be4f9576bfb715a4864a30dbee"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a></div><div class="ttdeci">Node * makeBST(Node *root, const std::vector&lt; int64_t &gt; &amp;data)</div><div class="ttdoc">This function is used in test cases to quickly create BST containing large data instead of hard codin...</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:155</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt; int64_t &gt;</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg" width="100%" height="442"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
</div>
<a id="ad0ca93be4f9576bfb715a4864a30dbee"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad0ca93be4f9576bfb715a4864a30dbee">&#9670;&nbsp;</a></span>makeBST()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d8b/struct_node.html">Node</a>* operations_on_datastructures::inorder_traversal_of_bst::makeBST </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>root</em>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>&lt; int64_t &gt; &amp;&#160;</td>
<td class="paramname"><em>data</em>&#160;</td>
</tr>
<tr>
<td></td>
<td>)</td>
<td></td><td></td>
</tr>
</table>
</div><div class="memdoc">
<p>This function is used in test cases to quickly create BST containing large data instead of hard coding it in code. For a given root, this will add all the nodes containing data passes in data vector. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">root</td><td>Pointer to the root node. </td></tr>
<tr><td class="paramname">data</td><td>A vector containing integer values which are suppose to be inserted as nodes in BST. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><a class="el" href="../../db/d8b/struct_node.html">Node</a> pointer to the root node. </dd></dl>
<div class="fragment"><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>&#160; {</div>
<div class="line"><a name="l00156"></a><span class="lineno"> 156</span>&#160; <span class="keywordflow">for</span> (int64_t values : <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>) {</div>
<div class="line"><a name="l00157"></a><span class="lineno"> 157</span>&#160; root = Insert(root, values);</div>
<div class="line"><a name="l00158"></a><span class="lineno"> 158</span>&#160; }</div>
<div class="line"><a name="l00159"></a><span class="lineno"> 159</span>&#160; <span class="keywordflow">return</span> root;</div>
<div class="line"><a name="l00160"></a><span class="lineno"> 160</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.svg" width="210" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a4852816cc9f28f7b9def0e5beb4e8545"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4852816cc9f28f7b9def0e5beb4e8545">&#9670;&nbsp;</a></span>makeNode()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname"><a class="el" href="../../db/d8b/struct_node.html">Node</a>* operations_on_datastructures::inorder_traversal_of_bst::makeNode </td>
<td>(</td>
<td class="paramtype">int64_t&#160;</td>
<td class="paramname"><em>data</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Allocates a new node in heap for given data and returns it's pointer. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">data</td><td>Data for the node. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>A pointer to the newly allocated <a class="el" href="../../db/d8b/struct_node.html">Node</a>. </dd></dl>
<p>&lt; setting data for node</p>
<p>&lt; setting left child as null</p>
<p>&lt; setting right child as null</p>
<div class="fragment"><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>&#160; {</div>
<div class="line"><a name="l00069"></a><span class="lineno"> 69</span>&#160; <a class="code" href="../../db/d8b/struct_node.html">Node</a> *<a class="code" href="../../d5/da1/structnode.html">node</a> = <span class="keyword">new</span> <a class="code" href="../../db/d8b/struct_node.html">Node</a>();</div>
<div class="line"><a name="l00070"></a><span class="lineno"> 70</span>&#160; <a class="code" href="../../d5/da1/structnode.html">node</a>-&gt;data = <a class="code" href="../../d1/df3/hash__search_8cpp.html#a6e1a77282bc65ad359d753d25df23243">data</a>; <span class="comment">///&lt; setting data for node</span></div>
<div class="line"><a name="l00071"></a><span class="lineno"> 71</span>&#160; <a class="code" href="../../d5/da1/structnode.html">node</a>-&gt;left = <span class="keyword">nullptr</span>; <span class="comment">///&lt; setting left child as null</span></div>
<div class="line"><a name="l00072"></a><span class="lineno"> 72</span>&#160; <a class="code" href="../../d5/da1/structnode.html">node</a>-&gt;right = <span class="keyword">nullptr</span>; <span class="comment">///&lt; setting right child as null</span></div>
<div class="line"><a name="l00073"></a><span class="lineno"> 73</span>&#160; <span class="keywordflow">return</span> <a class="code" href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a>;</div>
<div class="line"><a name="l00074"></a><span class="lineno"> 74</span>&#160;}</div>
<div class="ttc" id="ahash__search_8cpp_html_a8ca8dcb494104d273679e219e53d0555"><div class="ttname"><a href="../../d1/df3/hash__search_8cpp.html#a8ca8dcb494104d273679e219e53d0555">node</a></div><div class="ttdeci">struct list node</div></div>
<div class="ttc" id="astructnode_html"><div class="ttname"><a href="../../d5/da1/structnode.html">node</a></div><div class="ttdef"><b>Definition:</b> avltree.cpp:13</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.svg" width="210" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="a5d7266b934ca50c4f53e4f1e725d89a4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5d7266b934ca50c4f53e4f1e725d89a4">&#9670;&nbsp;</a></span>printInorder()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">void operations_on_datastructures::inorder_traversal_of_bst::printInorder </td>
<td>(</td>
<td class="paramtype"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td>
<td class="paramname"><em>root</em></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Prints the BST in inorder traversal using recursion. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">root</td><td>A pointer to the root node of the BST. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p>recursive call to left subtree</p>
<p>recursive call to right subtree</p>
<div class="fragment"><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>&#160; {</div>
<div class="line"><a name="l00137"></a><span class="lineno"> 137</span>&#160; <span class="keywordflow">if</span> (root == <span class="keyword">nullptr</span>) {</div>
<div class="line"><a name="l00138"></a><span class="lineno"> 138</span>&#160; <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00139"></a><span class="lineno"> 139</span>&#160; }</div>
<div class="line"><a name="l00140"></a><span class="lineno"> 140</span>&#160; </div>
<div class="line"><a name="l00141"></a><span class="lineno"> 141</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">printInorder</a>(root-&gt;left); <span class="comment">/// recursive call to left subtree</span></div>
<div class="line"><a name="l00142"></a><span class="lineno"> 142</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; root-&gt;<a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/data.html">data</a> &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;</div>
<div class="line"><a name="l00143"></a><span class="lineno"> 143</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">printInorder</a>(root-&gt;right); <span class="comment">/// recursive call to right subtree</span></div>
<div class="line"><a name="l00144"></a><span class="lineno"> 144</span>&#160;}</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg" width="210" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&nbsp;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">static void test </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self-test implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>&#160; {</div>
<div class="line"><a name="l00388"></a><span class="lineno"> 388</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html">TestCases</a> tc;</div>
<div class="line"><a name="l00389"></a><span class="lineno"> 389</span>&#160; tc.<a class="code" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>();</div>
<div class="line"><a name="l00390"></a><span class="lineno"> 390</span>&#160;}</div>
<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:225</div></div>
<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:243</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="442"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_35422be6552f1b3672c1b6c4aba2da64.html">operations_on_datastructures</a></li><li class="navelem"><a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html">inorder_successor_of_bst.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 </li>
</ul>
</div>
</body>
</html>

15
d4/d32/inorder__successor__of__bst_8cpp.js vendored Normal file
View File

@@ -0,0 +1,15 @@
var inorder__successor__of__bst_8cpp =
[
[ "Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node" ],
[ "TestCases", "d5/d58/class_test_cases.html", "d5/d58/class_test_cases" ],
[ "deallocate", "d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589", null ],
[ "findMinNode", "d4/d32/inorder__successor__of__bst_8cpp.html#a25667588088eb647887d1c2bff0efa8c", null ],
[ "getInorderSuccessor", "d4/d32/inorder__successor__of__bst_8cpp.html#a9aa3fac9aa48a6568ecf89aaee190d43", null ],
[ "getNode", "d4/d32/inorder__successor__of__bst_8cpp.html#a744afaca22fa7bb91c92209a26f23e8f", null ],
[ "Insert", "d4/d32/inorder__successor__of__bst_8cpp.html#a2153df6265379da9bda259af3f46556a", null ],
[ "main", "d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97", null ],
[ "makeBST", "d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee", null ],
[ "makeNode", "d4/d32/inorder__successor__of__bst_8cpp.html#a4852816cc9f28f7b9def0e5beb4e8545", null ],
[ "printInorder", "d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4", null ],
[ "test", "d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d", null ]
];

10
d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map Normal file
View File

@@ -0,0 +1,10 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Main function." alt="" coords="5,56,56,83"/>
<area shape="rect" id="node2" href="$d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="104,56,148,83"/>
<area shape="rect" id="node3" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="196,56,339,83"/>
<area shape="rect" id="node4" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="751,5,823,32"/>
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="593,56,703,83"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="387,56,545,83"/>
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="387,107,545,133"/>
<area shape="rect" id="node8" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="387,157,545,184"/>
</map>

1
d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
e2e29f58d25e0b39ed9236e44711a256

239
d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg Normal file
View File

@@ -0,0 +1,239 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: main Pages: 1 -->
<!--zoomable 142 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="text/javascript"><![CDATA[
var edges = document.getElementsByTagName('g');
if (edges && edges.length) {
for (var i=0;i<edges.length;i++) {
if (edges[i].id.substr(0,4)=='edge') {
edges[i].setAttribute('class','edge');
}
}
}
]]></script>
<defs>
<circle id="rim" cx="0" cy="0" r="7"/>
<circle id="rim2" cx="0" cy="0" r="3.5"/>
<g id="zoomPlus">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/>
</use>
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="zoomMin">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/>
</use>
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="dirArrow">
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="resetDef">
<use xlink:href="#rim2" fill="#404040">
<set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/>
</use>
</g>
</defs>
<script type="text/javascript">
var viewWidth = 621;
var viewHeight = 142;
var sectionId = 'dynsection-5';
</script>
<script xlink:href="../../svgpan.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 617,-138 617,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main function.">
<polygon fill="#bfbfbf" stroke="black" points="0,-76.5 0,-95.5 38,-95.5 38,-76.5 0,-76.5"/>
<text text-anchor="middle" x="19" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="black" points="74,-76.5 74,-95.5 107,-95.5 107,-76.5 74,-76.5"/>
<text text-anchor="middle" x="90.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.26,-86C46.07,-86 55.31,-86 63.79,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.95,-89.5 73.95,-86 63.95,-82.5 63.95,-89.5"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
<polygon fill="white" stroke="black" points="143,-76.5 143,-95.5 250,-95.5 250,-76.5 143,-76.5"/>
<text text-anchor="middle" x="196.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M107.3,-86C114.46,-86 123.46,-86 132.94,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="132.94,-89.5 142.94,-86 132.94,-82.5 132.94,-89.5"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="559,-114.5 559,-133.5 613,-133.5 613,-114.5 559,-114.5"/>
<text text-anchor="middle" x="586" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M215.88,-95.58C233.37,-104.13 260.71,-116.05 286,-121 379.09,-139.22 491.62,-132.96 548.41,-127.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="549.05,-131.34 558.68,-126.92 548.4,-124.37 549.05,-131.34"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="441,-76.5 441,-95.5 523,-95.5 523,-76.5 441,-76.5"/>
<text text-anchor="middle" x="482" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node3&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M233.39,-95.51C249.37,-99.27 268.5,-103.14 286,-105 338.59,-110.58 352.51,-111.46 405,-105 416.69,-103.56 429.17,-100.92 440.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="441.48,-101.44 450.26,-95.51 439.7,-94.67 441.48,-101.44"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="286,-76.5 286,-95.5 405,-95.5 405,-76.5 286,-76.5"/>
<text text-anchor="middle" x="345.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge6" class="edge">
<title>Node3&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M250.16,-86C258.5,-86 267.24,-86 275.89,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="275.98,-89.5 285.98,-86 275.98,-82.5 275.98,-89.5"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
<polygon fill="white" stroke="black" points="286,-38.5 286,-57.5 405,-57.5 405,-38.5 286,-38.5"/>
<text text-anchor="middle" x="345.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node7 -->
<g id="edge8" class="edge">
<title>Node3&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M234.59,-76.41C253.82,-71.44 277.49,-65.32 297.93,-60.04"/>
<polygon fill="midnightblue" stroke="midnightblue" points="298.87,-63.41 307.67,-57.52 297.11,-56.63 298.87,-63.41"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
<polygon fill="white" stroke="black" points="286,-0.5 286,-19.5 405,-19.5 405,-0.5 286,-0.5"/>
<text text-anchor="middle" x="345.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node8 -->
<g id="edge10" class="edge">
<title>Node3&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M210.08,-76.4C226.71,-64.07 257.27,-42.63 286,-29 290.64,-26.8 295.61,-24.75 300.61,-22.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="301.93,-26.12 310.2,-19.5 299.61,-19.52 301.93,-26.12"/>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge5" class="edge">
<title>Node5&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M508.74,-95.59C521.18,-100.22 536.31,-105.86 549.8,-110.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="548.68,-114.2 559.27,-114.41 551.12,-107.64 548.68,-114.2"/>
</g>
<!-- Node6&#45;&gt;Node5 -->
<g id="edge7" class="edge">
<title>Node6&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M405.1,-86C413.56,-86 422.21,-86 430.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="430.76,-89.5 440.76,-86 430.76,-82.5 430.76,-89.5"/>
</g>
<!-- Node7&#45;&gt;Node5 -->
<g id="edge9" class="edge">
<title>Node7&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M380.44,-57.59C397.72,-62.47 418.93,-68.46 437.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="436.5,-77.06 447.07,-76.41 438.4,-70.33 436.5,-77.06"/>
</g>
<!-- Node8&#45;&gt;Node5 -->
<g id="edge11" class="edge">
<title>Node8&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M382.22,-19.53C389.93,-22.15 397.89,-25.31 405,-29 426.29,-40.05 447.92,-56.95 462.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="460.6,-72.35 470.44,-76.27 465.2,-67.07 460.6,-72.35"/>
</g>
</g>
</svg>
<g id="navigator" transform="translate(0 0)" fill="#404254">
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
<g id="arrowUp" xlink:href="#dirArrow" transform="translate(30 24)" onmousedown="handlePan(0,-1)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowUp.mouseover" end="arrowUp.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowRight" xlink:href="#dirArrow" transform="rotate(90) translate(36 -43)" onmousedown="handlePan(1,0)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowRight.mouseover" end="arrowRight.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowDown" xlink:href="#dirArrow" transform="rotate(180) translate(-30 -48)" onmousedown="handlePan(0,1)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowDown.mouseover" end="arrowDown.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowLeft" xlink:href="#dirArrow" transform="rotate(270) translate(-36 17)" onmousedown="handlePan(-1,0)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowLeft.mouseover" end="arrowLeft.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
</g>
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
<g id="arrow_out" transform="scale(0.3 0.3)">
<a xlink:href="inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg" target="_base">
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
<path id="arrow"
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
style="fill:#404040;"/>
</a>
</g>
</svg>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 13 KiB

151
d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg Normal file
View File

@@ -0,0 +1,151 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: main Pages: 1 -->
<svg width="621pt" height="142pt"
viewBox="0.00 0.00 621.00 142.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 617,-138 617,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Main function.">
<polygon fill="#bfbfbf" stroke="black" points="0,-76.5 0,-95.5 38,-95.5 38,-76.5 0,-76.5"/>
<text text-anchor="middle" x="19" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">main</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" target="_top" xlink:title="Self&#45;test implementations.">
<polygon fill="white" stroke="black" points="74,-76.5 74,-95.5 107,-95.5 107,-76.5 74,-76.5"/>
<text text-anchor="middle" x="90.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M38.26,-86C46.07,-86 55.31,-86 63.79,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="63.95,-89.5 73.95,-86 63.95,-82.5 63.95,-89.5"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
<polygon fill="white" stroke="black" points="143,-76.5 143,-95.5 250,-95.5 250,-76.5 143,-76.5"/>
<text text-anchor="middle" x="196.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M107.3,-86C114.46,-86 123.46,-86 132.94,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="132.94,-89.5 142.94,-86 132.94,-82.5 132.94,-89.5"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="559,-114.5 559,-133.5 613,-133.5 613,-114.5 559,-114.5"/>
<text text-anchor="middle" x="586" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M215.88,-95.58C233.37,-104.13 260.71,-116.05 286,-121 379.09,-139.22 491.62,-132.96 548.41,-127.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="549.05,-131.34 558.68,-126.92 548.4,-124.37 549.05,-131.34"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="441,-76.5 441,-95.5 523,-95.5 523,-76.5 441,-76.5"/>
<text text-anchor="middle" x="482" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node5 -->
<g id="edge4" class="edge">
<title>Node3&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M233.39,-95.51C249.37,-99.27 268.5,-103.14 286,-105 338.59,-110.58 352.51,-111.46 405,-105 416.69,-103.56 429.17,-100.92 440.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="441.48,-101.44 450.26,-95.51 439.7,-94.67 441.48,-101.44"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="286,-76.5 286,-95.5 405,-95.5 405,-76.5 286,-76.5"/>
<text text-anchor="middle" x="345.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node6 -->
<g id="edge6" class="edge">
<title>Node3&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M250.16,-86C258.5,-86 267.24,-86 275.89,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="275.98,-89.5 285.98,-86 275.98,-82.5 275.98,-89.5"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
<polygon fill="white" stroke="black" points="286,-38.5 286,-57.5 405,-57.5 405,-38.5 286,-38.5"/>
<text text-anchor="middle" x="345.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node7 -->
<g id="edge8" class="edge">
<title>Node3&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M234.59,-76.41C253.82,-71.44 277.49,-65.32 297.93,-60.04"/>
<polygon fill="midnightblue" stroke="midnightblue" points="298.87,-63.41 307.67,-57.52 297.11,-56.63 298.87,-63.41"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
<polygon fill="white" stroke="black" points="286,-0.5 286,-19.5 405,-19.5 405,-0.5 286,-0.5"/>
<text text-anchor="middle" x="345.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
</a>
</g>
</g>
<!-- Node3&#45;&gt;Node8 -->
<g id="edge10" class="edge">
<title>Node3&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M210.08,-76.4C226.71,-64.07 257.27,-42.63 286,-29 290.64,-26.8 295.61,-24.75 300.61,-22.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="301.93,-26.12 310.2,-19.5 299.61,-19.52 301.93,-26.12"/>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge5" class="edge">
<title>Node5&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M508.74,-95.59C521.18,-100.22 536.31,-105.86 549.8,-110.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="548.68,-114.2 559.27,-114.41 551.12,-107.64 548.68,-114.2"/>
</g>
<!-- Node6&#45;&gt;Node5 -->
<g id="edge7" class="edge">
<title>Node6&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M405.1,-86C413.56,-86 422.21,-86 430.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="430.76,-89.5 440.76,-86 430.76,-82.5 430.76,-89.5"/>
</g>
<!-- Node7&#45;&gt;Node5 -->
<g id="edge9" class="edge">
<title>Node7&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M380.44,-57.59C397.72,-62.47 418.93,-68.46 437.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="436.5,-77.06 447.07,-76.41 438.4,-70.33 436.5,-77.06"/>
</g>
<!-- Node8&#45;&gt;Node5 -->
<g id="edge11" class="edge">
<title>Node8&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M382.22,-19.53C389.93,-22.15 397.89,-25.31 405,-29 426.29,-40.05 447.92,-56.95 462.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="460.6,-72.35 470.44,-76.27 465.2,-67.07 460.6,-72.35"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 7.7 KiB

3
d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.map Normal file
View File

@@ -0,0 +1,3 @@
<map id="operations_on_datastructures::inorder_traversal_of_bst::findMinNode" name="operations_on_datastructures::inorder_traversal_of_bst::findMinNode">
<area shape="rect" id="node1" title="Finds and return the minimum node in BST." alt="" coords="5,29,204,85"/>
</map>

1
d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
98116e169b6bec24c5d449688cdbb704

30
d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.svg Normal file
View File

@@ -0,0 +1,30 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::findMinNode Pages: 1 -->
<svg width="157pt" height="68pt"
viewBox="0.00 0.00 157.00 68.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64)">
<title>operations_on_datastructures::inorder_traversal_of_bst::findMinNode</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-64 153,-64 153,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Finds and return the minimum node in BST.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-41.5 149,-41.5 149,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
<text text-anchor="middle" x="74.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::findMinNode</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M47.3,-41.86C44.33,-51.54 53.4,-60 74.5,-60 87.69,-60 96.18,-56.7 99.96,-51.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="103.43,-52.32 101.7,-41.86 96.54,-51.12 103.43,-52.32"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.6 KiB

3
d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.map Normal file
View File

@@ -0,0 +1,3 @@
<map id="operations_on_datastructures::inorder_traversal_of_bst::makeNode" name="operations_on_datastructures::inorder_traversal_of_bst::makeNode">
<area shape="rect" id="node1" title="Allocates a new node in heap for given data and returns it&#39;s pointer." alt="" coords="5,29,204,85"/>
</map>

1
d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
9840c3d8af7efe8c22f0f0f42186210b

30
d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.svg Normal file
View File

@@ -0,0 +1,30 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::makeNode Pages: 1 -->
<svg width="157pt" height="68pt"
viewBox="0.00 0.00 157.00 68.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64)">
<title>operations_on_datastructures::inorder_traversal_of_bst::makeNode</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-64 153,-64 153,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Allocates a new node in heap for given data and returns it&#39;s pointer.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-41.5 149,-41.5 149,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
<text text-anchor="middle" x="74.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::makeNode</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M47.3,-41.86C44.33,-51.54 53.4,-60 74.5,-60 87.69,-60 96.18,-56.7 99.96,-51.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="103.43,-52.32 101.7,-41.86 96.54,-51.12 103.43,-52.32"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.7 KiB

3
d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.map Normal file
View File

@@ -0,0 +1,3 @@
<map id="operations_on_datastructures::inorder_traversal_of_bst::printInorder" name="operations_on_datastructures::inorder_traversal_of_bst::printInorder">
<area shape="rect" id="node1" title="Prints the BST in inorder traversal using recursion." alt="" coords="5,29,204,85"/>
</map>

1
d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
e0f1c24313a256e5f8f8cf20580ae974

30
d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg Normal file
View File

@@ -0,0 +1,30 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::printInorder Pages: 1 -->
<svg width="157pt" height="68pt"
viewBox="0.00 0.00 157.00 68.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64)">
<title>operations_on_datastructures::inorder_traversal_of_bst::printInorder</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-64 153,-64 153,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Prints the BST in inorder traversal using recursion.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-41.5 149,-41.5 149,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
<text text-anchor="middle" x="74.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::printInorder</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M47.3,-41.86C44.33,-51.54 53.4,-60 74.5,-60 87.69,-60 96.18,-56.7 99.96,-51.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="103.43,-52.32 101.7,-41.86 96.54,-51.12 103.43,-52.32"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.7 KiB

3
d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.map Normal file
View File

@@ -0,0 +1,3 @@
<map id="operations_on_datastructures::inorder_traversal_of_bst::getNode" name="operations_on_datastructures::inorder_traversal_of_bst::getNode">
<area shape="rect" id="node1" title="Searches the given data in BST and returns the pointer to the node containing that data." alt="" coords="5,29,204,85"/>
</map>

1
d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
c8215d87446a8331c5f2295f046a5d3d

30
d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.svg Normal file
View File

@@ -0,0 +1,30 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::getNode Pages: 1 -->
<svg width="157pt" height="68pt"
viewBox="0.00 0.00 157.00 68.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64)">
<title>operations_on_datastructures::inorder_traversal_of_bst::getNode</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-64 153,-64 153,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Searches the given data in BST and returns the pointer to the node containing that data.">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-41.5 149,-41.5 149,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
<text text-anchor="middle" x="74.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::getNode</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M47.3,-41.86C44.33,-51.54 53.4,-60 74.5,-60 87.69,-60 96.18,-56.7 99.96,-51.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="103.43,-52.32 101.7,-41.86 96.54,-51.12 103.43,-52.32"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.7 KiB

3
d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.map Normal file
View File

@@ -0,0 +1,3 @@
<map id="operations_on_datastructures::inorder_traversal_of_bst::deallocate" name="operations_on_datastructures::inorder_traversal_of_bst::deallocate">
<area shape="rect" id="node1" title="This function clears the memory allocated to entire tree recursively. Its just for clean up the memor..." alt="" coords="5,29,204,85"/>
</map>

1
d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
2d748e1986f3f669c9d295e23716561d

30
d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.svg Normal file
View File

@@ -0,0 +1,30 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::deallocate Pages: 1 -->
<svg width="157pt" height="68pt"
viewBox="0.00 0.00 157.00 68.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64)">
<title>operations_on_datastructures::inorder_traversal_of_bst::deallocate</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-64 153,-64 153,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-41.5 149,-41.5 149,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
<text text-anchor="middle" x="74.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::deallocate</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M47.3,-41.86C44.33,-51.54 53.4,-60 74.5,-60 87.69,-60 96.18,-56.7 99.96,-51.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="103.43,-52.32 101.7,-41.86 96.54,-51.12 103.43,-52.32"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.7 KiB

3
d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.map Normal file
View File

@@ -0,0 +1,3 @@
<map id="operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor" name="operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor">
<area shape="rect" id="node1" title="Inorder successor of a node is the next node in inorder traversal of the Binary Tree...." alt="" coords="5,29,204,85"/>
</map>

1
d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
a4aa86d37999e783d2034a506f0343b1

30
d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.svg Normal file
View File

@@ -0,0 +1,30 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor Pages: 1 -->
<svg width="157pt" height="68pt"
viewBox="0.00 0.00 157.00 68.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64)">
<title>operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-64 153,-64 153,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Inorder successor of a node is the next node in inorder traversal of the Binary Tree....">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-41.5 149,-41.5 149,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
<text text-anchor="middle" x="74.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::getInorderSuccessor</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M47.3,-41.86C44.33,-51.54 53.4,-60 74.5,-60 87.69,-60 96.18,-56.7 99.96,-51.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="103.43,-52.32 101.7,-41.86 96.54,-51.12 103.43,-52.32"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.7 KiB

9
d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map Normal file
View File

@@ -0,0 +1,9 @@
<map id="test" name="test">
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,56,49,83"/>
<area shape="rect" id="node2" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="97,56,240,83"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="652,5,724,32"/>
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="495,56,604,83"/>
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="288,56,447,83"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="288,107,447,133"/>
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="288,157,447,184"/>
</map>

1
d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
8387bcc4b0cc5bb822748e702fc24784

224
d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg Normal file
View File

@@ -0,0 +1,224 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: test Pages: 1 -->
<!--zoomable 142 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="text/javascript"><![CDATA[
var edges = document.getElementsByTagName('g');
if (edges && edges.length) {
for (var i=0;i<edges.length;i++) {
if (edges[i].id.substr(0,4)=='edge') {
edges[i].setAttribute('class','edge');
}
}
}
]]></script>
<defs>
<circle id="rim" cx="0" cy="0" r="7"/>
<circle id="rim2" cx="0" cy="0" r="3.5"/>
<g id="zoomPlus">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/>
</use>
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="zoomMin">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/>
</use>
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="dirArrow">
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="resetDef">
<use xlink:href="#rim2" fill="#404040">
<set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/>
</use>
</g>
</defs>
<script type="text/javascript">
var viewWidth = 547;
var viewHeight = 142;
var sectionId = 'dynsection-9';
</script>
<script xlink:href="../../svgpan.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<title>test</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 543,-138 543,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#bfbfbf" stroke="black" points="0,-76.5 0,-95.5 33,-95.5 33,-76.5 0,-76.5"/>
<text text-anchor="middle" x="16.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
<polygon fill="white" stroke="black" points="69,-76.5 69,-95.5 176,-95.5 176,-76.5 69,-76.5"/>
<text text-anchor="middle" x="122.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M33.3,-86C40.46,-86 49.46,-86 58.94,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="58.94,-89.5 68.94,-86 58.94,-82.5 58.94,-89.5"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="485,-114.5 485,-133.5 539,-133.5 539,-114.5 485,-114.5"/>
<text text-anchor="middle" x="512" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M141.88,-95.58C159.37,-104.13 186.71,-116.05 212,-121 305.09,-139.22 417.62,-132.96 474.41,-127.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="475.05,-131.34 484.68,-126.92 474.4,-124.37 475.05,-131.34"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="367,-76.5 367,-95.5 449,-95.5 449,-76.5 367,-76.5"/>
<text text-anchor="middle" x="408" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 264.59,-110.58 278.51,-111.46 331,-105 342.69,-103.56 355.17,-100.92 366.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="367.48,-101.44 376.26,-95.51 365.7,-94.67 367.48,-101.44"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="212,-76.5 212,-95.5 331,-95.5 331,-76.5 212,-76.5"/>
<text text-anchor="middle" x="271.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge5" class="edge">
<title>Node2&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M176.16,-86C184.5,-86 193.24,-86 201.89,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="201.98,-89.5 211.98,-86 201.98,-82.5 201.98,-89.5"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
<polygon fill="white" stroke="black" points="212,-38.5 212,-57.5 331,-57.5 331,-38.5 212,-38.5"/>
<text text-anchor="middle" x="271.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge7" class="edge">
<title>Node2&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M160.59,-76.41C179.82,-71.44 203.49,-65.32 223.93,-60.04"/>
<polygon fill="midnightblue" stroke="midnightblue" points="224.87,-63.41 233.67,-57.52 223.11,-56.63 224.87,-63.41"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
<polygon fill="white" stroke="black" points="212,-0.5 212,-19.5 331,-19.5 331,-0.5 212,-0.5"/>
<text text-anchor="middle" x="271.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node7 -->
<g id="edge9" class="edge">
<title>Node2&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M136.08,-76.4C152.71,-64.07 183.27,-42.63 212,-29 216.64,-26.8 221.61,-24.75 226.61,-22.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="227.93,-26.12 236.2,-19.5 225.61,-19.52 227.93,-26.12"/>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M434.74,-95.59C447.18,-100.22 462.31,-105.86 475.8,-110.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="474.68,-114.2 485.27,-114.41 477.12,-107.64 474.68,-114.2"/>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M331.1,-86C339.56,-86 348.21,-86 356.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="356.76,-89.5 366.76,-86 356.76,-82.5 356.76,-89.5"/>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge8" class="edge">
<title>Node6&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M306.44,-57.59C323.72,-62.47 344.93,-68.46 363.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="362.5,-77.06 373.07,-76.41 364.4,-70.33 362.5,-77.06"/>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge10" class="edge">
<title>Node7&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M308.22,-19.53C315.93,-22.15 323.89,-25.31 331,-29 352.29,-40.05 373.92,-56.95 388.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="386.6,-72.35 396.44,-76.27 391.2,-67.07 386.6,-72.35"/>
</g>
</g>
</svg>
<g id="navigator" transform="translate(0 0)" fill="#404254">
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
<g id="arrowUp" xlink:href="#dirArrow" transform="translate(30 24)" onmousedown="handlePan(0,-1)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowUp.mouseover" end="arrowUp.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowRight" xlink:href="#dirArrow" transform="rotate(90) translate(36 -43)" onmousedown="handlePan(1,0)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowRight.mouseover" end="arrowRight.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowDown" xlink:href="#dirArrow" transform="rotate(180) translate(-30 -48)" onmousedown="handlePan(0,1)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowDown.mouseover" end="arrowDown.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowLeft" xlink:href="#dirArrow" transform="rotate(270) translate(-36 17)" onmousedown="handlePan(-1,0)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowLeft.mouseover" end="arrowLeft.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
</g>
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
<g id="arrow_out" transform="scale(0.3 0.3)">
<a xlink:href="inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg" target="_base">
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
<path id="arrow"
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
style="fill:#404040;"/>
</a>
</g>
</svg>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 12 KiB

136
d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg Normal file
View File

@@ -0,0 +1,136 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: test Pages: 1 -->
<svg width="547pt" height="142pt"
viewBox="0.00 0.00 547.00 142.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138)">
<title>test</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 543,-138 543,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Self&#45;test implementations.">
<polygon fill="#bfbfbf" stroke="black" points="0,-76.5 0,-95.5 33,-95.5 33,-76.5 0,-76.5"/>
<text text-anchor="middle" x="16.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">test</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" target="_top" xlink:title="Executes test cases.">
<polygon fill="white" stroke="black" points="69,-76.5 69,-95.5 176,-95.5 176,-76.5 69,-76.5"/>
<text text-anchor="middle" x="122.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M33.3,-86C40.46,-86 49.46,-86 58.94,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="58.94,-89.5 68.94,-86 58.94,-82.5 58.94,-89.5"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="485,-114.5 485,-133.5 539,-133.5 539,-114.5 485,-114.5"/>
<text text-anchor="middle" x="512" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M141.88,-95.58C159.37,-104.13 186.71,-116.05 212,-121 305.09,-139.22 417.62,-132.96 474.41,-127.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="475.05,-131.34 484.68,-126.92 474.4,-124.37 475.05,-131.34"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="367,-76.5 367,-95.5 449,-95.5 449,-76.5 367,-76.5"/>
<text text-anchor="middle" x="408" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 264.59,-110.58 278.51,-111.46 331,-105 342.69,-103.56 355.17,-100.92 366.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="367.48,-101.44 376.26,-95.51 365.7,-94.67 367.48,-101.44"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="212,-76.5 212,-95.5 331,-95.5 331,-76.5 212,-76.5"/>
<text text-anchor="middle" x="271.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node5 -->
<g id="edge5" class="edge">
<title>Node2&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M176.16,-86C184.5,-86 193.24,-86 201.89,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="201.98,-89.5 211.98,-86 201.98,-82.5 201.98,-89.5"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
<polygon fill="white" stroke="black" points="212,-38.5 212,-57.5 331,-57.5 331,-38.5 212,-38.5"/>
<text text-anchor="middle" x="271.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node6 -->
<g id="edge7" class="edge">
<title>Node2&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M160.59,-76.41C179.82,-71.44 203.49,-65.32 223.93,-60.04"/>
<polygon fill="midnightblue" stroke="midnightblue" points="224.87,-63.41 233.67,-57.52 223.11,-56.63 224.87,-63.41"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
<polygon fill="white" stroke="black" points="212,-0.5 212,-19.5 331,-19.5 331,-0.5 212,-0.5"/>
<text text-anchor="middle" x="271.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node7 -->
<g id="edge9" class="edge">
<title>Node2&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M136.08,-76.4C152.71,-64.07 183.27,-42.63 212,-29 216.64,-26.8 221.61,-24.75 226.61,-22.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="227.93,-26.12 236.2,-19.5 225.61,-19.52 227.93,-26.12"/>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M434.74,-95.59C447.18,-100.22 462.31,-105.86 475.8,-110.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="474.68,-114.2 485.27,-114.41 477.12,-107.64 474.68,-114.2"/>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M331.1,-86C339.56,-86 348.21,-86 356.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="356.76,-89.5 366.76,-86 356.76,-82.5 356.76,-89.5"/>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge8" class="edge">
<title>Node6&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M306.44,-57.59C323.72,-62.47 344.93,-68.46 363.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="362.5,-77.06 373.07,-76.41 364.4,-70.33 362.5,-77.06"/>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge10" class="edge">
<title>Node7&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M308.22,-19.53C315.93,-22.15 323.89,-25.31 331,-29 352.29,-40.05 373.92,-56.95 388.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="386.6,-72.35 396.44,-76.27 391.2,-67.07 386.6,-72.35"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 6.9 KiB

3
d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.map Normal file
View File

@@ -0,0 +1,3 @@
<map id="operations_on_datastructures::inorder_traversal_of_bst::makeBST" name="operations_on_datastructures::inorder_traversal_of_bst::makeBST">
<area shape="rect" id="node1" title="This function is used in test cases to quickly create BST containing large data instead of hard codin..." alt="" coords="5,29,204,85"/>
</map>

1
d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.md5 Normal file
View File

@@ -0,0 +1 @@
1fc40f4869b51b8597df81c4eaa43674

30
d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.svg Normal file
View File

@@ -0,0 +1,30 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: operations_on_datastructures::inorder_traversal_of_bst::makeBST Pages: 1 -->
<svg width="157pt" height="68pt"
viewBox="0.00 0.00 157.00 68.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 64)">
<title>operations_on_datastructures::inorder_traversal_of_bst::makeBST</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-64 153,-64 153,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="This function is used in test cases to quickly create BST containing large data instead of hard codin...">
<polygon fill="#bfbfbf" stroke="black" points="0,-0.5 0,-41.5 149,-41.5 149,-0.5 0,-0.5"/>
<text text-anchor="start" x="8" y="-29.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="start" x="8" y="-18.5" font-family="Helvetica,sans-Serif" font-size="10.00">::inorder_traversal_of_bst</text>
<text text-anchor="middle" x="74.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">::makeBST</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node1 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node1</title>
<path fill="none" stroke="midnightblue" d="M47.3,-41.86C44.33,-51.54 53.4,-60 74.5,-60 87.69,-60 96.18,-56.7 99.96,-51.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="103.43,-52.32 101.7,-41.86 96.54,-51.12 103.43,-52.32"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 1.7 KiB

10
d5/d45/sublist__search_8cpp.html
View File

@@ -149,14 +149,14 @@ Functions</h2></td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of the <a href="https://www.geeksforgeeks.org/sublist-search-search-a-linked-list-in-another-list">Sublist Search Algorithm</a> </p>
<h3><a class="anchor" id="autotoc_md84"></a>
<h3><a class="anchor" id="autotoc_md88"></a>
Algorithm</h3>
<ul>
<li>Sublist search is used to detect a presence of one list in another list.</li>
<li>Suppose we have a single-node list (let's say the first list), and we want to ensure that the list is present in another list (let's say the second list), then we can perform the sublist search to find it.</li>
<li>For instance, the first list contains these elements: 23 -&gt; 30 -&gt; 41, and the second list contains these elements: 10 -&gt; 15 -&gt; 23 -&gt; 30 -&gt; 41 -&gt; 49. At a glance, we see that the first list presents in the second list.</li>
</ul>
<h3><a class="anchor" id="autotoc_md85"></a>
<h3><a class="anchor" id="autotoc_md89"></a>
Working</h3>
<ul>
<li>The sublist search algorithm works by comparing the first element of the first list with the first element of the second list.</li>
@@ -478,12 +478,12 @@ Here is the call graph for this function:</div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html">TestCases</a> tc;</div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>&#160; tc.<a class="code" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>();</div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>&#160;}</div>
<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:153</div></div>
<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:171</div></div>
<div class="ttc" id="aclass_test_cases_html"><div class="ttname"><a href="../../d5/d58/class_test_cases.html">TestCases</a></div><div class="ttdoc">class encapsulating the necessary test cases</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:225</div></div>
<div class="ttc" id="aclass_test_cases_html_aeabea90c02f9159e4a784bbf736e1e23"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">TestCases::runTests</a></div><div class="ttdeci">void runTests()</div><div class="ttdoc">Executes test cases.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:243</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="443"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg" width="100%" height="442"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
</div>
</div>

7
d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
View File

@@ -1,11 +1,10 @@
<map id="main" name="main">
<area shape="rect" id="node1" title="Main function." alt="" coords="5,68,56,95"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="797,43,869,69"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="751,43,823,69"/>
<area shape="rect" id="node3" href="$d5/d45/sublist__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d" title="Self&#45;test implementations." alt="" coords="104,93,148,120"/>
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="196,119,339,145"/>
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="617,144,726,171"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, Only contains one element." alt="" coords="387,144,545,171"/>
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="593,144,703,171"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="387,144,545,171"/>
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="387,195,545,221"/>
<area shape="rect" id="node8" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="387,245,545,272"/>
<area shape="rect" id="node9" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="593,245,749,272"/>
</map>

2
d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
View File

@@ -1 +1 @@
8f401a7fcc69e2bbac2b4f7d461211c9
0f4cc014afe33e9372a57354b7ceb14a

57
d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
View File

@@ -46,7 +46,7 @@ if (edges && edges.length) {
</defs>
<script type="text/javascript">
var viewWidth = 656;
var viewWidth = 621;
var viewHeight = 208;
var sectionId = 'dynsection-1';
</script>
@@ -54,7 +54,7 @@ var sectionId = 'dynsection-1';
<svg id="graph" class="graph">
<g id="viewport">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-204 652,-204 652,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-204 617,-204 617,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
@@ -68,16 +68,16 @@ var sectionId = 'dynsection-1';
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="594,-152.5 594,-171.5 648,-171.5 648,-152.5 594,-152.5"/>
<text text-anchor="middle" x="621" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="black" points="559,-152.5 559,-171.5 613,-171.5 613,-152.5 559,-152.5"/>
<text text-anchor="middle" x="586" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M37.33,-152.67C68.15,-168.93 134.95,-200 195.5,-200 195.5,-200 195.5,-200 346.5,-200 432.16,-200 531.49,-181.49 583.67,-170.3"/>
<polygon fill="midnightblue" stroke="midnightblue" points="584.74,-173.65 593.77,-168.11 583.25,-166.81 584.74,-173.65"/>
<path fill="none" stroke="midnightblue" d="M37.33,-152.67C68.15,-168.93 134.95,-200 195.5,-200 195.5,-200 195.5,-200 346.5,-200 419,-200 502.38,-182.66 548.86,-171.41"/>
<polygon fill="midnightblue" stroke="midnightblue" points="549.88,-174.76 558.75,-168.97 548.2,-167.97 549.88,-174.76"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
@@ -112,28 +112,28 @@ var sectionId = 'dynsection-1';
<!-- Node4&#45;&gt;Node2 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M243.78,-114.53C257.35,-117.15 272.24,-119.86 286,-122 394.01,-138.82 522.62,-152.43 583.97,-158.53"/>
<polygon fill="midnightblue" stroke="midnightblue" points="583.63,-162.01 593.93,-159.51 584.32,-155.05 583.63,-162.01"/>
<path fill="none" stroke="midnightblue" d="M247.98,-114.51C260.4,-116.74 273.66,-119.04 286,-121 380.55,-136.02 492.46,-150.49 548.77,-157.54"/>
<polygon fill="midnightblue" stroke="midnightblue" points="548.59,-161.04 558.95,-158.81 549.46,-154.1 548.59,-161.04"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="458.5,-76.5 458.5,-95.5 540.5,-95.5 540.5,-76.5 458.5,-76.5"/>
<text text-anchor="middle" x="499.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
<polygon fill="white" stroke="black" points="441,-76.5 441,-95.5 523,-95.5 523,-76.5 441,-76.5"/>
<text text-anchor="middle" x="482" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge5" class="edge">
<title>Node4&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M250.09,-107.9C292.12,-109.52 352.49,-110.28 405,-105 420,-103.49 436.15,-100.65 450.74,-97.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="451.51,-101.04 460.55,-95.51 450.04,-94.19 451.51,-101.04"/>
<path fill="none" stroke="midnightblue" d="M250.16,-108.54C292.24,-110.52 352.62,-111.45 405,-105 416.69,-103.56 429.17,-100.92 440.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="441.48,-101.44 450.26,-95.51 439.7,-94.67 441.48,-101.44"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="286,-76.5 286,-95.5 405,-95.5 405,-76.5 286,-76.5"/>
<text text-anchor="middle" x="345.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
@@ -178,41 +178,26 @@ var sectionId = 'dynsection-1';
<!-- Node5&#45;&gt;Node2 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M515.63,-95.63C536.02,-108.59 572.49,-131.79 596.47,-147.04"/>
<polygon fill="midnightblue" stroke="midnightblue" points="594.67,-150.04 604.99,-152.45 598.43,-144.13 594.67,-150.04"/>
<path fill="none" stroke="midnightblue" d="M495.92,-95.63C513.09,-108.42 543.63,-131.17 564.1,-146.43"/>
<polygon fill="midnightblue" stroke="midnightblue" points="562.08,-149.28 572.19,-152.45 566.26,-143.67 562.08,-149.28"/>
</g>
<!-- Node6&#45;&gt;Node5 -->
<g id="edge8" class="edge">
<title>Node6&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M405.27,-86C419.38,-86 434.33,-86 448.03,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="448.23,-89.5 458.22,-86 448.22,-82.5 448.23,-89.5"/>
<path fill="none" stroke="midnightblue" d="M405.1,-86C413.56,-86 422.21,-86 430.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="430.76,-89.5 440.76,-86 430.76,-82.5 430.76,-89.5"/>
</g>
<!-- Node7&#45;&gt;Node5 -->
<g id="edge10" class="edge">
<title>Node7&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M384.86,-57.59C404.82,-62.58 429.43,-68.73 450.63,-74.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="449.87,-77.45 460.42,-76.48 451.57,-70.66 449.87,-77.45"/>
<path fill="none" stroke="midnightblue" d="M380.44,-57.59C397.72,-62.47 418.93,-68.46 437.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="436.5,-77.06 447.07,-76.41 438.4,-70.33 436.5,-77.06"/>
</g>
<!-- Node8&#45;&gt;Node5 -->
<g id="edge12" class="edge">
<title>Node8&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M380.43,-19.54C388.61,-22.24 397.24,-25.43 405,-29 430.83,-40.87 458.39,-58.32 476.84,-70.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="474.89,-73.69 485.12,-76.45 478.85,-67.92 474.89,-73.69"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="441,-0.5 441,-19.5 558,-19.5 558,-0.5 441,-0.5"/>
<text text-anchor="middle" x="499.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge13" class="edge">
<title>Node8&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M405.27,-10C413.58,-10 422.19,-10 430.66,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="430.89,-13.5 440.89,-10 430.89,-6.5 430.89,-13.5"/>
<path fill="none" stroke="midnightblue" d="M382.22,-19.53C389.93,-22.15 397.89,-25.31 405,-29 426.29,-40.05 447.92,-56.95 462.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="460.6,-72.35 470.44,-76.27 465.2,-67.07 460.6,-72.35"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 14 KiB

After

Width:  |  Height:  |  Size: 13 KiB

59
d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
View File

@@ -4,11 +4,11 @@
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: main Pages: 1 -->
<svg width="656pt" height="208pt"
viewBox="0.00 0.00 656.00 208.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<svg width="621pt" height="208pt"
viewBox="0.00 0.00 621.00 208.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 204)">
<title>main</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-204 652,-204 652,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-204 617,-204 617,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
@@ -22,16 +22,16 @@
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="594,-152.5 594,-171.5 648,-171.5 648,-152.5 594,-152.5"/>
<text text-anchor="middle" x="621" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="black" points="559,-152.5 559,-171.5 613,-171.5 613,-152.5 559,-152.5"/>
<text text-anchor="middle" x="586" y="-159.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M37.33,-152.67C68.15,-168.93 134.95,-200 195.5,-200 195.5,-200 195.5,-200 346.5,-200 432.16,-200 531.49,-181.49 583.67,-170.3"/>
<polygon fill="midnightblue" stroke="midnightblue" points="584.74,-173.65 593.77,-168.11 583.25,-166.81 584.74,-173.65"/>
<path fill="none" stroke="midnightblue" d="M37.33,-152.67C68.15,-168.93 134.95,-200 195.5,-200 195.5,-200 195.5,-200 346.5,-200 419,-200 502.38,-182.66 548.86,-171.41"/>
<polygon fill="midnightblue" stroke="midnightblue" points="549.88,-174.76 558.75,-168.97 548.2,-167.97 549.88,-174.76"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
@@ -66,28 +66,28 @@
<!-- Node4&#45;&gt;Node2 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M243.78,-114.53C257.35,-117.15 272.24,-119.86 286,-122 394.01,-138.82 522.62,-152.43 583.97,-158.53"/>
<polygon fill="midnightblue" stroke="midnightblue" points="583.63,-162.01 593.93,-159.51 584.32,-155.05 583.63,-162.01"/>
<path fill="none" stroke="midnightblue" d="M247.98,-114.51C260.4,-116.74 273.66,-119.04 286,-121 380.55,-136.02 492.46,-150.49 548.77,-157.54"/>
<polygon fill="midnightblue" stroke="midnightblue" points="548.59,-161.04 558.95,-158.81 549.46,-154.1 548.59,-161.04"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="458.5,-76.5 458.5,-95.5 540.5,-95.5 540.5,-76.5 458.5,-76.5"/>
<text text-anchor="middle" x="499.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
<polygon fill="white" stroke="black" points="441,-76.5 441,-95.5 523,-95.5 523,-76.5 441,-76.5"/>
<text text-anchor="middle" x="482" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node4&#45;&gt;Node5 -->
<g id="edge5" class="edge">
<title>Node4&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M250.09,-107.9C292.12,-109.52 352.49,-110.28 405,-105 420,-103.49 436.15,-100.65 450.74,-97.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="451.51,-101.04 460.55,-95.51 450.04,-94.19 451.51,-101.04"/>
<path fill="none" stroke="midnightblue" d="M250.16,-108.54C292.24,-110.52 352.62,-111.45 405,-105 416.69,-103.56 429.17,-100.92 440.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="441.48,-101.44 450.26,-95.51 439.7,-94.67 441.48,-101.44"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="286,-76.5 286,-95.5 405,-95.5 405,-76.5 286,-76.5"/>
<text text-anchor="middle" x="345.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
@@ -132,41 +132,26 @@
<!-- Node5&#45;&gt;Node2 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M515.63,-95.63C536.02,-108.59 572.49,-131.79 596.47,-147.04"/>
<polygon fill="midnightblue" stroke="midnightblue" points="594.67,-150.04 604.99,-152.45 598.43,-144.13 594.67,-150.04"/>
<path fill="none" stroke="midnightblue" d="M495.92,-95.63C513.09,-108.42 543.63,-131.17 564.1,-146.43"/>
<polygon fill="midnightblue" stroke="midnightblue" points="562.08,-149.28 572.19,-152.45 566.26,-143.67 562.08,-149.28"/>
</g>
<!-- Node6&#45;&gt;Node5 -->
<g id="edge8" class="edge">
<title>Node6&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M405.27,-86C419.38,-86 434.33,-86 448.03,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="448.23,-89.5 458.22,-86 448.22,-82.5 448.23,-89.5"/>
<path fill="none" stroke="midnightblue" d="M405.1,-86C413.56,-86 422.21,-86 430.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="430.76,-89.5 440.76,-86 430.76,-82.5 430.76,-89.5"/>
</g>
<!-- Node7&#45;&gt;Node5 -->
<g id="edge10" class="edge">
<title>Node7&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M384.86,-57.59C404.82,-62.58 429.43,-68.73 450.63,-74.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="449.87,-77.45 460.42,-76.48 451.57,-70.66 449.87,-77.45"/>
<path fill="none" stroke="midnightblue" d="M380.44,-57.59C397.72,-62.47 418.93,-68.46 437.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="436.5,-77.06 447.07,-76.41 438.4,-70.33 436.5,-77.06"/>
</g>
<!-- Node8&#45;&gt;Node5 -->
<g id="edge12" class="edge">
<title>Node8&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M380.43,-19.54C388.61,-22.24 397.24,-25.43 405,-29 430.83,-40.87 458.39,-58.32 476.84,-70.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="474.89,-73.69 485.12,-76.45 478.85,-67.92 474.89,-73.69"/>
</g>
<!-- Node9 -->
<g id="node9" class="node">
<title>Node9</title>
<g id="a_node9"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="441,-0.5 441,-19.5 558,-19.5 558,-0.5 441,-0.5"/>
<text text-anchor="middle" x="499.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node8&#45;&gt;Node9 -->
<g id="edge13" class="edge">
<title>Node8&#45;&gt;Node9</title>
<path fill="none" stroke="midnightblue" d="M405.27,-10C413.58,-10 422.19,-10 430.66,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="430.89,-13.5 440.89,-10 430.89,-6.5 430.89,-13.5"/>
<path fill="none" stroke="midnightblue" d="M382.22,-19.53C389.93,-22.15 397.89,-25.31 405,-29 426.29,-40.05 447.92,-56.95 462.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="460.6,-72.35 470.44,-76.27 465.2,-67.07 460.6,-72.35"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 8.9 KiB

After

Width:  |  Height:  |  Size: 8.1 KiB

15
d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
View File

@@ -1,10 +1,9 @@
<map id="test" name="test">
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,57,49,83"/>
<area shape="rect" id="node2" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="97,57,240,83"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="699,6,771,33"/>
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="518,57,627,83"/>
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, Only contains one element." alt="" coords="288,57,447,83"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="288,107,447,134"/>
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="288,158,447,185"/>
<area shape="rect" id="node8" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="495,158,651,185"/>
<area shape="rect" id="node1" title="Self&#45;test implementations." alt="" coords="5,56,49,83"/>
<area shape="rect" id="node2" href="$d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23" title="Executes test cases." alt="" coords="97,56,240,83"/>
<area shape="rect" id="node3" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="652,5,724,32"/>
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="495,56,604,83"/>
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="288,56,447,83"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="288,107,447,133"/>
<area shape="rect" id="node7" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="288,157,447,184"/>
</map>

2
d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
View File

@@ -1 +1 @@
59cc849d5912d57ceb7252b3490d7478
8387bcc4b0cc5bb822748e702fc24784

57
d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
View File

@@ -4,7 +4,7 @@
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: test Pages: 1 -->
<!--zoomable 143 -->
<!--zoomable 142 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.edge:hover path { stroke: red; }
@@ -46,15 +46,15 @@ if (edges && edges.length) {
</defs>
<script type="text/javascript">
var viewWidth = 582;
var viewHeight = 143;
var viewWidth = 547;
var viewHeight = 142;
var sectionId = 'dynsection-5';
</script>
<script xlink:href="../../svgpan.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<title>test</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138.53 578,-138.53 578,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 543,-138 543,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
@@ -83,36 +83,36 @@ var sectionId = 'dynsection-5';
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="520,-114.5 520,-133.5 574,-133.5 574,-114.5 520,-114.5"/>
<text text-anchor="middle" x="547" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="black" points="485,-114.5 485,-133.5 539,-133.5 539,-114.5 485,-114.5"/>
<text text-anchor="middle" x="512" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M141.88,-95.59C159.37,-104.14 186.7,-116.06 212,-121 318.53,-141.8 447.83,-133.79 509.65,-127.98"/>
<polygon fill="midnightblue" stroke="midnightblue" points="510.08,-131.45 519.69,-127 509.4,-124.48 510.08,-131.45"/>
<path fill="none" stroke="midnightblue" d="M141.88,-95.58C159.37,-104.13 186.71,-116.05 212,-121 305.09,-139.22 417.62,-132.96 474.41,-127.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="475.05,-131.34 484.68,-126.92 474.4,-124.37 475.05,-131.34"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="384.5,-76.5 384.5,-95.5 466.5,-95.5 466.5,-76.5 384.5,-76.5"/>
<text text-anchor="middle" x="425.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
<polygon fill="white" stroke="black" points="367,-76.5 367,-95.5 449,-95.5 449,-76.5 367,-76.5"/>
<text text-anchor="middle" x="408" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 264.59,-110.58 278.38,-110.29 331,-105 346,-103.49 362.15,-100.65 376.74,-97.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="377.51,-101.04 386.55,-95.51 376.04,-94.19 377.51,-101.04"/>
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 264.59,-110.58 278.51,-111.46 331,-105 342.69,-103.56 355.17,-100.92 366.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="367.48,-101.44 376.26,-95.51 365.7,-94.67 367.48,-101.44"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="212,-76.5 212,-95.5 331,-95.5 331,-76.5 212,-76.5"/>
<text text-anchor="middle" x="271.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
@@ -157,41 +157,26 @@ var sectionId = 'dynsection-5';
<!-- Node4&#45;&gt;Node3 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M456.65,-95.59C472.95,-100.77 493.18,-107.21 510.27,-112.64"/>
<polygon fill="midnightblue" stroke="midnightblue" points="509.32,-116.01 519.91,-115.7 511.44,-109.34 509.32,-116.01"/>
<path fill="none" stroke="midnightblue" d="M434.74,-95.59C447.18,-100.22 462.31,-105.86 475.8,-110.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="474.68,-114.2 485.27,-114.41 477.12,-107.64 474.68,-114.2"/>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M331.27,-86C345.38,-86 360.33,-86 374.03,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="374.23,-89.5 384.22,-86 374.22,-82.5 374.23,-89.5"/>
<path fill="none" stroke="midnightblue" d="M331.1,-86C339.56,-86 348.21,-86 356.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="356.76,-89.5 366.76,-86 356.76,-82.5 356.76,-89.5"/>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge8" class="edge">
<title>Node6&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M310.86,-57.59C330.82,-62.58 355.43,-68.73 376.63,-74.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="375.87,-77.45 386.42,-76.48 377.57,-70.66 375.87,-77.45"/>
<path fill="none" stroke="midnightblue" d="M306.44,-57.59C323.72,-62.47 344.93,-68.46 363.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="362.5,-77.06 373.07,-76.41 364.4,-70.33 362.5,-77.06"/>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge10" class="edge">
<title>Node7&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M306.43,-19.54C314.61,-22.24 323.24,-25.43 331,-29 356.83,-40.87 384.39,-58.32 402.84,-70.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="400.89,-73.69 411.12,-76.45 404.85,-67.92 400.89,-73.69"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="367,-0.5 367,-19.5 484,-19.5 484,-0.5 367,-0.5"/>
<text text-anchor="middle" x="425.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge11" class="edge">
<title>Node7&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M331.27,-10C339.58,-10 348.19,-10 356.66,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="356.89,-13.5 366.89,-10 356.89,-6.5 356.89,-13.5"/>
<path fill="none" stroke="midnightblue" d="M308.22,-19.53C315.93,-22.15 323.89,-25.31 331,-29 352.29,-40.05 373.92,-56.95 388.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="386.6,-72.35 396.44,-76.27 391.2,-67.07 386.6,-72.35"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 13 KiB

After

Width:  |  Height:  |  Size: 12 KiB

57
d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
View File

@@ -4,11 +4,11 @@
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: test Pages: 1 -->
<svg width="582pt" height="143pt"
viewBox="0.00 0.00 582.00 142.53" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.53)">
<svg width="547pt" height="142pt"
viewBox="0.00 0.00 547.00 142.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138)">
<title>test</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138.53 578,-138.53 578,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 543,-138 543,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
@@ -37,36 +37,36 @@
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="520,-114.5 520,-133.5 574,-133.5 574,-114.5 520,-114.5"/>
<text text-anchor="middle" x="547" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="black" points="485,-114.5 485,-133.5 539,-133.5 539,-114.5 485,-114.5"/>
<text text-anchor="middle" x="512" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node2&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M141.88,-95.59C159.37,-104.14 186.7,-116.06 212,-121 318.53,-141.8 447.83,-133.79 509.65,-127.98"/>
<polygon fill="midnightblue" stroke="midnightblue" points="510.08,-131.45 519.69,-127 509.4,-124.48 510.08,-131.45"/>
<path fill="none" stroke="midnightblue" d="M141.88,-95.58C159.37,-104.13 186.71,-116.05 212,-121 305.09,-139.22 417.62,-132.96 474.41,-127.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="475.05,-131.34 484.68,-126.92 474.4,-124.37 475.05,-131.34"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="384.5,-76.5 384.5,-95.5 466.5,-95.5 466.5,-76.5 384.5,-76.5"/>
<text text-anchor="middle" x="425.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
<polygon fill="white" stroke="black" points="367,-76.5 367,-95.5 449,-95.5 449,-76.5 367,-76.5"/>
<text text-anchor="middle" x="408" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node2&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node2&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 264.59,-110.58 278.38,-110.29 331,-105 346,-103.49 362.15,-100.65 376.74,-97.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="377.51,-101.04 386.55,-95.51 376.04,-94.19 377.51,-101.04"/>
<path fill="none" stroke="midnightblue" d="M159.39,-95.51C175.37,-99.27 194.5,-103.14 212,-105 264.59,-110.58 278.51,-111.46 331,-105 342.69,-103.56 355.17,-100.92 366.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="367.48,-101.44 376.26,-95.51 365.7,-94.67 367.48,-101.44"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="212,-76.5 212,-95.5 331,-95.5 331,-76.5 212,-76.5"/>
<text text-anchor="middle" x="271.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
@@ -111,41 +111,26 @@
<!-- Node4&#45;&gt;Node3 -->
<g id="edge4" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M456.65,-95.59C472.95,-100.77 493.18,-107.21 510.27,-112.64"/>
<polygon fill="midnightblue" stroke="midnightblue" points="509.32,-116.01 519.91,-115.7 511.44,-109.34 509.32,-116.01"/>
<path fill="none" stroke="midnightblue" d="M434.74,-95.59C447.18,-100.22 462.31,-105.86 475.8,-110.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="474.68,-114.2 485.27,-114.41 477.12,-107.64 474.68,-114.2"/>
</g>
<!-- Node5&#45;&gt;Node4 -->
<g id="edge6" class="edge">
<title>Node5&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M331.27,-86C345.38,-86 360.33,-86 374.03,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="374.23,-89.5 384.22,-86 374.22,-82.5 374.23,-89.5"/>
<path fill="none" stroke="midnightblue" d="M331.1,-86C339.56,-86 348.21,-86 356.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="356.76,-89.5 366.76,-86 356.76,-82.5 356.76,-89.5"/>
</g>
<!-- Node6&#45;&gt;Node4 -->
<g id="edge8" class="edge">
<title>Node6&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M310.86,-57.59C330.82,-62.58 355.43,-68.73 376.63,-74.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="375.87,-77.45 386.42,-76.48 377.57,-70.66 375.87,-77.45"/>
<path fill="none" stroke="midnightblue" d="M306.44,-57.59C323.72,-62.47 344.93,-68.46 363.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="362.5,-77.06 373.07,-76.41 364.4,-70.33 362.5,-77.06"/>
</g>
<!-- Node7&#45;&gt;Node4 -->
<g id="edge10" class="edge">
<title>Node7&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M306.43,-19.54C314.61,-22.24 323.24,-25.43 331,-29 356.83,-40.87 384.39,-58.32 402.84,-70.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="400.89,-73.69 411.12,-76.45 404.85,-67.92 400.89,-73.69"/>
</g>
<!-- Node8 -->
<g id="node8" class="node">
<title>Node8</title>
<g id="a_node8"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="367,-0.5 367,-19.5 484,-19.5 484,-0.5 367,-0.5"/>
<text text-anchor="middle" x="425.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node7&#45;&gt;Node8 -->
<g id="edge11" class="edge">
<title>Node7&#45;&gt;Node8</title>
<path fill="none" stroke="midnightblue" d="M331.27,-10C339.58,-10 348.19,-10 356.66,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="356.89,-13.5 366.89,-10 356.89,-6.5 356.89,-13.5"/>
<path fill="none" stroke="midnightblue" d="M308.22,-19.53C315.93,-22.15 323.89,-25.31 331,-29 352.29,-40.05 373.92,-56.95 388.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="386.6,-72.35 396.44,-76.27 391.2,-67.07 386.6,-72.35"/>
</g>
</g>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 7.7 KiB

After

Width:  |  Height:  |  Size: 6.9 KiB

381
d5/d58/class_test_cases.html
View File

@@ -108,6 +108,18 @@ Public Member Functions</h2></td></tr>
<tr class="memdesc:aeabea90c02f9159e4a784bbf736e1e23"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes test cases. <a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">More...</a><br /></td></tr>
<tr class="separator:aeabea90c02f9159e4a784bbf736e1e23"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a> ()</td></tr>
<tr class="memdesc:ac2636e8b5b9e053374c45bfcf0603008"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case contains edge case, printing inorder successor of last node. <a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">More...</a><br /></td></tr>
<tr class="separator:ac2636e8b5b9e053374c45bfcf0603008"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a> ()</td></tr>
<tr class="memdesc:abae0148985f159b582a385cf399254e3"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case which contains main list of 100 elements and sublist of 20. <a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">More...</a><br /></td></tr>
<tr class="separator:abae0148985f159b582a385cf399254e3"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad9f95c09931625b41e3be1f88d1e28c5"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a> ()</td></tr>
<tr class="memdesc:ad9f95c09931625b41e3be1f88d1e28c5"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case which contains main list of 50 elements and sublist of 20. <a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">More...</a><br /></td></tr>
<tr class="separator:ad9f95c09931625b41e3be1f88d1e28c5"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aeabea90c02f9159e4a784bbf736e1e23"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a> ()</td></tr>
<tr class="memdesc:aeabea90c02f9159e4a784bbf736e1e23"><td class="mdescLeft">&#160;</td><td class="mdescRight">Executes test cases. <a href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">More...</a><br /></td></tr>
<tr class="separator:aeabea90c02f9159e4a784bbf736e1e23"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac2636e8b5b9e053374c45bfcf0603008"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a> ()</td></tr>
<tr class="memdesc:ac2636e8b5b9e053374c45bfcf0603008"><td class="mdescLeft">&#160;</td><td class="mdescRight">A test case contains edge case, Only contains one element. <a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">More...</a><br /></td></tr>
<tr class="separator:ac2636e8b5b9e053374c45bfcf0603008"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abae0148985f159b582a385cf399254e3"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a> ()</td></tr>
@@ -137,6 +149,10 @@ Private Member Functions</h2></td></tr>
<tr class="separator:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a> (T msg)</td></tr>
<tr class="memdesc:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function to print given message on console. <a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">More...</a><br /></td></tr>
<tr class="separator:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memTemplItemLeft" align="right" valign="top">void&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a> (T msg)</td></tr>
<tr class="memdesc:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="mdescLeft">&#160;</td><td class="mdescRight">A function to print64_t given message on console. <a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">More...</a><br /></td></tr>
<tr class="separator:aa3aa3d5bf666f327ee8e2d11d397b06e"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
@@ -145,7 +161,56 @@ Private Member Functions</h2></td></tr>
<p>a class containing the necessary test cases </p>
</div><h2 class="groupheader">Member Function Documentation</h2>
<a id="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">&#9670;&nbsp;</a></span>log() <span class="overload">[1/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">&#9670;&nbsp;</a></span>log() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void TestCases::log </td>
<td>(</td>
<td class="paramtype">T&#160;</td>
<td class="paramname"><em>msg</em></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">private</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A function to print given message on console. </p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
<table class="tparams">
<tr><td class="paramname">T</td><td>Type of the given message. </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>&#160; {</div>
<div class="line"><a name="l00234"></a><span class="lineno"> 234</span>&#160; <span class="comment">// It&#39;s just to avoid writing cout and endl</span></div>
<div class="line"><a name="l00235"></a><span class="lineno"> 235</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00236"></a><span class="lineno"> 236</span>&#160; }</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aa3aa3d5bf666f327ee8e2d11d397b06e_cgraph.svg" width="240" height="38"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">&#9670;&nbsp;</a></span>log() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -182,8 +247,6 @@ template&lt;typename T &gt; </div>
<div class="line"><a name="l00162"></a><span class="lineno"> 162</span>&#160; <span class="comment">// It&#39;s just to avoid writing cout and endl</span></div>
<div class="line"><a name="l00163"></a><span class="lineno"> 163</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;[TESTS] : ---&gt; &quot;</span> &lt;&lt; msg &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00164"></a><span class="lineno"> 164</span>&#160; }</div>
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
<div class="ttc" id="aendl_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a></div><div class="ttdeci">T endl(T... args)</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
@@ -194,7 +257,7 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="aa3aa3d5bf666f327ee8e2d11d397b06e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">&#9670;&nbsp;</a></span>log() <span class="overload">[2/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#aa3aa3d5bf666f327ee8e2d11d397b06e">&#9670;&nbsp;</a></span>log() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -241,7 +304,55 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="aeabea90c02f9159e4a784bbf736e1e23"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">&#9670;&nbsp;</a></span>runTests() <span class="overload">[1/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">&#9670;&nbsp;</a></span>runTests() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void TestCases::runTests </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Executes test cases. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<div class="fragment"><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>&#160; {</div>
<div class="line"><a name="l00244"></a><span class="lineno"> 244</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Running Tests...&quot;</span>);</div>
<div class="line"><a name="l00245"></a><span class="lineno"> 245</span>&#160; </div>
<div class="line"><a name="l00246"></a><span class="lineno"> 246</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>();</div>
<div class="line"><a name="l00247"></a><span class="lineno"> 247</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>();</div>
<div class="line"><a name="l00248"></a><span class="lineno"> 248</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>();</div>
<div class="line"><a name="l00249"></a><span class="lineno"> 249</span>&#160; </div>
<div class="line"><a name="l00250"></a><span class="lineno"> 250</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
<div class="line"><a name="l00251"></a><span class="lineno"> 251</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00252"></a><span class="lineno"> 252</span>&#160; }</div>
<div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:233</div></div>
<div class="ttc" id="aclass_test_cases_html_abae0148985f159b582a385cf399254e3"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">TestCases::testCase_2</a></div><div class="ttdeci">void testCase_2()</div><div class="ttdoc">A test case which contains main list of 100 elements and sublist of 20.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:304</div></div>
<div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case contains edge case, printing inorder successor of last node.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:259</div></div>
<div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case which contains main list of 50 elements and sublist of 20.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:345</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="638" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aeabea90c02f9159e4a784bbf736e1e23"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">&#9670;&nbsp;</a></span>runTests() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -275,21 +386,17 @@ Here is the call graph for this function:</div>
<div class="line"><a name="l00178"></a><span class="lineno"> 178</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Test Cases over!&quot;</span>);</div>
<div class="line"><a name="l00179"></a><span class="lineno"> 179</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00180"></a><span class="lineno"> 180</span>&#160; }</div>
<div class="ttc" id="aclass_test_cases_html_aa3aa3d5bf666f327ee8e2d11d397b06e"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">TestCases::log</a></div><div class="ttdeci">void log(T msg)</div><div class="ttdoc">A function to print given message on console.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:161</div></div>
<div class="ttc" id="aclass_test_cases_html_abae0148985f159b582a385cf399254e3"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">TestCases::testCase_2</a></div><div class="ttdeci">void testCase_2()</div><div class="ttdoc">A test case which contains main list of 100 elements and sublist of 20.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:229</div></div>
<div class="ttc" id="aclass_test_cases_html_ac2636e8b5b9e053374c45bfcf0603008"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">TestCases::testCase_1</a></div><div class="ttdeci">void testCase_1()</div><div class="ttdoc">A test case contains edge case, Only contains one element.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:186</div></div>
<div class="ttc" id="aclass_test_cases_html_ad9f95c09931625b41e3be1f88d1e28c5"><div class="ttname"><a href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">TestCases::testCase_3</a></div><div class="ttdeci">void testCase_3()</div><div class="ttdoc">A test case which contains main list of 50 elements and sublist of 20.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:280</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="100%" height="443"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="638" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="aeabea90c02f9159e4a784bbf736e1e23"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">&#9670;&nbsp;</a></span>runTests() <span class="overload">[2/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#aeabea90c02f9159e4a784bbf736e1e23">&#9670;&nbsp;</a></span>runTests() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -326,14 +433,98 @@ Here is the call graph for this function:</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><div class="zoom"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="100%" height="443"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg" width="638" height="190"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="ac2636e8b5b9e053374c45bfcf0603008"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">&#9670;&nbsp;</a></span>testCase_1() <span class="overload">[1/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">&#9670;&nbsp;</a></span>testCase_1() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void TestCases::testCase_1 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A test case contains edge case, printing inorder successor of last node. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p>&lt; Expected output of this test</p>
<p>&lt; Data to make nodes in BST</p>
<p>&lt; Adding nodes to BST</p>
<p>&lt; Printing inorder to cross-verify.</p>
<p>&lt; The inorder successor node for given data</p>
<p>memory cleanup!</p>
<div class="fragment"><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>&#160; {</div>
<div class="line"><a name="l00260"></a><span class="lineno"> 260</span>&#160; <span class="keyword">const</span> <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
<div class="line"><a name="l00261"></a><span class="lineno"> 261</span>&#160; *expectedOutput = <span class="keyword">nullptr</span>; <span class="comment">///&lt; Expected output of this test</span></div>
<div class="line"><a name="l00262"></a><span class="lineno"> 262</span>&#160; </div>
<div class="line"><a name="l00263"></a><span class="lineno"> 263</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><a name="l00264"></a><span class="lineno"> 264</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 1 : &quot;</span>);</div>
<div class="line"><a name="l00265"></a><span class="lineno"> 265</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Description:&quot;</span>);</div>
<div class="line"><a name="l00266"></a><span class="lineno"> 266</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot; EDGE CASE : Printing inorder successor for last node in the &quot;</span></div>
<div class="line"><a name="l00267"></a><span class="lineno"> 267</span>&#160; <span class="stringliteral">&quot;BST, Output will be nullptr.&quot;</span>);</div>
<div class="line"><a name="l00268"></a><span class="lineno"> 268</span>&#160; </div>
<div class="line"><a name="l00269"></a><span class="lineno"> 269</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
<div class="line"><a name="l00270"></a><span class="lineno"> 270</span>&#160; <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00271"></a><span class="lineno"> 271</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_data{</div>
<div class="line"><a name="l00272"></a><span class="lineno"> 272</span>&#160; 20, 3, 5, 6, 2, 23, 45, 78, 21}; <span class="comment">///&lt; Data to make nodes in BST</span></div>
<div class="line"><a name="l00273"></a><span class="lineno"> 273</span>&#160; </div>
<div class="line"><a name="l00274"></a><span class="lineno"> 274</span>&#160; root = <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
<div class="line"><a name="l00275"></a><span class="lineno"> 275</span>&#160; root,</div>
<div class="line"><a name="l00276"></a><span class="lineno"> 276</span>&#160; node_data); <span class="comment">///&lt; Adding nodes to BST</span></div>
<div class="line"><a name="l00277"></a><span class="lineno"> 277</span>&#160; </div>
<div class="line"><a name="l00278"></a><span class="lineno"> 278</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
<div class="line"><a name="l00279"></a><span class="lineno"> 279</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(</div>
<div class="line"><a name="l00280"></a><span class="lineno"> 280</span>&#160; root); <span class="comment">///&lt; Printing inorder to cross-verify.</span></div>
<div class="line"><a name="l00281"></a><span class="lineno"> 281</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00282"></a><span class="lineno"> 282</span>&#160; </div>
<div class="line"><a name="l00283"></a><span class="lineno"> 283</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
<div class="line"><a name="l00284"></a><span class="lineno"> 284</span>&#160; *inorderSuccessor = operations_on_datastructures::</div>
<div class="line"><a name="l00285"></a><span class="lineno"> 285</span>&#160; inorder_traversal_of_bst::getInorderSuccessor(</div>
<div class="line"><a name="l00286"></a><span class="lineno"> 286</span>&#160; root, 78); <span class="comment">///&lt; The inorder successor node for given data</span></div>
<div class="line"><a name="l00287"></a><span class="lineno"> 287</span>&#160; </div>
<div class="line"><a name="l00288"></a><span class="lineno"> 288</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><a name="l00289"></a><span class="lineno"> 289</span>&#160; assert(inorderSuccessor == expectedOutput);</div>
<div class="line"><a name="l00290"></a><span class="lineno"> 290</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><a name="l00291"></a><span class="lineno"> 291</span>&#160; </div>
<div class="line"><a name="l00292"></a><span class="lineno"> 292</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
<div class="line"><a name="l00293"></a><span class="lineno"> 293</span>&#160; root); <span class="comment">/// memory cleanup!</span></div>
<div class="line"><a name="l00294"></a><span class="lineno"> 294</span>&#160; </div>
<div class="line"><a name="l00295"></a><span class="lineno"> 295</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 1 PASS!&quot;</span>);</div>
<div class="line"><a name="l00296"></a><span class="lineno"> 296</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><a name="l00297"></a><span class="lineno"> 297</span>&#160; }</div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div><div class="ttdoc">A Node structure representing a single node in BST.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:56</div></div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a5d7266b934ca50c4f53e4f1e725d89a4"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a></div><div class="ttdeci">void printInorder(Node *root)</div><div class="ttdoc">Prints the BST in inorder traversal using recursion.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:136</div></div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_a7b20eb99272665c1777949e26ab59589"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a></div><div class="ttdeci">void deallocate(Node *rootNode)</div><div class="ttdoc">This function clears the memory allocated to entire tree recursively. Its just for clean up the memor...</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:210</div></div>
<div class="ttc" id="ainorder__successor__of__bst_8cpp_html_ad0ca93be4f9576bfb715a4864a30dbee"><div class="ttname"><a href="../../d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a></div><div class="ttdeci">Node * makeBST(Node *root, const std::vector&lt; int64_t &gt; &amp;data)</div><div class="ttdoc">This function is used in test cases to quickly create BST containing large data instead of hard codin...</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:155</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt; int64_t &gt;</a></div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.svg" width="447" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="ac2636e8b5b9e053374c45bfcf0603008"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">&#9670;&nbsp;</a></span>testCase_1() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -403,7 +594,6 @@ Here is the call graph for this function:</div>
<div class="ttc" id="astructsearch_1_1sublist__search_1_1_node_html"><div class="ttname"><a href="../../da/d61/structsearch_1_1sublist__search_1_1_node.html">search::sublist_search::Node</a></div><div class="ttdoc">A Node structure representing a single link Node in a linked list.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:47</div></div>
<div class="ttc" id="asublist__search_8cpp_html_a4faee403e2758aaab682ed6622ae218c"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#a4faee403e2758aaab682ed6622ae218c">search::sublist_search::sublistSearch</a></div><div class="ttdeci">bool sublistSearch(Node *sublist, Node *mainList)</div><div class="ttdoc">Main searching function.</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:100</div></div>
<div class="ttc" id="asublist__search_8cpp_html_ab4054b9ab80a5e609b6fcdf70f2e03b9"><div class="ttname"><a href="../../d5/d45/sublist__search_8cpp.html#ab4054b9ab80a5e609b6fcdf70f2e03b9">search::sublist_search::makeLinkedList</a></div><div class="ttdeci">Node * makeLinkedList(const std::vector&lt; uint64_t &gt; &amp;data)</div><div class="ttdoc">Give a vector of data, it adds each element of vector in the linked list and return the address of he...</div><div class="ttdef"><b>Definition:</b> sublist_search.cpp:73</div></div>
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt; uint64_t &gt;</a></div></div>
<div class="ttc" id="aword__break_8cpp_html_a1cc9dd6e6190d10a010fdcdfe7a21a81"><div class="ttname"><a href="../../d3/d84/word__break_8cpp.html#a1cc9dd6e6190d10a010fdcdfe7a21a81">dynamic_programming::word_break::exists</a></div><div class="ttdeci">bool exists(const std::string &amp;str, const std::unordered_set&lt; std::string &gt; &amp;strSet)</div><div class="ttdoc">Function that checks if the string passed in param is present in the the unordered_set passed.</div><div class="ttdef"><b>Definition:</b> word_break.cpp:60</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
@@ -415,7 +605,7 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="ac2636e8b5b9e053374c45bfcf0603008"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">&#9670;&nbsp;</a></span>testCase_1() <span class="overload">[2/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#ac2636e8b5b9e053374c45bfcf0603008">&#9670;&nbsp;</a></span>testCase_1() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -478,7 +668,83 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="abae0148985f159b582a385cf399254e3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">&#9670;&nbsp;</a></span>testCase_2() <span class="overload">[1/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">&#9670;&nbsp;</a></span>testCase_2() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void TestCases::testCase_2 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A test case which contains main list of 100 elements and sublist of 20. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p>&lt; Expected output of this test</p>
<p>&lt; Data to make nodes in BST</p>
<p>&lt; Adding nodes to BST</p>
<p>&lt; Printing inorder to cross-verify.</p>
<p>&lt; The inorder successor node for given data</p>
<p>memory cleanup!</p>
<div class="fragment"><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>&#160; {</div>
<div class="line"><a name="l00305"></a><span class="lineno"> 305</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 21; <span class="comment">///&lt; Expected output of this test</span></div>
<div class="line"><a name="l00306"></a><span class="lineno"> 306</span>&#160; </div>
<div class="line"><a name="l00307"></a><span class="lineno"> 307</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><a name="l00308"></a><span class="lineno"> 308</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 2 : &quot;</span>);</div>
<div class="line"><a name="l00309"></a><span class="lineno"> 309</span>&#160; </div>
<div class="line"><a name="l00310"></a><span class="lineno"> 310</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
<div class="line"><a name="l00311"></a><span class="lineno"> 311</span>&#160; <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00312"></a><span class="lineno"> 312</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_data{</div>
<div class="line"><a name="l00313"></a><span class="lineno"> 313</span>&#160; 20, 3, 5, 6, 2, 23, 45, 78, 21}; <span class="comment">///&lt; Data to make nodes in BST</span></div>
<div class="line"><a name="l00314"></a><span class="lineno"> 314</span>&#160; </div>
<div class="line"><a name="l00315"></a><span class="lineno"> 315</span>&#160; root = <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
<div class="line"><a name="l00316"></a><span class="lineno"> 316</span>&#160; root,</div>
<div class="line"><a name="l00317"></a><span class="lineno"> 317</span>&#160; node_data); <span class="comment">///&lt; Adding nodes to BST</span></div>
<div class="line"><a name="l00318"></a><span class="lineno"> 318</span>&#160; </div>
<div class="line"><a name="l00319"></a><span class="lineno"> 319</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
<div class="line"><a name="l00320"></a><span class="lineno"> 320</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(</div>
<div class="line"><a name="l00321"></a><span class="lineno"> 321</span>&#160; root); <span class="comment">///&lt; Printing inorder to cross-verify.</span></div>
<div class="line"><a name="l00322"></a><span class="lineno"> 322</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00323"></a><span class="lineno"> 323</span>&#160; </div>
<div class="line"><a name="l00324"></a><span class="lineno"> 324</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
<div class="line"><a name="l00325"></a><span class="lineno"> 325</span>&#160; *inorderSuccessor = operations_on_datastructures::</div>
<div class="line"><a name="l00326"></a><span class="lineno"> 326</span>&#160; inorder_traversal_of_bst::getInorderSuccessor(</div>
<div class="line"><a name="l00327"></a><span class="lineno"> 327</span>&#160; root, 20); <span class="comment">///&lt; The inorder successor node for given data</span></div>
<div class="line"><a name="l00328"></a><span class="lineno"> 328</span>&#160; </div>
<div class="line"><a name="l00329"></a><span class="lineno"> 329</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><a name="l00330"></a><span class="lineno"> 330</span>&#160; assert(inorderSuccessor-&gt;<a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> == expectedOutput);</div>
<div class="line"><a name="l00331"></a><span class="lineno"> 331</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><a name="l00332"></a><span class="lineno"> 332</span>&#160; </div>
<div class="line"><a name="l00333"></a><span class="lineno"> 333</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
<div class="line"><a name="l00334"></a><span class="lineno"> 334</span>&#160; root); <span class="comment">/// memory cleanup!</span></div>
<div class="line"><a name="l00335"></a><span class="lineno"> 335</span>&#160; </div>
<div class="line"><a name="l00336"></a><span class="lineno"> 336</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 2 PASS!&quot;</span>);</div>
<div class="line"><a name="l00337"></a><span class="lineno"> 337</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><a name="l00338"></a><span class="lineno"> 338</span>&#160; }</div>
<div class="ttc" id="aclassoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node_html_ae161f3e5ef33ade73429cab9291612e2"><div class="ttname"><a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node::data</a></div><div class="ttdeci">int64_t data</div><div class="ttdoc">The key/value of the node.</div><div class="ttdef"><b>Definition:</b> inorder_successor_of_bst.cpp:58</div></div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_abae0148985f159b582a385cf399254e3_cgraph.svg" width="447" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="abae0148985f159b582a385cf399254e3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">&#9670;&nbsp;</a></span>testCase_2() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -565,7 +831,7 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="abae0148985f159b582a385cf399254e3"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">&#9670;&nbsp;</a></span>testCase_2() <span class="overload">[2/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#abae0148985f159b582a385cf399254e3">&#9670;&nbsp;</a></span>testCase_2() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -623,7 +889,83 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="ad9f95c09931625b41e3be1f88d1e28c5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">&#9670;&nbsp;</a></span>testCase_3() <span class="overload">[1/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">&#9670;&nbsp;</a></span>testCase_3() <span class="overload">[1/3]</span></h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void TestCases::testCase_3 </td>
<td>(</td>
<td class="paramname"></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>A test case which contains main list of 50 elements and sublist of 20. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p>&lt; Expected output of this test</p>
<p>&lt; Data to make nodes in BST</p>
<p>&lt; Adding nodes to BST</p>
<p>&lt; Printing inorder to cross-verify.</p>
<p>&lt; The inorder successor node for given data</p>
<p>memory cleanup!</p>
<div class="fragment"><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>&#160; {</div>
<div class="line"><a name="l00346"></a><span class="lineno"> 346</span>&#160; <span class="keyword">const</span> <span class="keywordtype">int</span> expectedOutput = 110; <span class="comment">///&lt; Expected output of this test</span></div>
<div class="line"><a name="l00347"></a><span class="lineno"> 347</span>&#160; </div>
<div class="line"><a name="l00348"></a><span class="lineno"> 348</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><a name="l00349"></a><span class="lineno"> 349</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;This is test case 3 : &quot;</span>);</div>
<div class="line"><a name="l00350"></a><span class="lineno"> 350</span>&#160; </div>
<div class="line"><a name="l00351"></a><span class="lineno"> 351</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a> *root =</div>
<div class="line"><a name="l00352"></a><span class="lineno"> 352</span>&#160; <span class="keyword">nullptr</span>;</div>
<div class="line"><a name="l00353"></a><span class="lineno"> 353</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector&lt;int64_t&gt;</a> node_data{</div>
<div class="line"><a name="l00354"></a><span class="lineno"> 354</span>&#160; 89, 67, 32, 56, 90, 123, 120,</div>
<div class="line"><a name="l00355"></a><span class="lineno"> 355</span>&#160; 110, 115, 6, 78, 7, 10}; <span class="comment">///&lt; Data to make nodes in BST</span></div>
<div class="line"><a name="l00356"></a><span class="lineno"> 356</span>&#160; </div>
<div class="line"><a name="l00357"></a><span class="lineno"> 357</span>&#160; root = <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee">operations_on_datastructures::inorder_traversal_of_bst::makeBST</a>(</div>
<div class="line"><a name="l00358"></a><span class="lineno"> 358</span>&#160; root,</div>
<div class="line"><a name="l00359"></a><span class="lineno"> 359</span>&#160; node_data); <span class="comment">///&lt; Adding nodes to BST</span></div>
<div class="line"><a name="l00360"></a><span class="lineno"> 360</span>&#160; </div>
<div class="line"><a name="l00361"></a><span class="lineno"> 361</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <span class="stringliteral">&quot;Inorder sequence is : &quot;</span>;</div>
<div class="line"><a name="l00362"></a><span class="lineno"> 362</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4">operations_on_datastructures::inorder_traversal_of_bst::printInorder</a>(</div>
<div class="line"><a name="l00363"></a><span class="lineno"> 363</span>&#160; root); <span class="comment">///&lt; Printing inorder to cross-verify.</span></div>
<div class="line"><a name="l00364"></a><span class="lineno"> 364</span>&#160; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> &lt;&lt; <a class="codeRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/manip/endl.html">std::endl</a>;</div>
<div class="line"><a name="l00365"></a><span class="lineno"> 365</span>&#160; </div>
<div class="line"><a name="l00366"></a><span class="lineno"> 366</span>&#160; <a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">operations_on_datastructures::inorder_traversal_of_bst::Node</a></div>
<div class="line"><a name="l00367"></a><span class="lineno"> 367</span>&#160; *inorderSuccessor = operations_on_datastructures::</div>
<div class="line"><a name="l00368"></a><span class="lineno"> 368</span>&#160; inorder_traversal_of_bst::getInorderSuccessor(</div>
<div class="line"><a name="l00369"></a><span class="lineno"> 369</span>&#160; root, 90); <span class="comment">///&lt; The inorder successor node for given data</span></div>
<div class="line"><a name="l00370"></a><span class="lineno"> 370</span>&#160; </div>
<div class="line"><a name="l00371"></a><span class="lineno"> 371</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Checking assert expression...&quot;</span>);</div>
<div class="line"><a name="l00372"></a><span class="lineno"> 372</span>&#160; assert(inorderSuccessor-&gt;<a class="code" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a> == expectedOutput);</div>
<div class="line"><a name="l00373"></a><span class="lineno"> 373</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;Assertion check passed!&quot;</span>);</div>
<div class="line"><a name="l00374"></a><span class="lineno"> 374</span>&#160; </div>
<div class="line"><a name="l00375"></a><span class="lineno"> 375</span>&#160; <a class="code" href="../../d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589">operations_on_datastructures::inorder_traversal_of_bst::deallocate</a>(</div>
<div class="line"><a name="l00376"></a><span class="lineno"> 376</span>&#160; root); <span class="comment">/// memory cleanup!</span></div>
<div class="line"><a name="l00377"></a><span class="lineno"> 377</span>&#160; </div>
<div class="line"><a name="l00378"></a><span class="lineno"> 378</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;[PASS] : TEST CASE 3 PASS!&quot;</span>);</div>
<div class="line"><a name="l00379"></a><span class="lineno"> 379</span>&#160; <a class="code" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(<span class="stringliteral">&quot;~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~&quot;</span>);</div>
<div class="line"><a name="l00380"></a><span class="lineno"> 380</span>&#160; }</div>
</div><!-- fragment --><div class="dynheader">
Here is the call graph for this function:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.svg" width="447" height="139"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
</div>
</div>
</div>
<a id="ad9f95c09931625b41e3be1f88d1e28c5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">&#9670;&nbsp;</a></span>testCase_3() <span class="overload">[2/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -707,7 +1049,7 @@ Here is the call graph for this function:</div>
</div>
</div>
<a id="ad9f95c09931625b41e3be1f88d1e28c5"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">&#9670;&nbsp;</a></span>testCase_3() <span class="overload">[2/2]</span></h2>
<h2 class="memtitle"><span class="permalink"><a href="#ad9f95c09931625b41e3be1f88d1e28c5">&#9670;&nbsp;</a></span>testCase_3() <span class="overload">[3/3]</span></h2>
<div class="memitem">
<div class="memproto">
@@ -765,6 +1107,7 @@ Here is the call graph for this function:</div>
</div>
</div>
<hr/>The documentation for this class was generated from the following files:<ul>
<li>operations_on_datastructures/<a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html">inorder_successor_of_bst.cpp</a></li>
<li>search/<a class="el" href="../../d5/d45/sublist__search_8cpp.html">sublist_search.cpp</a></li>
<li>sorting/<a class="el" href="../../d1/daa/random__pivot__quick__sort_8cpp.html">random_pivot_quick_sort.cpp</a></li>
</ul>

5
d5/d58/class_test_cases.js
View File

@@ -2,12 +2,17 @@ var class_test_cases =
[
[ "log", "d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e", null ],
[ "log", "d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e", null ],
[ "log", "d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e", null ],
[ "runTests", "d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23", null ],
[ "runTests", "d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23", null ],
[ "runTests", "d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23", null ],
[ "testCase_1", "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008", null ],
[ "testCase_1", "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008", null ],
[ "testCase_1", "d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008", null ],
[ "testCase_2", "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3", null ],
[ "testCase_2", "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3", null ],
[ "testCase_2", "d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3", null ],
[ "testCase_3", "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5", null ],
[ "testCase_3", "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5", null ],
[ "testCase_3", "d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5", null ]
];

2
d5/d58/class_test_cases_ac2636e8b5b9e053374c45bfcf0603008_cgraph.md5
View File

@@ -1 +1 @@
1c08d6b3e3782565f00093e119013062
000c898a3efaff2713f4eddb852e41a5

2
d5/d58/class_test_cases_ad9f95c09931625b41e3be1f88d1e28c5_cgraph.md5
View File

@@ -1 +1 @@
84a86e24872617ba76e94e51175788bf
d234549112c906856fcde395a7e7d284

13
d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.map
View File

@@ -1,9 +1,8 @@
<map id="TestCases::runTests" name="TestCases::runTests">
<area shape="rect" id="node1" title="Executes test cases." alt="" coords="5,57,148,83"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="607,6,679,33"/>
<area shape="rect" id="node3" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="426,57,535,83"/>
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, Only contains one element." alt="" coords="196,57,355,83"/>
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="196,107,355,134"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="196,158,355,185"/>
<area shape="rect" id="node7" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/container/vector/push_back.html#" title=" " alt="" coords="403,158,559,185"/>
<area shape="rect" id="node1" title="Executes test cases." alt="" coords="5,56,148,83"/>
<area shape="rect" id="node2" href="/Users/runner/work/C-Plus-Plus/C-Plus-Plus/doc/cppreference-doxygen-web.tag.xml$cpp/io/manip/endl.html#" title=" " alt="" coords="560,5,632,32"/>
<area shape="rect" id="node3" href="$d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" title="A function to print given message on console." alt="" coords="403,56,512,83"/>
<area shape="rect" id="node4" href="$d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" title="A test case contains edge case, printing inorder successor of last node." alt="" coords="196,56,355,83"/>
<area shape="rect" id="node5" href="$d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" title="A test case which contains main list of 100 elements and sublist of 20." alt="" coords="196,107,355,133"/>
<area shape="rect" id="node6" href="$d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" title="A test case which contains main list of 50 elements and sublist of 20." alt="" coords="196,157,355,184"/>
</map>

2
d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.md5
View File

@@ -1 +1 @@
bd8192faa178b06571faac8394dab3ce
bd1bab0f5d5cbce6fcd79c7b2695d544

145
d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph.svg
View File

@@ -4,57 +4,11 @@
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: TestCases::runTests Pages: 1 -->
<!--zoomable 143 -->
<svg id="main" version="1.1" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" xml:space="preserve" onload="init(evt)">
<style type="text/css"><![CDATA[
.edge:hover path { stroke: red; }
.edge:hover polygon { stroke: red; fill: red; }
]]></style>
<script type="text/javascript"><![CDATA[
var edges = document.getElementsByTagName('g');
if (edges && edges.length) {
for (var i=0;i<edges.length;i++) {
if (edges[i].id.substr(0,4)=='edge') {
edges[i].setAttribute('class','edge');
}
}
}
]]></script>
<defs>
<circle id="rim" cx="0" cy="0" r="7"/>
<circle id="rim2" cx="0" cy="0" r="3.5"/>
<g id="zoomPlus">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="zoomplus.mouseover" end="zoomplus.mouseout"/>
</use>
<path d="M-4,0h8M0,-4v8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="zoomMin">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="zoomminus.mouseover" end="zoomminus.mouseout"/>
</use>
<path d="M-4,0h8" fill="none" stroke="white" stroke-width="1.5" pointer-events="none"/>
</g>
<g id="dirArrow">
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="resetDef">
<use xlink:href="#rim2" fill="#404040">
<set attributeName="fill" to="#808080" begin="reset.mouseover" end="reset.mouseout"/>
</use>
</g>
</defs>
<script type="text/javascript">
var viewWidth = 513;
var viewHeight = 143;
var sectionId = 'dynsection-2';
</script>
<script xlink:href="../../svgpan.js"/>
<svg id="graph" class="graph">
<g id="viewport">
<svg width="478pt" height="142pt"
viewBox="0.00 0.00 478.00 142.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138)">
<title>TestCases::runTests</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138.53 509,-138.53 509,4 -4,4"/>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138 474,-138 474,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
@@ -68,36 +22,36 @@ var sectionId = 'dynsection-2';
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="451,-114.5 451,-133.5 505,-133.5 505,-114.5 451,-114.5"/>
<text text-anchor="middle" x="478" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
<polygon fill="white" stroke="black" points="416,-114.5 416,-133.5 470,-133.5 470,-114.5 416,-114.5"/>
<text text-anchor="middle" x="443" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M72.88,-95.59C90.37,-104.14 117.7,-116.06 143,-121 249.53,-141.8 378.83,-133.79 440.65,-127.98"/>
<polygon fill="midnightblue" stroke="midnightblue" points="441.08,-131.45 450.69,-127 440.4,-124.48 441.08,-131.45"/>
<path fill="none" stroke="midnightblue" d="M72.88,-95.58C90.37,-104.13 117.71,-116.05 143,-121 236.09,-139.22 348.62,-132.96 405.41,-127.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="406.05,-131.34 415.68,-126.92 405.4,-124.37 406.05,-131.34"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="315.5,-76.5 315.5,-95.5 397.5,-95.5 397.5,-76.5 315.5,-76.5"/>
<text text-anchor="middle" x="356.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
<polygon fill="white" stroke="black" points="298,-76.5 298,-95.5 380,-95.5 380,-76.5 298,-76.5"/>
<text text-anchor="middle" x="339" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M90.39,-95.51C106.37,-99.27 125.5,-103.14 143,-105 195.59,-110.58 209.38,-110.29 262,-105 277,-103.49 293.15,-100.65 307.74,-97.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="308.51,-101.04 317.55,-95.51 307.04,-94.19 308.51,-101.04"/>
<path fill="none" stroke="midnightblue" d="M90.39,-95.51C106.37,-99.27 125.5,-103.14 143,-105 195.59,-110.58 209.51,-111.46 262,-105 273.69,-103.56 286.17,-100.92 297.57,-98.06"/>
<polygon fill="midnightblue" stroke="midnightblue" points="298.48,-101.44 307.26,-95.51 296.7,-94.67 298.48,-101.44"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, printing inorder successor of last node.">
<polygon fill="white" stroke="black" points="143,-76.5 143,-95.5 262,-95.5 262,-76.5 143,-76.5"/>
<text text-anchor="middle" x="202.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
@@ -142,83 +96,26 @@ var sectionId = 'dynsection-2';
<!-- Node3&#45;&gt;Node2 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M387.65,-95.59C403.95,-100.77 424.18,-107.21 441.27,-112.64"/>
<polygon fill="midnightblue" stroke="midnightblue" points="440.32,-116.01 450.91,-115.7 442.44,-109.34 440.32,-116.01"/>
<path fill="none" stroke="midnightblue" d="M365.74,-95.59C378.18,-100.22 393.31,-105.86 406.8,-110.89"/>
<polygon fill="midnightblue" stroke="midnightblue" points="405.68,-114.2 416.27,-114.41 408.12,-107.64 405.68,-114.2"/>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge5" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M262.27,-86C276.38,-86 291.33,-86 305.03,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="305.23,-89.5 315.22,-86 305.22,-82.5 305.23,-89.5"/>
<path fill="none" stroke="midnightblue" d="M262.1,-86C270.56,-86 279.21,-86 287.5,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="287.76,-89.5 297.76,-86 287.76,-82.5 287.76,-89.5"/>
</g>
<!-- Node5&#45;&gt;Node3 -->
<g id="edge7" class="edge">
<title>Node5&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M241.86,-57.59C261.82,-62.58 286.43,-68.73 307.63,-74.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="306.87,-77.45 317.42,-76.48 308.57,-70.66 306.87,-77.45"/>
<path fill="none" stroke="midnightblue" d="M237.44,-57.59C254.72,-62.47 275.93,-68.46 294.41,-73.68"/>
<polygon fill="midnightblue" stroke="midnightblue" points="293.5,-77.06 304.07,-76.41 295.4,-70.33 293.5,-77.06"/>
</g>
<!-- Node6&#45;&gt;Node3 -->
<g id="edge9" class="edge">
<title>Node6&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M237.43,-19.54C245.61,-22.24 254.24,-25.43 262,-29 287.83,-40.87 315.39,-58.32 333.84,-70.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="331.89,-73.69 342.12,-76.45 335.85,-67.92 331.89,-73.69"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="298,-0.5 298,-19.5 415,-19.5 415,-0.5 298,-0.5"/>
<text text-anchor="middle" x="356.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge10" class="edge">
<title>Node6&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M262.27,-10C270.58,-10 279.19,-10 287.66,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="287.89,-13.5 297.89,-10 287.89,-6.5 287.89,-13.5"/>
<path fill="none" stroke="midnightblue" d="M239.22,-19.53C246.93,-22.15 254.89,-25.31 262,-29 283.29,-40.05 304.92,-56.95 319.64,-69.48"/>
<polygon fill="midnightblue" stroke="midnightblue" points="317.6,-72.35 327.44,-76.27 322.2,-67.07 317.6,-72.35"/>
</g>
</g>
</svg>
<g id="navigator" transform="translate(0 0)" fill="#404254">
<rect fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width=".5" x="0" y="0" width="60" height="60"/>
<use id="zoomplus" xlink:href="#zoomPlus" x="17" y="9" onmousedown="handleZoom(evt,'in')"/>
<use id="zoomminus" xlink:href="#zoomMin" x="42" y="9" onmousedown="handleZoom(evt,'out')"/>
<use id="reset" xlink:href="#resetDef" x="30" y="36" onmousedown="handleReset()"/>
<g id="arrowUp" xlink:href="#dirArrow" transform="translate(30 24)" onmousedown="handlePan(0,-1)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowUp.mouseover" end="arrowUp.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowRight" xlink:href="#dirArrow" transform="rotate(90) translate(36 -43)" onmousedown="handlePan(1,0)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowRight.mouseover" end="arrowRight.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowDown" xlink:href="#dirArrow" transform="rotate(180) translate(-30 -48)" onmousedown="handlePan(0,1)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowDown.mouseover" end="arrowDown.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
<g id="arrowLeft" xlink:href="#dirArrow" transform="rotate(270) translate(-36 17)" onmousedown="handlePan(-1,0)">
<use xlink:href="#rim" fill="#404040">
<set attributeName="fill" to="#808080" begin="arrowLeft.mouseover" end="arrowLeft.mouseout"/>
</use>
<path fill="none" stroke="white" stroke-width="1.5" d="M0,-3.0v7 M-2.5,-0.5L0,-3.0L2.5,-0.5"/>
</g>
</g>
<svg viewBox="0 0 15 15" width="100%" height="30px" preserveAspectRatio="xMaxYMin meet">
<g id="arrow_out" transform="scale(0.3 0.3)">
<a xlink:href="class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph_org.svg" target="_base">
<rect id="button" ry="5" rx="5" y="6" x="6" height="38" width="38"
fill="#f2f5e9" fill-opacity="0.5" stroke="#606060" stroke-width="1.0"/>
<path id="arrow"
d="M 11.500037,31.436501 C 11.940474,20.09759 22.043105,11.32322 32.158766,21.979434 L 37.068811,17.246167 C 37.068811,17.246167 37.088388,32 37.088388,32 L 22.160133,31.978069 C 22.160133,31.978069 26.997745,27.140456 26.997745,27.140456 C 18.528582,18.264221 13.291696,25.230495 11.500037,31.436501 z"
style="fill:#404040;"/>
</a>
</g>
</svg>
</svg>
Side by Side Swipe Overlay

Before

Width:  |  Height:  |  Size: 12 KiB

After

Width:  |  Height:  |  Size: 6.2 KiB

136
d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph_org.svg
View File

@@ -1,136 +0,0 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: TestCases::runTests Pages: 1 -->
<svg width="513pt" height="143pt"
viewBox="0.00 0.00 513.00 142.53" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 138.53)">
<title>TestCases::runTests</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-138.53 509,-138.53 509,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="Executes test cases.">
<polygon fill="#bfbfbf" stroke="black" points="0,-76.5 0,-95.5 107,-95.5 107,-76.5 0,-76.5"/>
<text text-anchor="middle" x="53.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::runTests</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/io/manip/endl.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="451,-114.5 451,-133.5 505,-133.5 505,-114.5 451,-114.5"/>
<text text-anchor="middle" x="478" y="-121.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::endl</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M72.88,-95.59C90.37,-104.14 117.7,-116.06 143,-121 249.53,-141.8 378.83,-133.79 440.65,-127.98"/>
<polygon fill="midnightblue" stroke="midnightblue" points="441.08,-131.45 450.69,-127 440.4,-124.48 441.08,-131.45"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e" target="_top" xlink:title="A function to print given message on console.">
<polygon fill="white" stroke="black" points="315.5,-76.5 315.5,-95.5 397.5,-95.5 397.5,-76.5 315.5,-76.5"/>
<text text-anchor="middle" x="356.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::log</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M90.39,-95.51C106.37,-99.27 125.5,-103.14 143,-105 195.59,-110.58 209.38,-110.29 262,-105 277,-103.49 293.15,-100.65 307.74,-97.62"/>
<polygon fill="midnightblue" stroke="midnightblue" points="308.51,-101.04 317.55,-95.51 307.04,-94.19 308.51,-101.04"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008" target="_top" xlink:title="A test case contains edge case, Only contains one element.">
<polygon fill="white" stroke="black" points="143,-76.5 143,-95.5 262,-95.5 262,-76.5 143,-76.5"/>
<text text-anchor="middle" x="202.5" y="-83.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_1</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge4" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M107.16,-86C115.5,-86 124.24,-86 132.89,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="132.98,-89.5 142.98,-86 132.98,-82.5 132.98,-89.5"/>
</g>
<!-- Node5 -->
<g id="node5" class="node">
<title>Node5</title>
<g id="a_node5"><a xlink:href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3" target="_top" xlink:title="A test case which contains main list of 100 elements and sublist of 20.">
<polygon fill="white" stroke="black" points="143,-38.5 143,-57.5 262,-57.5 262,-38.5 143,-38.5"/>
<text text-anchor="middle" x="202.5" y="-45.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_2</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node5 -->
<g id="edge6" class="edge">
<title>Node1&#45;&gt;Node5</title>
<path fill="none" stroke="midnightblue" d="M91.59,-76.41C110.82,-71.44 134.49,-65.32 154.93,-60.04"/>
<polygon fill="midnightblue" stroke="midnightblue" points="155.87,-63.41 164.67,-57.52 154.11,-56.63 155.87,-63.41"/>
</g>
<!-- Node6 -->
<g id="node6" class="node">
<title>Node6</title>
<g id="a_node6"><a xlink:href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5" target="_top" xlink:title="A test case which contains main list of 50 elements and sublist of 20.">
<polygon fill="white" stroke="black" points="143,-0.5 143,-19.5 262,-19.5 262,-0.5 143,-0.5"/>
<text text-anchor="middle" x="202.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">TestCases::testCase_3</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node6 -->
<g id="edge8" class="edge">
<title>Node1&#45;&gt;Node6</title>
<path fill="none" stroke="midnightblue" d="M67.08,-76.4C83.71,-64.07 114.27,-42.63 143,-29 147.64,-26.8 152.61,-24.75 157.61,-22.88"/>
<polygon fill="midnightblue" stroke="midnightblue" points="158.93,-26.12 167.2,-19.5 156.61,-19.52 158.93,-26.12"/>
</g>
<!-- Node3&#45;&gt;Node2 -->
<g id="edge3" class="edge">
<title>Node3&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M387.65,-95.59C403.95,-100.77 424.18,-107.21 441.27,-112.64"/>
<polygon fill="midnightblue" stroke="midnightblue" points="440.32,-116.01 450.91,-115.7 442.44,-109.34 440.32,-116.01"/>
</g>
<!-- Node4&#45;&gt;Node3 -->
<g id="edge5" class="edge">
<title>Node4&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M262.27,-86C276.38,-86 291.33,-86 305.03,-86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="305.23,-89.5 315.22,-86 305.22,-82.5 305.23,-89.5"/>
</g>
<!-- Node5&#45;&gt;Node3 -->
<g id="edge7" class="edge">
<title>Node5&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M241.86,-57.59C261.82,-62.58 286.43,-68.73 307.63,-74.03"/>
<polygon fill="midnightblue" stroke="midnightblue" points="306.87,-77.45 317.42,-76.48 308.57,-70.66 306.87,-77.45"/>
</g>
<!-- Node6&#45;&gt;Node3 -->
<g id="edge9" class="edge">
<title>Node6&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M237.43,-19.54C245.61,-22.24 254.24,-25.43 262,-29 287.83,-40.87 315.39,-58.32 333.84,-70.78"/>
<polygon fill="midnightblue" stroke="midnightblue" points="331.89,-73.69 342.12,-76.45 335.85,-67.92 331.89,-73.69"/>
</g>
<!-- Node7 -->
<g id="node7" class="node">
<title>Node7</title>
<g id="a_node7"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/container/vector/push_back.html#" xlink:title=" ">
<polygon fill="white" stroke="black" points="298,-0.5 298,-19.5 415,-19.5 415,-0.5 298,-0.5"/>
<text text-anchor="middle" x="356.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">std::vector::push_back</text>
</a>
</g>
</g>
<!-- Node6&#45;&gt;Node7 -->
<g id="edge10" class="edge">
<title>Node6&#45;&gt;Node7</title>
<path fill="none" stroke="midnightblue" d="M262.27,-10C270.58,-10 279.19,-10 287.66,-10"/>
<polygon fill="midnightblue" stroke="midnightblue" points="287.89,-13.5 297.89,-10 287.89,-6.5 287.89,-13.5"/>
</g>
</g>
</svg>
Side by Side

Before

Width:  |  Height:  |  Size: 7.0 KiB

1
d5/d88/md__d_i_r_e_c_t_o_r_y.html
View File

@@ -345,6 +345,7 @@ Operations On Datastructures</h1>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/circular_linked_list.cpp">Circular Linked List</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/circular_queue_using_array.cpp">Circular Queue Using Array</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/get_size_of_linked_list.cpp">Get Size Of Linked List</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/inorder_successor_of_bst.cpp">Inorder Successor Of Bst</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/intersection_of_2_arrays.cpp">Intersection Of 2 Arrays</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/reverse_a_linked_list_using_recusion.cpp">Reverse A Linked List Using Recusion</a></li>
<li><a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/operations_on_datastructures/selectionsortlinkedlist.cpp">Selectionsortlinkedlist</a></li>

140
d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html Normal file
View File

@@ -0,0 +1,140 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: operations_on_datastructures::inorder_traversal_of_bst::Node Class Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="summary">
<a href="#pub-attribs">Public Attributes</a> &#124;
<a href="../../d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html">List of all members</a> </div>
<div class="headertitle">
<div class="title">operations_on_datastructures::inorder_traversal_of_bst::Node Class Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>A <a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST.
<a href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#details">More...</a></p>
<div class="dynheader">
Collaboration diagram for operations_on_datastructures::inorder_traversal_of_bst::Node:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" frameborder="0" src="../../d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.svg" width="274" height="52"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe>
</div>
<center><span class="legend">[<a target="top" href="../../graph_legend.html">legend</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-attribs"></a>
Public Attributes</h2></td></tr>
<tr class="memitem:ae161f3e5ef33ade73429cab9291612e2"><td class="memItemLeft" align="right" valign="top"><a id="ae161f3e5ef33ade73429cab9291612e2"></a>
int64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">data</a></td></tr>
<tr class="memdesc:ae161f3e5ef33ade73429cab9291612e2"><td class="mdescLeft">&#160;</td><td class="mdescRight">The key/value of the node. <br /></td></tr>
<tr class="separator:ae161f3e5ef33ade73429cab9291612e2"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9ccef4c746b7226488b014f5bac4789a"><td class="memItemLeft" align="right" valign="top"><a id="a9ccef4c746b7226488b014f5bac4789a"></a>
<a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a">left</a></td></tr>
<tr class="memdesc:a9ccef4c746b7226488b014f5bac4789a"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to Left child. <br /></td></tr>
<tr class="separator:a9ccef4c746b7226488b014f5bac4789a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a9b4ae6f5179a1c8ecfd563811a59e6c0"><td class="memItemLeft" align="right" valign="top"><a id="a9b4ae6f5179a1c8ecfd563811a59e6c0"></a>
<a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">right</a></td></tr>
<tr class="memdesc:a9b4ae6f5179a1c8ecfd563811a59e6c0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Pointer to right child. <br /></td></tr>
<tr class="separator:a9b4ae6f5179a1c8ecfd563811a59e6c0"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>A <a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST. </p>
</div><hr/>The documentation for this class was generated from the following file:<ul>
<li>operations_on_datastructures/<a class="el" href="../../d4/d32/inorder__successor__of__bst_8cpp.html">inorder_successor_of_bst.cpp</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></li><li class="navelem"><b>inorder_traversal_of_bst</b></li><li class="navelem"><a class="el" href="../../d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html">Node</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 </li>
</ul>
</div>
</body>
</html>

6
d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.js Normal file
View File

@@ -0,0 +1,6 @@
var classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node =
[
[ "data", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2", null ],
[ "left", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a", null ],
[ "right", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0", null ]
];

2
d5/ddb/bogo__sort_8cpp.html
View File

@@ -136,7 +136,7 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of <a href="https://en.wikipedia.org/wiki/Bogosort">Bogosort algorithm</a> </p>
<p>In computer science, bogosort (also known as permutation sort, stupid sort, slowsort, shotgun sort, random sort, monkey sort, bobosort or shuffle sort) is a highly inefficient sorting algorithm based on the generate and test paradigm. Two versions of this algorithm exist: a deterministic version that enumerates all permutations until it hits a sorted one, and a randomized version that randomly permutes its input.Randomized version is implemented here.</p>
<h3><a class="anchor" id="autotoc_md86"></a>
<h3><a class="anchor" id="autotoc_md90"></a>
Algorithm</h3>
<p>Shuffle the array untill array is sorted.</p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/imdeep2905">Deep Raval</a> </dd></dl>

6
d7/d66/inorder__successor__of__bst_8cpp__incl.map Normal file
View File

@@ -0,0 +1,6 @@
<map id="operations_on_datastructures/inorder_successor_of_bst.cpp" name="operations_on_datastructures/inorder_successor_of_bst.cpp">
<area shape="rect" id="node1" title="An implementation for finding the Inorder successor of a binary search tree Inorder successor of a no..." alt="" coords="29,5,233,47"/>
<area shape="rect" id="node2" title=" " alt="" coords="5,95,71,121"/>
<area shape="rect" id="node3" title=" " alt="" coords="95,95,168,121"/>
<area shape="rect" id="node4" title=" " alt="" coords="193,95,251,121"/>
</map>

1
d7/d66/inorder__successor__of__bst_8cpp__incl.md5 Normal file
View File

@@ -0,0 +1 @@
07533890d78052692da3421a3a388fe0

68
d7/d66/inorder__successor__of__bst_8cpp__incl.svg Normal file
View File

@@ -0,0 +1,68 @@
<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN"
"http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd">
<!-- Generated by graphviz version 2.47.3 (20210619.1520)
-->
<!-- Title: operations_on_datastructures/inorder_successor_of_bst.cpp Pages: 1 -->
<svg width="193pt" height="95pt"
viewBox="0.00 0.00 192.50 95.00" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g id="graph0" class="graph" transform="scale(1 1) rotate(0) translate(4 91)">
<title>operations_on_datastructures/inorder_successor_of_bst.cpp</title>
<polygon fill="white" stroke="transparent" points="-4,4 -4,-91 188.5,-91 188.5,4 -4,4"/>
<!-- Node1 -->
<g id="node1" class="node">
<title>Node1</title>
<g id="a_node1"><a xlink:title="An implementation for finding the Inorder successor of a binary search tree Inorder successor of a no...">
<polygon fill="#bfbfbf" stroke="black" points="18,-56.5 18,-86.5 171,-86.5 171,-56.5 18,-56.5"/>
<text text-anchor="start" x="26" y="-74.5" font-family="Helvetica,sans-Serif" font-size="10.00">operations_on_datastructures</text>
<text text-anchor="middle" x="94.5" y="-63.5" font-family="Helvetica,sans-Serif" font-size="10.00">/inorder_successor_of_bst.cpp</text>
</a>
</g>
</g>
<!-- Node2 -->
<g id="node2" class="node">
<title>Node2</title>
<g id="a_node2"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="0,-0.5 0,-19.5 49,-19.5 49,-0.5 0,-0.5"/>
<text text-anchor="middle" x="24.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">cassert</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node2 -->
<g id="edge1" class="edge">
<title>Node1&#45;&gt;Node2</title>
<path fill="none" stroke="midnightblue" d="M77.91,-56.4C67.21,-47.31 53.31,-35.49 42.37,-26.19"/>
<polygon fill="midnightblue" stroke="midnightblue" points="44.57,-23.47 34.69,-19.66 40.04,-28.8 44.57,-23.47"/>
</g>
<!-- Node3 -->
<g id="node3" class="node">
<title>Node3</title>
<g id="a_node3"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="67,-0.5 67,-19.5 122,-19.5 122,-0.5 67,-0.5"/>
<text text-anchor="middle" x="94.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">iostream</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node3 -->
<g id="edge2" class="edge">
<title>Node1&#45;&gt;Node3</title>
<path fill="none" stroke="midnightblue" d="M94.5,-56.4C94.5,-48.47 94.5,-38.46 94.5,-29.86"/>
<polygon fill="midnightblue" stroke="midnightblue" points="98,-29.66 94.5,-19.66 91,-29.66 98,-29.66"/>
</g>
<!-- Node4 -->
<g id="node4" class="node">
<title>Node4</title>
<g id="a_node4"><a xlink:title=" ">
<polygon fill="white" stroke="#bfbfbf" points="140.5,-0.5 140.5,-19.5 184.5,-19.5 184.5,-0.5 140.5,-0.5"/>
<text text-anchor="middle" x="162.5" y="-7.5" font-family="Helvetica,sans-Serif" font-size="10.00">vector</text>
</a>
</g>
</g>
<!-- Node1&#45;&gt;Node4 -->
<g id="edge3" class="edge">
<title>Node1&#45;&gt;Node4</title>
<path fill="none" stroke="midnightblue" d="M110.62,-56.4C120.9,-47.4 134.25,-35.72 144.83,-26.47"/>
<polygon fill="midnightblue" stroke="midnightblue" points="147.38,-28.88 152.61,-19.66 142.77,-23.61 147.38,-28.88"/>
</g>
</g>
</svg>
Side by Side

After

Width:  |  Height:  |  Size: 3.1 KiB

2
d7/def/trie__multiple__search_8cpp.html
View File

@@ -123,7 +123,7 @@ Classes</h2></td></tr>
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:da/d6d/namespaceoperations__on__datastructures"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../da/d6d/namespaceoperations__on__datastructures.html">operations_on_datastructures</a></td></tr>
<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a> <br /></td></tr>
<tr class="memdesc:da/d6d/namespaceoperations__on__datastructures"><td class="mdescLeft">&#160;</td><td class="mdescRight">for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:df/d8e/namespacetrie__operations"><td class="memItemLeft" align="right" valign="top"> &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../df/d8e/namespacetrie__operations.html">trie_operations</a></td></tr>
<tr class="memdesc:df/d8e/namespacetrie__operations"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/">Trie datastructure</a> implementation. <br /></td></tr>

6
d8/d90/iterative__tree__traversals_8cpp.html
View File

@@ -158,13 +158,13 @@ Functions</h2></td></tr>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Iterative version of Preorder, Postorder, and preorder <a href="https://en.wikipedia.org/wiki/Tree_traversal">Traversal of the Tree</a> </p>
<dl class="section author"><dt>Author</dt><dd><a href="https://github.com/motasimmakki">Motasim</a></dd></dl>
<h3><a class="anchor" id="autotoc_md76"></a>
<h3><a class="anchor" id="autotoc_md80"></a>
Iterative Preorder Traversal of a tree</h3>
<p>Create a Stack that will store the <a class="el" href="../../db/d8b/struct_node.html">Node</a> of Tree. Push the root node into the stack. Save the root into the variabe named as current, and pop and elemnt from the stack. Store the data of current into the result array, and start traversing from it. Push both the child node of the current node into the stack, first right child then left child. Repeat the same set of steps untill the Stack becomes empty. And return the result array as the preorder traversal of a tree.</p>
<h3><a class="anchor" id="autotoc_md77"></a>
<h3><a class="anchor" id="autotoc_md81"></a>
Iterative Postorder Traversal of a tree</h3>
<p>Create a Stack that will store the <a class="el" href="../../db/d8b/struct_node.html">Node</a> of Tree. Push the root node into the stack. Save the root into the variabe named as current, and pop and elemnt from the stack. Store the data of current into the result array, and start traversing from it. Push both the child node of the current node into the stack, first left child then right child. Repeat the same set of steps untill the Stack becomes empty. Now reverse the result array and then return it to the calling function as a postorder traversal of a tree.</p>
<h3><a class="anchor" id="autotoc_md78"></a>
<h3><a class="anchor" id="autotoc_md82"></a>
Iterative Inorder Traversal of a tree</h3>
<p>Create a Stack that will store the <a class="el" href="../../db/d8b/struct_node.html">Node</a> of Tree. Push the root node into the stack. Save the root into the variabe named as current. Now iterate and take the current to the extreme left of the tree by traversing only to its left. Pop the elemnt from the stack and assign it to the current. Store the data of current into the result array. Repeat the same set of steps until the Stack becomes empty or the current becomes NULL. And return the result array as the inorder traversal of a tree. </p>
</div><h2 class="groupheader">Function Documentation</h2>

5
d9/d2c/class_test_cases-members.html
View File

@@ -99,14 +99,19 @@ $(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../'
<table class="directory">
<tr class="even"><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(T msg)</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</span></td></tr>
<tr><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(T msg)</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#aa3aa3d5bf666f327ee8e2d11d397b06e">log</a>(T msg)</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">private</span></td></tr>
<tr><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#aeabea90c02f9159e4a784bbf736e1e23">runTests</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#ac2636e8b5b9e053374c45bfcf0603008">testCase_1</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#abae0148985f159b582a385cf399254e3">testCase_2</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
<tr class="even"><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html#ad9f95c09931625b41e3be1f88d1e28c5">testCase_3</a>()</td><td class="entry"><a class="el" href="../../d5/d58/class_test_cases.html">TestCases</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
</table></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->

7
da/d6d/namespaceoperations__on__datastructures.html
View File

@@ -95,10 +95,13 @@ $(document).ready(function(){initNavTree('da/d6d/namespaceoperations__on__datast
</div><!--header-->
<div class="contents">
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>
<a href="../../da/d6d/namespaceoperations__on__datastructures.html#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a> </p>
<div class="textblock"><p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a> </p>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/priority_queue.html">std::priority_queue</a></p>
<p>for assert for IO Operations</p>
<p>Operations on data structures</p>
<p>for <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/algorithm/count.html">std::count</a> for assert for tolower for string operations for IO Operations</p>
<p>Operations on data structures </p>
</div></div><!-- contents -->

11
da/d6d/namespaceoperations__on__datastructures.js
View File

@@ -1,5 +1,16 @@
var namespaceoperations__on__datastructures =
[
[ "inorder_traversal_of_bst", null, [
[ "Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node" ],
[ "deallocate", "d4/d32/inorder__successor__of__bst_8cpp.html#a7b20eb99272665c1777949e26ab59589", null ],
[ "findMinNode", "d4/d32/inorder__successor__of__bst_8cpp.html#a25667588088eb647887d1c2bff0efa8c", null ],
[ "getInorderSuccessor", "d4/d32/inorder__successor__of__bst_8cpp.html#a9aa3fac9aa48a6568ecf89aaee190d43", null ],
[ "getNode", "d4/d32/inorder__successor__of__bst_8cpp.html#a744afaca22fa7bb91c92209a26f23e8f", null ],
[ "Insert", "d4/d32/inorder__successor__of__bst_8cpp.html#a2153df6265379da9bda259af3f46556a", null ],
[ "makeBST", "d4/d32/inorder__successor__of__bst_8cpp.html#ad0ca93be4f9576bfb715a4864a30dbee", null ],
[ "makeNode", "d4/d32/inorder__successor__of__bst_8cpp.html#a4852816cc9f28f7b9def0e5beb4e8545", null ],
[ "printInorder", "d4/d32/inorder__successor__of__bst_8cpp.html#a5d7266b934ca50c4f53e4f1e725d89a4", null ]
] ],
[ "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" ]
] ]

112
dd/d74/namespaceinorder__successor__of__bst.html Normal file
View File

@@ -0,0 +1,112 @@
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.9.1"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Algorithms_in_C++: inorder_successor_of_bst Namespace Reference</title>
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../jquery.js"></script>
<script type="text/javascript" src="../../dynsections.js"></script>
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../resize.js"></script>
<script type="text/javascript" src="../../navtreedata.js"></script>
<script type="text/javascript" src="../../navtree.js"></script>
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="../../search/searchdata.js"></script>
<script type="text/javascript" src="../../search/search.js"></script>
<script type="text/x-mathjax-config">
MathJax.Hub.Config({
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
jax: ["input/TeX","output/HTML-CSS"],
});
</script>
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname">Algorithms_in_C++
&#160;<span id="projectnumber">1.0.0</span>
</div>
<div id="projectbrief">Set of algorithms implemented in C++.</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.9.1 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
var searchBox = new SearchBox("searchBox", "../../search",false,'Search','.html');
/* @license-end */
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
initMenu('../../',true,false,'search.php','Search');
$(document).ready(function() { init_search(); });
});
/* @license-end */</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('dd/d74/namespaceinorder__successor__of__bst.html','../../'); initResizable(); });
/* @license-end */
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">inorder_successor_of_bst Namespace Reference</div> </div>
</div><!--header-->
<div class="contents">
<p>Functions for the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA">Inorder successor of a binary search tree</a> implementation.
<a href="../../dd/d74/namespaceinorder__successor__of__bst.html#details">More...</a></p>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Functions for the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA">Inorder successor of a binary search tree</a> implementation. </p>
</div></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dd/d74/namespaceinorder__successor__of__bst.html">inorder_successor_of_bst</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.9.1 </li>
</ul>
</div>
</body>
</html>

3
dir_35422be6552f1b3672c1b6c4aba2da64.html
View File

@@ -97,6 +97,9 @@ $(document).ready(function(){initNavTree('dir_35422be6552f1b3672c1b6c4aba2da64.h
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="files"></a>
Files</h2></td></tr>
<tr class="memitem:d4/d32/inorder__successor__of__bst_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d4/d32/inorder__successor__of__bst_8cpp.html">inorder_successor_of_bst.cpp</a></td></tr>
<tr class="memdesc:d4/d32/inorder__successor__of__bst_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight">An implementation for finding the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA">Inorder successor of a binary search tree</a> Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal. <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:d7/def/trie__multiple__search_8cpp"><td class="memItemLeft" align="right" valign="top">file &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="d7/def/trie__multiple__search_8cpp.html">trie_multiple_search.cpp</a></td></tr>
<tr class="memdesc:d7/def/trie__multiple__search_8cpp"><td class="mdescLeft">&#160;</td><td class="mdescRight"><a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/">Trie datastructure</a> with search variants <br /></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>

1
dir_35422be6552f1b3672c1b6c4aba2da64.js
View File

@@ -1,4 +1,5 @@
var dir_35422be6552f1b3672c1b6c4aba2da64 =
[
[ "inorder_successor_of_bst.cpp", "d4/d32/inorder__successor__of__bst_8cpp.html", "d4/d32/inorder__successor__of__bst_8cpp" ],
[ "trie_multiple_search.cpp", "d7/def/trie__multiple__search_8cpp.html", "d7/def/trie__multiple__search_8cpp" ]
];

3
files.html
View File

@@ -252,7 +252,8 @@ solve-a-rat-in-a-maze-c-java-pytho/" </td></tr>
<tr id="row_13_15_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/da6/rungekutta_8cpp.html" target="_self">rungekutta.cpp</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods">Runge Kutta fourth order</a> method implementation </td></tr>
<tr id="row_13_16_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/dc8/successive__approximation_8cpp.html" target="_self">successive_approximation.cpp</a></td><td class="desc">Method of successive approximations using <a href="https://en.wikipedia.org/wiki/Fixed-point_iteration">fixed-point iteration</a> method </td></tr>
<tr id="row_14_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_14_" class="arrow" onclick="toggleFolder('14_')">&#9658;</span><span id="img_14_" class="iconfclosed" onclick="toggleFolder('14_')">&#160;</span><a class="el" href="dir_35422be6552f1b3672c1b6c4aba2da64.html" target="_self">operations_on_datastructures</a></td><td class="desc"></td></tr>
<tr id="row_14_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/def/trie__multiple__search_8cpp.html" target="_self">trie_multiple_search.cpp</a></td><td class="desc"><a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/">Trie datastructure</a> with search variants </td></tr>
<tr id="row_14_0_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d4/d32/inorder__successor__of__bst_8cpp.html" target="_self">inorder_successor_of_bst.cpp</a></td><td class="desc">An implementation for finding the <a href="https://www.youtube.com/watch?v=5cPbNCrdotA">Inorder successor of a binary search tree</a> Inorder successor of a node is the next node in Inorder traversal of the Binary Tree. Inorder Successor is NULL for the last node in Inorder traversal </td></tr>
<tr id="row_14_1_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d7/def/trie__multiple__search_8cpp.html" target="_self">trie_multiple_search.cpp</a></td><td class="desc"><a href="https://iq.opengenus.org/autocomplete-using-trie-data-structure/">Trie datastructure</a> with search variants </td></tr>
<tr id="row_15_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_15_" class="arrow" onclick="toggleFolder('15_')">&#9658;</span><span id="img_15_" class="iconfclosed" onclick="toggleFolder('15_')">&#160;</span><a class="el" href="dir_9510827d0b234b3cc54b29892f217477.html" target="_self">others</a></td><td class="desc"></td></tr>
<tr id="row_15_0_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="d1/d76/buzz__number_8cpp.html" target="_self">buzz_number.cpp</a></td><td class="desc">A buzz number is a number that is either divisible by 7 or has last digit as 7 </td></tr>
<tr id="row_15_1_" class="even" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icondoc"></span><a class="el" href="df/d06/decimal__to__binary_8cpp.html" target="_self">decimal_to_binary.cpp</a></td><td class="desc">Function to convert decimal number to binary representation </td></tr>

1
functions_d.html
View File

@@ -95,6 +95,7 @@ $(document).ready(function(){initNavTree('functions_d.html',''); initResizable()
<h3><a id="index_d"></a>- d -</h3><ul>
<li>data
: <a class="el" href="d5/da1/structnode.html#a42309387b3fa0237ec200c025071ad37">node&lt; Kind &gt;</a>
, <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node</a>
, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">others::iterative_tree_traversals::Node</a>
, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">search::sublist_search::Node</a>
</li>

2
functions_func_i.html
View File

@@ -114,7 +114,7 @@ $(document).ready(function(){initNavTree('functions_func_i.html',''); initResiza
, <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">data_structures::list_array::list</a>
</li>
<li>Insert()
: <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234</a>
: <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f">data_structures::tree_234::Tree234</a>
</li>
<li>insert()
: <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie</a>

2
functions_i.html
View File

@@ -115,7 +115,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
, <a class="el" href="d5/dab/structdata__structures_1_1list__array_1_1list.html#a0f44d5e3a52d35f8ff23ace9569c6305">data_structures::list_array::list</a>
</li>
<li>Insert()
: <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a6749ebb40710c9752a2771eda03c6b3e">data_structures::tree_234::Tree234</a>
: <a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html#a02df91964915ca97609d35f847faff5f">data_structures::tree_234::Tree234</a>
</li>
<li>insert()
: <a class="el" href="d0/d3e/classdata__structures_1_1trie.html#a0ab94bc6417e3f59fab33cea5b64d546">data_structures::trie</a>

1
functions_l.html
View File

@@ -111,6 +111,7 @@ $(document).ready(function(){initNavTree('functions_l.html',''); initResizable()
<li>left
: <a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788">binary_search_tree&lt; T &gt;::bst_node</a>
, <a class="el" href="d2/d05/class_min_heap.html#aa8c6c141e3de664819686aa637e1afca">MinHeap</a>
, <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a">operations_on_datastructures::inorder_traversal_of_bst::Node</a>
, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">others::iterative_tree_traversals::Node</a>
</li>
<li>LeftRotate()

1
functions_r.html
View File

@@ -124,6 +124,7 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable()
<li>right
: <a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df">binary_search_tree&lt; T &gt;::bst_node</a>
, <a class="el" href="d2/d05/class_min_heap.html#ac760b85cf90265b8d674b942a43fb70e">MinHeap</a>
, <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">operations_on_datastructures::inorder_traversal_of_bst::Node</a>
, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">others::iterative_tree_traversals::Node</a>
, <a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088">range_queries::perSegTree::Node</a>
</li>

3
functions_vars.html
View File

@@ -140,6 +140,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
<h3><a id="index_d"></a>- d -</h3><ul>
<li>data
: <a class="el" href="d5/da1/structnode.html#a42309387b3fa0237ec200c025071ad37">node&lt; Kind &gt;</a>
, <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#ae161f3e5ef33ade73429cab9291612e2">operations_on_datastructures::inorder_traversal_of_bst::Node</a>
, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#ad443d44275337b9e361375ce66f1104f">others::iterative_tree_traversals::Node</a>
, <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html#a912ae0b339da401fc33ad21494c60e2b">search::sublist_search::Node</a>
</li>
@@ -230,6 +231,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
</li>
<li>left
: <a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html#a55c165b9e0e5b50a23104e0604dcc788">binary_search_tree&lt; T &gt;::bst_node</a>
, <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9ccef4c746b7226488b014f5bac4789a">operations_on_datastructures::inorder_traversal_of_bst::Node</a>
, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#a1dbaeff928e469a05251879568515b8e">others::iterative_tree_traversals::Node</a>
</li>
<li>level
@@ -314,6 +316,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
</li>
<li>right
: <a class="el" href="dd/db6/structbinary__search__tree_1_1bst__node.html#a05f3a7aa6c31622f855ce4b5a95e91df">binary_search_tree&lt; T &gt;::bst_node</a>
, <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html#a9b4ae6f5179a1c8ecfd563811a59e6c0">operations_on_datastructures::inorder_traversal_of_bst::Node</a>
, <a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html#af19e39acfc18b823be9d4879a20e1143">others::iterative_tree_traversals::Node</a>
, <a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html#a9adb4639a0797e94a3e556b6b902c088">range_queries::perSegTree::Node</a>
</li>

6
globals_func_i.html
View File

@@ -123,12 +123,12 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
<li>is_square()
: <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#a4921874435266592b222e3f2eda0e01f">ordinary_least_squares_regressor.cpp</a>
</li>
<li>IsPrime()
: <a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a>
</li>
<li>isPrime()
: <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a>
</li>
<li>IsPrime()
: <a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a>
</li>
<li>it_ternary_search()
: <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">ternary_search.cpp</a>
</li>

1
globals_func_m.html
View File

@@ -219,6 +219,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, <a class="el" href="de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">qr_eigen_values.cpp</a>
, <a class="el" href="d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">rungekutta.cpp</a>
, <a class="el" href="df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">successive_approximation.cpp</a>
, <a class="el" href="d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">inorder_successor_of_bst.cpp</a>
, <a class="el" href="d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089">trie_multiple_search.cpp</a>
, <a class="el" href="d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">buzz_number.cpp</a>
, <a class="el" href="da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">decimal_to_hexadecimal.cpp</a>

6
globals_func_s.html
View File

@@ -126,12 +126,12 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
<li>show_pascal()
: <a class="el" href="dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c">pascal_triangle.cpp</a>
</li>
<li>sieve()
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve_of_eratosthenes.cpp</a>
</li>
<li>Sieve()
: <a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c">primes_up_to_billion.cpp</a>
</li>
<li>sieve()
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve_of_eratosthenes.cpp</a>
</li>
<li>SieveOfEratosthenes()
: <a class="el" href="db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099">prime_factorization.cpp</a>
</li>

1
globals_func_t.html
View File

@@ -142,6 +142,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, <a class="el" href="d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">sum_of_digits.cpp</a>
, <a class="el" href="df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">vector_cross_product.cpp</a>
, <a class="el" href="d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">rungekutta.cpp</a>
, <a class="el" href="d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">inorder_successor_of_bst.cpp</a>
, <a class="el" href="d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">trie_multiple_search.cpp</a>
, <a class="el" href="d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">smallest_circle.cpp</a>
, <a class="el" href="d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">persistent_seg_tree_lazy_prop.cpp</a>

8
globals_i.html
View File

@@ -127,14 +127,14 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
<li>is_square()
: <a class="el" href="dc/d38/ordinary__least__squares__regressor_8cpp.html#a4921874435266592b222e3f2eda0e01f">ordinary_least_squares_regressor.cpp</a>
</li>
<li>IsPrime()
: <a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a>
<li>isprime
: <a class="el" href="db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">prime_factorization.cpp</a>
</li>
<li>isPrime()
: <a class="el" href="d8/d53/modular__inverse__fermat__little__theorem_8cpp.html#a09660096b134753128952246f4f4e4bd">modular_inverse_fermat_little_theorem.cpp</a>
</li>
<li>isprime
: <a class="el" href="db/d0d/prime__factorization_8cpp.html#a7fe38b570a51e448430d6a0f072c2f23">prime_factorization.cpp</a>
<li>IsPrime()
: <a class="el" href="da/d7b/primality__test_8cpp.html#a2bfa6adead2bdcbf1dac94cbe08d7eaf">primality_test.cpp</a>
</li>
<li>it_ternary_search()
: <a class="el" href="dc/dfe/ternary__search_8cpp.html#ae30dfe2894191bfeffe5b3b1854b95b0">ternary_search.cpp</a>

1
globals_m.html
View File

@@ -219,6 +219,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, <a class="el" href="de/d75/qr__eigen__values_8cpp.html#a3c04138a5bfe5d72780bb7e82a18e627">qr_eigen_values.cpp</a>
, <a class="el" href="d1/da6/rungekutta_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">rungekutta.cpp</a>
, <a class="el" href="df/dc8/successive__approximation_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">successive_approximation.cpp</a>
, <a class="el" href="d4/d32/inorder__successor__of__bst_8cpp.html#a0ddf1224851353fc92bfbff6f499fa97">inorder_successor_of_bst.cpp</a>
, <a class="el" href="d7/def/trie__multiple__search_8cpp.html#abf9e6b7e6f15df4b525a2e7705ba3089">trie_multiple_search.cpp</a>
, <a class="el" href="d1/d76/buzz__number_8cpp.html#ae66f6b31b5ad750f1fe042a706a4e3d4">buzz_number.cpp</a>
, <a class="el" href="da/de7/decimal__to__hexadecimal_8cpp.html#a840291bc02cba5474a4cb46a9b9566fe">decimal_to_hexadecimal.cpp</a>

6
globals_s.html
View File

@@ -126,12 +126,12 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
<li>show_pascal()
: <a class="el" href="dc/d1a/pascal__triangle_8cpp.html#ad7a31d9cb2818d21b1ba12aead7f4c5c">pascal_triangle.cpp</a>
</li>
<li>sieve()
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve_of_eratosthenes.cpp</a>
</li>
<li>Sieve()
: <a class="el" href="d4/d9c/primes__up__to__billion_8cpp.html#a031cada84819ed6426f58e4f7e81261c">primes_up_to_billion.cpp</a>
</li>
<li>sieve()
: <a class="el" href="d8/ddf/sieve__of__eratosthenes_8cpp.html#a60fa6579eab0db3c1c0ab1bf6d651be3">sieve_of_eratosthenes.cpp</a>
</li>
<li>SieveOfEratosthenes()
: <a class="el" href="db/d0d/prime__factorization_8cpp.html#affe577b9bce8f604f5e2f861c63c7099">prime_factorization.cpp</a>
</li>

1
globals_t.html
View File

@@ -142,6 +142,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, <a class="el" href="d4/d83/sum__of__digits_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">sum_of_digits.cpp</a>
, <a class="el" href="df/d66/vector__cross__product_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">vector_cross_product.cpp</a>
, <a class="el" href="d1/da6/rungekutta_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">rungekutta.cpp</a>
, <a class="el" href="d4/d32/inorder__successor__of__bst_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">inorder_successor_of_bst.cpp</a>
, <a class="el" href="d7/def/trie__multiple__search_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">trie_multiple_search.cpp</a>
, <a class="el" href="d0/d01/smallest__circle_8cpp.html#ae1a3968e7947464bee7714f6d43b7002">smallest_circle.cpp</a>
, <a class="el" href="d5/d58/persistent__seg__tree__lazy__prop_8cpp.html#aa8dca7b867074164d5f45b0f3851269d">persistent_seg_tree_lazy_prop.cpp</a>

91
hierarchy.html
View File

@@ -142,51 +142,52 @@ This inheritance list is sorted roughly, but not completely, alphabetically:</di
<tr id="row_40_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d49/structdata__structures_1_1_node.html" target="_self">data_structures::Node</a></td><td class="desc"></td></tr>
<tr id="row_41_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d40/classdata__structures_1_1tree__234_1_1_node.html" target="_self">data_structures::tree_234::Node</a></td><td class="desc">2-3-4 tree node class </td></tr>
<tr id="row_42_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html" target="_self">data_structures::trie_using_hashmap::Trie::Node</a></td><td class="desc">Struct representing a trie node </td></tr>
<tr id="row_43_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_44_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_45_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">others::iterative_tree_traversals::Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
<tr id="row_46_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">range_queries::perSegTree::Node</a></td><td class="desc"></td></tr>
<tr id="row_47_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">search::sublist_search::Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_48_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node&lt; Type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_49_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">range_queries::perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
<tr id="row_50_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" target="_self">ciphers::elliptic_curve_key_exchange::Point</a></td><td class="desc">Definition of struct <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> </td></tr>
<tr id="row_51_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></td></tr>
<tr id="row_52_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_53_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_54_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_55_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_56_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">data_structures::queue_using_array::Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_57_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_58_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_59_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_59_" class="arrow" onclick="toggleFolder('59_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_59_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_60_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
<tr id="row_61_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
<tr id="row_63_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack&lt; Type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_65_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_67_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_68_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_69_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_71_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_71_" class="arrow" onclick="toggleFolder('71_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
<tr id="row_71_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_72_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
<tr id="row_73_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_74_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
<tr id="row_75_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_76_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_77_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_77_" class="arrow" onclick="toggleFolder('77_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a>&#160;[external]</td><td class="desc"></td></tr>
<tr id="row_77_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_77_1_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_77_2_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_77_3_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_77_4_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_77_5_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">std::is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_78_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_79_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
<tr id="row_43_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d8b/struct_node.html" target="_self">Node</a></td><td class="desc"></td></tr>
<tr id="row_44_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_45_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" target="_self">operations_on_datastructures::inorder_traversal_of_bst::Node</a></td><td class="desc">A <a class="el" href="d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST.">Node</a> structure representing a single node in BST </td></tr>
<tr id="row_46_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html" target="_self">others::iterative_tree_traversals::Node</a></td><td class="desc">Defines the structure of a node of the tree </td></tr>
<tr id="row_47_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html" target="_self">range_queries::perSegTree::Node</a></td><td class="desc"></td></tr>
<tr id="row_48_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" target="_self">search::sublist_search::Node</a></td><td class="desc">A <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> structure representing a single link <a class="el" href="da/d61/structsearch_1_1sublist__search_1_1_node.html" title="A Node structure representing a single link Node in a linked list.">Node</a> in a linked list </td></tr>
<tr id="row_49_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/da1/structnode.html" target="_self">node&lt; Type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_50_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d28/classrange__queries_1_1per_seg_tree.html" target="_self">range_queries::perSegTree</a></td><td class="desc">Range query here is range sum, but the code can be modified to make different queries like range max or min </td></tr>
<tr id="row_51_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" target="_self">ciphers::elliptic_curve_key_exchange::Point</a></td><td class="desc">Definition of struct <a class="el" href="d6/d45/structciphers_1_1elliptic__curve__key__exchange_1_1_point.html" title="Definition of struct Point.">Point</a> </td></tr>
<tr id="row_52_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d5a/structgeometry_1_1jarvis_1_1_point.html" target="_self">geometry::jarvis::Point</a></td><td class="desc"></td></tr>
<tr id="row_53_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dc8/struct_point.html" target="_self">Point</a></td><td class="desc"></td></tr>
<tr id="row_54_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d1b/structquery.html" target="_self">query</a></td><td class="desc"></td></tr>
<tr id="row_55_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/da9/classqueue.html" target="_self">queue&lt; Kind &gt;</a></td><td class="desc"></td></tr>
<tr id="row_56_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/db5/struct_queue.html" target="_self">Queue</a></td><td class="desc"></td></tr>
<tr id="row_57_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" target="_self">data_structures::queue_using_array::Queue_Array</a></td><td class="desc"><a class="el" href="d6/d04/classdata__structures_1_1queue__using__array_1_1_queue___array.html" title="Queue_Array class containing the main data and also index of head and tail of the array.">Queue_Array</a> class containing the main data and also index of head and tail of the array </td></tr>
<tr id="row_58_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/d72/class_r_btree.html" target="_self">RBtree</a></td><td class="desc"></td></tr>
<tr id="row_59_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/db4/struct_segment_intersection.html" target="_self">SegmentIntersection</a></td><td class="desc"></td></tr>
<tr id="row_60_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_60_" class="arrow" onclick="toggleFolder('60_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d9/d35/classrange__queries_1_1heavy__light__decomposition_1_1_s_g.html" target="_self">range_queries::heavy_light_decomposition::SG&lt; X &gt;</a></td><td class="desc">Segment <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, to store heavy chains </td></tr>
<tr id="row_60_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_61_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d4/d90/classdata__structures_1_1_skip_list.html" target="_self">data_structures::SkipList</a></td><td class="desc"></td></tr>
<tr id="row_62_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d4f/class_solution.html" target="_self">Solution</a></td><td class="desc"></td></tr>
<tr id="row_63_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="da/d37/structdata__structures_1_1sparse__table_1_1_sparse__table.html" target="_self">data_structures::sparse_table::Sparse_table</a></td><td class="desc"></td></tr>
<tr id="row_64_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d8a/classothers_1_1postfix__expression_1_1_stack.html" target="_self">others::postfix_expression::Stack</a></td><td class="desc">Creates an array to be used as stack for storing values </td></tr>
<tr id="row_65_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/dc2/classstack.html" target="_self">stack&lt; Type &gt;</a></td><td class="desc"></td></tr>
<tr id="row_66_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dc4/classstack__linked_list.html" target="_self">stack_linkedList</a></td><td class="desc"></td></tr>
<tr id="row_67_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d7c/classstatistics_1_1stats__computer1.html" target="_self">statistics::stats_computer1&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_68_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d8/dab/classstatistics_1_1stats__computer2.html" target="_self">statistics::stats_computer2&lt; T &gt;</a></td><td class="desc"></td></tr>
<tr id="row_69_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d58/class_test_cases.html" target="_self">TestCases</a></td><td class="desc">Class encapsulating the necessary test cases </td></tr>
<tr id="row_70_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" target="_self">operations_on_datastructures::trie_operations::Tnode</a></td><td class="desc">Class defining the structure of trie node and containing the methods to perform operations on them </td></tr>
<tr id="row_71_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d2c/structtower.html" target="_self">tower</a></td><td class="desc"></td></tr>
<tr id="row_72_" class="even"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_72_" class="arrow" onclick="toggleFolder('72_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" target="_self">range_queries::heavy_light_decomposition::Tree&lt; X &gt;</a></td><td class="desc">A Basic <a class="el" href="d1/d51/classrange__queries_1_1heavy__light__decomposition_1_1_tree.html" title="A Basic Tree, which supports binary lifting.">Tree</a>, which supports binary lifting </td></tr>
<tr id="row_72_0_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/d8a/classrange__queries_1_1heavy__light__decomposition_1_1_h_l_d.html" target="_self">range_queries::heavy_light_decomposition::HLD&lt; X &gt;</a></td><td class="desc">The Heavy-Light Decomposition class </td></tr>
<tr id="row_73_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d95/classdata__structures_1_1tree__234_1_1_tree234.html" target="_self">data_structures::tree_234::Tree234</a></td><td class="desc">2-3-4 tree class </td></tr>
<tr id="row_74_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d0/d3e/classdata__structures_1_1trie.html" target="_self">data_structures::trie</a></td><td class="desc"><a href="https://en.wikipedia.org/wiki/Trie">Trie</a> implementation for small-case English alphabets <code>a-z</code> </td></tr>
<tr id="row_75_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" target="_self">data_structures::trie_using_hashmap::Trie</a></td><td class="desc"><a class="el" href="d3/d26/classdata__structures_1_1trie__using__hashmap_1_1_trie.html" title="Trie class, implementation of trie using hashmap in each trie node for all the characters of char16_t...">Trie</a> class, implementation of trie using hashmap in each trie node for all the characters of char16_t(UTF-16)type with methods to insert, delete, search, start with and to recommend words based on a given prefix </td></tr>
<tr id="row_76_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dd/d2f/class_trie.html" target="_self">Trie</a></td><td class="desc"></td></tr>
<tr id="row_77_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="de/d48/struct_trie_1_1_trie_node.html" target="_self">Trie::TrieNode</a></td><td class="desc"></td></tr>
<tr id="row_78_"><td class="entry"><span style="width:0px;display:inline-block;">&#160;</span><span id="arr_78_" class="arrow" onclick="toggleFolder('78_')">&#9660;</span><span class="icona"><span class="icon">C</span></span><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/types/integral_constant.html">std::true_type</a>&#160;[external]</td><td class="desc"></td></tr>
<tr id="row_78_0_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dfc/structstd_1_1is__arithmetic_3_01uint128__t_01_4.html" target="_self">std::is_arithmetic&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_78_1_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="dc/d6d/structstd_1_1is__arithmetic_3_01uint256__t_01_4.html" target="_self">std::is_arithmetic&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_78_2_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d2/dd4/structstd_1_1is__integral_3_01uint128__t_01_4.html" target="_self">std::is_integral&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_78_3_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d7/d47/structstd_1_1is__integral_3_01uint256__t_01_4.html" target="_self">std::is_integral&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_78_4_" class="even"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d5/d25/structstd_1_1is__unsigned_3_01uint128__t_01_4.html" target="_self">std::is_unsigned&lt; uint128_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_78_5_"><td class="entry"><span style="width:32px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="df/d99/structstd_1_1is__unsigned_3_01uint256__t_01_4.html" target="_self">std::is_unsigned&lt; uint256_t &gt;</a></td><td class="desc"></td></tr>
<tr id="row_79_" class="even"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="db/d9a/classuint128__t.html" target="_self">uint128_t</a></td><td class="desc">Class for 128-bit unsigned integer </td></tr>
<tr id="row_80_"><td class="entry"><span style="width:16px;display:inline-block;">&#160;</span><span class="icona"><span class="icon">C</span></span><a class="el" href="d1/d83/classuint256__t.html" target="_self">uint256_t</a></td><td class="desc">Class for 256-bit unsigned integer </td></tr>
</table>
</div><!-- directory -->
</div><!-- contents -->

3
hierarchy.js
View File

@@ -45,8 +45,9 @@ var hierarchy =
[ "data_structures::Node", "d9/d49/structdata__structures_1_1_node.html", null ],
[ "data_structures::tree_234::Node", "dd/d40/classdata__structures_1_1tree__234_1_1_node.html", null ],
[ "data_structures::trie_using_hashmap::Trie::Node", "d5/d12/structdata__structures_1_1trie__using__hashmap_1_1_trie_1_1_node.html", null ],
[ "node< Kind >", "d5/da1/structnode.html", null ],
[ "Node", "db/d8b/struct_node.html", null ],
[ "node< Kind >", "d5/da1/structnode.html", null ],
[ "operations_on_datastructures::inorder_traversal_of_bst::Node", "d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html", null ],
[ "others::iterative_tree_traversals::Node", "d2/d9a/structothers_1_1iterative__tree__traversals_1_1_node.html", null ],
[ "range_queries::perSegTree::Node", "d5/d66/classrange__queries_1_1per_seg_tree_1_1_node.html", null ],
[ "search::sublist_search::Node", "da/d61/structsearch_1_1sublist__search_1_1_node.html", null ],

8
index.html
View File

@@ -96,10 +96,10 @@ $(document).ready(function(){initNavTree('index.html',''); initResizable(); });
<div class="contents">
<div class="textblock"><p><a class="anchor" id="mainpage"></a></p>
<p><a href="https://gitpod.io/#https://github.com/TheAlgorithms/C-Plus-Plus"><img src="https://img.shields.io/badge/Gitpod-Ready--to--Code-blue?logo=gitpod" alt="Gitpod Ready-to-Code" class="inline"/></a> <a href="https://lgtm.com/projects/g/TheAlgorithms/C-Plus-Plus/context:cpp"><img src="https://img.shields.io/lgtm/grade/cpp/g/TheAlgorithms/C-Plus-Plus.svg?logo=lgtm&amp;logoWidth=18" alt="Language grade: C/C++" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C-Plus-Plus/actions/workflows/codeql_analysis.yml"><img src="https://github.com/TheAlgorithms/C-Plus-Plus/actions/workflows/codeql_analysis.yml/badge.svg" alt="CodeQL CI" style="pointer-events: none;" class="inline"/></a> <a href="https://gitter.im/TheAlgorithms"><img src="https://img.shields.io/badge/Chat-Gitter-ff69b4.svg?label=Chat&amp;logo=gitter&amp;style=flat-square" alt="Gitter chat" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/CONTRIBUTING.md"><img src="https://img.shields.io/static/v1.svg?label=Contributions&amp;message=Welcome&amp;color=0059b3&amp;style=flat-square" alt="contributions welcome" style="pointer-events: none;" class="inline"/></a> <img src="https://img.shields.io/github/repo-size/TheAlgorithms/C-Plus-Plus?color=red&amp;style=flat-square" alt="GitHub repo size" class="inline"/> <a href="https://TheAlgorithms.github.io/C-Plus-Plus"><img src="https://github.com/TheAlgorithms/C-Plus-Plus/workflows/Doxygen%20CI/badge.svg" alt="Doxygen CI" style="pointer-events: none;" class="inline"/></a> <a href="https://github.com/TheAlgorithms/C-Plus-Plus/actions?query=workflow%3A%22Awesome+CI+Workflow%22"><img src="https://github.com/TheAlgorithms/C-Plus-Plus/workflows/Awesome%20CI%20Workflow/badge.svg" alt="Awesome CI" style="pointer-events: none;" class="inline"/></a> <a href="https://liberapay.com/TheAlgorithms"><img src="https://img.shields.io/liberapay/receives/TheAlgorithms.svg?logo=liberapay" alt="Income" style="pointer-events: none;" class="inline"/></a> <a href="https://discord.gg/c7MnfGFGa6"><img src="https://img.shields.io/discord/808045925556682782.svg?logo=discord&amp;colorB=7289DA" alt="Discord chat" style="pointer-events: none;" class="inline"/></a> <a href="https://liberapay.com/TheAlgorithms/donate"><img src="https://liberapay.com/assets/widgets/donate.svg" alt="Donate" style="pointer-events: none;" class="inline"/></a></p>
<h1><a class="anchor" id="autotoc_md79"></a>
<h1><a class="anchor" id="autotoc_md83"></a>
Overview</h1>
<p>The repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/LICENSE">MIT License</a>. The algorithms span a variety of topics from computer science, mathematics and statistics, data science, machine learning, engineering, etc.. The implementations and the associated documentation are meant to provide a learning resource for educators and students. Hence, one may find more than one implementation for the same objective but using a different algorithm strategies and optimizations.</p>
<h1><a class="anchor" id="autotoc_md80"></a>
<h1><a class="anchor" id="autotoc_md84"></a>
Features</h1>
<ul>
<li>The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - <a href="https://en.wikipedia.org/wiki/C%2B%2B">C++</a>.</li>
@@ -110,12 +110,12 @@ Features</h1>
<li>Self-checks within programs ensure correct implementations with confidence.</li>
<li>Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.</li>
</ul>
<h1><a class="anchor" id="autotoc_md81"></a>
<h1><a class="anchor" id="autotoc_md85"></a>
Documentation</h1>
<p><a href="https://TheAlgorithms.github.io/C-Plus-Plus">Online Documentation</a> is generated from the repository source codes directly. The documentation contains all resources including source code snippets, details on execution of the programs, diagrammatic representation of program flow, and links to external resources where necessary. The documentation also introduces interactive source code with links to documentation for C++ STL library functions used. Click on <a href="https://TheAlgorithms.github.io/C-Plus-Plus/files.html">Files menu</a> to see the list of all the files documented with the code.</p>
<p><a href="https://thealgorithms.github.io/C-Plus-Plus">Documentation of Algorithms in C++</a> by <a href="https://github.com/TheAlgorithms/C-Plus-Plus/graphs/contributors">The Algorithms Contributors</a> is licensed under <a href="https://creativecommons.org/licenses/by-sa/4.0/?ref=chooser-v1">CC BY-SA 4.0</a><br />
<a href="https://creativecommons.org/licenses/by-sa/4.0"><img src="https://mirrors.creativecommons.org/presskit/icons/cc.svg" alt="Creative Commons License" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/by.svg" alt="Credit must be given to the creator" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/><img src="https://mirrors.creativecommons.org/presskit/icons/sa.svg" alt="Adaptations must be shared under the same terms" style="pointer-events: none; height:22px!important;margin-left: 3px;vertical-align:text-bottom;" class="inline"/></a></p>
<h1><a class="anchor" id="autotoc_md82"></a>
<h1><a class="anchor" id="autotoc_md86"></a>
Contributions</h1>
<p>As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our <a href="https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/CONTRIBUTING.md">Contribution Guidelines</a>. </p>
</div></div><!-- PageDoc -->

2
inherit_graph_52.map
View File

@@ -1,3 +1,3 @@
<map id="Graphical Class Hierarchy" name="Graphical Class Hierarchy">
<area shape="rect" id="node1" href="$d0/d5f/classoperations__on__datastructures_1_1trie__operations_1_1_tnode.html" title="Class defining the structure of trie node and containing the methods to perform operations on them." alt="" coords="5,5,204,47"/>
<area shape="rect" id="node1" href="$d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html" title="A Node structure representing a single node in BST." alt="" coords="5,5,217,47"/>
</map>

Some files were not shown because too many files have changed in this diff Show More