#ifndef TREE_H
#define  TREE_H
#include <stdio.h>
#include "list.h"
#define LEN 1000
#define MAX_LEVEL 5
class tree_node:public list
{
	private:
	tree_node *child;
	tree_node *brother;
	public:
	tree_node(){child=0;brother=0;}
	tree_node( const tree_node &x):list(x) {child=0;brother=0;}
	~tree_node(){child=0;brother=0;}
	tree_node & operator=(const tree_node &x)
	{
		*(list*)this=x;
		child=0;
		brother=0;
		return *this;
	}
	friend class tree;
};

class tree
{
	private:
	tree_node *root;
	tree_node *curr;
	public:
	tree(){root=0;curr=0;}
	~tree();
	int operator < (const tree & b);
	int operator > (const tree & b);
	int operator == (const tree & b);
	void del(tree_node *root);
	void insert(tree_node *root,tree_node * add);
	int read(FILE *fp,int n1=1,int n2=1,int n3=1);
	void print(FILE *fp,tree_node *root,int level,int kol_level,int n2,int n3);
	int go_to_child();
	int go_to_brother();
	int go_to_root();
	int del_child();
	int del_brother();
	int del_root();
	int del_child_subtree();
	int del_brother_subtree();
	int add_child(tree_node *add);
	int add_brother(tree_node *add);
	int add_root(tree_node *add);
	void print_current(FILE *fp,int n2,int n3);
	void menu();

};
void print_menu_tree();
#endif