Infix Order of a BinaryTree

Print a binary tree in infix order. Recursive and iterative.

Output:
These nodes are inserted into BST:
16 39 43 65 56 77 22
Printing BST inorder:
16 22 39 43 56 65 77
Printing infix order iteratively:
16 22 39 43 56 65 77

Code: