二叉樹的結(jié)點(diǎn)定義PPT課件

1、2021/6/71二叉樹的結(jié)點(diǎn)定義二叉樹的結(jié)點(diǎn)定義typedef struct NodeDataType data;/*數(shù)據(jù)域數(shù)據(jù)域 */struct Node *leftChild;/*左子樹指針左子樹指針*/struct Node *rightChild;/*右子樹指針右子樹指針*/BiTreeNode;/*結(jié)點(diǎn)的結(jié)構(gòu)體定義結(jié)點(diǎn)的結(jié)構(gòu)體定義*/2021/6/72初始化操作初始化操作void Initiate(BiTreeNode *root)*root=(BiTreeNode*)malloc(sizeof(BiTreeNode);(*root)-leftChild=NULL;(*root)

2、-rightChild=NULL;2021/6/73BiTreeNode BiTreeNode * *InsertLeftNode(BiTreeNode InsertLeftNode(BiTreeNode * *curr,DataType x)curr,DataType x) BiTreeNode BiTreeNode * *s, s,* *t; t;if(curr=NULL) return NULL;if(curr=NULL) return NULL;t=curr-leftChild;/t=curr-leftChild;/* *保存原保存原currcurr所指結(jié)點(diǎn)的左子樹指針?biāo)附Y(jié)點(diǎn)的左子樹

3、指針* */ /s=(BiTreeNode s=(BiTreeNode * *)malloc(sizeof(BiTreeNode);)malloc(sizeof(BiTreeNode);s-data=x;s-data=x;/*若當(dāng)前結(jié)點(diǎn)curr為空，在curr的左子樹插入元素值為x的新結(jié)點(diǎn)*/*原curr所指結(jié)點(diǎn)的左子樹成為新插入結(jié)點(diǎn)的左子樹*/*若插入成功則返回新插入結(jié)點(diǎn)的指針，否則返回空指針*/2021/6/74 s-leftChild=t;/s-leftChild=t;/* *新插入結(jié)點(diǎn)的左子樹為原新插入結(jié)點(diǎn)的左子樹為原currcurr的左子樹的左子樹* */ /s-rightChild

4、=NULL;s-rightChild=NULL;curr-leftChild=s;/curr-leftChild=s;/* *新結(jié)點(diǎn)成為新結(jié)點(diǎn)成為currcurr的左子樹的左子樹* */ /return curr-leftChild;/return curr-leftChild;/* *返回新插入結(jié)點(diǎn)的指針返回新插入結(jié)點(diǎn)的指針* */ / 2021/6/75/*若當(dāng)前結(jié)點(diǎn)curr非空，在curr的右子樹插入元素值為x的新結(jié)點(diǎn)*/*原curr所指結(jié)點(diǎn)的右子樹成為新插入結(jié)點(diǎn)的右子樹*/*若插入成功返回新插入結(jié)點(diǎn)的指針，否則返回空指針*/BiTreeNode *InsertRightNode(BiT

5、reeNode *curr,DataType x)BiTreeNode *s,*t; if(curr=NULL) return NULL; t=curr-rightChild;/*保存原curr所指結(jié)點(diǎn)的右子樹指針*/s=(BiTreeNode *)malloc(sizeof(BiTreeNode);s-data=x;s-rightChild=t;/*新插入結(jié)點(diǎn)的左子樹為原curr的右子樹*/s-leftChild=NULL; curr-rightChild=s;/*新結(jié)點(diǎn)成為curr的右子樹*/return curr-rightChild;/*返回新插入結(jié)點(diǎn)的指針*/2021/6/76/*若

6、curr非空，刪除curr所指結(jié)點(diǎn)的左子樹*/*若刪除成功返回刪除結(jié)點(diǎn)的雙親結(jié)點(diǎn)指針，否則返回空指針*/BiTreeNode *DeleteLeftTree(BiTreeNode *curr)if(curr=NULL|curr-leftChild=NULL) return NULL; curr-leftChild=NULL; return curr;2021/6/77/*若curr非空，刪除curr所指結(jié)點(diǎn)的右子樹*/*若刪除成功返回刪除結(jié)點(diǎn)的雙親結(jié)點(diǎn)指針，否則返回空指針*/BiTreeNode *DeleteRightTree(BiTreeNode *curr)if(curr=NULL|curr-rightChild=NULL) return NULL; curr-righttChild=NULL; return curr;2021/6/78釋放內(nèi)存空間BiTreeNode *DeleteRightTree(BiTreeNode *curr)if(curr