View difference between Paste ID: if6HPgUW and rPF65AF7

-// ConsoleApplication4.cpp : 定義主控台應用程式的進入點。
+// ConsoleApplication2.cpp : 定義主控台應用程式的進入點。
 //
 
 #include "stdafx.h"
 #include <iostream>
 using namespace std;
 
 class treenode
 {
 public:
-	int value=NULL;
+	int data;
-	treenode *l=NULL, *r=NULL;
+	treenode *l, *r;
 	treenode(int in){
 		data = in;
-class tree
+		this->l = NULL;
 		this->r = NULL;
 	}
-	void append(int);
+
-	void InOrder(treenode*);
+
-	void PreOrder(treenode*);
+class Btree
-	void PostOrder(treenode*);
+
-	treenode *root = new(treenode);
+
-private:
+	treenode *root;
 	Btree(){ root = NULL; }
 	void Add_TreeNode(int);
-void tree::append(int in)
+	void in_order(treenode *pos);
 	void pre_order(treenode *pos);
-	treenode* pos = root;
+	void post_order(treenode *pos);
-	if (root->value == NULL)
+	void delnode(int value);
 };
-		root->value = in;
+
-		cout << "append " << in << " to root" << endl;
+void Btree::Add_TreeNode(int value)
-		goto end;
+
 	//cout << "root:" << root << endl;
 	if (root == NULL)
 	{
-		if (pos->value < in)
+		root = new treenode(value);
 		cout << "root value=" << root->data << endl;
-			if (pos->l != NULL)
+
 	else
-				pos = pos->l;
+
 		//cout << "rootvalue" << root->data << endl;
 		//cout << "rootl:" << root->l << endl;
 		treenode *pos = root;
-				pos->l = new(treenode);
+		while (true)
-				pos->l->value = in;
+
-				cout << "append " << in << endl;
+			/*
-				goto end;
+			cout << "posl:" << pos->l << endl;
 			cout << "posr:" << pos->r << endl;
 			cout << "pos=" << pos << endl;
-		else if (pos->value > in)
+			*/
 			if (value < pos->data)
-			if (pos->r != NULL)
+
 				if (pos->l != NULL)
-				pos = pos->r;
+				{
 					pos = pos->l;
 				}
 				else
-				pos->r = new(treenode);
+				{
-				pos->r->value = in;
+					pos->l = new treenode(value);
-				cout << "append " << in << endl;
+					cout << "add " << value << " at " << pos->l << endl;
-				goto end;
+					return;
 				}
 			}
 			else
 			{
-			cout << pos->value << ' ' << in;
+				if (pos->r != NULL)
-			cout << "append same value\n";
+				{
-			goto end;
+					pos = pos->r;
 				}
 				else
-	end:
+				{
 					pos->r = new treenode(value);
 					cout << "add " << value << " at " << pos->r << endl;
 					return;
-void tree::InOrder(treenode *pos)
+				}
 			}
 		}
 	}
-		InOrder(pos->l);
+
-		cout << '[' << pos->value << ']';
+
-		InOrder(pos->r);
+void Btree::in_order(treenode *pos)
 {
 	if (pos != NULL)
 	{
-void tree::PreOrder(treenode *pos)
+		in_order(pos->l);
 		cout << "[" << pos->data << "]";
 		in_order(pos->r);
 	}
-		cout << '[' << pos->value << ']';
+
-		PreOrder(pos->l);
+void  Btree::pre_order(treenode *pos)
-		PreOrder(pos->r);
+
 	if (pos != NULL)
 	{
-void tree::PostOrder(treenode *pos)
+		cout << "[" << pos->data << "]";
 		pre_order(pos->l);
 		pre_order(pos->r);
 	}
-		PostOrder(pos->l);
+
-		PostOrder(pos->r);
+
-		cout << '[' << pos->value << ']';
+void  Btree::post_order(treenode *pos)
 {
 	if (pos != NULL)
 	{
 		post_order(pos->l);
 		post_order(pos->r);
-	tree ta;
+		cout << "[" << pos->data << "]";
-	ta.append(50);
+
-	ta.append(40);
+
-	ta.append(30);
+
-	ta.append(45);
+void Btree:: delnode(int value)
-	ta.append(48);
+
-	ta.append(65);
+	cout << "pop " << value << endl;
-	ta.append(70);
+	treenode *pos = root,*del=pos;
-	ta.InOrder(ta.root);
+	if (root == NULL)
 	{
-	ta.PreOrder(ta.root);
+		cout << "empty tree\n";
 		return;
-	ta.PostOrder(ta.root);
+
 	while (true)
 	{
 		if (del == NULL)
 		{
 			cout << "can't find this value\n";
 			return;
 		}
 		else if (del->data != value)
 		{
 			pos = del;
 			if (value>del->data)
 				del = del->r;
 			else
 				del = del->l;
 		}
 		else
 		{
 			if (del->l == NULL&&del->r == NULL)
 			{
 				cout << "delete" << del->data << endl;
 				delete del;
 			if (value > pos->data)
 				pos->r = NULL;
 			else
 				pos->l = NULL;
 			return;
 			}
 
 		}
 	}
 }
 
 int main()
 {
 	Btree tr1;
 	const int listnum = 6;
 	int list[listnum] = {8,17,31,9,98,12};
 	for (int i = 0; i < listnum; i++)
 		tr1.Add_TreeNode(list[i]);
 	cout << "inorder:";
 	tr1.in_order(tr1.root);
 	cout << "\npreorder:";
 	tr1.pre_order(tr1.root);
 	cout << "\npostorder:";
 	tr1.post_order(tr1.root);
 	cout << endl;
 
 	tr1.delnode(9);
 	return 0;
 }