test0.hh

Go to the documentation of this file.

 
#ifndef INCLUDE_TEST0_HH_
#define INCLUDE_TEST0_HH_
 
#include "Tree.h"
#include <ctime>
#include <fstream>
#include <iostream>
 
namespace Tree
{
 
static bool GenTreeData(const char *_file_path = "./test0.txt", const char *empty_flag = "@")
{
    std::string file_path(_file_path);
 
    // 调用DOS命令，询问是否删除文件
    std::string cmd = std::string("DEL /P \"") + file_path + '"';
    system("@echo on");
    system("echo We are trying to delete some files, which will be created later.");
    system("pause");
    system(cmd.c_str());
    // system((std::string("IF NOT EXIST ") + '"' + file_path + "\" (").c_str());
    // system("echo File has been deleted!");
    // system(") ELSE (");
    // system("echo Fail to delete files!");
    // system(")");
    // system("pause");
 
    // 检查文件是否存在且可读
    std::ifstream fin(file_path.c_str(), std::ios_base::in);
    if (fin.good())
    {
        std::cerr << "文件已存在！\n";
        fin.close();
 
        system("pause");
        return true;
    }
 
    // 文件不存在或不可读，尝试新建
    std::ofstream fout(file_path.c_str(), std::ios_base::out);
    if (fout.fail())
    {
        std::cerr << "无写权限，文件生成失败！\n";
 
        system("pause");
        return false;
    }
    fout << "A\n"
         << "L\tC\n"
         << "B\tE\t" << empty_flag << "\tD\n"
         << empty_flag << '\t' << empty_flag << '\t' << empty_flag << '\t' << empty_flag << '\t' << "W\t" << empty_flag << '\n'
         << empty_flag << "\tX\n"
         << empty_flag << '\t' << empty_flag << std::endl;
 
    // 检查是否生成成功
    if (fout.good())
    {
        system("echo File created successfully!");
        fout.close();
        system("pause");
        return true;
    }
 
    std::cerr << "无法生成文件！\n";
    system("pause");
    return false;
}
 
template <typename T, typename Comparator>
static void print_test_result(const binaryTree<T, Comparator> &binary_tree, const typename binaryTree<T, Comparator>::value_type &flag, std::ostream &out = std::cout)
{
    out << "二叉树的规模(递归 非递归)：\n"
        << binary_tree.size() << ' ' << binary_tree.size_loop();
    out << "\n二叉树的高(深)度(递归 非递归)，从0起：\n"
        << binary_tree.height() << ' ' << binary_tree.height_loop();
    out << "\n前序遍历(递归)：\n";
    binary_tree.preOrder(out);
    out << "\n前序遍历(非递归)：\n";
    binary_tree.preOrder_loop(out);
    out << "\n中序遍历(递归)：\n";
    binary_tree.inOrder(out);
    out << "\n中序遍历(非递归)：\n";
    binary_tree.inOrder_loop(out);
    out << "\n后序遍历(递归)：\n";
    binary_tree.postOrder(out);
    out << "\n后序遍历(非递归)：\n";
    binary_tree.postOrder_loop(out);
    out << "\n层次遍历：\n";
    binary_tree.levelOrder(out);
    out << "\n层次打印(调用lchild(), rchild(), root()等API)：\n";
    printBinaryTree(binary_tree, flag, out);
}
 
} // namespace Tree
 
#endif /* INCLUDE_TEST0_HH_ */