(Solved) : C Exercise Data Structures Need Code Functions Missing Please Help Figure Thanks C Bst I Q29263341 . . . .

C++ EXERCISE (DATA STRUCTURES). I just need a code for somefunctions that are missing. Please help me figure out. Thanks.

C++ BST implementation (using a struct)

Enter the code below, and then compile and run the program.

After the program runs successfully, add the followingfunctions:

postorder()

This function is similar to the inorder() andpreorder() functions, but demonstrates postorder treetraversal.

displayParentsWithTwo()

This function is similar to the displayParentsWithOne() function, but displays nodes having only twochildren.

countAllLeaves()

This function is similar to the countAllNodes()function, but counts leaves (nodes with no children).

#include <iostream>

#include <cstdlib>

#include <iomanip>

using namespace std;

struct TreeNode

{

     int info;

     TreeNode *left, *right;

};

typedef TreeNode* ptrType;

void insert(ptrType &tree, int item);

void showMenu(int & choice);

void