C++ (Cpp) BinarySearchTree::Print示例

示例#1

文件： is_balanced_tree.cpp 项目： FuckBaidu/FuckInterview

void Test1(BinarySearchTree<int> &tree) {
    tree.Print();
    if (!IsBalanced(tree.GetRoot()))
        printf("Not balanced\n");
    else
        printf("Balanced\n");
}

示例#2

文件： is_balanced_tree.cpp 项目： FuckBaidu/FuckInterview

void Test(BinarySearchTree<int> &tree) {
    tree.Print();
    if (GetBalancedTreeHeight(tree.GetRoot()) == -1)
        printf("Not balanced\n");
    else
        printf("Balanced\n");
}

示例#3

文件： construct_tree_from_postorder_inorder.cpp 项目： FuckBaidu/FuckInterview

int main() {
    int p[] = {3, 9, 5, 7, 20, 1};
    int i[] = {9, 3, 1, 5, 20, 7};
    std::vector<int> postorder(p, p + 6);
    std::vector<int> inorder(i, i + 6);
    Node<int> *root = BuildTree(postorder, inorder);
    BinarySearchTree<int> tree;
    tree._root = root;
    tree.Print();
}

示例#4

文件： unique_bst.cpp 项目： FuckBaidu/FuckInterview

int main() {
    assert(NumTrees(4) == 14);
    std::vector<Node<int>*> result = GenerateTrees(4);
    for (int i = 0; i < result.size(); i++) {
        BinarySearchTree<int> tree;
        tree._root = result[i];
        tree.Print();
        std::cout << std::endl;
    }
    return 0;
}