📄 6_2_7 哈希avl树的编码实现 - 《多任务下的数据结构与算法》 - 免费试读 - book_csdn_net.htm
字号:
<LI><A href="http://club.book.csdn.net/people/myclub.aspx">我的书友会</A> </LI>
<LI><A href="http://club.book.csdn.net/people/putblog.aspx">图书秀</A> </LI>
<LI><A href="http://club.book.csdn.net/people/alllist.aspx">书架</A> </LI>
<LI><A href="http://blog.csdn.net/group/bookread/" target=_blank>圈子</A> </LI>
<LI><A href="http://down.csdn.net/app/list.php?tid=502" target=_blank>资源下载</A>
</LI>
<LI><A href="http://bank.csdn.net/" target=_blank><FONT
style="FONT-WEIGHT: bold">银行</FONT></A> </LI></UL></DIV>
<SCRIPT type=text/javascript>
function IsBlank(obj) //查看对象的值是否为空
{
if(obj.replace(/^\s+|\s+$/,"")=="")
{
return true;
}
else
{
return false;
}
}
function SearchBook_Top()
{
if( !IsBlank(document.getElementById("txtTopKey").value))
{
var loc;
var szType;
if(document.getElementById("listSearchType").value==null)
{
szType= document.getElementById("listSearchType").options(document.getElementById("listSearchType").selectedIndex).value;
}
else
{
szType= document.getElementById("listSearchType").value;
}
if(szType==1)
loc="http://book.csdn.net/book/morelz.aspx?key="+escape(document.getElementById("txtTopKey").value);
else
loc="http://club.book.csdn.net/book/s.aspx?key="+escape(document.getElementById("txtTopKey").value);
self.location=loc;
}
}
</SCRIPT>
<DIV id=booknavbottom2>
<DIV class=hotleft><A href="http://book.csdn.net/subject/allbook.htm"
target=_blank>全部图书</A> <FONT color=red>推荐</FONT>:<A
href="http://club.book.csdn.net/book/s.aspx?key=asp.net">ASP.NET</A> <A
href="http://club.book.csdn.net/book/s.aspx?key=ajax">Ajax</A> <A
href="http://club.book.csdn.net/book/s.aspx?key=spring">Spring</A> <A
href="http://club.book.csdn.net/book/s.aspx?key=Hibernate">Hibernate</A> <A
href="http://club.book.csdn.net/book/s.aspx?key=Java">Java</A></DIV>
<DIV class=hotright><SELECT id=listSearchType name=aa> <OPTION value=2
selected>书友会</OPTION> <OPTION value=1>连载</OPTION></SELECT><INPUT
onkeypress=if(event.keyCode==13){SearchBook_Top();} id=txtTopKey maxLength=25><INPUT onclick=SearchBook_Top(); type=button value=搜索 name=提交></DIV></DIV></DIV>
<DIV class=area>
<SCRIPT
src="6_2_7 哈希AVL树的编码实现 - 《多任务下的数据结构与算法》 - 免费试读 - book_csdn_net.files/BookDetailAd.js"
type=text/javascript></SCRIPT>
<DIV class=col1>
<DIV class=lineBlue></DIV><!-- title -->
<DIV class=arcTitle>
<H1><A href="http://book.csdn.net/bookfiles/65">多任务下的数据结构与算法 </A></H1>
<DIV style="FONT-SIZE: 15px; TEXT-ALIGN: center"><A
href="http://book.csdn.net/bookfiles/65/100652564.shtml">6.2.7 哈希AVL树的编码实现
</A></DIV>
<DIV style="FONT-SIZE: 15px; TEXT-ALIGN: center"><A class=url
href="http://book.csdn.net/">http://book.csdn.net/</A> 2006-8-14 14:19:00 </DIV>
<DIV class=clear></DIV>
<DIV
style="BORDER-RIGHT: #0b5f98 1px solid; BORDER-TOP: #0b5f98 1px solid; MARGIN: 0px auto; BORDER-LEFT: #0b5f98 1px solid; WIDTH: 700px; BORDER-BOTTOM: #0b5f98 1px solid">
<DIV
style="PADDING-RIGHT: 1px; PADDING-LEFT: 1px; FLOAT: left; PADDING-BOTTOM: 1px; WIDTH: 16px; COLOR: white; PADDING-TOP: 1px; BACKGROUND-COLOR: #0b5f98">图书导读
</DIV>
<DIV
style="PADDING-LEFT: 2px; FLOAT: right; WIDTH: 670px; LINE-HEIGHT: 16pt; TEXT-ALIGN: left"><!--导读-->
<H1 id=divCurrentNode
style="PADDING-LEFT: 2px; FONT-SIZE: 12px; WIDTH: 100%; COLOR: #b83507; TEXT-ALIGN: left">当前章节:<A
href="http://book.csdn.net/bookfiles/65/100652564.shtml"><FONT color=red>6.2.7
哈希AVL树的编码实现</FONT></A></H1>
<DIV id=divRelateNode style="PADDING-LEFT: 2px">
<DIV style="FLOAT: left; WIDTH: 49%">·<A
href="http://book.csdn.net/bookfiles/65/100652561.shtml">6.2.4
哈希AVL树的删除</A></DIV>
<DIV style="FLOAT: right; WIDTH: 49%">·<A
href="http://book.csdn.net/bookfiles/65/100652562.shtml">6.2.5
哈希AVL树的释放</A></DIV>
<DIV style="FLOAT: left; WIDTH: 49%">·<A
href="http://book.csdn.net/bookfiles/65/100652563.shtml">6.2.6
哈希AVL树的遍历</A></DIV>
<DIV style="FLOAT: right; WIDTH: 49%">·<A
href="http://book.csdn.net/bookfiles/65/100652565.shtml">6.2.8
复合数据结构的分类</A></DIV>
<DIV style="FLOAT: left; WIDTH: 49%">·<A
href="http://book.csdn.net/bookfiles/65/100652566.shtml">8.6.1
线程池调度管理的基本概念</A></DIV>
<DIV style="FLOAT: right; WIDTH: 49%">·<A
href="http://book.csdn.net/bookfiles/65/100652567.shtml">8.6.2
线程池调度管理的编码实现</A></DIV></DIV></DIV></DIV>
<DIV class=clear></DIV></DIV><!-- main -->
<DIV id=main>
<DIV id=text>
<DIV id=csdn_zhaig_ad_yahoo_2></DIV>
<H3 style="MARGIN-LEFT: 0cm; TEXT-INDENT: 0cm"><SPAN
lang=EN-US>6.2.7</SPAN><SPAN lang=EN-US> </SPAN><SPAN
style="FONT-FAMILY: 方正准圆简体">哈希</SPAN><SPAN lang=EN-US>AVL</SPAN><SPAN
style="FONT-FAMILY: 方正准圆简体">树的编码实现</SPAN></H3>
<P class=MsoNormal><SPAN style="FONT-FAMILY: 华康简宋">前面介绍了用</SPAN><SPAN
lang=EN-US>C</SPAN><SPAN style="FONT-FAMILY: 华康简宋">语言结构体描述的哈希</SPAN><SPAN
lang=EN-US>AVL</SPAN><SPAN style="FONT-FAMILY: 华康简宋">树的节点类型，现将整个哈希</SPAN><SPAN
lang=EN-US>AVL</SPAN><SPAN style="FONT-FAMILY: 华康简宋">树用</SPAN><SPAN
lang=EN-US>C</SPAN><SPAN style="FONT-FAMILY: 华康简宋">语言结构体描述如下。</SPAN></P>
<P class=4><SPAN lang=EN-US>typedef BINTREEBASENODE AVLTREENODE</SPAN><SPAN
style="FONT-FAMILY: 宋体">；</SPAN></P>
<P class=4><SPAN lang=EN-US>typedef struct HASHAVLTREE_st {</SPAN></P>
<P class=MsoNormal style="LINE-HEIGHT: 14pt"><SPAN lang=EN-US
style="FONT-SIZE: 9pt"> AVLTREENODE
**ppBucket</SPAN><SPAN style="FONT-SIZE: 9pt; FONT-FAMILY: 宋体">；</SPAN><SPAN
lang=EN-US style="FONT-SIZE: 9pt"> /* </SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋">索引表指针</SPAN><SPAN lang=EN-US
style="FONT-SIZE: 9pt"> */</SPAN></P>
<P class=MsoNormal style="LINE-HEIGHT: 14pt"><SPAN lang=EN-US
style="FONT-SIZE: 9pt"> UINT
uBucketCount</SPAN><SPAN style="FONT-SIZE: 9pt; FONT-FAMILY: 宋体">；</SPAN><SPAN
lang=EN-US
style="FONT-SIZE: 9pt">
/* </SPAN><SPAN style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋">索引表的大小</SPAN><SPAN
lang=EN-US style="FONT-SIZE: 9pt"> */</SPAN></P>
<P class=MsoNormal style="LINE-HEIGHT: 14pt"><SPAN lang=EN-US
style="FONT-SIZE: 9pt"> UINT
uNodeCount</SPAN><SPAN style="FONT-SIZE: 9pt; FONT-FAMILY: 宋体">；</SPAN><SPAN
lang=EN-US
style="FONT-SIZE: 9pt">
/* </SPAN><SPAN style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋">表中实际节点的个数</SPAN><SPAN
lang=EN-US style="FONT-SIZE: 9pt"> */</SPAN></P>
<P class=MsoNormal style="LINE-HEIGHT: 14pt"><SPAN lang=EN-US
style="FONT-SIZE: 9pt"> UINT
uCurBucketNo</SPAN><SPAN style="FONT-SIZE: 9pt; FONT-FAMILY: 宋体">；</SPAN><SPAN
lang=EN-US
style="FONT-SIZE: 9pt">
/* </SPAN><SPAN style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋">当前要执行的</SPAN><SPAN
lang=EN-US style="FONT-SIZE: 9pt">bucket</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋">序号</SPAN><SPAN lang=EN-US
style="FONT-SIZE: 9pt"> */</SPAN></P>
<P class=MsoNormal style="LINE-HEIGHT: 14pt"><SPAN lang=EN-US
style="FONT-SIZE: 9pt"> AVLTREENODE
*pCurEntry</SPAN><SPAN style="FONT-SIZE: 9pt; FONT-FAMILY: 宋体">；</SPAN><SPAN
lang=EN-US style="FONT-SIZE: 9pt"> /* </SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋">当前</SPAN><SPAN lang=EN-US
style="FONT-SIZE: 9pt">bucket</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋">中下一个要执行的节点条目</SPAN><SPAN lang=EN-US
style="FONT-SIZE: 9pt"> */ </SPAN></P>
<P class=MsoNormal style="MARGIN-BOTTOM: 8pt; LINE-HEIGHT: 14pt"><SPAN
lang=EN-US style="FONT-SIZE: 9pt">} HASHAVLTREE</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 宋体">；</SPAN></P>
<P class=MsoNormal><SPAN style="FONT-FAMILY: 华康简宋">由于哈希</SPAN><SPAN
lang=EN-US>AVL</SPAN><SPAN style="FONT-FAMILY: 华康简宋">树是哈希表和</SPAN><SPAN
lang=EN-US>AVL</SPAN><SPAN
style="FONT-FAMILY: 华康简宋">树的复合体，为了便于实现，必须复用已有的</SPAN><SPAN
lang=EN-US>AVL</SPAN><SPAN style="FONT-FAMILY: 华康简宋">树的代码。</SPAN></P>
<P class=MsoNormal><SPAN style="FONT-FAMILY: 华康简宋">下面给出哈希</SPAN><SPAN
lang=EN-US>AVL</SPAN><SPAN style="FONT-FAMILY: 华康简宋">树的编码实现。</SPAN></P>
<P class=4><SPAN lang=EN-US>/** </SPAN><SPAN
style="FONT-FAMILY: 华康简宋">哈希</SPAN><SPAN lang=EN-US>AVL</SPAN><SPAN
style="FONT-FAMILY: 华康简宋">树的创建函数</SPAN></P>
<P class=MsoNormal style="LINE-HEIGHT: 14pt"><SPAN lang=EN-US
style="FONT-SIZE: 9pt"> @param
UINT uBucketCount</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋; LETTER-SPACING: -0.2pt">—</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋; LETTER-SPACING: -0.1pt">—</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋">哈希</SPAN><SPAN lang=EN-US
style="FONT-SIZE: 9pt">AVL</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋">树中</SPAN><SPAN lang=EN-US
style="FONT-SIZE: 9pt">bucket</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋">数量</SPAN></P>
<P class=MsoNormal style="LINE-HEIGHT: 14pt"><SPAN lang=EN-US
style="FONT-SIZE: 9pt"> @return
HASHAVLTREE *</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋; LETTER-SPACING: -0.2pt">—</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋; LETTER-SPACING: -0.1pt">—</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋">成功返回创建的哈希</SPAN><SPAN lang=EN-US
style="FONT-SIZE: 9pt">AVL</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋">树指针</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 宋体">；</SPAN><SPAN
style="FONT-SIZE: 9pt; FONT-FAMILY: 华康简宋">失败返回</SPAN><SPAN lang=EN-US
style="FONT-SIZE: 9pt">NULL</SPAN></P>
<P class=MsoNormal style="LINE-HEIGHT: 14pt"><SPAN lang=EN-US
style="FONT-SIZE: 9pt">*/</SPAN></P>
<P class=MsoNormal style="LINE-HEIGHT: 14pt"><STRONG><SPAN lang=EN-US
style="FONT-SIZE: 9pt">HASHAVLTREE *HashAVLTree_Create(UINT
uBucketCount)</SPAN></STRONG></P>
<P class=MsoNormal style="LINE-HEIGHT: 14pt"><SPAN lang=EN-US
style="FONT-SIZE: 9pt">{</SPAN></P>
<P class=MsoNormal style="LINE-HEIGHT: 14pt"><SPAN lang=EN-US
style="FONT-SIZE: 9pt"> HASHAVLTREE
*pTree</SPAN><SPAN style="FONT-SIZE: 9pt; FONT-FAMILY: 宋体">；</SPAN></P>
<P class=MsoNormal style="LINE-HEIGHT: 14pt"><SPAN lang=EN-US
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -