﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-liyuxia713-随笔分类-Data Structure</title><link>http://www.cppblog.com/liyuxia713/category/10261.html</link><description>蹒跚前行者</description><language>zh-cn</language><lastBuildDate>Fri, 08 May 2009 16:31:25 GMT</lastBuildDate><pubDate>Fri, 08 May 2009 16:31:25 GMT</pubDate><ttl>60</ttl><item><title>HuffMan编码</title><link>http://www.cppblog.com/liyuxia713/archive/2009/05/07/82184.html</link><dc:creator>幸运草</dc:creator><author>幸运草</author><pubDate>Thu, 07 May 2009 13:07:00 GMT</pubDate><guid>http://www.cppblog.com/liyuxia713/archive/2009/05/07/82184.html</guid><wfw:comment>http://www.cppblog.com/liyuxia713/comments/82184.html</wfw:comment><comments>http://www.cppblog.com/liyuxia713/archive/2009/05/07/82184.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/liyuxia713/comments/commentRss/82184.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/liyuxia713/services/trackbacks/82184.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: * 对给定的一组权值，实现HuffMan编码，时间复杂度1/2n^2<br>* 第一步：由已知的n个权值形成哈夫曼的初态                                                                   <br>* 第二步：建立哈夫曼结点数组。依次对前面已建立的结点作如下处理<br>*         1. 选择两个权值最小且无双亲的权<br>*         2. 根据选出来的两个权构造新的哈夫曼结点，修改两个点父亲结点为新建的节点<br>* 第三步：对哈夫曼树进行哈夫曼编码：从权结点逆序到根节点写出01编码，<br>          然后再次逆序（正序）存储到哈夫曼编码数组中&nbsp;&nbsp;<a href='http://www.cppblog.com/liyuxia713/archive/2009/05/07/82184.html'>阅读全文</a><img src ="http://www.cppblog.com/liyuxia713/aggbug/82184.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/liyuxia713/" target="_blank">幸运草</a> 2009-05-07 21:07 <a href="http://www.cppblog.com/liyuxia713/archive/2009/05/07/82184.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>二叉树抽象类型</title><link>http://www.cppblog.com/liyuxia713/archive/2009/04/28/81285.html</link><dc:creator>幸运草</dc:creator><author>幸运草</author><pubDate>Tue, 28 Apr 2009 00:40:00 GMT</pubDate><guid>http://www.cppblog.com/liyuxia713/archive/2009/04/28/81285.html</guid><wfw:comment>http://www.cppblog.com/liyuxia713/comments/81285.html</wfw:comment><comments>http://www.cppblog.com/liyuxia713/archive/2009/04/28/81285.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/liyuxia713/comments/commentRss/81285.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/liyuxia713/services/trackbacks/81285.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: ** BTree.h二叉树抽象类型<br>** 由给定的完全二叉树形式存储的数组(如"12345 6"),构造二叉树<br>** 提供：复制构造函数和赋值操作符重载   <br>** 递归和非递归形式的中、前、后序遍历方法<br>** 求一个节点的父节点，左右兄弟结点的函数     <br>** 求二叉树深度和结点个数的函数  &nbsp;&nbsp;<a href='http://www.cppblog.com/liyuxia713/archive/2009/04/28/81285.html'>阅读全文</a><img src ="http://www.cppblog.com/liyuxia713/aggbug/81285.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/liyuxia713/" target="_blank">幸运草</a> 2009-04-28 08:40 <a href="http://www.cppblog.com/liyuxia713/archive/2009/04/28/81285.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>二叉排序树</title><link>http://www.cppblog.com/liyuxia713/archive/2009/04/27/81260.html</link><dc:creator>幸运草</dc:creator><author>幸运草</author><pubDate>Mon, 27 Apr 2009 12:57:00 GMT</pubDate><guid>http://www.cppblog.com/liyuxia713/archive/2009/04/27/81260.html</guid><wfw:comment>http://www.cppblog.com/liyuxia713/comments/81260.html</wfw:comment><comments>http://www.cppblog.com/liyuxia713/archive/2009/04/27/81260.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/liyuxia713/comments/commentRss/81260.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/liyuxia713/services/trackbacks/81260.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: * 根据给定的字符串构造一个排序二叉树<br>* 从排序二叉树中寻找最大值，最小值，不存在时抛出invalid_argument异常<br>* 从排序二叉树中删除某一元素，不存在时抛出invalid_argument 异常<br>* 往排序二叉树中添加一个新元素 &nbsp;&nbsp;<a href='http://www.cppblog.com/liyuxia713/archive/2009/04/27/81260.html'>阅读全文</a><img src ="http://www.cppblog.com/liyuxia713/aggbug/81260.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/liyuxia713/" target="_blank">幸运草</a> 2009-04-27 20:57 <a href="http://www.cppblog.com/liyuxia713/archive/2009/04/27/81260.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>矩阵类</title><link>http://www.cppblog.com/liyuxia713/archive/2009/04/16/80177.html</link><dc:creator>幸运草</dc:creator><author>幸运草</author><pubDate>Thu, 16 Apr 2009 11:49:00 GMT</pubDate><guid>http://www.cppblog.com/liyuxia713/archive/2009/04/16/80177.html</guid><wfw:comment>http://www.cppblog.com/liyuxia713/comments/80177.html</wfw:comment><comments>http://www.cppblog.com/liyuxia713/archive/2009/04/16/80177.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/liyuxia713/comments/commentRss/80177.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/liyuxia713/services/trackbacks/80177.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 自己编写的一个矩阵类。<br>从文件中读取矩阵和将矩阵写入文件这两个函数费了一点心思，感觉作用也大一些。<br>收获：1. 对类的static成员函数的作用有所了解。<br>      2. 对文件的读写操作熟练了一些。clear，seekg等<br>      3. 对异常处理的初级应用。<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/liyuxia713/archive/2009/04/16/80177.html'>阅读全文</a><img src ="http://www.cppblog.com/liyuxia713/aggbug/80177.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/liyuxia713/" target="_blank">幸运草</a> 2009-04-16 19:49 <a href="http://www.cppblog.com/liyuxia713/archive/2009/04/16/80177.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>