page361.html

来自「Data Structures And Algorithms With Obje」· HTML 代码 · 共 35 行

HTML
35 行
字号 
<HTML><HEAD><TITLE>Leftist Heaps</TITLE></HEAD><BODY bgcolor="#FFFFFF"> <a href="../index.html" target="_top"><img src="../icons/usins.gif" alt="Logo" align=right></a><b>Data Structures and Algorithms with Object-Oriented Design Patterns in Python</b><br><A NAME="tex2html5345" HREF="page362.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="../icons/next_motif.gif"></A> <A NAME="tex2html5343" HREF="page351.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="../icons/up_motif.gif"></A> <A NAME="tex2html5337" HREF="page360.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="../icons/previous_motif.gif"></A>  <A NAME="tex2html5347" HREF="page611.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="../icons/index_motif.gif"></A> <BR><HR><H1><A NAME="SECTION0011300000000000000000">Leftist Heaps</A></H1><A NAME="secpqueuesleftist">&#160;</A><P>A leftist heap is a heap-ordered binary treewhich has a very special shape called a <em>leftist tree</em>.One of the nice properties of leftist heaps is that it is possible to merge two leftist heaps efficiently.As a result, leftist heaps are suited for the implementationof mergeable priority queues.<P><BR> <HR><UL> <LI> <A NAME="tex2html5348" HREF="page362.html#SECTION0011310000000000000000">Leftist Trees</A><LI> <A NAME="tex2html5349" HREF="page363.html#SECTION0011320000000000000000">Implementation</A><LI> <A NAME="tex2html5350" HREF="page365.html#SECTION0011330000000000000000">Merging Leftist Heaps</A><LI> <A NAME="tex2html5351" HREF="page366.html#SECTION0011340000000000000000">Putting Items into a Leftist Heap</A><LI> <A NAME="tex2html5352" HREF="page367.html#SECTION0011350000000000000000">Removing Items from a Leftist Heap</A></UL><HR><A NAME="tex2html5345" HREF="page362.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="../icons/next_motif.gif"></A> <A NAME="tex2html5343" HREF="page351.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="../icons/up_motif.gif"></A> <A NAME="tex2html5337" HREF="page360.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="../icons/previous_motif.gif"></A>  <A NAME="tex2html5347" HREF="page611.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="../icons/index_motif.gif"></A> <P><ADDRESS><img src="../icons/bruno.gif" alt="Bruno" align=right><a href="../copyright.html">Copyright &#169; 2003</a> by <a href="../signature.html">Bruno R. Preiss, P.Eng.</a>  All rights reserved.</ADDRESS></BODY></HTML>

page361.html - 源码说明

本页面展示了「Data Structures And Algorithms With Object-Oriented Design Patterns In Python (2003) source code and」中的 page361.html 源码文件，采用 HTML 编程语言编写，共 35 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

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

⌨️ 快捷键说明

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