main.cpp

来自「C++写的二叉树类」· C++ 代码 · 共 26 行

#include "stdafx.h"
#include "BiTree.h"
#include "BSTNode.h"

void main()
{
	BSTree T=NULL;
//	BiTree T=NULL;
	int data;
	BOOL taller=TRUE;
	freopen("input.txt","r",stdin);
	scanf("%d",&data);
	while(data!=-1)
	{
		BSTNode::InsertAVL(&T,data,taller);
//		Tree::InsertBST(&T,data);
		scanf("%d",&data);
	}
	BSTNode::InOrderTraverse(T);
//	Tree::InOrderTraverse(T);
	cout<<endl;
	int TotalLen=0,n=0;
	BSTNode::ASL(T,1,TotalLen,n);
//	Tree::ASL(T,1,TotalLen,n);
	cout<<"\nASL="<<(float)TotalLen/n<<endl;
}