📄 tree.html
字号:
<!DOCTYPE HTML PUBLIC "-//IETF//DTD W3 HTML 2.0//EN">
<HTML lang="en-US">
<HEAD>
<TITLE>tree</TITLE>
<META name="description"
content="Definition of tree,
possibly with links to more information and implementations.">
<META name="keywords" content="tree">
</HEAD>
<BODY BGCOLOR="#FFFFFF">
<H1>tree</H1>
<P>
(data structure)
<P>
<strong>Definition:</strong>
A data structure accessed beginning at the <a href="root.html" tppabs="http://hissa.nist.gov/dads/HTML/root.html"><em>root</em></a> <a href="node.html" tppabs="http://hissa.nist.gov/dads/HTML/node.html"><em>node</em></a>. Each node is either a <a href="leaf.html" tppabs="http://hissa.nist.gov/dads/HTML/leaf.html"><em>leaf</em></a> or it is a <a href="parent.html" tppabs="http://hissa.nist.gov/dads/HTML/parent.html"><em>parent</em></a> which refers to <a href="child.html" tppabs="http://hissa.nist.gov/dads/HTML/child.html"><em>child</em></a> nodes. More formally, a <a href="connectdgraf.html" tppabs="http://hissa.nist.gov/dads/HTML/connectdgraf.html"><em>connected</em></a> <a href="forest.html" tppabs="http://hissa.nist.gov/dads/HTML/forest.html"><em>forest</em></a>. Contrary to a physical tree, the root is usually depicted at the top of the structure, and the leaves are depicted at the bottom. <img src="tree.gif" tppabs="http://hissa.nist.gov/dads/Images/tree.gif" height="225" width="201">
<P><strong>See also</strong>
<a href="heap.html" tppabs="http://hissa.nist.gov/dads/HTML/heap.html"><em>heap</em></a>, <a href="btree.html" tppabs="http://hissa.nist.gov/dads/HTML/btree.html"><em>B-tree</em></a>, <a href="binarytree.html" tppabs="http://hissa.nist.gov/dads/HTML/binarytree.html"><em>binary tree</em></a>, <a href="balancedtree.html" tppabs="http://hissa.nist.gov/dads/HTML/balancedtree.html"><em>balanced tree</em></a>, <a href="multiwaytree.html" tppabs="http://hissa.nist.gov/dads/HTML/multiwaytree.html"><em>multiway tree</em></a>, <a href="descendant.html" tppabs="http://hissa.nist.gov/dads/HTML/descendant.html"><em>descendant</em></a>, <a href="ancestor.html" tppabs="http://hissa.nist.gov/dads/HTML/ancestor.html"><em>ancestor</em></a>, <a href="orderedtree.html" tppabs="http://hissa.nist.gov/dads/HTML/orderedtree.html"><em>ordered tree</em></a>.
<P><em>Note:
Unless otherwise specified, a tree is <a href="orderedtree.html" tppabs="http://hissa.nist.gov/dads/HTML/orderedtree.html"><em>ordered</em></a>. <P> From Algorithms and Theory of Computation Handbook, Copyright © 1999 by CRC Press LLC.</em>
<P>Author: <a href="terms.html#authorPEB" tppabs="http://hissa.nist.gov/dads/terms.html#authorPEB">PEB</a>,<a href="terms.html#authorCRC-A" tppabs="http://hissa.nist.gov/dads/terms.html#authorCRC-A">CRC-A</a>
<hr>
Go to the
<A HREF="terms.html" tppabs="http://hissa.nist.gov/dads/terms.html">Algorithms, Data Structures, and Problems</A>
home page.
<hr>
If you have suggestions, corrections, or comments, please get in touch
with
<a href="javascript:if(confirm('http://hissa.nist.gov/~black/black.html \n\nThis file was not retrieved by Teleport Pro, because it is addressed on a domain or path outside the boundaries set for its Starting Address. \n\nDo you want to open it from the server?'))window.location='http://hissa.nist.gov/~black/black.html'" tppabs="http://hissa.nist.gov/~black/black.html">Paul E. Black</a>
(<a href="mailto:paul.black@nist.gov">paul.black@nist.gov</a>).
<p>
Entry modified Mon Jun 21 10:35:38 1999.<BR>
HTML page formatted Wed Dec 22 09:36:46 1999.
<P>
This page's URL is
<A href="tree.html" tppabs="http://hissa.nist.gov/dads/HTML/tree.html">http://hissa.nist.gov/dads/HTML/tree.html</A>
</BODY>
</HTML>
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -