C++ BinaryTree::get_root方法代码示例

int main()
{
    BinaryTree<int> *root = new BinaryTree<int>();
    //const unique_ptr<BinaryTreeNode<int>>& node = unique_ptr<BinaryTreeNode<int> root>->get_root();
    BinaryTreeNode<int> *node = new BinaryTreeNode<int>(); //& root;
    root->insert(3);
    root->insert(5);
    root->insert(7);
    root->insert(11);
    node = root->search(3); if (node) std::cout << "found " << node->key_value << std::endl;
    node = root->search(5); if (node) std::cout << "found " << node->key_value << std::endl;
    node = root->search(7); if (node) std::cout << "found " << node->key_value << std::endl;
    node = root->search(11); if (node) std::cout << "found " << node->key_value << std::endl;
    node = root->search(13); if (node) std::cout << "found " << node->key_value << std::endl;
    root->show();
    node = root->get_root();
    bool isbst = IsBST(node);
    std::cout << "isbst? " << (isbst ? "yes" : "no") << std::endl;
    return 0;
}

/* usage:  ./proj5 organisms.txt
 * *******************************************
 * Given a correct file the program takes a list of organisms and
 * constructs its ancestral tree based on the scores in the file.
 * The only output is the string parenthetical expression which
 * represents the closest organisms joined in a tuple of the form
 * ((dog,wolf),mountianGoat)
 *
 */
int main(int argc, char* argv[]){
	std::string addressFile="";
	/*
	 * If the program is ran without sufficient arguments it Will exit gracefully
	 * with suggestions for the usage of the program.
	 */
	if (argc < 2) {
		std::cerr << "Address File not Found\n";
		std::cerr << "Usage:  " << argv[0] << " adresses.txt" << std::endl;
		return -1;
	}

	addressFile=argv[1];
	std::ifstream inFile;
	inFile.open(addressFile.c_str()); // need to open the fileargv[1].c_str()

	if(!inFile){
		write_Log( "Valid File not found:  ** Exiting ** ");
		exit(1);
	}


	std::list< BinaryTree<Organism*> *> treeList;
	/****************************************
	 * Build a vector of Organisms from the file
	 ***********************************************/
	try {
		std::string str;
		std::vector<std::string> data;
		while(std::getline(inFile, str, '\n'))	{

			try{
				 data = split(str);
			}catch(...){
			    	write_Log("**********Exception Throw splitting string:  Line Skipped********");
			    	write_Log("Error Occured IN: "+str);
			    	continue;
			}
			//double score = std::stod (data[1]);
			Organism * toAdd = new Organism(data[0], atoi(data[1].c_str()));
			//Organism * toAdd = new Organism(data[0], score);
			BinaryTree<Organism*> * tree = new BinaryTree<Organism*> (toAdd);
			treeList.push_front(tree);
		}
	} catch(...){
		write_Log( "*********Exception thrown building Binary Trees: *********");
		write_Log("*********Please correct Invalid Input: ********************");
	}
	/********************************************
	 *Initial List of Binary Trees Built
	 *******************************************/
	//write_Log("Length of list of trees =  "+convertDigit(treeList.size()));

	/*******************************************************************
	 * Build LifeTree:
	 * *****************************************************************
	 */
	BinaryTree<Organism*> orgTree;
	buildOrgTree(treeList,orgTree);

	/*
	 *DISPLAY THE FINAL TREES ROOT NODE
	 */
	orgTree.in_order(display);
	write_Log("orgTree has heigh = " + convertDigit(orgTree.height()));
	write_Log(orgTree.get_root()->toString());
	return 0;
}

void print_tree(const BinaryTree& tree) {
    if (tree.get_root() == 0)
        return;
    print_tree(tree.get_root());
}