C++

5. printTree()Problem demonstrates simply binary tree traversal Given a binary search tree (aka an "ordered binary tree"), iterate over the nodes to print them out in increasing order. So the tree.. Produces the output "1 2 3 4 5". This is known as an "inorder" traversal of the tree Hint: For each node, the strategy is: recur left, print the node data, recur right. void printTree(struct node* node) [