From cbca3ec1a9a0f799f48d3facfca1ad358742a39e Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Sun, 18 Jul 2021 05:07:11 +0000
Subject: [PATCH] Documentation for 652c2d2650210d867447618f70dcbfd78ce33a0b
---
annotated.html | 136 ++--
annotated_dup.js | 5 +-
classes.html | 2 +-
d1/daa/random__pivot__quick__sort_8cpp.html | 12 +-
...ddf1224851353fc92bfbff6f499fa97_cgraph.map | 7 +-
...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 | 2 +-
...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 57 +-
...224851353fc92bfbff6f499fa97_cgraph_org.svg | 59 +-
...8dca7b867074164d5f45b0f3851269d_cgraph.map | 15 +-
...8dca7b867074164d5f45b0f3851269d_cgraph.md5 | 2 +-
...8dca7b867074164d5f45b0f3851269d_cgraph.svg | 57 +-
...7b867074164d5f45b0f3851269d_cgraph_org.svg | 57 +-
...__traversal__of__bst_1_1_node-members.html | 112 +++
d2/d26/count__inversions_8cpp.html | 2 +-
...aversal__of__bst_1_1_node__coll__graph.map | 3 +
...aversal__of__bst_1_1_node__coll__graph.md5 | 1 +
...aversal__of__bst_1_1_node__coll__graph.svg | 31 +
d3/df9/recursive__bubble__sort_8cpp.html | 2 +-
d4/d32/inorder__successor__of__bst_8cpp.html | 738 ++++++++++++++++++
d4/d32/inorder__successor__of__bst_8cpp.js | 15 +
...ddf1224851353fc92bfbff6f499fa97_cgraph.map | 10 +
...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 | 1 +
...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 239 ++++++
...224851353fc92bfbff6f499fa97_cgraph_org.svg | 151 ++++
...5667588088eb647887d1c2bff0efa8c_cgraph.map | 3 +
...5667588088eb647887d1c2bff0efa8c_cgraph.md5 | 1 +
...5667588088eb647887d1c2bff0efa8c_cgraph.svg | 30 +
...852816cc9f28f7b9def0e5beb4e8545_cgraph.map | 3 +
...852816cc9f28f7b9def0e5beb4e8545_cgraph.md5 | 1 +
...852816cc9f28f7b9def0e5beb4e8545_cgraph.svg | 30 +
...d7266b934ca50c4f53e4f1e725d89a4_cgraph.map | 3 +
...d7266b934ca50c4f53e4f1e725d89a4_cgraph.md5 | 1 +
...d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg | 30 +
...44afaca22fa7bb91c92209a26f23e8f_cgraph.map | 3 +
...44afaca22fa7bb91c92209a26f23e8f_cgraph.md5 | 1 +
...44afaca22fa7bb91c92209a26f23e8f_cgraph.svg | 30 +
...b20eb99272665c1777949e26ab59589_cgraph.map | 3 +
...b20eb99272665c1777949e26ab59589_cgraph.md5 | 1 +
...b20eb99272665c1777949e26ab59589_cgraph.svg | 30 +
...aa3fac9aa48a6568ecf89aaee190d43_cgraph.map | 3 +
...aa3fac9aa48a6568ecf89aaee190d43_cgraph.md5 | 1 +
...aa3fac9aa48a6568ecf89aaee190d43_cgraph.svg | 30 +
...8dca7b867074164d5f45b0f3851269d_cgraph.map | 9 +
...8dca7b867074164d5f45b0f3851269d_cgraph.md5 | 1 +
...8dca7b867074164d5f45b0f3851269d_cgraph.svg | 224 ++++++
...7b867074164d5f45b0f3851269d_cgraph_org.svg | 136 ++++
...0ca93be4f9576bfb715a4864a30dbee_cgraph.map | 3 +
...0ca93be4f9576bfb715a4864a30dbee_cgraph.md5 | 1 +
...0ca93be4f9576bfb715a4864a30dbee_cgraph.svg | 30 +
d5/d45/sublist__search_8cpp.html | 10 +-
...ddf1224851353fc92bfbff6f499fa97_cgraph.map | 7 +-
...ddf1224851353fc92bfbff6f499fa97_cgraph.md5 | 2 +-
...ddf1224851353fc92bfbff6f499fa97_cgraph.svg | 57 +-
...224851353fc92bfbff6f499fa97_cgraph_org.svg | 59 +-
...8dca7b867074164d5f45b0f3851269d_cgraph.map | 15 +-
...8dca7b867074164d5f45b0f3851269d_cgraph.md5 | 2 +-
...8dca7b867074164d5f45b0f3851269d_cgraph.svg | 57 +-
...7b867074164d5f45b0f3851269d_cgraph_org.svg | 57 +-
d5/d58/class_test_cases.html | 381 ++++++++-
d5/d58/class_test_cases.js | 5 +
...2636e8b5b9e053374c45bfcf0603008_cgraph.md5 | 2 +-
...9f95c09931625b41e3be1f88d1e28c5_cgraph.md5 | 2 +-
...abea90c02f9159e4a784bbf736e1e23_cgraph.map | 13 +-
...abea90c02f9159e4a784bbf736e1e23_cgraph.md5 | 2 +-
...abea90c02f9159e4a784bbf736e1e23_cgraph.svg | 145 +---
...90c02f9159e4a784bbf736e1e23_cgraph_org.svg | 136 ----
d5/d88/md__d_i_r_e_c_t_o_r_y.html | 1 +
...1inorder__traversal__of__bst_1_1_node.html | 140 ++++
...1_1inorder__traversal__of__bst_1_1_node.js | 6 +
d5/ddb/bogo__sort_8cpp.html | 2 +-
...inorder__successor__of__bst_8cpp__incl.map | 6 +
...inorder__successor__of__bst_8cpp__incl.md5 | 1 +
...inorder__successor__of__bst_8cpp__incl.svg | 68 ++
d7/def/trie__multiple__search_8cpp.html | 2 +-
d8/d90/iterative__tree__traversals_8cpp.html | 6 +-
d9/d2c/class_test_cases-members.html | 5 +
...mespaceoperations__on__datastructures.html | 7 +-
...namespaceoperations__on__datastructures.js | 11 +
.../namespaceinorder__successor__of__bst.html | 112 +++
dir_35422be6552f1b3672c1b6c4aba2da64.html | 3 +
dir_35422be6552f1b3672c1b6c4aba2da64.js | 1 +
files.html | 3 +-
functions_d.html | 1 +
functions_func_i.html | 2 +-
functions_i.html | 2 +-
functions_l.html | 1 +
functions_r.html | 1 +
functions_vars.html | 3 +
globals_func_i.html | 6 +-
globals_func_m.html | 1 +
globals_func_s.html | 6 +-
globals_func_t.html | 1 +
globals_i.html | 8 +-
globals_m.html | 1 +
globals_s.html | 6 +-
globals_t.html | 1 +
hierarchy.html | 91 +--
hierarchy.js | 3 +-
index.html | 8 +-
inherit_graph_52.map | 2 +-
inherit_graph_52.md5 | 2 +-
inherit_graph_52.svg | 12 +-
inherit_graph_53.map | 2 +-
inherit_graph_53.md5 | 2 +-
inherit_graph_53.svg | 14 +-
inherit_graph_54.map | 2 +-
inherit_graph_54.md5 | 2 +-
inherit_graph_54.svg | 12 +-
inherit_graph_55.map | 2 +-
inherit_graph_55.md5 | 2 +-
inherit_graph_55.svg | 14 +-
inherit_graph_56.map | 2 +-
inherit_graph_56.md5 | 2 +-
inherit_graph_56.svg | 15 +-
inherit_graph_57.map | 2 +-
inherit_graph_57.md5 | 2 +-
inherit_graph_57.svg | 15 +-
inherit_graph_58.map | 2 +-
inherit_graph_58.md5 | 2 +-
inherit_graph_58.svg | 15 +-
inherit_graph_59.map | 2 +-
inherit_graph_59.md5 | 2 +-
inherit_graph_59.svg | 12 +-
inherit_graph_60.map | 2 +-
inherit_graph_60.md5 | 2 +-
inherit_graph_60.svg | 12 +-
inherit_graph_61.map | 4 +-
inherit_graph_61.md5 | 2 +-
inherit_graph_61.svg | 50 +-
inherit_graph_62.map | 4 +-
inherit_graph_62.md5 | 2 +-
inherit_graph_62.svg | 50 +-
inherit_graph_63.map | 2 +-
inherit_graph_63.md5 | 2 +-
inherit_graph_63.svg | 15 +-
inherit_graph_64.map | 2 +-
inherit_graph_64.md5 | 2 +-
inherit_graph_64.svg | 15 +-
inherit_graph_65.map | 2 +-
inherit_graph_65.md5 | 2 +-
inherit_graph_65.svg | 15 +-
inherit_graph_66.map | 2 +-
inherit_graph_66.md5 | 2 +-
inherit_graph_66.svg | 15 +-
inherit_graph_67.map | 2 +-
inherit_graph_67.md5 | 2 +-
inherit_graph_67.svg | 12 +-
inherit_graph_68.map | 2 +-
inherit_graph_68.md5 | 2 +-
inherit_graph_68.svg | 12 +-
inherit_graph_69.map | 2 +-
inherit_graph_69.md5 | 2 +-
inherit_graph_69.svg | 12 +-
inherit_graph_70.map | 2 +-
inherit_graph_70.md5 | 2 +-
inherit_graph_70.svg | 12 +-
inherit_graph_71.map | 2 +-
inherit_graph_71.md5 | 2 +-
inherit_graph_71.svg | 4 +-
inherit_graph_72.map | 8 +-
inherit_graph_72.md5 | 2 +-
inherit_graph_72.svg | 106 +--
inherit_graph_73.map | 8 +-
inherit_graph_73.md5 | 2 +-
inherit_graph_73.svg | 106 ++-
inherit_graph_74.map | 2 +-
inherit_graph_74.md5 | 2 +-
inherit_graph_74.svg | 12 +-
inherit_graph_75.map | 2 +-
inherit_graph_75.md5 | 2 +-
inherit_graph_75.svg | 12 +-
inherit_graph_76.map | 2 +-
inherit_graph_76.md5 | 2 +-
inherit_graph_76.svg | 12 +-
inherit_graph_77.map | 2 +-
inherit_graph_77.md5 | 2 +-
inherit_graph_77.svg | 12 +-
inherit_graph_78.map | 2 +-
inherit_graph_78.md5 | 2 +-
inherit_graph_78.svg | 4 +-
inherit_graph_79.map | 3 +
inherit_graph_79.md5 | 1 +
inherit_graph_79.svg | 22 +
inherits.html | 52 +-
namespacemembers.html | 6 +-
namespacemembers_func.html | 6 +-
namespaces.html | 231 +++---
namespaces_dup.js | 1 +
navtreedata.js | 35 +-
navtreeindex0.js | 496 ++++++------
navtreeindex1.js | 500 ++++++------
navtreeindex10.js | 86 +-
navtreeindex11.js | 124 +--
navtreeindex12.js | 115 +--
navtreeindex13.js | 20 +
navtreeindex2.js | 254 +++---
navtreeindex3.js | 184 ++---
navtreeindex4.js | 144 ++--
navtreeindex5.js | 186 ++---
navtreeindex6.js | 88 +--
navtreeindex7.js | 200 ++---
navtreeindex8.js | 116 +--
navtreeindex9.js | 94 +--
search/all_10.js | 154 ++--
search/all_11.js | 265 +++----
search/all_12.js | 54 +-
search/all_13.js | 256 +++---
search/all_14.js | 550 ++++++-------
search/all_15.js | 286 +++----
search/all_16.js | 148 ++--
search/all_17.js | 108 +--
search/all_18.js | 180 ++---
search/all_19.js | 12 +-
search/all_1a.js | 8 +-
search/all_1b.js | 6 +-
search/all_1c.js | 194 ++---
search/all_5.js | 48 +-
search/all_6.js | 4 +-
search/all_7.js | 131 ++--
search/all_8.js | 211 ++---
search/all_9.js | 100 +--
search/all_a.js | 444 +++++------
search/all_b.js | 16 +-
search/all_c.js | 36 +-
search/all_d.js | 188 ++---
search/all_e.js | 295 +++----
search/all_f.js | 174 ++---
search/classes_0.js | 54 +-
search/classes_1.js | 128 +--
search/classes_10.js | 10 +-
search/classes_11.js | 82 +-
search/classes_12.js | 100 +--
search/classes_13.js | 54 +-
search/classes_14.js | 72 +-
search/classes_15.js | 48 +-
search/classes_16.js | 62 +-
search/classes_17.js | 4 +-
search/classes_18.js | 2 +-
search/classes_2.js | 74 +-
search/classes_3.js | 32 +-
search/classes_4.js | 36 +-
search/classes_5.js | 34 +-
search/classes_6.js | 12 +-
search/classes_7.js | 18 +-
search/classes_8.js | 210 ++---
search/classes_9.js | 2 +-
search/classes_a.js | 4 +-
search/classes_b.js | 36 +-
search/classes_c.js | 76 +-
search/classes_d.js | 42 +-
search/classes_e.js | 24 +-
search/classes_f.js | 38 +-
search/defines_0.js | 4 +-
search/defines_1.js | 4 +-
search/defines_2.js | 4 +-
search/defines_3.js | 4 +-
search/defines_4.js | 2 +-
search/defines_5.js | 4 +-
search/defines_6.js | 4 +-
search/defines_7.js | 4 +-
search/files_0.js | 2 +-
search/files_1.js | 10 +-
search/files_10.js | 30 +-
search/files_11.js | 16 +-
search/files_12.js | 14 +-
search/files_13.js | 42 +-
search/files_14.js | 16 +-
search/files_15.js | 4 +-
search/files_16.js | 8 +-
search/files_17.js | 6 +-
search/files_18.js | 2 +-
search/files_2.js | 32 +-
search/files_3.js | 28 +-
search/files_4.js | 20 +-
search/files_5.js | 8 +-
search/files_6.js | 22 +-
search/files_7.js | 16 +-
search/files_8.js | 20 +-
search/files_9.js | 13 +-
search/files_a.js | 6 +-
search/files_b.js | 10 +-
search/files_c.js | 32 +-
search/files_d.js | 24 +-
search/files_e.js | 18 +-
search/files_f.js | 8 +-
search/functions_0.js | 12 +-
search/functions_1.js | 172 ++--
search/functions_10.js | 183 ++---
search/functions_11.js | 22 +-
search/functions_12.js | 176 ++---
search/functions_13.js | 416 +++++-----
search/functions_14.js | 208 ++---
search/functions_15.js | 96 +--
search/functions_16.js | 46 +-
search/functions_17.js | 152 ++--
search/functions_18.js | 6 +-
search/functions_19.js | 2 +-
search/functions_1a.js | 4 +-
search/functions_1b.js | 194 ++---
search/functions_2.js | 132 ++--
search/functions_3.js | 180 ++---
search/functions_4.js | 202 ++---
search/functions_5.js | 120 +--
search/functions_6.js | 224 +++---
search/functions_7.js | 180 ++---
search/functions_8.js | 48 +-
search/functions_9.js | 228 +++---
search/functions_a.js | 6 +-
search/functions_b.js | 18 +-
search/functions_c.js | 114 +--
search/functions_d.js | 196 ++---
search/functions_e.js | 116 +--
search/functions_f.js | 130 +--
search/groups_0.js | 2 +-
search/groups_1.js | 4 +-
search/groups_2.js | 2 +-
search/namespaces_0.js | 6 +-
search/namespaces_1.js | 10 +-
search/namespaces_10.js | 10 +-
search/namespaces_11.js | 36 +-
search/namespaces_12.js | 6 +-
search/namespaces_13.js | 2 +-
search/namespaces_14.js | 4 +-
search/namespaces_15.js | 6 +-
search/namespaces_16.js | 2 +-
search/namespaces_2.js | 12 +-
search/namespaces_3.js | 10 +-
search/namespaces_4.js | 4 +-
search/namespaces_5.js | 6 +-
search/namespaces_6.js | 8 +-
search/namespaces_7.js | 7 +-
search/namespaces_8.js | 2 +-
search/namespaces_9.js | 4 +-
search/namespaces_a.js | 12 +-
search/namespaces_b.js | 18 +-
search/namespaces_c.js | 12 +-
search/namespaces_d.js | 4 +-
search/namespaces_e.js | 6 +-
search/namespaces_f.js | 6 +-
search/pages_0.js | 2 +-
search/pages_1.js | 6 +-
search/pages_2.js | 2 +-
search/pages_3.js | 2 +-
search/pages_4.js | 4 +-
search/related_0.js | 10 +-
search/typedefs_0.js | 2 +-
search/typedefs_1.js | 2 +-
search/typedefs_2.js | 2 +-
search/typedefs_3.js | 4 +-
search/typedefs_4.js | 2 +-
search/variables_0.js | 4 +-
search/variables_1.js | 12 +-
search/variables_10.js | 10 +-
search/variables_11.js | 22 +-
search/variables_12.js | 20 +-
search/variables_13.js | 2 +-
search/variables_14.js | 8 +-
search/variables_15.js | 6 +-
search/variables_16.js | 2 +-
search/variables_17.js | 2 +-
search/variables_2.js | 2 +-
search/variables_3.js | 6 +-
search/variables_4.js | 6 +-
search/variables_5.js | 4 +-
search/variables_6.js | 10 +-
search/variables_7.js | 2 +-
search/variables_8.js | 18 +-
search/variables_9.js | 8 +-
search/variables_a.js | 2 +-
search/variables_b.js | 10 +-
search/variables_c.js | 18 +-
search/variables_d.js | 10 +-
search/variables_e.js | 20 +-
search/variables_f.js | 4 +-
374 files changed, 9709 insertions(+), 7357 deletions(-)
create mode 100644 d1/dc0/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node-members.html
create mode 100644 d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.map
create mode 100644 d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.md5
create mode 100644 d2/dae/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node__coll__graph.svg
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp.html
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp.js
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.map
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.md5
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.svg
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.map
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.md5
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.svg
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.map
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.md5
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.map
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.md5
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.svg
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.map
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.md5
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.svg
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.map
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.md5
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.svg
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.map
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.md5
create mode 100644 d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.svg
delete mode 100644 d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph_org.svg
create mode 100644 d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.html
create mode 100644 d5/db5/classoperations__on__datastructures_1_1inorder__traversal__of__bst_1_1_node.js
create mode 100644 d7/d66/inorder__successor__of__bst_8cpp__incl.map
create mode 100644 d7/d66/inorder__successor__of__bst_8cpp__incl.md5
create mode 100644 d7/d66/inorder__successor__of__bst_8cpp__incl.svg
create mode 100644 dd/d74/namespaceinorder__successor__of__bst.html
create mode 100644 inherit_graph_79.map
create mode 100644 inherit_graph_79.md5
create mode 100644 inherit_graph_79.svg
create mode 100644 navtreeindex13.js
diff --git a/annotated.html b/annotated.html
index 0807d71e6..2ccef6fe0 100644
--- a/annotated.html
+++ b/annotated.html
@@ -148,73 +148,75 @@ $(document).ready(function(){initNavTree('annotated.html',''); initResizable();
▼ N math For IO operations ► N ncr_modulo_p C NCRModuloP Class which contains all methods required for calculating nCr mod p ▼ N operations_on_datastructures For std::priority_queue ► N trie_operations C Tnode Class defining the structure of trie node and containing the methods to perform operations on them ▼ N others For assert ► N iterative_tree_traversals C Node Defines the structure of a node of the tree C BinaryTree Defines the functions associated with the binary tree ► N postfix_expression C Stack Creates an array to be used as stack for storing values ▼ N quadratic_probing An implementation of hash table using quadratic probing algorithm C Entry ▼ N range_queries Algorithms and Data Structures that support range queries and updates ► N heavy_light_decomposition C Tree A Basic Tree , which supports binary lifting C SG Segment Tree , to store heavy chains C HLD The Heavy-Light Decomposition class ► C perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min C Node ▼ N search Search algorithms ► N sublist_search C Node A Node structure representing a single link Node in a linked list ▼ N statistics Statistical algorithms C stats_computer1 C stats_computer2 ▼ N std STL namespace C is_integral< uint128_t > C is_arithmetic< uint128_t > C is_unsigned< uint128_t > C is_integral< uint256_t > C is_arithmetic< uint256_t > C is_unsigned< uint256_t > ▼ C binary_search_tree The Binary Search Tree class C bst_node A struct to represent a node in the Binary Search Tree C Btree C cll C compare C Complex Class Complex to represent complex numbers as a field C CycleCheck C double_linked_list C Edge C FenwickTree C Graph C hash_chain Chain class with a given modulus C Item C large_number C linkedlist C list C MinHeap C MinHeapNode C mst C node C Node C Point C query C queue C Queue C RBtree C SegmentIntersection C Solution C stack C stack_linkedList C TestCases Class encapsulating the necessary test cases C tower ▼ C Trie C TrieNode C uint128_t Class for 128-bit unsigned integer C uint256_t Class for 256-bit unsigned integer ▼ N operations_on_datastructures For std::vector ► N inorder_traversal_of_bst C Node A Node structure representing a single node in BST ► N trie_operations C Tnode Class defining the structure of trie node and containing the methods to perform operations on them ▼ N others For assert ► N iterative_tree_traversals C Node Defines the structure of a node of the tree C BinaryTree Defines the functions associated with the binary tree ► N postfix_expression C Stack Creates an array to be used as stack for storing values ▼ N quadratic_probing An implementation of hash table using quadratic probing algorithm C Entry ▼ N range_queries Algorithms and Data Structures that support range queries and updates ► N heavy_light_decomposition C Tree A Basic Tree , which supports binary lifting C SG Segment Tree , to store heavy chains C HLD The Heavy-Light Decomposition class ► C perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min C Node ▼ N search Search algorithms ► N sublist_search C Node A Node structure representing a single link Node in a linked list ▼ N statistics Statistical algorithms C stats_computer1 C stats_computer2 ▼ N std STL namespace C is_integral< uint128_t > C is_arithmetic< uint128_t > C is_unsigned< uint128_t > C is_integral< uint256_t > C is_arithmetic< uint256_t > C is_unsigned< uint256_t > ▼ C binary_search_tree The Binary Search Tree class C bst_node A struct to represent a node in the Binary Search Tree C Btree C cll C compare C Complex Class Complex to represent complex numbers as a field C CycleCheck C double_linked_list C Edge C FenwickTree C Graph C hash_chain Chain class with a given modulus C Item C large_number C linkedlist C list C MinHeap C MinHeapNode C mst C Node C node C Point C query C queue C Queue C RBtree C SegmentIntersection C Solution C stack C stack_linkedList C TestCases Class encapsulating the necessary test cases C tower ▼ C Trie C TrieNode C uint128_t Class for 128-bit unsigned integer C uint256_t Class for 256-bit unsigned integer MinHeap MinHeapNode mst
N NCRModuloP (math::ncr_modulo_p)NeuralNetwork (machine_learning::neural_network)Node (data_structures )Node (data_structures::tree_234)Trie::Node (data_structures::trie_using_hashmap)node Node Node (others::iterative_tree_traversals)perSegTree::Node (range_queries )Node (search::sublist_search)
+NCRModuloP (math::ncr_modulo_p)NeuralNetwork (machine_learning::neural_network)Node (data_structures )Node (data_structures::tree_234)Trie::Node (data_structures::trie_using_hashmap)Node node Node (operations_on_datastructures::inorder_traversal_of_bst)Node (others::iterative_tree_traversals)perSegTree::Node (range_queries )Node (search::sublist_search)
P perSegTree (range_queries )Point (ciphers::elliptic_curve_key_exchange )Point (geometry::jarvis)Point
diff --git a/d1/daa/random__pivot__quick__sort_8cpp.html b/d1/daa/random__pivot__quick__sort_8cpp.html
index a0a9d8399..7146aafed 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp.html
+++ b/d1/daa/random__pivot__quick__sort_8cpp.html
@@ -164,19 +164,19 @@ Functions
Where in quick sort is fast, but still can give you the time complexity of O(n^2) in worst case.
To avoid hitting the time complexity of O(n^2), we use the logic of randomize the selection process of pivot element.
-
The logic is pretty simple, the only change is in the partitioning algorithm, which is selecting the pivot element.
Instead of selecting the last or the first element from array for pivot we use a random index to select pivot element.
This avoids hitting the O(n^2) time complexity in practical use cases.
-
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.
-
Select the pivot element randomly using getRandomIndex() function from this namespace.
@@ -607,12 +607,12 @@ Here is the call graph for this function:
-class encapsulating the necessary test cases
Definition: sublist_search.cpp:153
void runTests()
Executes test cases.
Definition: sublist_search.cpp:171
class encapsulating the necessary test cases
Definition: inorder_successor_of_bst.cpp:225
void runTests()
Executes test cases.
Definition: inorder_successor_of_bst.cpp:243
-
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
index 8f19ae0b4..6991c5b86 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
@@ -1,12 +1,11 @@
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
index 5a26d5aaf..be9ea13bd 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
@@ -1 +1 @@
-6573e351d172d8b938d1a6d0851eb3ae
\ No newline at end of file
+9b085284bdb446d13903a4e92d32bbd2
\ No newline at end of file
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
index a91432847..7d571b201 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
@@ -46,7 +46,7 @@ if (edges && edges.length) {
@@ -54,7 +54,7 @@ var sectionId = 'dynsection-3';
main
-
Node1
@@ -68,16 +68,16 @@ var sectionId = 'dynsection-3';
Node2
-std::endl
+std::endl
Node1->Node2
-
@@ -127,28 +127,28 @@ var sectionId = 'dynsection-3';
Node5->Node2
-
Node6
-TestCases::log
+TestCases::log
Node5->Node6
-
Node7
-
+
TestCases::testCase_1
@@ -193,41 +193,26 @@ var sectionId = 'dynsection-3';
Node6->Node2
-
Node7->Node6
-
Node8->Node6
-
Node9->Node6
-
-
-
-Node10
-
-std::vector::push_back
-
-
-
-
-Node9->Node10
-
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
index 1dcf4b86e..d1da0905e 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ b/d1/daa/random__pivot__quick__sort_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
@@ -4,11 +4,11 @@
-
+
main
-
Node1
@@ -22,16 +22,16 @@
Node2
-std::endl
+std::endl
Node1->Node2
-
@@ -81,28 +81,28 @@
Node5->Node2
-
Node6
-TestCases::log
+TestCases::log
Node5->Node6
-
Node7
-
+
TestCases::testCase_1
@@ -147,41 +147,26 @@
Node6->Node2
-
Node7->Node6
-
Node8->Node6
-
Node9->Node6
-
-
-
-Node10
-
-std::vector::push_back
-
-
-
-
-Node9->Node10
-
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
index 8d4b48329..e731ff650 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -1,10 +1,9 @@
-
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
index 2908ecc6e..5328d9dc5 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -1 +1 @@
-59cc849d5912d57ceb7252b3490d7478
\ No newline at end of file
+8387bcc4b0cc5bb822748e702fc24784
\ No newline at end of file
diff --git a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
index d5ee67946..c02721cca 100644
--- a/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ b/d1/daa/random__pivot__quick__sort_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -4,7 +4,7 @@
-
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+test
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+TestCases::runTests
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+std::endl
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+TestCases::log
+
+
+
+
+Node3->Node5
+
+
+
+Node6
+
+TestCases::testCase_1
+
+
+
+
+Node3->Node6
+
+
+
+Node7
+
+TestCases::testCase_2
+
+
+
+
+Node3->Node7
+
+
+
+Node8
+
+TestCases::testCase_3
+
+
+
+
+Node3->Node8
+
+
+
+Node5->Node4
+
+
+
+Node6->Node5
+
+
+
+Node7->Node5
+
+
+
+Node8->Node5
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
new file mode 100644
index 000000000..20766f273
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
@@ -0,0 +1,151 @@
+
+
+
+
+
+
+main
+
+Node1
+
+main
+
+
+
+
+Node2
+
+test
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+TestCases::runTests
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+std::endl
+
+
+
+
+Node3->Node4
+
+
+
+Node5
+
+TestCases::log
+
+
+
+
+Node3->Node5
+
+
+
+Node6
+
+TestCases::testCase_1
+
+
+
+
+Node3->Node6
+
+
+
+Node7
+
+TestCases::testCase_2
+
+
+
+
+Node3->Node7
+
+
+
+Node8
+
+TestCases::testCase_3
+
+
+
+
+Node3->Node8
+
+
+
+Node5->Node4
+
+
+
+Node6->Node5
+
+
+
+Node7->Node5
+
+
+
+Node8->Node5
+
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.map
new file mode 100644
index 000000000..1849982bf
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.map
@@ -0,0 +1,3 @@
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.md5
new file mode 100644
index 000000000..86451897e
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.md5
@@ -0,0 +1 @@
+98116e169b6bec24c5d449688cdbb704
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.svg
new file mode 100644
index 000000000..de4ade7bd
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a25667588088eb647887d1c2bff0efa8c_cgraph.svg
@@ -0,0 +1,30 @@
+
+
+
+
+
+
+operations_on_datastructures::inorder_traversal_of_bst::findMinNode
+
+Node1
+
+operations_on_datastructures
+::inorder_traversal_of_bst
+::findMinNode
+
+
+
+
+Node1->Node1
+
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.map
new file mode 100644
index 000000000..10130fbdd
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.map
@@ -0,0 +1,3 @@
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.md5
new file mode 100644
index 000000000..8ab28b95b
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.md5
@@ -0,0 +1 @@
+9840c3d8af7efe8c22f0f0f42186210b
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.svg
new file mode 100644
index 000000000..4a8d5aca2
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a4852816cc9f28f7b9def0e5beb4e8545_cgraph.svg
@@ -0,0 +1,30 @@
+
+
+
+
+
+
+operations_on_datastructures::inorder_traversal_of_bst::makeNode
+
+Node1
+
+operations_on_datastructures
+::inorder_traversal_of_bst
+::makeNode
+
+
+
+
+Node1->Node1
+
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.map
new file mode 100644
index 000000000..5f7e39b8f
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.map
@@ -0,0 +1,3 @@
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.md5
new file mode 100644
index 000000000..b8126230d
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.md5
@@ -0,0 +1 @@
+e0f1c24313a256e5f8f8cf20580ae974
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg
new file mode 100644
index 000000000..083adf95d
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a5d7266b934ca50c4f53e4f1e725d89a4_cgraph.svg
@@ -0,0 +1,30 @@
+
+
+
+
+
+
+operations_on_datastructures::inorder_traversal_of_bst::printInorder
+
+Node1
+
+operations_on_datastructures
+::inorder_traversal_of_bst
+::printInorder
+
+
+
+
+Node1->Node1
+
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.map
new file mode 100644
index 000000000..bd5952dea
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.map
@@ -0,0 +1,3 @@
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.md5
new file mode 100644
index 000000000..6f2774a40
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.md5
@@ -0,0 +1 @@
+c8215d87446a8331c5f2295f046a5d3d
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.svg
new file mode 100644
index 000000000..68ea2bc24
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a744afaca22fa7bb91c92209a26f23e8f_cgraph.svg
@@ -0,0 +1,30 @@
+
+
+
+
+
+
+operations_on_datastructures::inorder_traversal_of_bst::getNode
+
+Node1
+
+operations_on_datastructures
+::inorder_traversal_of_bst
+::getNode
+
+
+
+
+Node1->Node1
+
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.map
new file mode 100644
index 000000000..37b88a504
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.map
@@ -0,0 +1,3 @@
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.md5
new file mode 100644
index 000000000..5ebf7b8b4
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.md5
@@ -0,0 +1 @@
+2d748e1986f3f669c9d295e23716561d
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.svg
new file mode 100644
index 000000000..edc22b404
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a7b20eb99272665c1777949e26ab59589_cgraph.svg
@@ -0,0 +1,30 @@
+
+
+
+
+
+
+operations_on_datastructures::inorder_traversal_of_bst::deallocate
+
+Node1
+
+operations_on_datastructures
+::inorder_traversal_of_bst
+::deallocate
+
+
+
+
+Node1->Node1
+
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.map
new file mode 100644
index 000000000..5cfff7466
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.map
@@ -0,0 +1,3 @@
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.md5
new file mode 100644
index 000000000..88577f26d
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.md5
@@ -0,0 +1 @@
+a4aa86d37999e783d2034a506f0343b1
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.svg
new file mode 100644
index 000000000..256617026
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_a9aa3fac9aa48a6568ecf89aaee190d43_cgraph.svg
@@ -0,0 +1,30 @@
+
+
+
+
+
+
+operations_on_datastructures::inorder_traversal_of_bst::getInorderSuccessor
+
+Node1
+
+operations_on_datastructures
+::inorder_traversal_of_bst
+::getInorderSuccessor
+
+
+
+
+Node1->Node1
+
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
new file mode 100644
index 000000000..e731ff650
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -0,0 +1,9 @@
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
new file mode 100644
index 000000000..5328d9dc5
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -0,0 +1 @@
+8387bcc4b0cc5bb822748e702fc24784
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
new file mode 100644
index 000000000..8f945fdcd
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -0,0 +1,224 @@
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+test
+
+Node1
+
+test
+
+
+
+
+Node2
+
+TestCases::runTests
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+TestCases::log
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+TestCases::testCase_1
+
+
+
+
+Node2->Node5
+
+
+
+Node6
+
+TestCases::testCase_2
+
+
+
+
+Node2->Node6
+
+
+
+Node7
+
+TestCases::testCase_3
+
+
+
+
+Node2->Node7
+
+
+
+Node4->Node3
+
+
+
+Node5->Node4
+
+
+
+Node6->Node4
+
+
+
+Node7->Node4
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
new file mode 100644
index 000000000..dade50c99
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph_org.svg
@@ -0,0 +1,136 @@
+
+
+
+
+
+
+test
+
+Node1
+
+test
+
+
+
+
+Node2
+
+TestCases::runTests
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+std::endl
+
+
+
+
+Node2->Node3
+
+
+
+Node4
+
+TestCases::log
+
+
+
+
+Node2->Node4
+
+
+
+Node5
+
+TestCases::testCase_1
+
+
+
+
+Node2->Node5
+
+
+
+Node6
+
+TestCases::testCase_2
+
+
+
+
+Node2->Node6
+
+
+
+Node7
+
+TestCases::testCase_3
+
+
+
+
+Node2->Node7
+
+
+
+Node4->Node3
+
+
+
+Node5->Node4
+
+
+
+Node6->Node4
+
+
+
+Node7->Node4
+
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.map b/d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.map
new file mode 100644
index 000000000..6fb55a96c
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.map
@@ -0,0 +1,3 @@
+
+
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.md5 b/d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.md5
new file mode 100644
index 000000000..f30453073
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.md5
@@ -0,0 +1 @@
+1fc40f4869b51b8597df81c4eaa43674
\ No newline at end of file
diff --git a/d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.svg b/d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.svg
new file mode 100644
index 000000000..f35641b78
--- /dev/null
+++ b/d4/d32/inorder__successor__of__bst_8cpp_ad0ca93be4f9576bfb715a4864a30dbee_cgraph.svg
@@ -0,0 +1,30 @@
+
+
+
+
+
+
+operations_on_datastructures::inorder_traversal_of_bst::makeBST
+
+Node1
+
+operations_on_datastructures
+::inorder_traversal_of_bst
+::makeBST
+
+
+
+
+Node1->Node1
+
+
+
diff --git a/d5/d45/sublist__search_8cpp.html b/d5/d45/sublist__search_8cpp.html
index f95e995f7..15a723504 100644
--- a/d5/d45/sublist__search_8cpp.html
+++ b/d5/d45/sublist__search_8cpp.html
@@ -149,14 +149,14 @@ Functions
Implementation of the Sublist Search Algorithm
-
Sublist search is used to detect a presence of one list in another list.
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.
For instance, the first list contains these elements: 23 -> 30 -> 41, and the second list contains these elements: 10 -> 15 -> 23 -> 30 -> 41 -> 49. At a glance, we see that the first list presents in the second list.
-
The sublist search algorithm works by comparing the first element of the first list with the first element of the second list.
@@ -478,12 +478,12 @@ Here is the call graph for this function: class encapsulating the necessary test cases
Definition: sublist_search.cpp:153
void runTests()
Executes test cases.
Definition: sublist_search.cpp:171
class encapsulating the necessary test cases
Definition: inorder_successor_of_bst.cpp:225
void runTests()
Executes test cases.
Definition: inorder_successor_of_bst.cpp:243
-
diff --git a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
index 2255450b8..bee281531 100644
--- a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
+++ b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.map
@@ -1,11 +1,10 @@
diff --git a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5 b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
index dc7ce3100..09604a2f5 100644
--- a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
+++ b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.md5
@@ -1 +1 @@
-8f401a7fcc69e2bbac2b4f7d461211c9
\ No newline at end of file
+0f4cc014afe33e9372a57354b7ceb14a
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
index c7b951262..fa4014c4c 100644
--- a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
+++ b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph.svg
@@ -46,7 +46,7 @@ if (edges && edges.length) {
@@ -54,7 +54,7 @@ var sectionId = 'dynsection-1';
main
-
Node1
@@ -68,16 +68,16 @@ var sectionId = 'dynsection-1';
Node2
-std::endl
+std::endl
Node1->Node2
-
@@ -112,28 +112,28 @@ var sectionId = 'dynsection-1';
Node4->Node2
-
Node5
-TestCases::log
+TestCases::log
Node4->Node5
-
Node6
-
+
TestCases::testCase_1
@@ -178,41 +178,26 @@ var sectionId = 'dynsection-1';
Node5->Node2
-
Node6->Node5
-
Node7->Node5
-
Node8->Node5
-
-
-
-Node9
-
-std::vector::push_back
-
-
-
-
-Node8->Node9
-
diff --git a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
index 3123996f5..c4660d600 100644
--- a/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
+++ b/d5/d45/sublist__search_8cpp_a0ddf1224851353fc92bfbff6f499fa97_cgraph_org.svg
@@ -4,11 +4,11 @@
-
+
main
-
Node1
@@ -22,16 +22,16 @@
Node2
-std::endl
+std::endl
Node1->Node2
-
@@ -66,28 +66,28 @@
Node4->Node2
-
Node5
-TestCases::log
+TestCases::log
Node4->Node5
-
Node6
-
+
TestCases::testCase_1
@@ -132,41 +132,26 @@
Node5->Node2
-
Node6->Node5
-
Node7->Node5
-
Node8->Node5
-
-
-
-Node9
-
-std::vector::push_back
-
-
-
-
-Node8->Node9
-
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
index 8d4b48329..e731ff650 100644
--- a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.map
@@ -1,10 +1,9 @@
-
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5 b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
index 2908ecc6e..5328d9dc5 100644
--- a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.md5
@@ -1 +1 @@
-59cc849d5912d57ceb7252b3490d7478
\ No newline at end of file
+8387bcc4b0cc5bb822748e702fc24784
\ No newline at end of file
diff --git a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
index d5c9818c4..b647d3673 100644
--- a/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
+++ b/d5/d45/sublist__search_8cpp_aa8dca7b867074164d5f45b0f3851269d_cgraph.svg
@@ -4,7 +4,7 @@
-
+
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
+
+
TestCases::runTests
-
Node1
@@ -68,36 +22,36 @@ var sectionId = 'dynsection-2';
Node2
-std::endl
+std::endl
Node1->Node2
-
Node3
-TestCases::log
+TestCases::log
Node1->Node3
-
Node4
-
+
TestCases::testCase_1
@@ -142,83 +96,26 @@ var sectionId = 'dynsection-2';
Node3->Node2
-
Node4->Node3
-
Node5->Node3
-
Node6->Node3
-
-
-
-Node7
-
-std::vector::push_back
-
-
-
-
-Node6->Node7
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
diff --git a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph_org.svg b/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph_org.svg
deleted file mode 100644
index 6540076ee..000000000
--- a/d5/d58/class_test_cases_aeabea90c02f9159e4a784bbf736e1e23_cgraph_org.svg
+++ /dev/null
@@ -1,136 +0,0 @@
-
-
-
-
-
-
-TestCases::runTests
-
-Node1
-
-TestCases::runTests
-
-
-
-
-Node2
-
-std::endl
-
-
-
-
-Node1->Node2
-
-
-
-Node3
-
-TestCases::log
-
-
-
-
-Node1->Node3
-
-
-
-Node4
-
-TestCases::testCase_1
-
-
-
-
-Node1->Node4
-
-
-
-Node5
-
-TestCases::testCase_2
-
-
-
-
-Node1->Node5
-
-
-
-Node6
-
-TestCases::testCase_3
-
-
-
-
-Node1->Node6
-
-
-
-Node3->Node2
-
-
-
-Node4->Node3
-
-
-
-Node5->Node3
-
-
-
-Node6->Node3
-
-
-
-Node7
-
-std::vector::push_back
-
-
-
-
-Node6->Node7
-
-
-
diff --git a/d5/d88/md__d_i_r_e_c_t_o_r_y.html b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
index d1090fd9c..f089e3055 100644
--- a/d5/d88/md__d_i_r_e_c_t_o_r_y.html
+++ b/d5/d88/md__d_i_r_e_c_t_o_r_y.html
@@ -345,6 +345,7 @@ Operations On Datastructures
Circular Linked List Circular Queue Using Array Get Size Of Linked List Inorder Successor Of Bst Intersection Of 2 Arrays Reverse A Linked List Using Recusion Selectionsortlinkedlist Algorithms_in_C++: operations_on_datastructures::inorder_traversal_of_bst::Node Class Reference
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
A Node structure representing a single node in BST.
+ More...
+
+
+
+data The key/value of the node. Node * left Pointer to Left child. Node * right Pointer to right child.
+
+
A Node structure representing a single node in BST.
+
The documentation for this class was generated from the following file:
+
+
Implementation of Bogosort algorithm
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.
-
Shuffle the array untill array is sorted.
Author Deep Raval
diff --git a/d7/d66/inorder__successor__of__bst_8cpp__incl.map b/d7/d66/inorder__successor__of__bst_8cpp__incl.map
new file mode 100644
index 000000000..0894456cb
--- /dev/null
+++ b/d7/d66/inorder__successor__of__bst_8cpp__incl.map
@@ -0,0 +1,6 @@
+
+
diff --git a/d7/d66/inorder__successor__of__bst_8cpp__incl.md5 b/d7/d66/inorder__successor__of__bst_8cpp__incl.md5
new file mode 100644
index 000000000..6598715ca
--- /dev/null
+++ b/d7/d66/inorder__successor__of__bst_8cpp__incl.md5
@@ -0,0 +1 @@
+07533890d78052692da3421a3a388fe0
\ No newline at end of file
diff --git a/d7/d66/inorder__successor__of__bst_8cpp__incl.svg b/d7/d66/inorder__successor__of__bst_8cpp__incl.svg
new file mode 100644
index 000000000..c2473a902
--- /dev/null
+++ b/d7/d66/inorder__successor__of__bst_8cpp__incl.svg
@@ -0,0 +1,68 @@
+
+
+
+
+
+
+operations_on_datastructures/inorder_successor_of_bst.cpp
+
+Node1
+
+operations_on_datastructures
+/inorder_successor_of_bst.cpp
+
+
+
+
+Node2
+
+cassert
+
+
+
+
+Node1->Node2
+
+
+
+Node3
+
+iostream
+
+
+
+
+Node1->Node3
+
+
+
+Node4
+
+vector
+
+
+
+
+Node1->Node4
+
+
+
diff --git a/d7/def/trie__multiple__search_8cpp.html b/d7/def/trie__multiple__search_8cpp.html
index f067c5e82..cb97d58c2 100644
--- a/d7/def/trie__multiple__search_8cpp.html
+++ b/d7/def/trie__multiple__search_8cpp.html
@@ -123,7 +123,7 @@ Classes
operations_on_datastructures
-
for std::priority_queue
+
for std::vector trie_operations Functions for Trie datastructure implementation.
diff --git a/d8/d90/iterative__tree__traversals_8cpp.html b/d8/d90/iterative__tree__traversals_8cpp.html
index 349666147..c08326154 100644
--- a/d8/d90/iterative__tree__traversals_8cpp.html
+++ b/d8/d90/iterative__tree__traversals_8cpp.html
@@ -158,13 +158,13 @@ Functions
Iterative version of Preorder, Postorder, and preorder Traversal of the Tree
Author Motasim
-
Create a Stack that will store the Node 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.
-
Create a Stack that will store the Node 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.
-
Create a Stack that will store the Node 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.
diff --git a/d9/d2c/class_test_cases-members.html b/d9/d2c/class_test_cases-members.html
index 1b186f433..7a0b774f5 100644
--- a/d9/d2c/class_test_cases-members.html
+++ b/d9/d2c/class_test_cases-members.html
@@ -99,14 +99,19 @@ $(document).ready(function(){initNavTree('d5/d58/class_test_cases.html','../../'
-
for std::priority_queue
+
for std::vector
More...
-
for std::priority_queue
+
for std::vector
+
for std::priority_queue
+
for assert for IO Operations
+
Operations on data structures
for std::count for assert for tolower for string operations for IO Operations
Operations on data structures
diff --git a/da/d6d/namespaceoperations__on__datastructures.js b/da/d6d/namespaceoperations__on__datastructures.js
index f3523d1f8..f9c488b7b 100644
--- a/da/d6d/namespaceoperations__on__datastructures.js
+++ b/da/d6d/namespaceoperations__on__datastructures.js
@@ -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" ]
] ]
diff --git a/dd/d74/namespaceinorder__successor__of__bst.html b/dd/d74/namespaceinorder__successor__of__bst.html
new file mode 100644
index 000000000..1168ade2a
--- /dev/null
+++ b/dd/d74/namespaceinorder__successor__of__bst.html
@@ -0,0 +1,112 @@
+
+
+
+
+
+
+
+
Algorithms_in_C++: inorder_successor_of_bst Namespace Reference
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Algorithms_in_C++
+ 1.0.0
+
+ Set of algorithms implemented in C++.
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
diff --git a/dir_35422be6552f1b3672c1b6c4aba2da64.html b/dir_35422be6552f1b3672c1b6c4aba2da64.html
index ec0535ab5..6ad871072 100644
--- a/dir_35422be6552f1b3672c1b6c4aba2da64.html
+++ b/dir_35422be6552f1b3672c1b6c4aba2da64.html
@@ -97,6 +97,9 @@ $(document).ready(function(){initNavTree('dir_35422be6552f1b3672c1b6c4aba2da64.h
file inorder_successor_of_bst.cpp An implementation for finding the Inorder successor of a binary search tree 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. file trie_multiple_search.cpp Trie datastructure with search variants rungekutta.cpp Runge Kutta fourth order method implementation successive_approximation.cpp Method of successive approximations using fixed-point iteration method ► operations_on_datastructures trie_multiple_search.cpp Trie datastructure with search variants inorder_successor_of_bst.cpp An implementation for finding the Inorder successor of a binary search tree 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 trie_multiple_search.cpp Trie datastructure with search variants ► others buzz_number.cpp A buzz number is a number that is either divisible by 7 or has last digit as 7 decimal_to_binary.cpp Function to convert decimal number to binary representation
data
: node< Kind >
+, operations_on_datastructures::inorder_traversal_of_bst::Node
, others::iterative_tree_traversals::Node
, search::sublist_search::Node
diff --git a/functions_func_i.html b/functions_func_i.html
index 5ffb0e7dc..7955cc873 100644
--- a/functions_func_i.html
+++ b/functions_func_i.html
@@ -114,7 +114,7 @@ $(document).ready(function(){initNavTree('functions_func_i.html',''); initResiza
, data_structures::list_array::list
Insert()
-: data_structures::tree_234::Tree234
+: data_structures::tree_234::Tree234
insert()
: data_structures::trie
diff --git a/functions_i.html b/functions_i.html
index 9797097a1..15679db4e 100644
--- a/functions_i.html
+++ b/functions_i.html
@@ -115,7 +115,7 @@ $(document).ready(function(){initNavTree('functions_i.html',''); initResizable()
, data_structures::list_array::list
Insert()
-: data_structures::tree_234::Tree234
+: data_structures::tree_234::Tree234
insert()
: data_structures::trie
diff --git a/functions_l.html b/functions_l.html
index 4b7338c69..df357b7a3 100644
--- a/functions_l.html
+++ b/functions_l.html
@@ -111,6 +111,7 @@ $(document).ready(function(){initNavTree('functions_l.html',''); initResizable()
left
: binary_search_tree< T >::bst_node
, MinHeap
+, operations_on_datastructures::inorder_traversal_of_bst::Node
, others::iterative_tree_traversals::Node
LeftRotate()
diff --git a/functions_r.html b/functions_r.html
index 182b9c87b..3ba30b6b7 100644
--- a/functions_r.html
+++ b/functions_r.html
@@ -124,6 +124,7 @@ $(document).ready(function(){initNavTree('functions_r.html',''); initResizable()
right
: binary_search_tree< T >::bst_node
, MinHeap
+, operations_on_datastructures::inorder_traversal_of_bst::Node
, others::iterative_tree_traversals::Node
, range_queries::perSegTree::Node
diff --git a/functions_vars.html b/functions_vars.html
index 6eea9d247..d773d2c3d 100644
--- a/functions_vars.html
+++ b/functions_vars.html
@@ -140,6 +140,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
data
: node< Kind >
+, operations_on_datastructures::inorder_traversal_of_bst::Node
, others::iterative_tree_traversals::Node
, search::sublist_search::Node
@@ -230,6 +231,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
left
: binary_search_tree< T >::bst_node
+, operations_on_datastructures::inorder_traversal_of_bst::Node
, others::iterative_tree_traversals::Node
level
@@ -314,6 +316,7 @@ $(document).ready(function(){initNavTree('functions_vars.html',''); initResizabl
right
: binary_search_tree< T >::bst_node
+, operations_on_datastructures::inorder_traversal_of_bst::Node
, others::iterative_tree_traversals::Node
, range_queries::perSegTree::Node
diff --git a/globals_func_i.html b/globals_func_i.html
index d419feb46..2037df291 100644
--- a/globals_func_i.html
+++ b/globals_func_i.html
@@ -123,12 +123,12 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
is_square()
: ordinary_least_squares_regressor.cpp
-IsPrime()
-: primality_test.cpp
-
isPrime()
: modular_inverse_fermat_little_theorem.cpp
+IsPrime()
+: primality_test.cpp
+
it_ternary_search()
: ternary_search.cpp
diff --git a/globals_func_m.html b/globals_func_m.html
index 65090ba34..f08a7e898 100644
--- a/globals_func_m.html
+++ b/globals_func_m.html
@@ -219,6 +219,7 @@ $(document).ready(function(){initNavTree('globals_func_m.html',''); initResizabl
, qr_eigen_values.cpp
, rungekutta.cpp
, successive_approximation.cpp
+, inorder_successor_of_bst.cpp
, trie_multiple_search.cpp
, buzz_number.cpp
, decimal_to_hexadecimal.cpp
diff --git a/globals_func_s.html b/globals_func_s.html
index 4981e10ce..79af10ed4 100644
--- a/globals_func_s.html
+++ b/globals_func_s.html
@@ -126,12 +126,12 @@ $(document).ready(function(){initNavTree('globals_func_s.html',''); initResizabl
show_pascal()
: pascal_triangle.cpp
-sieve()
-: sieve_of_eratosthenes.cpp
-
Sieve()
: primes_up_to_billion.cpp
+sieve()
+: sieve_of_eratosthenes.cpp
+
SieveOfEratosthenes()
: prime_factorization.cpp
diff --git a/globals_func_t.html b/globals_func_t.html
index 0e41a797e..be212419a 100644
--- a/globals_func_t.html
+++ b/globals_func_t.html
@@ -142,6 +142,7 @@ $(document).ready(function(){initNavTree('globals_func_t.html',''); initResizabl
, sum_of_digits.cpp
, vector_cross_product.cpp
, rungekutta.cpp
+, inorder_successor_of_bst.cpp
, trie_multiple_search.cpp
, smallest_circle.cpp
, persistent_seg_tree_lazy_prop.cpp
diff --git a/globals_i.html b/globals_i.html
index 7b558531d..87908168b 100644
--- a/globals_i.html
+++ b/globals_i.html
@@ -127,14 +127,14 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
is_square()
: ordinary_least_squares_regressor.cpp
-IsPrime()
-: primality_test.cpp
+ isprime
+: prime_factorization.cpp
isPrime()
: modular_inverse_fermat_little_theorem.cpp
-isprime
-: prime_factorization.cpp
+ IsPrime()
+: primality_test.cpp
it_ternary_search()
: ternary_search.cpp
diff --git a/globals_m.html b/globals_m.html
index b784421f9..be412add6 100644
--- a/globals_m.html
+++ b/globals_m.html
@@ -219,6 +219,7 @@ $(document).ready(function(){initNavTree('globals_m.html',''); initResizable();
, qr_eigen_values.cpp
, rungekutta.cpp
, successive_approximation.cpp
+, inorder_successor_of_bst.cpp
, trie_multiple_search.cpp
, buzz_number.cpp
, decimal_to_hexadecimal.cpp
diff --git a/globals_s.html b/globals_s.html
index 3ec5d0aab..b717f4e8f 100644
--- a/globals_s.html
+++ b/globals_s.html
@@ -126,12 +126,12 @@ $(document).ready(function(){initNavTree('globals_s.html',''); initResizable();
show_pascal()
: pascal_triangle.cpp
-sieve()
-: sieve_of_eratosthenes.cpp
-
Sieve()
: primes_up_to_billion.cpp
+sieve()
+: sieve_of_eratosthenes.cpp
+
SieveOfEratosthenes()
: prime_factorization.cpp
diff --git a/globals_t.html b/globals_t.html
index 3df4ad942..b89aa3f31 100644
--- a/globals_t.html
+++ b/globals_t.html
@@ -142,6 +142,7 @@ $(document).ready(function(){initNavTree('globals_t.html',''); initResizable();
, sum_of_digits.cpp
, vector_cross_product.cpp
, rungekutta.cpp
+, inorder_successor_of_bst.cpp
, trie_multiple_search.cpp
, smallest_circle.cpp
, persistent_seg_tree_lazy_prop.cpp
diff --git a/hierarchy.html b/hierarchy.html
index 3f68aae50..f1a2de3ce 100644
--- a/hierarchy.html
+++ b/hierarchy.html
@@ -142,51 +142,52 @@ This inheritance list is sorted roughly, but not completely, alphabetically: C data_structures::Node C data_structures::tree_234::Node 2-3-4 tree node class C data_structures::trie_using_hashmap::Trie::Node Struct representing a trie node C node< Kind > C Node C others::iterative_tree_traversals::Node Defines the structure of a node of the tree C range_queries::perSegTree::Node C search::sublist_search::Node A Node structure representing a single link Node in a linked list C node< Type > C range_queries::perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min C ciphers::elliptic_curve_key_exchange::Point Definition of struct Point C geometry::jarvis::Point C Point C query C queue< Kind > C Queue C data_structures::queue_using_array::Queue_Array Queue_Array class containing the main data and also index of head and tail of the array C RBtree C SegmentIntersection ▼ C range_queries::heavy_light_decomposition::SG< X > Segment Tree , to store heavy chains C range_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class C data_structures::SkipList C Solution C data_structures::sparse_table::Sparse_table C others::postfix_expression::Stack Creates an array to be used as stack for storing values C stack< Type > C stack_linkedList C statistics::stats_computer1< T > C statistics::stats_computer2< T > C TestCases Class encapsulating the necessary test cases C operations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them C tower ▼ C range_queries::heavy_light_decomposition::Tree< X > A Basic Tree , which supports binary lifting C range_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class C data_structures::tree_234::Tree234 2-3-4 tree class C data_structures::trie Trie implementation for small-case English alphabets a-z C data_structures::trie_using_hashmap::Trie Trie 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 C Trie C Trie::TrieNode ▼ C std::true_type [external] C std::is_arithmetic< uint128_t > C std::is_arithmetic< uint256_t > C std::is_integral< uint128_t > C std::is_integral< uint256_t > C std::is_unsigned< uint128_t > C std::is_unsigned< uint256_t > C uint128_t Class for 128-bit unsigned integer C uint256_t Class for 256-bit unsigned integer C Node C node< Kind > C operations_on_datastructures::inorder_traversal_of_bst::Node A Node structure representing a single node in BST C others::iterative_tree_traversals::Node Defines the structure of a node of the tree C range_queries::perSegTree::Node C search::sublist_search::Node A Node structure representing a single link Node in a linked list C node< Type > C range_queries::perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min C ciphers::elliptic_curve_key_exchange::Point Definition of struct Point C geometry::jarvis::Point C Point C query C queue< Kind > C Queue C data_structures::queue_using_array::Queue_Array Queue_Array class containing the main data and also index of head and tail of the array C RBtree C SegmentIntersection ▼ C range_queries::heavy_light_decomposition::SG< X > Segment Tree , to store heavy chains C range_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class C data_structures::SkipList C Solution C data_structures::sparse_table::Sparse_table C others::postfix_expression::Stack Creates an array to be used as stack for storing values C stack< Type > C stack_linkedList C statistics::stats_computer1< T > C statistics::stats_computer2< T > C TestCases Class encapsulating the necessary test cases C operations_on_datastructures::trie_operations::Tnode Class defining the structure of trie node and containing the methods to perform operations on them C tower ▼ C range_queries::heavy_light_decomposition::Tree< X > A Basic Tree , which supports binary lifting C range_queries::heavy_light_decomposition::HLD< X > The Heavy-Light Decomposition class C data_structures::tree_234::Tree234 2-3-4 tree class C data_structures::trie Trie implementation for small-case English alphabets a-z C data_structures::trie_using_hashmap::Trie Trie 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 C Trie C Trie::TrieNode ▼ C std::true_type [external] C std::is_arithmetic< uint128_t > C std::is_arithmetic< uint256_t > C std::is_integral< uint128_t > C std::is_integral< uint256_t > C std::is_unsigned< uint128_t > C std::is_unsigned< uint256_t > C uint128_t Class for 128-bit unsigned integer C uint256_t Class for 256-bit unsigned integer
-
The repository is a collection of open-source implementation of a variety of algorithms implemented in C++ and licensed under MIT License . 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.
-
The repository provides implementations of various algorithms in one of the most fundamental general purpose languages - C++ .
@@ -110,12 +110,12 @@ Features Self-checks within programs ensure correct implementations with confidence.
Modular implementations and OpenSource licensing enable the functions to be utilized conveniently in other applications.
-
Online Documentation 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 Files menu to see the list of all the files documented with the code.
Documentation of Algorithms in C++ by The Algorithms Contributors is licensed under CC BY-SA 4.0
-
As a community developed and maintained repository, we welcome new un-plagiarized quality contributions. Please read our Contribution Guidelines .
diff --git a/inherit_graph_52.map b/inherit_graph_52.map
index 282d67b45..0aa6b0c01 100644
--- a/inherit_graph_52.map
+++ b/inherit_graph_52.map
@@ -1,3 +1,3 @@
-
diff --git a/inherit_graph_52.md5 b/inherit_graph_52.md5
index 4211adfbd..0b418f775 100644
--- a/inherit_graph_52.md5
+++ b/inherit_graph_52.md5
@@ -1 +1 @@
-2b8d2217680c3c1998c34e51fcbe2669
\ No newline at end of file
+ef4c4cf0170a3477b170da46253277f6
\ No newline at end of file
diff --git a/inherit_graph_52.svg b/inherit_graph_52.svg
index e5cd401f4..68937ed32 100644
--- a/inherit_graph_52.svg
+++ b/inherit_graph_52.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-
+operations_on_datastructures
-::trie_operations::Tnode
+::inorder_traversal_of_bst::Node
-
diff --git a/inherit_graph_53.md5 b/inherit_graph_53.md5
index 65e09727b..4211adfbd 100644
--- a/inherit_graph_53.md5
+++ b/inherit_graph_53.md5
@@ -1 +1 @@
-bc14811d9b50fabe9356f7908162deb7
\ No newline at end of file
+2b8d2217680c3c1998c34e51fcbe2669
\ No newline at end of file
diff --git a/inherit_graph_53.svg b/inherit_graph_53.svg
index 81c40da24..e5cd401f4 100644
--- a/inherit_graph_53.svg
+++ b/inherit_graph_53.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-others::iterative_tree
-_traversals::BinaryTree
+
+operations_on_datastructures
+::trie_operations::Tnode
-
diff --git a/inherit_graph_54.md5 b/inherit_graph_54.md5
index 4ccce49f2..65e09727b 100644
--- a/inherit_graph_54.md5
+++ b/inherit_graph_54.md5
@@ -1 +1 @@
-393c9d2178c8eee68e815b34cb049ca7
\ No newline at end of file
+bc14811d9b50fabe9356f7908162deb7
\ No newline at end of file
diff --git a/inherit_graph_54.svg b/inherit_graph_54.svg
index c99b4507d..81c40da24 100644
--- a/inherit_graph_54.svg
+++ b/inherit_graph_54.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-
+others::iterative_tree
-_traversals::Node
+_traversals::BinaryTree
-
diff --git a/inherit_graph_55.md5 b/inherit_graph_55.md5
index 74e3354ec..4ccce49f2 100644
--- a/inherit_graph_55.md5
+++ b/inherit_graph_55.md5
@@ -1 +1 @@
-c6f13c81f1e70f3519d7fbd61697121e
\ No newline at end of file
+393c9d2178c8eee68e815b34cb049ca7
\ No newline at end of file
diff --git a/inherit_graph_55.svg b/inherit_graph_55.svg
index 191821ab8..c99b4507d 100644
--- a/inherit_graph_55.svg
+++ b/inherit_graph_55.svg
@@ -4,18 +4,18 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-others::postfix_expression
-::Stack
+
+others::iterative_tree
+_traversals::Node
-
diff --git a/inherit_graph_56.md5 b/inherit_graph_56.md5
index 950a3429b..74e3354ec 100644
--- a/inherit_graph_56.md5
+++ b/inherit_graph_56.md5
@@ -1 +1 @@
-38884a151d472065dcd8a6fcae7b35c8
\ No newline at end of file
+c6f13c81f1e70f3519d7fbd61697121e
\ No newline at end of file
diff --git a/inherit_graph_56.svg b/inherit_graph_56.svg
index c17bbd290..191821ab8 100644
--- a/inherit_graph_56.svg
+++ b/inherit_graph_56.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
-
Node0
-
-Point
+
+others::postfix_expression
+::Stack
-
diff --git a/inherit_graph_57.md5 b/inherit_graph_57.md5
index 01c6e454e..950a3429b 100644
--- a/inherit_graph_57.md5
+++ b/inherit_graph_57.md5
@@ -1 +1 @@
-6cac1c113b0aa0693cc268a362aeb46e
\ No newline at end of file
+38884a151d472065dcd8a6fcae7b35c8
\ No newline at end of file
diff --git a/inherit_graph_57.svg b/inherit_graph_57.svg
index d3a5e1eb3..c17bbd290 100644
--- a/inherit_graph_57.svg
+++ b/inherit_graph_57.svg
@@ -4,18 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
-
Node0
-
-quadratic_probing::
-Entry
+
+Point
-
diff --git a/inherit_graph_58.md5 b/inherit_graph_58.md5
index 5ebe333de..01c6e454e 100644
--- a/inherit_graph_58.md5
+++ b/inherit_graph_58.md5
@@ -1 +1 @@
-bec59f87893a1ff0344686ba3ed67359
\ No newline at end of file
+6cac1c113b0aa0693cc268a362aeb46e
\ No newline at end of file
diff --git a/inherit_graph_58.svg b/inherit_graph_58.svg
index 04eb64e7f..d3a5e1eb3 100644
--- a/inherit_graph_58.svg
+++ b/inherit_graph_58.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
-
Node0
-
-query
+
+quadratic_probing::
+Entry
-
diff --git a/inherit_graph_59.md5 b/inherit_graph_59.md5
index 5a179cc7b..5ebe333de 100644
--- a/inherit_graph_59.md5
+++ b/inherit_graph_59.md5
@@ -1 +1 @@
-75b8c6171df3d450e7b6057dcc7a759b
\ No newline at end of file
+bec59f87893a1ff0344686ba3ed67359
\ No newline at end of file
diff --git a/inherit_graph_59.svg b/inherit_graph_59.svg
index 3ba1ddb5f..04eb64e7f 100644
--- a/inherit_graph_59.svg
+++ b/inherit_graph_59.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-Queue
+
+query
-
diff --git a/inherit_graph_60.md5 b/inherit_graph_60.md5
index cdce21f81..5a179cc7b 100644
--- a/inherit_graph_60.md5
+++ b/inherit_graph_60.md5
@@ -1 +1 @@
-dda763a0bdfe4bfcb05a0b97b5c11e0a
\ No newline at end of file
+75b8c6171df3d450e7b6057dcc7a759b
\ No newline at end of file
diff --git a/inherit_graph_60.svg b/inherit_graph_60.svg
index 6dba97223..3ba1ddb5f 100644
--- a/inherit_graph_60.svg
+++ b/inherit_graph_60.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-queue< Kind >
+
+Queue
-
diff --git a/inherit_graph_61.md5 b/inherit_graph_61.md5
index 6a30f2f0b..cdce21f81 100644
--- a/inherit_graph_61.md5
+++ b/inherit_graph_61.md5
@@ -1 +1 @@
-296b8c109e6a18a9dd057579b2083015
\ No newline at end of file
+dda763a0bdfe4bfcb05a0b97b5c11e0a
\ No newline at end of file
diff --git a/inherit_graph_61.svg b/inherit_graph_61.svg
index 172676b83..6dba97223 100644
--- a/inherit_graph_61.svg
+++ b/inherit_graph_61.svg
@@ -4,55 +4,19 @@
-
-
+
+
Graphical Class Hierarchy
-
Node0
-
-range_queries::heavy
-_light_decomposition
-::SG< X >
+
+queue< Kind >
-Node1
-
-range_queries::heavy
-_light_decomposition
-::HLD< X >
-
-
-
-
-Node0->Node1
-
-
-
-Node74
-
-range_queries::heavy
-_light_decomposition
-::Tree< X >
-
-
-
-
-Node74->Node1
-
diff --git a/inherit_graph_62.map b/inherit_graph_62.map
index 1e4928b91..0fcb8badf 100644
--- a/inherit_graph_62.map
+++ b/inherit_graph_62.map
@@ -1,3 +1,5 @@
-
diff --git a/inherit_graph_62.md5 b/inherit_graph_62.md5
index dbb271b1b..14861185b 100644
--- a/inherit_graph_62.md5
+++ b/inherit_graph_62.md5
@@ -1 +1 @@
-b727b49d33eaac846613f24543c7515b
\ No newline at end of file
+0479fa15eb939225c955667c33f4bfe8
\ No newline at end of file
diff --git a/inherit_graph_62.svg b/inherit_graph_62.svg
index ae92eedc5..212802c88 100644
--- a/inherit_graph_62.svg
+++ b/inherit_graph_62.svg
@@ -4,19 +4,55 @@
-
-
+
+
Graphical Class Hierarchy
-
Node0
-
-range_queries::perSegTree
+
+range_queries::heavy
+_light_decomposition
+::SG< X >
+Node1
+
+range_queries::heavy
+_light_decomposition
+::HLD< X >
+
+
+
+
+Node0->Node1
+
+
+
+Node75
+
+range_queries::heavy
+_light_decomposition
+::Tree< X >
+
+
+
+
+Node75->Node1
+
diff --git a/inherit_graph_63.map b/inherit_graph_63.map
index 6e8a16387..1e4928b91 100644
--- a/inherit_graph_63.map
+++ b/inherit_graph_63.map
@@ -1,3 +1,3 @@
-
diff --git a/inherit_graph_63.md5 b/inherit_graph_63.md5
index 8b64f4692..dbb271b1b 100644
--- a/inherit_graph_63.md5
+++ b/inherit_graph_63.md5
@@ -1 +1 @@
-bdb91a66072aac6e54cadd23f1d913b8
\ No newline at end of file
+b727b49d33eaac846613f24543c7515b
\ No newline at end of file
diff --git a/inherit_graph_63.svg b/inherit_graph_63.svg
index d05e57e4e..ae92eedc5 100644
--- a/inherit_graph_63.svg
+++ b/inherit_graph_63.svg
@@ -4,18 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
-
Node0
-
-range_queries::perSegTree
-::Node
+
+range_queries::perSegTree
-
diff --git a/inherit_graph_64.md5 b/inherit_graph_64.md5
index 8133608df..8b64f4692 100644
--- a/inherit_graph_64.md5
+++ b/inherit_graph_64.md5
@@ -1 +1 @@
-cef884937e61d3db890f68522f268f88
\ No newline at end of file
+bdb91a66072aac6e54cadd23f1d913b8
\ No newline at end of file
diff --git a/inherit_graph_64.svg b/inherit_graph_64.svg
index be28248be..d05e57e4e 100644
--- a/inherit_graph_64.svg
+++ b/inherit_graph_64.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
-
Node0
-
-RBtree
+
+range_queries::perSegTree
+::Node
-
diff --git a/inherit_graph_65.md5 b/inherit_graph_65.md5
index a90d887c6..8133608df 100644
--- a/inherit_graph_65.md5
+++ b/inherit_graph_65.md5
@@ -1 +1 @@
-20bec266e6a4e80cf8cf4d236a64bdb3
\ No newline at end of file
+cef884937e61d3db890f68522f268f88
\ No newline at end of file
diff --git a/inherit_graph_65.svg b/inherit_graph_65.svg
index 7af6e8cb0..be28248be 100644
--- a/inherit_graph_65.svg
+++ b/inherit_graph_65.svg
@@ -4,18 +4,17 @@
-
-
+
+
Graphical Class Hierarchy
-
Node0
-
-search::sublist_search
-::Node
+
+RBtree
-
diff --git a/inherit_graph_66.md5 b/inherit_graph_66.md5
index efd8fff05..a90d887c6 100644
--- a/inherit_graph_66.md5
+++ b/inherit_graph_66.md5
@@ -1 +1 @@
-15c0758977894124ce8483f7108e3e73
\ No newline at end of file
+20bec266e6a4e80cf8cf4d236a64bdb3
\ No newline at end of file
diff --git a/inherit_graph_66.svg b/inherit_graph_66.svg
index 838bdf08c..7af6e8cb0 100644
--- a/inherit_graph_66.svg
+++ b/inherit_graph_66.svg
@@ -4,17 +4,18 @@
-
-
+
+
Graphical Class Hierarchy
-
Node0
-
-SegmentIntersection
+
+search::sublist_search
+::Node
-
diff --git a/inherit_graph_67.md5 b/inherit_graph_67.md5
index 479953b06..efd8fff05 100644
--- a/inherit_graph_67.md5
+++ b/inherit_graph_67.md5
@@ -1 +1 @@
-d29718af26117f8d229cea6c31073750
\ No newline at end of file
+15c0758977894124ce8483f7108e3e73
\ No newline at end of file
diff --git a/inherit_graph_67.svg b/inherit_graph_67.svg
index c768ec1c5..838bdf08c 100644
--- a/inherit_graph_67.svg
+++ b/inherit_graph_67.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-Solution
+
+SegmentIntersection
-
diff --git a/inherit_graph_68.md5 b/inherit_graph_68.md5
index e2b989bc1..479953b06 100644
--- a/inherit_graph_68.md5
+++ b/inherit_graph_68.md5
@@ -1 +1 @@
-172cf06ef071a5ae65c47d2b08429ea1
\ No newline at end of file
+d29718af26117f8d229cea6c31073750
\ No newline at end of file
diff --git a/inherit_graph_68.svg b/inherit_graph_68.svg
index 0258cc90e..c768ec1c5 100644
--- a/inherit_graph_68.svg
+++ b/inherit_graph_68.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-stack< Type >
+
+Solution
-
diff --git a/inherit_graph_69.md5 b/inherit_graph_69.md5
index aefbe3f94..e2b989bc1 100644
--- a/inherit_graph_69.md5
+++ b/inherit_graph_69.md5
@@ -1 +1 @@
-a99fca445652dfb292d35f8fd85290cf
\ No newline at end of file
+172cf06ef071a5ae65c47d2b08429ea1
\ No newline at end of file
diff --git a/inherit_graph_69.svg b/inherit_graph_69.svg
index 7e690921c..0258cc90e 100644
--- a/inherit_graph_69.svg
+++ b/inherit_graph_69.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-stack_linkedList
+
+stack< Type >
-
diff --git a/inherit_graph_70.md5 b/inherit_graph_70.md5
index bc7de0c4a..aefbe3f94 100644
--- a/inherit_graph_70.md5
+++ b/inherit_graph_70.md5
@@ -1 +1 @@
-56037270393cd432505f71b72a285a33
\ No newline at end of file
+a99fca445652dfb292d35f8fd85290cf
\ No newline at end of file
diff --git a/inherit_graph_70.svg b/inherit_graph_70.svg
index 08a66fc41..7e690921c 100644
--- a/inherit_graph_70.svg
+++ b/inherit_graph_70.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-statistics::stats_computer1< T >
+
+stack_linkedList
-
diff --git a/inherit_graph_71.md5 b/inherit_graph_71.md5
index 7537416a0..bc7de0c4a 100644
--- a/inherit_graph_71.md5
+++ b/inherit_graph_71.md5
@@ -1 +1 @@
-44f61a6c355366e4e56ece076004f6f3
\ No newline at end of file
+56037270393cd432505f71b72a285a33
\ No newline at end of file
diff --git a/inherit_graph_71.svg b/inherit_graph_71.svg
index 4a6eb68a5..08a66fc41 100644
--- a/inherit_graph_71.svg
+++ b/inherit_graph_71.svg
@@ -12,9 +12,9 @@
Node0
-
+
statistics::stats_computer2< T >
+statistics::stats_computer1< T >
-
diff --git a/inherit_graph_72.md5 b/inherit_graph_72.md5
index da54af982..7537416a0 100644
--- a/inherit_graph_72.md5
+++ b/inherit_graph_72.md5
@@ -1 +1 @@
-62e235f7149651d1af2a7100f5c1917d
\ No newline at end of file
+44f61a6c355366e4e56ece076004f6f3
\ No newline at end of file
diff --git a/inherit_graph_72.svg b/inherit_graph_72.svg
index c1b4f2cd6..4a6eb68a5 100644
--- a/inherit_graph_72.svg
+++ b/inherit_graph_72.svg
@@ -4,111 +4,19 @@
-
-
+
+
Graphical Class Hierarchy
-
Node0
-
-std::true_type
+
+statistics::stats_computer2< T >
-Node1
-
-std::is_arithmetic
-< uint128_t >
-
-
-
-
-Node0->Node1
-
-
-
-Node2
-
-std::is_arithmetic
-< uint256_t >
-
-
-
-
-Node0->Node2
-
-
-
-Node3
-
-std::is_integral< uint128_t >
-
-
-
-
-Node0->Node3
-
-
-
-Node4
-
-std::is_integral< uint256_t >
-
-
-
-
-Node0->Node4
-
-
-
-Node5
-
-std::is_unsigned< uint128_t >
-
-
-
-
-Node0->Node5
-
-
-
-Node6
-
-std::is_unsigned< uint256_t >
-
-
-
-
-Node0->Node6
-
diff --git a/inherit_graph_73.map b/inherit_graph_73.map
index a41fe4a60..1ebba7be9 100644
--- a/inherit_graph_73.map
+++ b/inherit_graph_73.map
@@ -1,3 +1,9 @@
-
diff --git a/inherit_graph_73.md5 b/inherit_graph_73.md5
index d91fabc43..da54af982 100644
--- a/inherit_graph_73.md5
+++ b/inherit_graph_73.md5
@@ -1 +1 @@
-1454ed59679b4b83560a8d48031ddf65
\ No newline at end of file
+62e235f7149651d1af2a7100f5c1917d
\ No newline at end of file
diff --git a/inherit_graph_73.svg b/inherit_graph_73.svg
index 4cd80bfe2..c1b4f2cd6 100644
--- a/inherit_graph_73.svg
+++ b/inherit_graph_73.svg
@@ -4,19 +4,111 @@
-
-
+
+
Graphical Class Hierarchy
-
Node0
-
-TestCases
+
+std::true_type
+Node1
+
+std::is_arithmetic
+< uint128_t >
+
+
+
+
+Node0->Node1
+
+
+
+Node2
+
+std::is_arithmetic
+< uint256_t >
+
+
+
+
+Node0->Node2
+
+
+
+Node3
+
+std::is_integral< uint128_t >
+
+
+
+
+Node0->Node3
+
+
+
+Node4
+
+std::is_integral< uint256_t >
+
+
+
+
+Node0->Node4
+
+
+
+Node5
+
+std::is_unsigned< uint128_t >
+
+
+
+
+Node0->Node5
+
+
+
+Node6
+
+std::is_unsigned< uint256_t >
+
+
+
+
+Node0->Node6
+
diff --git a/inherit_graph_74.map b/inherit_graph_74.map
index c71175987..a41fe4a60 100644
--- a/inherit_graph_74.map
+++ b/inherit_graph_74.map
@@ -1,3 +1,3 @@
-
diff --git a/inherit_graph_74.md5 b/inherit_graph_74.md5
index 3a07c34e1..d91fabc43 100644
--- a/inherit_graph_74.md5
+++ b/inherit_graph_74.md5
@@ -1 +1 @@
-872e37e24c1cda4505901e5ff62edc74
\ No newline at end of file
+1454ed59679b4b83560a8d48031ddf65
\ No newline at end of file
diff --git a/inherit_graph_74.svg b/inherit_graph_74.svg
index 980522353..4cd80bfe2 100644
--- a/inherit_graph_74.svg
+++ b/inherit_graph_74.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-tower
+
+TestCases
-
diff --git a/inherit_graph_75.md5 b/inherit_graph_75.md5
index 20586b3d4..3a07c34e1 100644
--- a/inherit_graph_75.md5
+++ b/inherit_graph_75.md5
@@ -1 +1 @@
-5899a1f6e54aec90d87e0a432b7310e8
\ No newline at end of file
+872e37e24c1cda4505901e5ff62edc74
\ No newline at end of file
diff --git a/inherit_graph_75.svg b/inherit_graph_75.svg
index 828361069..980522353 100644
--- a/inherit_graph_75.svg
+++ b/inherit_graph_75.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-Trie
+
+tower
-
diff --git a/inherit_graph_76.md5 b/inherit_graph_76.md5
index 62c1866c2..20586b3d4 100644
--- a/inherit_graph_76.md5
+++ b/inherit_graph_76.md5
@@ -1 +1 @@
-6e8fd46aa541ace4c09c4c3fe8621344
\ No newline at end of file
+5899a1f6e54aec90d87e0a432b7310e8
\ No newline at end of file
diff --git a/inherit_graph_76.svg b/inherit_graph_76.svg
index 655e47edc..828361069 100644
--- a/inherit_graph_76.svg
+++ b/inherit_graph_76.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-Trie::TrieNode
+
+Trie
-
diff --git a/inherit_graph_77.md5 b/inherit_graph_77.md5
index cecc8840f..62c1866c2 100644
--- a/inherit_graph_77.md5
+++ b/inherit_graph_77.md5
@@ -1 +1 @@
-a3d15a2bc4ef8bbaeae210fe1f472cf0
\ No newline at end of file
+6e8fd46aa541ace4c09c4c3fe8621344
\ No newline at end of file
diff --git a/inherit_graph_77.svg b/inherit_graph_77.svg
index de9397251..655e47edc 100644
--- a/inherit_graph_77.svg
+++ b/inherit_graph_77.svg
@@ -4,17 +4,17 @@
-
+
Graphical Class Hierarchy
-
Node0
-
-uint128_t
+
+Trie::TrieNode
-
diff --git a/inherit_graph_78.md5 b/inherit_graph_78.md5
index 3fb1b78c7..cecc8840f 100644
--- a/inherit_graph_78.md5
+++ b/inherit_graph_78.md5
@@ -1 +1 @@
-5323d65878d4e52ab324687ba213b79a
\ No newline at end of file
+a3d15a2bc4ef8bbaeae210fe1f472cf0
\ No newline at end of file
diff --git a/inherit_graph_78.svg b/inherit_graph_78.svg
index 086a18259..de9397251 100644
--- a/inherit_graph_78.svg
+++ b/inherit_graph_78.svg
@@ -12,9 +12,9 @@
Node0
-
+
uint256_t
+uint128_t
+
diff --git a/inherit_graph_79.md5 b/inherit_graph_79.md5
new file mode 100644
index 000000000..3fb1b78c7
--- /dev/null
+++ b/inherit_graph_79.md5
@@ -0,0 +1 @@
+5323d65878d4e52ab324687ba213b79a
\ No newline at end of file
diff --git a/inherit_graph_79.svg b/inherit_graph_79.svg
new file mode 100644
index 000000000..086a18259
--- /dev/null
+++ b/inherit_graph_79.svg
@@ -0,0 +1,22 @@
+
+
+
+
+
+
+Graphical Class Hierarchy
+
+Node0
+
+uint256_t
+
+
+
+
diff --git a/inherits.html b/inherits.html
index d13cd6f58..475f1b9a8 100644
--- a/inherits.html
+++ b/inherits.html
@@ -201,60 +201,62 @@ $(document).ready(function(){initNavTree('hierarchy.html',''); initResizable();
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ isPossible()
: backtracking
-issafe()
-: backtracking
-
isSafe()
: backtracking
+issafe()
+: backtracking
+
diff --git a/namespacemembers_func.html b/namespacemembers_func.html
index 0c64c200b..d679ce3b9 100644
--- a/namespacemembers_func.html
+++ b/namespacemembers_func.html
@@ -223,12 +223,12 @@ $(document).ready(function(){initNavTree('namespacemembers_func.html',''); initR
isPossible()
: backtracking
-issafe()
-: backtracking
-
isSafe()
: backtracking
+issafe()
+: backtracking
+
diff --git a/namespaces.html b/namespaces.html
index 4f303c9d2..68dcb6e61 100644
--- a/namespaces.html
+++ b/namespaces.html
@@ -162,121 +162,124 @@ $(document).ready(function(){initNavTree('namespaces.html',''); initResizable();
N heavy_light_decomposition Heavy light decomposition algorithm N horspool Functions for Horspool's algorithm N house_robber Functions for the House Robber algorithm N inversion Functions for counting inversions using Merge Sort algorithm N is_graph_bipartite Functions for checking whether a graph is bipartite or not N iterative_tree_traversals Functions for the Traversal of the Tree algorithm N jarvis Functions for Jarvis’s algorithm N kadane Functions for Kadane algorithm N Knapsack Implementation of 0-1 Knapsack problem N layers This namespace contains layers used in MLP N linear_algebra For io operations ► N linear_probing An implementation of hash table using linear probing algorithm C Entry N linear_recurrence_matrix Functions for Linear Recurrence Matrix implementation N linked_list Functions for singly linked list algorithm N list_array Functions for Dynamic Array algorithm ► N machine_learning A* search algorithm ► N aystar_search C EightPuzzle A class defining EightPuzzle/15-Puzzle game ► C AyStarSearch A class defining A* search algorithm . for some initial state and final state C comparison_operator Custom comparator for open_list C Info Struct that handles all the information related to the current state ► N neural_network N activations ► N layers C DenseLayer N util_functions C NeuralNetwork C adaline N magic_sequence Functions for the Magic sequence implementation ► N math For IO operations N binomial N fibonacci_sum N linear_recurrence_matrix N modular_division ► N ncr_modulo_p C NCRModuloP Class which contains all methods required for calculating nCr mod p N vector_cross N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N mincoins_topdown Functions for minimum coin exchange problem N Minimum Implementation of Minimum Edit Distance algorithm N modular_division Functions for Modular Division implementation N morse Functions for Morse Code N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions N n_queens_optimized Functions for Eight Queens puzzle optimized N ncr_modulo_p Functions for nCr modulo p implementation N neural_network Neural Network or Multilayer Perceptron N numerical_methods For io operations ► N operations_on_datastructures For std::priority_queue ► N trie_operations C Tnode Class defining the structure of trie node and containing the methods to perform operations on them ► N others For assert ► N iterative_tree_traversals C Node Defines the structure of a node of the tree C BinaryTree Defines the functions associated with the binary tree ► N postfix_expression C Stack Creates an array to be used as stack for storing values N palindrome_partitioning Functions for Palindrome Partitioning algorithm N pancake_sort Functions for Pancake sort algorithm N postfix_expression Functions for Postfix Expression algorithm N qr_algorithm Functions to compute QR decomposition of any rectangular matrix ► N quadratic_probing An implementation of hash table using quadratic probing algorithm C Entry N queue_using_array Functions for Queue using Array implementation N radix_sort Functions for Radix sort algorithm N random_pivot_quick_sort Functions for the Random Pivot Quick Sort implementation ► N range_queries Algorithms and Data Structures that support range queries and updates ► N heavy_light_decomposition C Tree A Basic Tree , which supports binary lifting C SG Segment Tree , to store heavy chains C HLD The Heavy-Light Decomposition class N sparse_table ► C perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min C Node N rat_maze Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
+ N inorder_successor_of_bst Functions for the Inorder successor of a binary search tree implementation N inversion Functions for counting inversions using Merge Sort algorithm N is_graph_bipartite Functions for checking whether a graph is bipartite or not N iterative_tree_traversals Functions for the Traversal of the Tree algorithm N jarvis Functions for Jarvis’s algorithm N kadane Functions for Kadane algorithm N Knapsack Implementation of 0-1 Knapsack problem N layers This namespace contains layers used in MLP N linear_algebra For io operations ► N linear_probing An implementation of hash table using linear probing algorithm C Entry N linear_recurrence_matrix Functions for Linear Recurrence Matrix implementation N linked_list Functions for singly linked list algorithm N list_array Functions for Dynamic Array algorithm ► N machine_learning A* search algorithm ► N aystar_search C EightPuzzle A class defining EightPuzzle/15-Puzzle game ► C AyStarSearch A class defining A* search algorithm . for some initial state and final state C comparison_operator Custom comparator for open_list C Info Struct that handles all the information related to the current state ► N neural_network N activations ► N layers C DenseLayer N util_functions C NeuralNetwork C adaline N magic_sequence Functions for the Magic sequence implementation ► N math For IO operations N binomial N fibonacci_sum N linear_recurrence_matrix N modular_division ► N ncr_modulo_p C NCRModuloP Class which contains all methods required for calculating nCr mod p N vector_cross N median_search Functions for Median search algorithm N merge_insertion Combined Intersion-Merge sorting algorithm N mincoins_topdown Functions for minimum coin exchange problem N Minimum Implementation of Minimum Edit Distance algorithm N modular_division Functions for Modular Division implementation N morse Functions for Morse Code N n_queens Functions for Eight Queens puzzle N n_queens_all_solutions Functions for Eight Queens puzzle with all solutions N n_queens_optimized Functions for Eight Queens puzzle optimized N ncr_modulo_p Functions for nCr modulo p implementation N neural_network Neural Network or Multilayer Perceptron N numerical_methods For io operations ► N operations_on_datastructures For std::vector ► N inorder_traversal_of_bst C Node A Node structure representing a single node in BST ► N trie_operations C Tnode Class defining the structure of trie node and containing the methods to perform operations on them ► N others For assert ► N iterative_tree_traversals C Node Defines the structure of a node of the tree C BinaryTree Defines the functions associated with the binary tree ► N postfix_expression C Stack Creates an array to be used as stack for storing values N palindrome_partitioning Functions for Palindrome Partitioning algorithm N pancake_sort Functions for Pancake sort algorithm N postfix_expression Functions for Postfix Expression algorithm N qr_algorithm Functions to compute QR decomposition of any rectangular matrix ► N quadratic_probing An implementation of hash table using quadratic probing algorithm C Entry N queue_using_array Functions for Queue using Array implementation N radix_sort Functions for Radix sort algorithm N random_pivot_quick_sort Functions for the Random Pivot Quick Sort implementation ► N range_queries Algorithms and Data Structures that support range queries and updates ► N heavy_light_decomposition C Tree A Basic Tree , which supports binary lifting C SG Segment Tree , to store heavy chains C HLD The Heavy-Light Decomposition class N sparse_table ► C perSegTree Range query here is range sum, but the code can be modified to make different queries like range max or min C Node N rat_maze Functions for <a href="https://www.codesdope.com/blog/article/backtracking-to-
solve-a-rat-in-a-maze-c-java-pytho/" N runge_kutta Functions for Runge Kutta fourth order method N saddleback Function for implementing Saddleback Algorithm ► N search Search algorithms N median_search N saddleback ► N sublist_search C Node A Node structure representing a single link Node in a linked list N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N sparse_table Functions for Implementation of Sparse Table N spirograph ► N statistics Statistical algorithms C stats_computer1 C stats_computer2 ► N std STL namespace N chrono N experimental N rel_ops N this_thread C is_integral< uint128_t > C is_arithmetic< uint128_t > C is_unsigned< uint128_t > C is_integral< uint256_t > C is_arithmetic< uint256_t > C is_unsigned< uint256_t > N strand Functions for Strand Sort algorithm N string_search String search algorithms N strings Algorithms with strings N sublist_search Functions for the Sublist Search implementation N Subsets Functions for the Subset Sum problem N tree_234 Functions for 2–3–4 tree N trie_operations Functions for Trie datastructure implementation N trie_using_hashmap Functions for Trie data structure using hashmap implementation N util_functions Various utility functions used in Neural network N vector_cross Functions for Vector Cross Product algorithms N vigenere Functions for vigenère cipher algorithm N wave_sort Functions for the Wave sort implementation N wiggle_sort Functions for Wiggle Sort algorithm N word_break Functions for Word Break problem N XOR Functions for XOR cipher algorithm N runge_kutta Functions for Runge Kutta fourth order method N saddleback Function for implementing Saddleback Algorithm ► N search Search algorithms N median_search N saddleback ► N sublist_search C Node A Node structure representing a single link Node in a linked list N shortest_common_supersequence Shortest Common Super Sequence algorithm N sorting Sorting algorithms N sparse_table Functions for Implementation of Sparse Table N spirograph ► N statistics Statistical algorithms C stats_computer1 C stats_computer2 ► N std STL namespace N chrono N experimental N rel_ops N this_thread C is_integral< uint128_t > C is_arithmetic< uint128_t > C is_unsigned< uint128_t > C is_integral< uint256_t > C is_arithmetic< uint256_t > C is_unsigned< uint256_t > N strand Functions for Strand Sort algorithm N string_search String search algorithms N strings Algorithms with strings N sublist_search Functions for the Sublist Search implementation N Subsets Functions for the Subset Sum problem N tree_234 Functions for 2–3–4 tree N trie_operations Functions for Trie datastructure implementation N trie_using_hashmap Functions for Trie data structure using hashmap implementation N util_functions Various utility functions used in Neural network N vector_cross Functions for Vector Cross Product algorithms N vigenere Functions for vigenère cipher algorithm N wave_sort Functions for the Wave sort implementation N wiggle_sort Functions for Wiggle Sort algorithm N word_break Functions for Word Break problem N XOR Functions for XOR cipher algorithm 
1.9.1 
