weakheap.html

来自「数据结构词典（英文）」· HTML 代码 · 共 48 行

HTML
48 行
字号 
<!DOCTYPE HTML PUBLIC "-//IETF//DTD W3 HTML 2.0//EN">
<HTML lang="en-US">
<HEAD>
<TITLE>weak-heap</TITLE>
<META name="description"
  content="Definition of weak-heap,
	possibly with links to more information and implementations.">
<META name="keywords" content="weak-heap">
</HEAD>
<BODY BGCOLOR="#FFFFFF">

<H1>weak-heap</H1>
<P>
(data structure)

<P>
<strong>Definition:</strong>
A relaxed <a href="heap.html" tppabs="http://hissa.nist.gov/dads/HTML/heap.html"><em>heap</em></a> satisfying the following three conditions: (1) every <a href="key.html" tppabs="http://hissa.nist.gov/dads/HTML/key.html"><em>key</em></a> in the <a href="rightsubtree.html" tppabs="http://hissa.nist.gov/dads/HTML/rightsubtree.html"><em>right subtree</em></a> of a <a href="node.html" tppabs="http://hissa.nist.gov/dads/HTML/node.html"><em>node</em></a> is greater than the key stored in the node itself,  (2) the <a href="root.html" tppabs="http://hissa.nist.gov/dads/HTML/root.html"><em>root</em></a> has no left <a href="child.html" tppabs="http://hissa.nist.gov/dads/HTML/child.html"><em>child</em></a>, and (3) <a href="leaf.html" tppabs="http://hissa.nist.gov/dads/HTML/leaf.html"><em>leaves</em></a> are only found on the last two levels of the tree.
<P><strong>See also</strong>
<a href="weakheapsort.html" tppabs="http://hissa.nist.gov/dads/HTML/weakheapsort.html"><em>weak-heap sort</em></a>.
<P><em>Note:
A weak-heap is realized with an array <em>a</em> of items and an  array <em>r</em> of reverse bits.  The left child of an index <em>i</em> is addressed by <em>2i+1-r<sub>i</sub></em>, and the right child is addressed by <em>2i+r<sub>i</sub></em>. <P> This is a min weak-heap.  A max weak-heap has subtree keys which are less than the node's key.</em>
<P>Author: <a href="terms.html#authorSE" tppabs="http://hissa.nist.gov/dads/terms.html#authorSE">SE</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>
&nbsp;(<a href="mailto:paul.black@nist.gov">paul.black@nist.gov</a>).

<p>
Entry modified Tue May 11 16:39:45 1999.<BR>
HTML page formatted Wed Dec 22 09:36:52 1999.

<P>
This page's URL is
<A href="weakheap.html" tppabs="http://hissa.nist.gov/dads/HTML/weakheap.html">http://hissa.nist.gov/dads/HTML/weakheap.html</A>

</BODY>
</HTML>

weakheap.html - 源码说明

本页面展示了「数据结构词典（英文）」中的 weakheap.html 源码文件，采用 HTML 编程语言编写，共 48 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与数据结构相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?