strtree.h

本代码演示了平衡排序二叉树的实现

#if !defined(AFX_STRTREE_H__26F7C3EB_5B0E_417F_8350_A1FD8691B6B1__INCLUDED_)
#define AFX_STRTREE_H__26F7C3EB_5B0E_417F_8350_A1FD8691B6B1__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif
#include<iostream>
#include"auto.h"
namespace tree{
	auto_arr<int>	tree_1(int num,std::istream&i=std::cin);/*get string of tree*/
	void			tree_2(int*tree,std::ostream&o=std::cout);/*print string of tree*/
	bool			tree_3(int*tree);/*test the tree's validity*/
	auto_arr<int>	tree_4(int*tree);/*change string of tree to edge of tree*/
	void			tree_5(int *edges,std::ostream&o=std::cout);/*print edge of tree*/
	auto_arr<int>	tree_6(int*edges);/*change edge of tree to string of tree*/
	auto_arr<int>	tree_7(int num,std::istream&i=std::cin);/*get edge of tree without check*/
}
#endif