bintree.cpp

来自「经典c++程序的实现」· C++ 代码 · 共 25 行

#include <iostream.h>
#include <stdlib.h>
#include <assert.h>

#include "..\include\book.h"

typedef int BELEM;

#include "..\include\bintree.h"

BinNode* BinNode::freelist = NULL;

void* BinNode::operator new(size_t) { // Overload new
  if (freelist == NULL) return ::new BinNode; // Create new space
  BinNode* temp = freelist;       // Otherwise, get from freelist
  freelist = freelist->left;
  return temp;                    // Return the link node
}

void BinNode::operator delete(void* ptr) { // Overload delete
  ((BinNode*)ptr)->left = freelist;  // Put on freelist
  freelist = (BinNode*)ptr;
}