﻿<?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>博客园-badnewfish-随笔分类-数据结构</title><link>http://www.cnblogs.com/badnewfish/category/86699.html</link><description>我是菜鸟我怕谁？</description><language>zh-cn</language><lastBuildDate>Mon, 09 Jun 2008 13:29:59 GMT</lastBuildDate><pubDate>Mon, 09 Jun 2008 13:29:59 GMT</pubDate><ttl>60</ttl><item><title>利用栈结构判断括号匹配问题</title><link>http://www.cnblogs.com/badnewfish/archive/2007/04/17/716472.html</link><dc:creator>badnewfish</dc:creator><author>badnewfish</author><pubDate>Tue, 17 Apr 2007 03:30:00 GMT</pubDate><guid>http://www.cnblogs.com/badnewfish/archive/2007/04/17/716472.html</guid><wfw:comment>http://www.cnblogs.com/badnewfish/comments/716472.html</wfw:comment><comments>http://www.cnblogs.com/badnewfish/archive/2007/04/17/716472.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/badnewfish/comments/commentRss/716472.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/badnewfish/services/trackbacks/716472.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 前台一个文本框，一个lable，一个按钮，后台代码如下：我虽然实现了判断匹配的问题，但是对原理理解的不是很清除，希望有经验的给解释一下！usingSystem;usingSystem.Collec...&nbsp;&nbsp;<a href='http://www.cnblogs.com/badnewfish/archive/2007/04/17/716472.html'>阅读全文</a><img src ="http://www.cnblogs.com/badnewfish/aggbug/716472.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://badnewfish.cnblogs.com/" target="_blank">badnewfish</a> 2007-04-17 11:30 <a href="http://www.cnblogs.com/badnewfish/archive/2007/04/17/716472.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>c#实现排序二叉树</title><link>http://www.cnblogs.com/badnewfish/archive/2007/03/07/666367.html</link><dc:creator>badnewfish</dc:creator><author>badnewfish</author><pubDate>Wed, 07 Mar 2007 01:58:00 GMT</pubDate><guid>http://www.cnblogs.com/badnewfish/archive/2007/03/07/666367.html</guid><wfw:comment>http://www.cnblogs.com/badnewfish/comments/666367.html</wfw:comment><comments>http://www.cnblogs.com/badnewfish/archive/2007/03/07/666367.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/badnewfish/comments/commentRss/666367.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/badnewfish/services/trackbacks/666367.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: c#实现排序二叉树&nbsp;&nbsp;<a href='http://www.cnblogs.com/badnewfish/archive/2007/03/07/666367.html'>阅读全文</a><img src ="http://www.cnblogs.com/badnewfish/aggbug/666367.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://badnewfish.cnblogs.com/" target="_blank">badnewfish</a> 2007-03-07 09:58 <a href="http://www.cnblogs.com/badnewfish/archive/2007/03/07/666367.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>用2叉树排序</title><link>http://www.cnblogs.com/badnewfish/archive/2006/12/27/605120.html</link><dc:creator>badnewfish</dc:creator><author>badnewfish</author><pubDate>Wed, 27 Dec 2006 08:17:00 GMT</pubDate><guid>http://www.cnblogs.com/badnewfish/archive/2006/12/27/605120.html</guid><wfw:comment>http://www.cnblogs.com/badnewfish/comments/605120.html</wfw:comment><comments>http://www.cnblogs.com/badnewfish/archive/2006/12/27/605120.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/badnewfish/comments/commentRss/605120.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/badnewfish/services/trackbacks/605120.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 构造一个二叉树，它具备以下功能：首先构建一个跟节点，假设数据是5。得到：第一次插入节点时，从根部插入if(插入数据〉=根节点)&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp...&nbsp;&nbsp;<a href='http://www.cnblogs.com/badnewfish/archive/2006/12/27/605120.html'>阅读全文</a><img src ="http://www.cnblogs.com/badnewfish/aggbug/605120.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://badnewfish.cnblogs.com/" target="_blank">badnewfish</a> 2006-12-27 16:17 <a href="http://www.cnblogs.com/badnewfish/archive/2006/12/27/605120.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>