使用C++链表实现二叉树的存储及基本操作

#include "Node.h" #include <iostream> using namespace std; Node::Node(){ index = 0; data = 0; pLChild = NULL; pRChild = NULL; } Node* Node::searchNode(int nodeIndex){ if(this->index == nodeIndex) return this; Node *temp = NULL; if(this->pLChild != NULL){ if(this->pLChild->index == nodeIndex) return this->pLChild; else{ temp = this->pLChild->searchNode(nodeIndex); if(temp != NULL){ /**在左孩子中找到了要找的节点返回，没找到不返回，继续寻找右孩子**/ return temp; } } } if(this->pRChild != NULL){ if(this->pRChild->index == nodeIndex) return this->pRChild; else{ temp = this->pRChild->searchNode(nodeIndex); return temp; } } return NULL; } void Node::delNode(){ if(this->pLChild != NULL) this->pLChild->delNode(); if(this->pRChild != NULL) this->pRChild->delNode(); /****/ if(this->pParent != NULL){ if(this->pParent->pLChild == this) this->pParent->pLChild = NULL; if(this->pParent->pRChild == this) this->pParent->pRChild = NULL; } delete this; } void Node::preOrderTraverse(){ cout<<this->index<<" "<<this->data<<endl; if(this->pLChild != NULL) this->pLChild->preOrderTraverse(); if(this->pRChild != NULL) this->pRChild->preOrderTraverse(); } void Node::midOrderTraverse(){ if(this->pLChild != NULL) this->pLChild->midOrderTraverse(); cout<<this->index<<" "<<this->data<<endl; if(this->pRChild != NULL) this->pRChild->midOrderTraverse(); } void Node::postOrderTraverse(){ if(this->pLChild != NULL) this->pLChild->postOrderTraverse(); if(this->pRChild != NULL) this->pRChild->postOrderTraverse(); cout<<this->index<<" "<<this->data<<endl; }