mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-05-12 11:37:18 +08:00
66 lines
3.3 KiB
XML
66 lines
3.3 KiB
XML
<?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 7.0.6 (20230106.0513)
|
|
-->
|
|
<!-- Title: binary_search_tree::remove Pages: 1 -->
|
|
<svg width="242pt" height="94pt"
|
|
viewBox="0.00 0.00 242.00 93.50" 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 89.5)">
|
|
<title>binary_search_tree::remove</title>
|
|
<!-- Node1 -->
|
|
<g id="node1" class="node">
|
|
<title>Node1</title>
|
|
<g id="a_node1"><a xlink:title="Recursive function to remove a value from the BST.">
|
|
<polygon fill="#999999" stroke="#666666" points="99,-45.5 0,-45.5 0,-15.5 99,-15.5 99,-45.5"/>
|
|
<text text-anchor="start" x="8" y="-33.5" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
|
|
<text text-anchor="middle" x="49.5" y="-22.5" font-family="Helvetica,sans-Serif" font-size="10.00">::remove</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node1 -->
|
|
<g id="edge4" class="edge">
|
|
<title>Node1->Node1</title>
|
|
<path fill="none" stroke="#63b8ff" d="M25.77,-45.78C20.5,-54.91 28.41,-63.5 49.5,-63.5 61.04,-63.5 68.63,-60.93 72.28,-57.11"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="75.75,-57.54 73.1,-47.28 68.78,-56.96 75.75,-57.54"/>
|
|
</g>
|
|
<!-- Node2 -->
|
|
<g id="node2" class="node">
|
|
<title>Node2</title>
|
|
<g id="a_node2"><a xlink:href="../../d9/dde/classbinary__search__tree.html#a75f897af6aa732a9901454401c869bcb" target="_top" xlink:title="Recursive function to find the maximum value in the BST.">
|
|
<polygon fill="white" stroke="#666666" points="234,-67.5 135,-67.5 135,-37.5 234,-37.5 234,-67.5"/>
|
|
<text text-anchor="start" x="143" y="-55.5" font-family="Helvetica,sans-Serif" font-size="10.00">binary_search_tree</text>
|
|
<text text-anchor="middle" x="184.5" y="-44.5" font-family="Helvetica,sans-Serif" font-size="10.00">::find_max</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node2 -->
|
|
<g id="edge1" class="edge">
|
|
<title>Node1->Node2</title>
|
|
<path fill="none" stroke="#63b8ff" d="M99.27,-38.57C107.13,-39.87 115.35,-41.23 123.44,-42.56"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="122.81,-46.01 133.24,-44.19 123.95,-39.1 122.81,-46.01"/>
|
|
</g>
|
|
<!-- Node3 -->
|
|
<g id="node3" class="node">
|
|
<title>Node3</title>
|
|
<g id="a_node3"><a target="_blank" xlink:href="http://en.cppreference.com/w/cpp/utility/move.html#" xlink:title=" ">
|
|
<polygon fill="white" stroke="#666666" points="214.5,-19 154.5,-19 154.5,0 214.5,0 214.5,-19"/>
|
|
<text text-anchor="middle" x="184.5" y="-7" font-family="Helvetica,sans-Serif" font-size="10.00">std::move</text>
|
|
</a>
|
|
</g>
|
|
</g>
|
|
<!-- Node1->Node3 -->
|
|
<g id="edge3" class="edge">
|
|
<title>Node1->Node3</title>
|
|
<path fill="none" stroke="#63b8ff" d="M99.27,-22.8C113.63,-20.53 129.19,-18.08 142.98,-15.9"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="143.25,-19.4 152.58,-14.38 142.16,-12.48 143.25,-19.4"/>
|
|
</g>
|
|
<!-- Node2->Node2 -->
|
|
<g id="edge2" class="edge">
|
|
<title>Node2->Node2</title>
|
|
<path fill="none" stroke="#63b8ff" d="M160.77,-67.78C155.5,-76.91 163.41,-85.5 184.5,-85.5 196.04,-85.5 203.63,-82.93 207.28,-79.11"/>
|
|
<polygon fill="#63b8ff" stroke="#63b8ff" points="210.75,-79.54 208.1,-69.28 203.78,-78.96 210.75,-79.54"/>
|
|
</g>
|
|
</g>
|
|
</svg>
|