backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-07-08 13:06:36 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for 652c2d2650

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

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

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

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

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

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

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

After

Width:  |  Height:  |  Size: 3.1 KiB

2
d7/def/trie__multiple__search_8cpp.html
View File

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