bstree.h

一个关于二叉树的查询 插入 删除 排序的小程序

// BSTree.h: interface for the BSTree class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_TREE_H__62D35B08_D8C7_4E44_AC5E_148A2D8DDD1A__INCLUDED_)
#define AFX_TREE_H__62D35B08_D8C7_4E44_AC5E_148A2D8DDD1A__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
#include "Node.h"

class BSTree  
{
private :
	int NODE_HEIGHT;
	int NODE_WIDTH;
public:
	Node *Root;
//	CDC  *g;
public:
	BSTree();
	virtual ~BSTree();

	bool Tree_Insert(int);
	bool Insertnode(int,Node *);
	Node *Tree_Search(int,Node *);
    Node *Tree_delete(int ,Node *);
    void positiontree(int,int);
	int  position_tree(Node*,int,int);
    bool ResetColor(Node *);
    void draw_tree(CDC*,Node*);
	void draw_edge(CDC*,Node *);
    void draw_node(CDC*,Node *);
	//void setCDC(CDC*);
	//CDC *getCDC();  
};

#endif // !defined(AFX_BSTREE_H__F38B0EFF_C2C5_41A7_944F_53591BA67415__INCLUDED_)