資料結構之樹的學習

一顆樹的深度等於他的最深的樹葉的深度,該深度總是等於這棵樹的高.

樹節點的宣告

typedef struct treenode *ptrtonode;

struct treenode

;二叉樹節點宣告

typedef struct treenode *ptrtonode;

tyedef struct ptrtonode tree;

struct treenode

;是二叉樹成為二叉查詢樹的性質是:對於樹中的每乙個節點x,他的左子樹的所有關鍵字值

小於x的關鍵字值.而他的右子樹中所有關鍵字的值大於x的關鍵字值.

二叉查詢樹的宣告

#ifndef _tree-h

struct treenode;

typedef struct treenode *position;

typedef struct treenode *searchtree;

searchtree makeempty(searchtree t);

position find(elementtype x,searchtree t);

position findmin(searchtree t);

positon  findmax(searchtree  t);

searchtree  insert(elementtype x,searchtree t);

searchtree  delete(elementtype x,serachtre t);

elementtype retrieve(position p);

#endif

struct treemode

;建立一顆空的二叉樹

searchtree makeempty(seachtree t)

return null;

}二叉查詢樹的find操作

position find(elementtype x,searchtree t)

對二叉查詢樹的findmin的遞迴實現

position findmin(searchtree t)

對而查詢樹的findmax的非遞迴實現

position findmax(searchtree t)

插入元素到二叉查詢樹的

searchtree insert(elementtype x,searchtree t)

}else

if(xelement)

t->left=insert(x,t->left);

else 

if(x>t->element)

t->right=insert(x,t->right);

return t;

}二叉查詢樹的刪除

searchtree delete(elementtype x,searchtree t)

else

return t;