https://wiki.riguz.com/index.php?action=history&feed=atom&title=Ternary_tree 2026-06-02T18:48:14Z 本wiki上该页面的版本历史 MediaWiki 1.42.3 https://wiki.riguz.com/index.php?title=Ternary_tree&diff=4018&oldid=prev 2024-01-18T09:10:25Z

<p></p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="zh-Hans-CN"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">←上一版本</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">2024年1月18日 (四) 09:10的版本</td> </tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1">第1行：</td> <td colspan="2" class="diff-lineno">第1行：</td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>In computer science, a ternary tree is a tree data structure in which each node has at most three child nodes, usually distinguished as &quot;left&quot;, “mid” and &quot;right&quot;. Nodes with children are parent nodes, and child nodes may contain references to their parents. Outside the tree, there is often a reference to the &quot;root&quot; node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left, mid or right child.</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>In computer science, a ternary tree is a tree data structure in which each node has at most three child nodes, usually distinguished as &quot;left&quot;, “mid” and &quot;right&quot;. Nodes with children are parent nodes, and child nodes may contain references to their parents. Outside the tree, there is often a reference to the &quot;root&quot; node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left, mid or right child.</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td></tr> <tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>Ternary <del style="font-weight: bold; text-decoration: none;">trees </del>are used to implement Ternary search trees and Ternary heaps.</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>Ternary <ins style="font-weight: bold; text-decoration: none;">trees（三元搜索树） </ins>are used to implement Ternary search trees and Ternary heaps.</div></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><br></td></tr> <tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Algorithm]]</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>[[Category:Algorithm]]</div></td></tr> <!-- diff cache key wiki_db:diff:1.41:old-4017:rev-4018:php=table --> </table>

Riguz https://wiki.riguz.com/index.php?title=Ternary_tree&diff=4017&oldid=prev 2024-01-18T09:09:48Z

<p>Riguz移动页面<a href="/index.php?title=%E6%A0%91:Ternary_Tree&amp;action=edit&amp;redlink=1" class="new" title="树:Ternary Tree（页面不存在）">树:Ternary Tree</a>至<a href="/Ternary_tree" title="Ternary tree">Ternary tree</a>，不留重定向</p> <table style="background-color: #fff; color: #202122;" data-mw="interface"> <col class="diff-marker" /> <col class="diff-content" /> <col class="diff-marker" /> <col class="diff-content" /> <tr class="diff-title" lang="zh-Hans-CN"> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">←上一版本</td> <td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">2024年1月18日 (四) 09:09的版本</td> </tr><tr><td colspan="4" class="diff-notice" lang="zh-Hans-CN"><div class="mw-diff-empty">（没有差异）</div> </td></tr> <!-- diff cache key wiki_db:diff:1.41:old-1809:rev-4017 --> </table>

Riguz https://wiki.riguz.com/index.php?title=Ternary_tree&diff=1809&oldid=prev 2016-11-08T15:03:12Z

<p>以“In computer science, a ternary tree is a tree data structure in which each node has at most three child nodes, usually distinguished as &quot;left&quot;, “mid” and &quot;right&quot;...”为内容创建页面</p> <p><b>新页面</b></p><div>In computer science, a ternary tree is a tree data structure in which each node has at most three child nodes, usually distinguished as &quot;left&quot;, “mid” and &quot;right&quot;. Nodes with children are parent nodes, and child nodes may contain references to their parents. Outside the tree, there is often a reference to the &quot;root&quot; node (the ancestor of all nodes), if it exists. Any node in the data structure can be reached by starting at root node and repeatedly following references to either the left, mid or right child.<br /> <br /> Ternary trees are used to implement Ternary search trees and Ternary heaps.<br /> <br /> [[Category:Algorithm]]</div>

imported>Soleverlee