#include <iostream>
#include "bintre.h"

int main () {

	int  tall[12] = { 9, 55, 4, 6, 8, 1, 3, 25, 56, 15, 108, 66	};



	Bintre bintre();

	for (int i; i < 12; i++) {
		bintre.NewNode(tall[i]);
	}

		return 0;
}

---------

#ifndef _BINTRE_H
#define _BINTRE_H
#include <cstdlib>
#include "Node.h"

class Bintre {

public:
	Node *rotnode;

	Bintre();
	void NewNode(int tall);
	void InsertNode(Node* &treeNode, Node *newNode);
private:



};

#endif

-----------------------

#include "bintre.h"


Bintre::Bintre(){
	rotnode = NULL;
}

void Bintre::NewNode(int tall){

	Node *node = new Node(tall);

	InsertNode(rotnode, node);
}

void Bintre::InsertNode(Node* &treeNode, Node *newNode){

	if (treeNode == NULL) {
		treeNode = newNode;
	}

	else if (newNode ->key < treeNode->key){
		InsertNode(treeNode->left, newNode);
	}
	else {
		InsertNode(treeNode->right, newNode);
	}


}

---------------------

#ifndef _NODE_H
#define _NODE_H

class Node {

public:
	Node();
	Node(int verdi);
	Node *left;
	Node *right;
	int key;
};

#endif

--------------------

#include "Node.h"

Node::Node(){

}

Node::Node(int verdi){
	key = verdi;
}