<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[鹰击长空]]></title><description><![CDATA[c/c++]]></description><link>https://blog.csdn.net/terry_v</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; terry_v]]></copyright><item><title><![CDATA[链式栈]]></title><link>https://blog.csdn.net/terry_v/article/details/6784206</link><guid>https://blog.csdn.net/terry_v/article/details/6784206</guid><author>terry_v</author><pubDate>Sat, 17 Sep 2011 10:45:32 +0800</pubDate><description><![CDATA[#pragma once
#ifndef _LINKEDSTACK_H_
#define _LINKEDSTACK_H_
#include 

struct LinkNode
{
		int data;
		LinkNode *link;
		LinkNode(LinkNode]]></description><category></category></item><item><title><![CDATA[顺序栈]]></title><link>https://blog.csdn.net/terry_v/article/details/6782968</link><guid>https://blog.csdn.net/terry_v/article/details/6782968</guid><author>terry_v</author><pubDate>Fri, 16 Sep 2011 18:03:53 +0800</pubDate><description><![CDATA[#include 
#define NULL 0
#define defaultSize 50
#define stackIncreament 20

class SeqStack]]></description><category></category></item><item><title><![CDATA[平衡二叉搜索树（AVL树)]]></title><link>https://blog.csdn.net/terry_v/article/details/6782228</link><guid>https://blog.csdn.net/terry_v/article/details/6782228</guid><author>terry_v</author><pubDate>Fri, 16 Sep 2011 15:28:35 +0800</pubDate><description><![CDATA[#pragma once
#ifndef _AVLTREE_H_
#define _AVLTREE_H_
#include 
#include 

struct Student
{
	long key;
	char name[12];
	char sex;
	char addre]]></description><category></category></item><item><title><![CDATA[二叉搜索树]]></title><link>https://blog.csdn.net/terry_v/article/details/6778401</link><guid>https://blog.csdn.net/terry_v/article/details/6778401</guid><author>terry_v</author><pubDate>Thu, 15 Sep 2011 15:14:11 +0800</pubDate><description><![CDATA[#pragma once
#ifndef _BST_H_
#define _BST_H_
#include 
#include 
using namespace std;

struct Student    
{    
    long ID_number;]]></description><category></category></item><item><title><![CDATA[哈希表---开散列实现]]></title><link>https://blog.csdn.net/terry_v/article/details/6773004</link><guid>https://blog.csdn.net/terry_v/article/details/6773004</guid><author>terry_v</author><pubDate>Tue, 13 Sep 2011 23:41:37 +0800</pubDate><description><![CDATA[#pragma once
#ifndef _HASHTABLE_H_
#define _HASHTABLE_H_
#include 
#define defaultSize 100

struct Student  
{  
    long ID_number;  
    c]]></description><category></category></item><item><title><![CDATA[用有序链表实现集合]]></title><link>https://blog.csdn.net/terry_v/article/details/6771798</link><guid>https://blog.csdn.net/terry_v/article/details/6771798</guid><author>terry_v</author><pubDate>Tue, 13 Sep 2011 17:01:24 +0800</pubDate><description><![CDATA[#pragma once
#ifndef _LINKEDSET_H_
#define _LINKEDSET_H_
#include 

template 
struct SetNode]]></description><category></category></item><item><title><![CDATA[字典的线性表描述]]></title><link>https://blog.csdn.net/terry_v/article/details/6771778</link><guid>https://blog.csdn.net/terry_v/article/details/6771778</guid><author>terry_v</author><pubDate>Tue, 13 Sep 2011 16:58:45 +0800</pubDate><description><![CDATA[#pragma once
#ifndef _STOREDCHAIN_H_
#define _STOREDCHAIN_H_
#include 

struct Student
{
	long ID_number;
	char name[12];
	Student& operator]]></description><category></category></item><item><title><![CDATA[哈希表---线性探测法]]></title><link>https://blog.csdn.net/terry_v/article/details/6771760</link><guid>https://blog.csdn.net/terry_v/article/details/6771760</guid><author>terry_v</author><pubDate>Tue, 13 Sep 2011 16:54:44 +0800</pubDate><description><![CDATA[#pragma once
#ifndef _HASHTABLE_H_
#define _HASHTABLE _H_
#include 
#define DefaultSize 100
enum KindOfStatus {Active, Empty, Deleted};

str]]></description><category></category></item><item><title><![CDATA[最大堆和堆排序]]></title><link>https://blog.csdn.net/terry_v/article/details/6760696</link><guid>https://blog.csdn.net/terry_v/article/details/6760696</guid><author>terry_v</author><pubDate>Thu, 08 Sep 2011 16:01:21 +0800</pubDate><description><![CDATA[#pragma once
#ifndef _MAXHEAP_H_
#define _MAXHEAP_H_
#define DefaultSize 10
template 
class MaxHeap
{
public:
	MaxHeap(int sz=DefaultSize)]]></description><category></category></item><item><title><![CDATA[最小堆和堆排序]]></title><link>https://blog.csdn.net/terry_v/article/details/6760684</link><guid>https://blog.csdn.net/terry_v/article/details/6760684</guid><author>terry_v</author><pubDate>Thu, 08 Sep 2011 15:59:34 +0800</pubDate><description><![CDATA[#pragma once
#ifndef _MINHEAP_H_
#define _MINHEAP_H_
#define DefaultSize 10
template 
class MinHeap
{
public:
	MinHeap(int sz=DefaultSize)]]></description><category></category></item><item><title><![CDATA[常用排序算法]]></title><link>https://blog.csdn.net/terry_v/article/details/6760639</link><guid>https://blog.csdn.net/terry_v/article/details/6760639</guid><author>terry_v</author><pubDate>Thu, 08 Sep 2011 15:52:56 +0800</pubDate><description><![CDATA[#pragma once
#ifndef _ALGSORT_H_
#define _ALGSORT_H_
#define M 10]]></description><category></category></item></channel></rss>