# include <iostream>
// #include <string> 
// #include <cmath>
// #include <cstdlib>
// #include <iomanip>
// #include <fstream>
// #include <vector>
//#include "../../../code/queue_stack_vip.h"
#include "queue_stack.h"
using namespace std;
# include "treenode.h"


void TreeInsert (treenode * root, int x){
	//create a new node
	treenode* n = new treenode;
	n->setvalue( x);
	//make it a leaf
	n->lchild = n->rchild = NULL;
	//look for a place in the tree to insert it
	treenode* e = root;
	while(1){
		cout<<"     --- val="<<x<<"    increase size of "<<e<<" ("<<e->getvalue()<<")"<<endl;
		e->size++;
		if (e->getvalue()<=x){
			if (e->rchild==NULL){
				e->rchild=n; n->parent=e; return;
			}
			e=e->rchild;
		}
	else if (e->getvalue()>x){
			if (e->lchild==NULL){
				e->lchild=n; n->parent=e; return;
			}
			e=e->lchild;
		}
	}
	
}





void TraversePreorder (treenode* node){//parent-lchild-rchild
	if (node==NULL) {cout<< "NULL."; return;}
	cout<<"  "<<"address="<<node<<"      value="<<node->getvalue();
	cout<<"\ngoing left ..."; TraversePreorder (node->lchild);
	cout<<"\ngoing right ..."; TraversePreorder (node->rchild);
}

void TraversePostorder (treenode* node){//lchild-rchild-parent
	if (node==NULL) {cout<< "NULL."; return;}	
	cout<<"\ngoing left ..."; TraversePostorder (node->lchild);
	cout<<"\ngoing right ..."; TraversePostorder (node->rchild);
	cout<<"  "<<"address="<<node<<"      value="<<node->getvalue();
}

void TraverseBFS(treenode* node){ //parent-(lchild-rchild) nonrecursive
	//build a qeue  with nodes in BFS order
//	treenode* Q[100]; int Qmax=1; Q[0]=node; int Qcurrent=0;
//	treenode* p;
	//use a que for processing nodes
	myqueue q; q.enqueue(node);
	treenode* p=NULL; 
	while (p=(treenode*)q.dequeue()) {
		cout<<"\n  "<<"address="<<p<<"      value="<<p->getvalue()<<"  size="<<p->size;
		if(p->lchild!=NULL) {q.enqueue((void*)(p->lchild));}
		if(p->rchild!=NULL) {q.enqueue((void*)(p->rchild));}
	}	
}

// treenode* SearchTree (treenode* root, int val){
// 	
// }

void DFS_nonrec(treenode* node){
		mystack q;
		q.push(node);
		treenode* e;
		while(e= (treenode*)q.pop()){
			cout<<"  "<<"address="<<e<<"      value="<<e->getvalue();
			if(e->rchild) q.push(e->rchild);
			if(e->lchild) q.push(e->lchild);
		}
}
int main(){
	
	// treenode* root = new treenode;
	// root->setvalue (100);
	// root->parent=NULL;
	// root->lchild=root->rchild=NULL;



	treenode* root = new treenode;



	
	// int v;
	// for (int i=0;i<10;i++){
	// 	cout<<"value=";cin>>v;
	// 	TreeInsert(root, v);
	// }
		TreeInsert(root, 19);
		TreeInsert(root, 10);
		TreeInsert(root, 25);
		TreeInsert(root, 1);
		TreeInsert(root, 12);
		TreeInsert(root, 20);
		TreeInsert(root, 22);
		TreeInsert(root, 20);
		TreeInsert(root, 40);
		TreeInsert(root, 120);
		TreeInsert(root, 110);
		TreeInsert(root, 130);
		TreeInsert(root, 140);
		TreeInsert(root, 150);
		TreeInsert(root, 115);
	
	//	return 0;
	cout<<"\n\n\n\n TRAVERSAL in INORDER\n";
	root->lchild->TraverseInorder();
	cout<<"\n\n";
//	return 0;
	cout<<"\n\n TRAVERSAL in PREORDER\n";
	TraversePreorder(root);

	
	cout<<"\n\n\n\n TRAVERSAL in POSTORDER\n";
	TraversePostorder(root);
	//return 0;	
	cout<<"\n\n\n\n TRAVERSAL BFS\n";
	TraverseBFS(root);	
	
	cout<<"\n\n\n\n\n\n\n\n TRAVERSAL DFS\n";
	DFS_nonrec(root);
	return 0;
}