bstree.cpp

来自「我的红黑树的c++实现。主要特点是可以用dot工具把红黑树画出来」· C++ 代码 · 共 50 行

// file bstree.cpp
//created by alpha 2008.11.3

#include <iostream>
#include "../headers/bstree.h"

using namespace std;

bstree::bstree()
{
	root = NULL;
}

bool bstree::insert(int key)
{
	bstnode* p = root;
	bstnode* q = NULL;
	while(p)
	{
		q = p;
		if (key == p->key) return false;
		if (key < p->key) p = p->lchild;
		else p = p->rchild;
	}
	p = new bstnode;
	p->lchild = p->rchild = NULL;
	p->key = key;
	if (!root) root = p;
	else if (key < q->key) q->lchild = p;
		else q->rchild = p;
	return true;
}

bool bstree::delNode(int key)
{
	return true;
}

bstnode *bstree::find(int key)
{
	bstnode *node = root;
	while(node)
	{
		if( key == node->key) return node;
		if( key < node->key) node = node->lchild;
		else node = node->rchild;
	}
	return NULL;
}