﻿<?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++博客-welcome!-随笔分类-数据结构</title><link>http://www.cppblog.com/shly/category/11649.html</link><description>never give up!</description><language>zh-cn</language><lastBuildDate>Tue, 01 Sep 2009 05:22:23 GMT</lastBuildDate><pubDate>Tue, 01 Sep 2009 05:22:23 GMT</pubDate><ttl>60</ttl><item><title>[C++]二叉树的链式描述。创建，遍历，摧毁。</title><link>http://www.cppblog.com/shly/archive/2009/09/01/94930.html</link><dc:creator>shly</dc:creator><author>shly</author><pubDate>Mon, 31 Aug 2009 16:58:00 GMT</pubDate><guid>http://www.cppblog.com/shly/archive/2009/09/01/94930.html</guid><wfw:comment>http://www.cppblog.com/shly/comments/94930.html</wfw:comment><comments>http://www.cppblog.com/shly/archive/2009/09/01/94930.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/shly/comments/commentRss/94930.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/shly/services/trackbacks/94930.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 刚学写的二叉树的创建，遍历，摧毁。&nbsp;&nbsp;<a href='http://www.cppblog.com/shly/archive/2009/09/01/94930.html'>阅读全文</a><img src ="http://www.cppblog.com/shly/aggbug/94930.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/shly/" target="_blank">shly</a> 2009-09-01 00:58 <a href="http://www.cppblog.com/shly/archive/2009/09/01/94930.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>