﻿<?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++博客-Oliver's R&amp;D Lab-文章分类-DataStructure</title><link>http://www.cppblog.com/zenliang/category/15257.html</link><description>C/C++/Linux</description><language>zh-cn</language><lastBuildDate>Sat, 30 Oct 2010 12:42:13 GMT</lastBuildDate><pubDate>Sat, 30 Oct 2010 12:42:13 GMT</pubDate><ttl>60</ttl><item><title>二叉树前序，中序，后序遍历的非递归实现（c++版）</title><link>http://www.cppblog.com/zenliang/articles/130918.html</link><dc:creator>oliver</dc:creator><author>oliver</author><pubDate>Fri, 22 Oct 2010 11:05:00 GMT</pubDate><guid>http://www.cppblog.com/zenliang/articles/130918.html</guid><wfw:comment>http://www.cppblog.com/zenliang/comments/130918.html</wfw:comment><comments>http://www.cppblog.com/zenliang/articles/130918.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/zenliang/comments/commentRss/130918.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/zenliang/services/trackbacks/130918.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 1. 二叉树后序非递归遍历：&nbsp;1#include&nbsp;&lt;stack&gt;&nbsp;2#include&nbsp;&lt;iostream&gt;&nbsp;3using&nbsp;namespace&nbsp;std;&nbsp;4&nbsp;5template&nbsp;&lt;class&nbsp;T&gt;&nbsp;6class&nbsp;TreeNode&n...&nbsp;&nbsp;<a href='http://www.cppblog.com/zenliang/articles/130918.html'>阅读全文</a><img src ="http://www.cppblog.com/zenliang/aggbug/130918.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/zenliang/" target="_blank">oliver</a> 2010-10-22 19:05 <a href="http://www.cppblog.com/zenliang/articles/130918.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>