#include

#include

#include "bintree.h"

 

using namespace std;

 

struct bnode {

int data;

bnode *left;

bnode *right;

};

 

BinTree NewBinTree()

{

srand(time(NULL));

return 0;

}

 

void InsertRandom(BinTree& root, int val)

{

if (root == 0) {

root = new bnode;

root->data = val;

root->left = root->right = 0;

return;

}

 

int r = rand() % 2;

 

if (r == 0)

InsertRandom(root->left, val);

else

InsertRandom(root->right, val);

}

 

void PrintNested(BinTree& root)

{

if (root == 0) {

cout

}

else {

cout << "( " << root->data

PrintNested(root->left); cout

PrintNested(root->right); cout

}

}

 

void InOrder(BinTree& root)

{

if (root == 0)

return;

 

InOrder(root->left);

cout << root->data

InOrder(root->right);

}

 

BinTree MirrorImage(BinTree t)

{

// FOR YOU TO DO: Implement the following recursive algorithm to create a mirror image of a binary tree:

// If t is empty, return empty tree (0)

// Else t = (root, L, R) where L = left subtree, R = right subtree.

// Return tree t2 = (root, MirrorImage(R), MirrorImage(L))

 

BinTree t2; // mirror image

 

// Your code here.

 

 

 

 

 

 

 

return t2;

}

 

int NumTrees[100] = {1,1}; //For memoization.

 

int NumBinTrees(int n)

{

// Implement the recursion:

// NumBinTrees(0) = 1

// NumBinTrees(n) = Sum(k=0 to n-1) B(k)*B(n-1-k) for n > 0;

// Use memoization.

 

// Your code here:

 

 

 

 

 

 

 

}#include <iostream>

 

#include <cstdlib>

#include "bintree.h"

 

using namespace std;

 

struct bnode {

    int data;

    bnode *left;

    bnode *right;

};

 

BinTree NewBinTree()

{

    srand(time(NULL));

    return 0;

}

 

void InsertRandom(BinTree& root, int val)

{

    if (root == 0) {

        root = new bnode;

        root->data = val;

        root->left = root->right = 0;

        return;

    }

 

    int r = rand() % 2;

 

    if (r == 0)

        InsertRandom(root->left, val);

    else

        InsertRandom(root->right, val);

}

 

void PrintNested(BinTree& root)

{

    if (root == 0) {

        cout << "[ ]";

    }

    else {

        cout << "( " << root->data << ", ";

        PrintNested(root->left); cout << ", ";

        PrintNested(root->right); cout << " )";

    }

}

 

void InOrder(BinTree& root)

{

    if (root == 0)

        return;

 

    InOrder(root->left);

    cout << root->data << " ";

    InOrder(root->right);

}

 

BinTree MirrorImage(BinTree t)

{

    // FOR YOU TO DO: Implement the following recursive algorithm to create a mirror image of a binary           tree:

    //      If t is empty, return empty tree (0)

    //      Else t = (root, L, R) where L = left subtree, R = right subtree.

    //      Return tree t2 = (root, MirrorImage(R), MirrorImage(L))

 

    BinTree t2; // mirror image

 

    // Your code here.

 

 

 

 

 

 

 

    return t2;

 }

 

int NumTrees[100] = {1,1}; // For memoization.

 

int NumBinTrees(int n)

{

    // Implement the recursion:

    //       NumBinTrees(0) = 1

    //       NumBinTrees(n) = Sum(k=0 to n-1) B(k)*B(n-1-k) for n > 0;

    // Use memoization.

 

    // Your code here:

 

 

 

 

 

 

 

}