[Daily Coding Problem 223] O(1) space in order traversal of a binary tree
Typically, an implementation of in-order traversal of a binary tree has O(h) space complexity, where h is the height of the tree. Write a program to compute the in-order traversal of a binary tree usi