BJFUOJ-290

基于非递归的二叉排序树的结点的查找和插入

#include<iostream>
#include<stack>
using namespace std;
typedef struct TreeNode {
	int data;
	int count;
	TreeNode* llink;
	TreeNode* rlink;
	TreeNode() :data(0), count(0), llink(nullptr), rlink(nullptr){}
	TreeNode(int x) :data(x), count(0), llink(nullptr), rlink(nullptr) {}
}TreeNode,*BiTree;


int syn = 0;
int n = 0;
int l = 0;

BiTree CreateBST(int n) {
	TreeNode* root = nullptr;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		if (i == 0) {
			root = new TreeNode(x);
		}
		else {
			TreeNode* p = root;
			TreeNode* pre = p;
			int flag = 0;
			while (p) {
				if (x >= p->data) {
					pre = p;
					flag = 1;
					p = p->rlink;
				}
				else {
					pre = p;
					flag = 0;
					p = p->llink;
				}
			}
			if (flag == 1) pre->rlink = new TreeNode(x);
			else pre->llink = new TreeNode(x);
		}
	}

	return root;
}
void find_x_else_insert(BiTree T, int x) {
	if (T == nullptr) return;
	TreeNode* p = T;
	TreeNode* pre = p;
	int flag = 0;
	
	while (p) {
		if (p->data == x) {
			p->count++;
			syn = 1;
			break;
		}
		pre = p;
		if (x > p->data) {
			flag = 1;
			p = p->rlink;
		}
		else if (x < p->data) {
			flag = 0;
			p = p->llink;
		}

	}
	if (syn == 0) { //要插入
		if (flag == 1) pre->rlink = new TreeNode(x);
		else pre->llink = new TreeNode(x);
	}
	

}


void InOrder(BiTree T) {
	if (T == nullptr) return;
	InOrder(T->llink);
	cout << T->data;
	if (++l < n) {
		cout << " ";
	}
	InOrder(T->rlink);
}
void InOrder_count(BiTree T) {
	if (T == nullptr) return;
	InOrder_count(T->llink);
	cout << T->count;
	if (++l < n) {
		cout << " ";
	}
	InOrder_count(T->rlink);
}

int main() {
	
	while (cin >> n && n != 0) {
		BiTree T = CreateBST(n);
		
		int x;
		cin >> x;
		find_x_else_insert(T, x);
		if (syn == 0) n++;

		InOrder(T);
		cout << endl;

		l = 0;
		InOrder_count(T);
		cout << endl;

		syn = 0;
		l = 0;
		
	}


	return 0;
}