Function main

CPP/binarytreeuse.cpp:532–551

int main()
{
    // 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
    // 1 2 3 4 5 6 7 -1 -1 -1 -1 8 9 -1 -1 -1 -1 -1 -1
    //8 5 10 2 6 -1 6 -1 -1 -1 7 -1 -1 -1 -1
    // 1 2 3 4 5 -1 -1 -1 -1 -1 -1 
    // 1 2 3 4 5 -1 8 -1 -1 6 -1 -1 -1 -1 -1
    // int in[]={4,2,5,1,8,6,9,33,7};
    // int pre[]={1,2,4,5,33,6,8,9,7};
    // binarytree<int>*root=buildtree(in,pre,9);

    binarytree<int>*root=takeinputlevelwise();
    printlevelwise(root);
    cout<<endl;
    int a=pair_sum_binarytree(root,11);
 


    return 0;
}