2016/11/10 1002. 二叉查找树的遍历

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#include <iostream>
using namespace std;
class Node
{
public:
	Node(int a = 0)
	{
		v = a;
		left = nullptr;
		right = nullptr;
	}
	Node *left;
	Node *right;
	int v;
};
class Tree
{
public:
	Tree(int a=0)
	{
		root = new Node(a);
	}
	void insert(int a)
	{
		Node* p = root;
		for (;;)
		{
			if (a > p->v)
			{
				if (p->right == nullptr)
				{
					p->right = new Node(a);
					break;
				}
				else
				{
					p = p->right;
					continue;
				}
			}
			if (a < p->v)
			{
				if (p->left == nullptr)
				{
					p->left = new Node(a);
					break;
				}
				else
				{
					p = p->left;
					continue;
				}
			}
		}
	}
	Node *root;
};
void inorder(Node *root)
{
	if (root == nullptr)
	{
		return;
	}
	inorder(root->left);
	cout << root->v << " ";
	inorder(root->right);
}
void preorder(Node *root)
{
	if (root == nullptr)
	{
		return;
	}
	cout << root->v << " ";
	preorder(root->left);
	preorder(root->right);
}
int main()
{
	int t;
	for (;;)
	{
		cin >> t;
		if (t == 0)break;
		int temp;
		cin >> temp;
		Tree T(temp);
		for (int i = 2; i <= t; i++)
		{
			int a;
			cin >> a;
			T.insert(a);
		}
		inorder(T.root);
		cout << endl;
		preorder(T.root);
		cout << endl;
	}
}