📄 bintreenode.h
字号:
#ifndef BinTreeNode_H
#define BinTreeNode_H
#include<iostream.h>
template <class T>
class BinaryTree;
template <class T>
class BinTreeNode{
friend class BinaryTree<T>;
private:
BinTreeNode<T> *leftChild,*rightChild;
T data;
int Flag;
public:
BinTreeNode():leftChild(NULL),rightChild(NULL),Flag(0){}
BinTreeNode(T item,int flag=0,BinTreeNode<T> *left=NULL,
BinTreeNode<T> *right=NULL):data(item),Flag(flag),leftChild(left),rightChild(right){}
T GetData() const {return data;}
int GetFlag() const {return Flag;}
BinTreeNode<T>* Getleft() const {return leftChild;}
BinTreeNode<T>* Getright() const {return rightChild;}
void SatData(const T& item) {data = item;}
void SatFlag(const T& item) {Flag = item;}
void SetLeft(BinTreeNode<T> *L) {leftChild = L;}
void SetRight(BinTreeNode<T> *R) {rightChild = R;}
int IsLeaf(){return this->rightChild==NULL
&&this->leftChild==NULL&&this!=NULL?1:0;}
};
#endif
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -