<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ilivid的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ilivid</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ilivid]]></copyright><item><title><![CDATA[04-树6 Complete Binary Search Tree（30 分）]]></title><link>https://blog.youkuaiyun.com/ilivid/article/details/79995146</link><guid>https://blog.youkuaiyun.com/ilivid/article/details/79995146</guid><author>ilivid</author><pubDate>Wed, 18 Apr 2018 18:59:38 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;
#include &amp;lt;algorithm&amp;gt;
using namespace std;

int jj=0,b[1005];

void out(int rt, int n, int a[]){
    if(rt&amp;lt;=n){
        out(2*rt,n,a);
        b[rt-1]=a[jj++];
//    ...]]></description><category></category></item><item><title><![CDATA[是否同一棵二叉搜索树]]></title><link>https://blog.youkuaiyun.com/ilivid/article/details/79929771</link><guid>https://blog.youkuaiyun.com/ilivid/article/details/79929771</guid><author>ilivid</author><pubDate>Fri, 13 Apr 2018 16:07:17 +0800</pubDate><description><![CDATA[04-树4 是否同一棵二叉搜索树（25 分）
给定一个插入序列就可以唯一确定一棵二叉搜索树。然而，一棵给定的二叉搜索树却可以由多种不同的插入序列得到。例如分别按照序列{2, 1, 3}和{2, 3, 1}插入初始为空的二叉搜索树，都得到一样的结果。于是对于输入的各种插入序列，你需要判断它们是否能生成一样的二叉搜索树。

输入格式:
输入包含若干组测试数据。每组数据的第1行给出两个正整数N (≤10...]]></description><category></category></item><item><title><![CDATA[List Leaves 03-树2 List Leaves（25 分）(C++) 浙大数据结构]]></title><link>https://blog.youkuaiyun.com/ilivid/article/details/79900308</link><guid>https://blog.youkuaiyun.com/ilivid/article/details/79900308</guid><author>ilivid</author><pubDate>Wed, 11 Apr 2018 17:45:02 +0800</pubDate><description><![CDATA[原题：Given a tree, you are supposed to list all the leaves in the order of top down, and left to right.

Input Specification:
Each input file contains one test case. For each case, the first line gives ...]]></description><category></category></item><item><title><![CDATA[树的同构 03-树1 树的同构（25 分）（C++）浙大数据结构]]></title><link>https://blog.youkuaiyun.com/ilivid/article/details/79880544</link><guid>https://blog.youkuaiyun.com/ilivid/article/details/79880544</guid><author>ilivid</author><pubDate>Tue, 10 Apr 2018 14:44:32 +0800</pubDate><description><![CDATA[原题:03-树1 树的同构（25 分）
给定两棵树T1和T2。如果T1可以通过若干次左右孩子互换就变成T2，则我们称两棵树是“同构”的。例如图1给出的两棵树就是同构的，因为我们把其中一棵树的结点A、B、G的左右孩子互换后，就得到另外一棵树。而图2就不是同构的。



现给定两棵树，请你判断它们是否是同构的。
输入格式:
输入给出2棵二叉树树的信息。对于每棵树，首先在一行中给出一个非负整数N (≤1...]]></description><category></category></item><item><title><![CDATA[Pop Sequence  02-线性结构4. Pop Sequence(25) （C++）浙大数据结构新手向]]></title><link>https://blog.youkuaiyun.com/ilivid/article/details/79876418</link><guid>https://blog.youkuaiyun.com/ilivid/article/details/79876418</guid><author>ilivid</author><pubDate>Tue, 10 Apr 2018 09:46:47 +0800</pubDate><description><![CDATA[原题：02-线性结构4 Pop Sequence（25 分）
Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a given sequence of numbers ...]]></description><category></category></item></channel></rss>