<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Wik_X的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Wik_X</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Wik_X]]></copyright><item><title><![CDATA[基于Arduino的智能循迹小车]]></title><link>https://blog.youkuaiyun.com/Wik_X/article/details/139391591</link><guid>https://blog.youkuaiyun.com/Wik_X/article/details/139391591</guid><author>Wik_X</author><pubDate>Wed, 05 Jun 2024 17:11:02 +0800</pubDate><description><![CDATA[基于Arduino的智能循迹小车教程-待更新完成]]></description><category></category></item><item><title><![CDATA[王道数据结构课后题第五章第14题]]></title><link>https://blog.youkuaiyun.com/Wik_X/article/details/132376923</link><guid>https://blog.youkuaiyun.com/Wik_X/article/details/132376923</guid><author>Wik_X</author><pubDate>Sat, 19 Aug 2023 10:25:12 +0800</pubDate><description><![CDATA[借助树的层次遍历的非递归算法，在处理每层第一个结点和最后一个结点时设置变量记录其在队列中的下标，相减即可得到该层结点数，每层的结点数量都记录在一个数组width中。最后遍历该数组找最大值，即为树的宽度。假设二叉树采用二叉链表存储结构，设计一个算法，求非空二叉树 b 的宽度（即具有结。点数最多的那一层的结点个数）。]]></description><category></category></item><item><title><![CDATA[王道数据结构代码题第二章第六题]]></title><link>https://blog.youkuaiyun.com/Wik_X/article/details/131736356</link><guid>https://blog.youkuaiyun.com/Wik_X/article/details/131736356</guid><author>Wik_X</author><pubDate>Sat, 15 Jul 2023 10:51:55 +0800</pubDate><description><![CDATA[自留]]></description><category></category></item></channel></rss>