Part 8 of 15 in Binary Trees  

Inorder traversal of a binary tree by animeshn

Problem statement

Given pointer to the root node of a binary tree of integers, write a function to print elements of the tree in its in-order traversal.

Input

You need to write a function named "Inorder" that will take root of a binary tree of integers as argument. You have to output using cout function and one node per line. You can assume that the header iostream is already imported.

Output

Your function should print all the elements in the binary tree in its in-order traversal. Each element should be printed on a single line.



To try out your code



Sign in

Sign up