用二叉排序树求解逆序数

本文代码为自己所写，思路参照博文：http://www.cppblog.com/myjfm/archive/2012/09/15/190772.html

#include<iostream>
using namespace std;
struct BST
{
	int value;//数
	int num_right_subtree;//右子树中结点个数
	BST* Left;
	BST* Right;
	BST(int num)//构造函数
	{
		value=num;
		num_right_subtree=0;
		Left=NULL;
		Right=NULL;
	}
};
int Build_tree(BST *root,int num)
{
	int num_of_inversions=0;
	BST *temp=new BST(num);
	while(root)
	{
		if(temp->value<root->value)
		{
			num_of_inversions+=root->num_right_subtree+1;
			if(root->Left==NULL)
			{
				root->Left=temp;
				break;
			}
			else
				root=root->Left;
		}
		else
		{
			root->num_right_subtree++;
			if(root->Right==NULL)
			{
				root->Right=temp;
				break;
			}
			else
				root=root->Right;
		}
	}
	return num_of_inversions;
}
void Release_tree(BST *root)
{
	if(root)
	{
		Release_tree(root->Left);
		Release_tree(root->Right);
	}
	delete root;
}
void pre_traversal(BST *root)
{
	if(root)
	{
		pre_traversal(root->Left);
		cout<<root->value<<' ';
		pre_traversal(root->Right);
	}
}
int main()
{
	int n;
	int *tt;
	int i;
	int N_inversions;
	while(cin>>n && n>0)
	{
		N_inversions=0;
		tt=new int[n];
		cin>>tt[0];
		BST *root=new BST(tt[0]);
		for(i=1;i<n;i++)
		{
			cin>>tt[i];
			N_inversions+=Build_tree(root,tt[i]);
		}
		pre_traversal(root);
		cout<<endl;
		cout<<"The number of inversions is :"<<N_inversions<<endl;
		Release_tree(root);
		delete []tt;
	}
	return 0;
}