- Data Structures
- Tree: Inorder Traversal
In this challenge, you are required to implement inorder traversal of a tree.
Complete the function in your editor below, which has parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values.
Our hidden tester code passes the root node of a binary tree to your $inOrder* function.
Print the tree's inorder traversal as a single line of space-separated values.
1 \ 2 \ 5 / \ 3 6 \ 4
1 2 3 4 5 6
The tree's inorder traversal results in as the required result.