<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[EmmyDuo的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/EmmyDuo</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; EmmyDuo]]></copyright><item><title><![CDATA[java 创建一个二叉树并遍历]]></title><link>https://blog.youkuaiyun.com/EmmyDuo/article/details/81213685</link><guid>https://blog.youkuaiyun.com/EmmyDuo/article/details/81213685</guid><author>EmmyDuo</author><pubDate>Thu, 26 Jul 2018 09:02:50 +0800</pubDate><description><![CDATA[import java.util.Scanner;
//定义一个二叉树
//实例化后，形成二叉树的节点
class Tree{
  //定义节点的属性
    private char data;//存储数据
    //存储左右子树地址的属性
    private Tree left,right;
    //控制数组索引
    private int top;//默认为0
    /**
...]]></description><category></category></item><item><title><![CDATA[数据结构，使用头插法创建一个链表]]></title><link>https://blog.youkuaiyun.com/EmmyDuo/article/details/81213673</link><guid>https://blog.youkuaiyun.com/EmmyDuo/article/details/81213673</guid><author>EmmyDuo</author><pubDate>Thu, 26 Jul 2018 09:02:02 +0800</pubDate><description><![CDATA[
   import java.util.Random;
//创建链表类
class MLink{
    //当Mlink实例化后形成一个链表的节点对象
    //节点对象中的属性
    //节点存储的属性
    private int data;
    //存储下一个链表节点地址的属性
    private MLink next;

    /**
     *   功能：创建一个链...]]></description><category></category></item><item><title><![CDATA[插入排序代码]]></title><link>https://blog.youkuaiyun.com/EmmyDuo/article/details/81180722</link><guid>https://blog.youkuaiyun.com/EmmyDuo/article/details/81180722</guid><author>EmmyDuo</author><pubDate>Tue, 24 Jul 2018 10:52:38 +0800</pubDate><description><![CDATA[
public class Homework01 {
    public static void shuzu(int[] a) {
        if(a == null || a.length == 0) {//判断数组是否为空
            System.out.println(&quot;该数组为空！&quot;);
            return;
        }
        in...]]></description><category></category></item></channel></rss>