#include <iostream.h>
typedef int labeltype;
struct element{
	labeltype label;
	element *left, *right;};
typedef element cvor;
typedef element btree;

cvor LeftChildB(cvor c, btree *stablo){
	return *c.left;
};
cvor RightChildB(cvor c, btree *stablo){
	return *c.right;
};
labeltype LabelB(cvor c, btree *stablo){
	return c.label;
};
void ChangeLabelB(labeltype x, cvor c, btree *stablo){
	c.label=x;
};
void CreateLeftB(labeltype x, cvor c, btree *stablo){
	if(c.left==NULL){
		cvor *p=new cvor;
		c.left=p;
		p->left=NULL;
		p->right=NULL;
		return;
	}
	else { cout <<"Lijevo dijete tog cvora vec postoji"<<endl;
		return;
	}
};
void CreateRightB(labeltype x, cvor c, btree *stablo){
	if(c.right==NULL){
		cvor *p=new cvor;
		c.right=p;
		p->left=NULL;
		p->right=NULL;
		return;}
	else { cout <<"Desno dijete tog cvora vec postoji"<<endl;
		return;}
};
cvor RootB(btree *stablo){
	return *stablo;};
void DelB(cvor *c, btree *stablo){
	if(c->left) DelB(c->left,stablo);
	if(c->right) DelB(c->right,stablo);
	delete c;
};
void DeleteB(cvor c, btree *stablo){
	cvor p;
	if(c.left!=NULL) DelB(c.left,stablo);
	if(c.right!=NULL) DelB(c.right,stablo);
	p=ParentB(c,stablo);
	if(p.left==&c) p.left=NULL;
	else p.right=NULL;
	delete &c;
};
void InitB(btree *stablo, labeltype x){
	cvor *p=new element;
	p->left=NULL;
	p->right=NULL;
	p->label=x;
	stablo=p;
};
//ParentB nedostaje