二叉查找树的游标实现

数据结构与算法分析——c语言描述 练习4.11  答案

翻译错了，翻译成指针实现。看了英文原版。

tree.h

typedef int ElementType;
#define SpaceSize 100  
#ifndef _Tree_H
#define _Tree_H



typedef int PtrToNode;
typedef PtrToNode Position;
typedef PtrToNode SearchTree;

void initializeCursorSpace(void);

void makeEmpty(SearchTree t);
Position find(ElementType X, SearchTree t);
Position findMin(SearchTree t);
Position findMax(SearchTree t);
SearchTree insert(ElementType X, SearchTree t);
SearchTree Delete(ElementType X, SearchTree t);
ElementType Retrieve(Position p);
void Dir(SearchTree t);
#endif

tree.c

#include"tree.h"
#include"fatal.h"

struct TreeNode {
	ElementType element;
	SearchTree left;
	SearchTree right;
};

struct TreeNode cursorSpace[SpaceSize];

static PtrToNode cursorNew() {
	PtrToNode p;
	p = cursorSpace[0].le