<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[berbar的专栏]]></title><description><![CDATA[]]></description><link>https://blog.csdn.net/berbar</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; berbar]]></copyright><item><title><![CDATA[二叉树的非递归遍历的算法]]></title><link>https://blog.csdn.net/berbar/article/details/1622925</link><guid>https://blog.csdn.net/berbar/article/details/1622925</guid><author>berbar</author><pubDate>Wed, 23 May 2007 18:04:00 +0800</pubDate><description><![CDATA[#include#include "type.h"void  main(){     BiTree  T;     CreateBiTree(T);//创建二叉树   cout   InorderTraverse(T);//中序遍历   cout   InorderBack(T);//后序遍历   cout   Order(T);   cout} #include "type.h"]]></description><category></category></item><item><title><![CDATA[haffman树的遍历]]></title><link>https://blog.csdn.net/berbar/article/details/1622917</link><guid>https://blog.csdn.net/berbar/article/details/1622917</guid><author>berbar</author><pubDate>Wed, 23 May 2007 18:01:00 +0800</pubDate><description><![CDATA[#include#include "type.h"void  main(){    int a[]={5,29,7,8,14,23,3,11};   HuffmanTree  HT;   HuffmanCode  HC;   HuffmanCoding(HT,HC,a,8);   }#include "type.h"void  HuffmanCoding(HuffmanTree &HT,H]]></description><category></category></item><item><title><![CDATA[银行的问题]]></title><link>https://blog.csdn.net/berbar/article/details/1587251</link><guid>https://blog.csdn.net/berbar/article/details/1587251</guid><author>berbar</author><pubDate>Fri, 27 Apr 2007 14:45:00 +0800</pubDate><description><![CDATA[#include#include#include#includetypedef struct {  int Occurtime;//事件发生当前的时间  int NType;//标志0表示客户到达,1表示1窗口客户离开,2表示2窗口客户离开,3表示3窗口客户离开,4表示4窗口客户离开}Event;//事件类型typedef struct LNode{ Event data; struct LN]]></description><category></category></item><item><title><![CDATA[关于迷宫的算法]]></title><link>https://blog.csdn.net/berbar/article/details/1587247</link><guid>https://blog.csdn.net/berbar/article/details/1587247</guid><author>berbar</author><pubDate>Fri, 27 Apr 2007 14:43:00 +0800</pubDate><description><![CDATA[//base.h#include#include#include#define OVERFLOW -2#define OK 1#define ERROR 0#define TRUE 1#define FALSE 0typedef int Status;//stack.h#define STACK_INIT_SIZE 100 //存储空间初始量#define STACK_INCREMENT 10]]></description><category></category></item></channel></rss>