Tree Node In Data Structure Using C++

Data Structure Using C++

Tree Data Structure

Tree Node

class treeNode
{
 private:
  int info;
  treeNode* left;
  treeNode* right;
 public:
  // constructors
        treeNode();
        treeNode(int i);
        void setInfo(int i);
 int getInfo();
 void setLeft(treeNode *l);
 treeNode* getLeft();
 void setRight(treeNode *r);
 treeNode* getRight();      
 int isLeaf();

};
// constructors
treeNode::treeNode() 
{
 left=NULL;
 right=NULL;
}
treeNode::treeNode(int i) 
{
 info=i;
 left=NULL;
 right=NULL;
}
int treeNode::getInfo() 
{ 
 return info; 
}
void treeNode::setInfo(int i) 
{ 
 info=i;
}
treeNode* treeNode::getLeft() 
{ 
 return left; 
}
void treeNode::setLeft(treeNode *l) 
{ 
 left=l;
}
treeNode* treeNode::getRight() 
{ 
 return right; 
}
void treeNode::setRight(treeNode *r) 
{ 
 right=r;
}     
int treeNode::isLeaf( )
{
 if(left==NULL&& right==NULL ) 
     return 1;
 return 0;
}

Let me know in the comment section if you have any question.

Previous Post:
Queue Template Using Linked List In Data Structure Using C++

Next Post:

Tree Node Template In Data Structure Using C++