zoukankan      html  css  js  c++  java
  • CSUOJ 1005 Binary Search Tree analog

    Description

    Binary Search Tree, abbreviated as BST, is a kind of binary tree maintains the following property:

    1. each node has a Key value, which can be used to compare with each other.
    2. For every node in the tree, every Key value in its left subtree is smaller than its own Key value.
    3. For every node in the tree, every Key value in its right subtree is equal to or larger than its own Key value.

    Now we need to analog a BST, we only require one kind of operation: inserting.

    First, we have an empty BST. Input is a sequence of numbers. We need to insert them one by one flowing the rules below:

    If the inserted value is smaller than the root's value, insert it to the left subtree.

    If the inserted value is larger than or equal to the value of the root's value, insert it to the right subtree.

    After each input, we need to output the preorder, inorder, postorder traversal sequences.

    About tree traversal, the following is from Wikipedia:

    Depth-first Traversal

    To traverse a non-empty binary tree in preorder, perform the following operations recursively at each node, starting with the root node:

    • Visit the root.
    • Traverse the left subtree.
    • Traverse the right subtree.

    To traverse a non-empty binary tree in inorder (symmetric), perform the following operations recursively at each node:

    • Traverse the left subtree.
    • Visit the root.
    • Traverse the right subtree.

    To traverse a non-empty binary tree in postorder, perform the following operations recursively at each node:

    • Traverse the left subtree.
    • Traverse the right subtree.
    • Visit the root.

    Look at the folowing example:

    Intput is a sequence of 5 integers: 3 6 9 5 1

    After each integer inserted the structure of the tree is illustrated in the flowing:

       3
     /   
    1      6
         /  
        5     9

    Input

    The first integer of the input is T, the number of test cases.Each test case has two lines.The first line contain an integer N,(1<=N<=1000), the number of numbers need to be inserted into the BST.The second line contain N integers separated by space, each integer is in the range of [0,230].

    Output

    Each test case, output must contain three lines: the preorder, inorder and postorder traversal sequence. The numbers in each line should be separated by a single space and you should not output anything at the end of the line! Output a blank line after each case.

    Sample Input

    1
    5
    3 6 9 5 1
    

    Sample Output

    3 1 6 5 9
    1 3 5 6 9
    1 5 9 6 3
    

    Hint


    思路:建立二叉树,在树上搜索
    #include<stdio.h>
    #include<string.h>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    #define MAXN 1005
    int pre[MAXN], in[MAXN], post[MAXN];
    int cnt;
    struct node{
    	int element;
    	node* left;
    	node* right;
    };
    node* insert(node* t, int x)
    {
    	if (t == NULL)
    	{
    		t = (node*)malloc(sizeof(node));
    		t->element = x;
    		t->right = t->left = NULL;
    	}
    	else if (x < t->element)
    	{
    		t->left = insert(t->left, x);
    	}
    	else if (x >= t->element)
    	{
    		t->right = insert(t->right, x);
    	}
    	return t;
    }
    void preoder(node* t)
    {
    	if (t == NULL)
    		return;
    	pre[cnt++] = t->element;//根
    	preoder(t->left);
    	preoder(t->right);
    }
    void inorder(node* t)
    {
    	if (t == NULL)
    		return;
    	inorder(t->left);
    	in[cnt++] = t->element;//根
    	inorder(t->right);
    }
    void postorder(node* t)
    {
    	if (t == NULL)
    		return;
    	postorder(t->left);
    	postorder(t->right);
    	post[cnt++] = t->element;//根
    }
    void print(int *x,int n)
    {
    	printf("%d", x[0]);
    	for (int i = 1; i < n; i++)
    		printf(" %d", x[i]);
    	printf("
    ");
    }
    int main()
    {
    	int T,n,x;
    	while (~scanf("%d", &T))
    	{
    		while (T--)
    		{
    			scanf("%d", &n);
    			node* tree=NULL;
    			for (int i = 0; i < n; i++)
    			{
    				scanf("%d", &x);
    				tree=insert(tree, x);
    			}
    			cnt = 0; preoder(tree);
    			cnt = 0; inorder(tree);
    			cnt = 0; postorder(tree);
    			print(pre,n); print(in,n); print(post,n);
    			cout << endl;
    		}
    	}
    	return 0;
    }
    /**********************************************************************
    	Problem: 1005
    	User: leo6033
    	Language: C++
    	Result: AC
    	Time:32 ms
    	Memory:2828 kb
    **********************************************************************/
    

  • 相关阅读:
    一:Storm集群环境搭建
    八:Zookeeper开源客户端Curator的api测试
    七:zooKeeper开源客户端ZkClient的api测试
    六:ZooKeeper的java客户端api的使用
    Redis(四):常用数据类型和命令
    Spring Cloud分布式微服务系统中利用redssion实现分布式锁
    @Controller和@RestController的区别?
    可伸缩系统架构探讨
    可扩展架构系统的探讨
    @ExceptionHandler异常统一处理
  • 原文地址:https://www.cnblogs.com/csu-lmw/p/9124454.html
Copyright © 2011-2022 走看看