C++

Write a program to text the code I posted below.

Write Test program with this algorithm.

currentnode = root; //First of all we have to start traversal at root node

v = 0; //Intilize with zero

if(currentnode is NULL) //Check condtion the binary tree is empty

if(currentnode is not NULL) //Check condtion

push currentnode into stack;

push 1 onto stack;

currentnode = currentnode->leftlink;

while(For suppose if stack is not empty)

if(currentnode is not NULL and v is 0)

{

push currentnode and 1 onto stack; //Push into stack

currentnode = currentnode->leftlink;

}

{

pop stack into currentnode and v; //pop from stack

if(v == 1) //Check condtion

{

push currentnode and 2 onto stack; //Push into stack

currentnode = currentnode->rightlink;

v = 0;

}

else

visit currentnode;

}

b. Write a program to test the nonrecursive inorder, preorder, and postorder traversal algorithms. (Note: First create a binary search tree