﻿<?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++博客-kuramawzw-随笔分类-数据结构</title><link>http://www.cppblog.com/kuramawzw/category/11450.html</link><description>BUAA</description><language>zh-cn</language><lastBuildDate>Tue, 26 Apr 2011 12:41:47 GMT</lastBuildDate><pubDate>Tue, 26 Apr 2011 12:41:47 GMT</pubDate><ttl>60</ttl><item><title>随机二叉搜索树 Treap</title><link>http://www.cppblog.com/kuramawzw/archive/2009/08/12/93086.html</link><dc:creator>kuramawzw</dc:creator><author>kuramawzw</author><pubDate>Wed, 12 Aug 2009 13:57:00 GMT</pubDate><guid>http://www.cppblog.com/kuramawzw/archive/2009/08/12/93086.html</guid><wfw:comment>http://www.cppblog.com/kuramawzw/comments/93086.html</wfw:comment><comments>http://www.cppblog.com/kuramawzw/archive/2009/08/12/93086.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/kuramawzw/comments/commentRss/93086.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/kuramawzw/services/trackbacks/93086.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 介绍一种数据结构，随机二叉树Trep，可以当作一种近似的平衡二叉树，实现简单，实际的运行效率较高&nbsp;&nbsp;<a href='http://www.cppblog.com/kuramawzw/archive/2009/08/12/93086.html'>阅读全文</a><img src ="http://www.cppblog.com/kuramawzw/aggbug/93086.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/kuramawzw/" target="_blank">kuramawzw</a> 2009-08-12 21:57 <a href="http://www.cppblog.com/kuramawzw/archive/2009/08/12/93086.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>