reverse odd binary trees

[vatsal9117]

here space complexity of the algorithm is O(h) and time complexity is O(n)