Morris traversal for Inorder
Given a Binary Tree, the task is to print its Inorder Traversal, without using recursion or stack.Examples:Input:Output: [4, 2, 5, 1, 3]Explanation: Inorder traversal (Left->Root->Right) of the tree is 4, 2, 5, 1, 3.Input:Output: [1, 7, 10, 8, 6, 10, 5, 6]Explanation: Inorder traversal (Left-