<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[q_Q_wang的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/q_Q_wang</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; q_Q_wang]]></copyright><item><title><![CDATA[java实现广度优先搜索(BFS)深度优先搜索(DFS)]]></title><link>https://blog.youkuaiyun.com/q_Q_wang/article/details/105425275</link><guid>https://blog.youkuaiyun.com/q_Q_wang/article/details/105425275</guid><author>q_Q_wang</author><pubDate>Fri, 10 Apr 2020 08:31:14 +0800</pubDate><description><![CDATA[如何用java实现对二叉树的DFS和BFS？
首先，一个简单二叉树如下图：

每一个结点的数据域为整型，有左节点和右节点
实现如下
import java.util.LinkedList;
import java.util.Queue;
import java.util.Stack;

/**
 * @author WangMingMing
 * @creat 2020-04-10 7:58
 *...]]></description><category></category></item><item><title><![CDATA[字符编码笔记：ASCII、Unicode、UTF-8]]></title><link>https://blog.youkuaiyun.com/q_Q_wang/article/details/103638335</link><guid>https://blog.youkuaiyun.com/q_Q_wang/article/details/103638335</guid><author>q_Q_wang</author><pubDate>Fri, 20 Dec 2019 20:47:44 +0800</pubDate><description><![CDATA[字符编码笔记：ASCII、Unicode、UTF-8
讲真，这人讲得真的超级好，一扫困惑。
字符编码笔记链接

]]></description><category></category></item></channel></rss>