Esempi in C++ (Cpp) per printTreeLevelOrder

Esempio n. 1

File: main.c Progetto: cengek/CKDatastruct

int main() {
    tree T;
    makeTree( &T, 'A');
	addChild(T.root, 'B');
    addChild(T.root, 'C');
    addChild(T.root, 'D');
    addChild(T.root->child, 'E');
    addChild(T.root->child, 'F');
   addChild(T.root->child->sibling, 'G');

    printf("Level Order\n");
	printTreeLevelOrder(T.root);
    printf("\n");
    return 0;
}

Esempio n. 2

File: MergeTwoBinaryTrees.cpp Progetto: alvas/ms_interview_100

int main()
{
    Solution sln;
    vector<string> v1 = {"1", "3", "2", "5"};
    vector<string> v2 = {"2", "1", "3", "#", "4", "#", "7"};
    TreeNode *root1 = nullptr, *root2 = nullptr;
    ReBuildTreeFromOrderLevel<TreeNode>(v1, root1);
    ReBuildTreeFromOrderLevel<TreeNode>(v2, root2);
    TreeNode *root3 = sln.mergeTrees(root1, root2);
    printTreeLevelOrder(root3);
    CleanUp2<TreeNode>(root1);
    CleanUp2<TreeNode>(root2);
    CleanUp2<TreeNode>(root3);
    return 0;
}