Design a r ecursive function to count t he number of different binary trees that

Question

Design a recursive function to count the number of different binary trees that can build with N nodes.

Explanation / Answer

#include #include using namespace std; // node structure struct node { int key; struct node *left, *right; }; // A utility function to create a new BST node struct node *newNode(int item) { struct node *temp = new node; temp->key = item; temp->left = temp->right = NULL; return temp; } void preorder(struct node *root) { if (root != NULL) { cout right); } } // function for constructing trees vector constructTrees(int start, int end) { vector list; /* if start > end then subtree will be empty so returning NULL in the list */ if (start > end) { list.push_back(NULL); return list; } /* iterating through all values from start to end for constructing left and right subtree recursively */ for (int i = start; i

Related Questions

Navigate

• Browse (All)
• Browse D
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.