<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[fragrantulip的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/fragrantulip</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; fragrantulip]]></copyright><item><title><![CDATA[expected';'','or')'before'&'token 报这个错]]></title><link>https://blog.youkuaiyun.com/fragrantulip/article/details/78985517</link><guid>https://blog.youkuaiyun.com/fragrantulip/article/details/78985517</guid><author>fragrantulip</author><pubDate>Fri, 05 Jan 2018 21:52:36 +0800</pubDate><description><![CDATA[expected';'','or')'before'&'token 报这个错

c语言中没有引用&]]></description><category></category></item><item><title><![CDATA[Android Studio 主题、字体大小的设置]]></title><link>https://blog.youkuaiyun.com/fragrantulip/article/details/78957639</link><guid>https://blog.youkuaiyun.com/fragrantulip/article/details/78957639</guid><author>fragrantulip</author><pubDate>Wed, 03 Jan 2018 09:09:05 +0800</pubDate><description><![CDATA[转载自：http://blog.youkuaiyun.com/watermusicyes/article/details/46292913]]></description><category></category></item><item><title><![CDATA[二叉树的先序、中序、后序遍历]]></title><link>https://blog.youkuaiyun.com/fragrantulip/article/details/78820639</link><guid>https://blog.youkuaiyun.com/fragrantulip/article/details/78820639</guid><author>fragrantulip</author><pubDate>Sat, 16 Dec 2017 16:37:03 +0800</pubDate><description><![CDATA[1、先序遍历（前序）

（1）访问根节点；

（2）先序遍历左子树；

（3）先序遍历右子树。

2、中序遍历

（1）中序遍历左子树；

（2）访问根节点；

（3）中序遍历右子树。

3、后序遍历

（1）后序遍历左子树；

（2）后序遍历右子树‘

（3）访问根节点。]]></description><category></category></item><item><title><![CDATA[layout_below与layout_alignBottom的区别]]></title><link>https://blog.youkuaiyun.com/fragrantulip/article/details/78735660</link><guid>https://blog.youkuaiyun.com/fragrantulip/article/details/78735660</guid><author>fragrantulip</author><pubDate>Wed, 06 Dec 2017 21:52:18 +0800</pubDate><description><![CDATA[android:layout_below="@+id/first" //在某元素的的下方；  
android:layout_alignBottom="@+id/first"//本元素的下边缘和某元素的的下边缘对齐；  
//今天想用”layout_below“，却用成了”layout_alignBottom“郁闷了相当长的时间。  
原文地址：http://blog.youkuaiyun.com/ch]]></description><category></category></item><item><title><![CDATA[分别用头插法和尾插法建立有头结点和无头结点的单链表]]></title><link>https://blog.youkuaiyun.com/fragrantulip/article/details/78637582</link><guid>https://blog.youkuaiyun.com/fragrantulip/article/details/78637582</guid><author>fragrantulip</author><pubDate>Sun, 26 Nov 2017 17:28:56 +0800</pubDate><description><![CDATA[链表]]></description><category></category></item><item><title><![CDATA[数据结构之二叉树的性质]]></title><link>https://blog.youkuaiyun.com/fragrantulip/article/details/78607127</link><guid>https://blog.youkuaiyun.com/fragrantulip/article/details/78607127</guid><author>fragrantulip</author><pubDate>Wed, 22 Nov 2017 19:34:49 +0800</pubDate><description><![CDATA[1、第i层的结点数至多是2^(i-1)个，第i 层上至少有1个结点
2、深度为K的二叉树至多有  2^K-1  个结点
3、对于任意一颗二叉树，若2度的结点有n2个，则叶子树（n0）为：n0=n2+1;
4、满二叉树：深度为K,且含有2^K-1个结点的二叉树;
5、完全二叉树：树中所含的n个结点和满二叉树中编号为1至n的结点一一对应
6、具有n个结点的完全二叉树的高度为log2 n +1]]></description><category></category></item></channel></rss>