You don't need to read input or print anything. Your task is to complete the functioninOrder() that takes root node of the tree as input and returns a list containing the In-Order Traversal of the given Binary Tree.
Expected Time Complexity: O(N). Expected Auxiliary Space: O(N).
1 <= Number of nodes <= 105
0 <= Data of a node <= 105