Skip to main content

Posts

Showing posts with the label inordertraversal

INORDER TRAVERSAL -- HACKERRANK SOLUTIONS

  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. Input Format Our hidden tester code passes the root node of a binary tree to your $inOrder* function. Constraints               Output Format Print the tree's inorder traversal as a single line of space-separated values. Sample Input 1 \ 2 \ 5 / \ 3 6 \ 4 Sample Output 1 2 3 4 5 6 Explanation The tree's inorder traversal results in             as the required result. Solution #include   < stdio.h > #include   < string.h > #include   < math.h > #include   < stdlib.h > struct  node {           int  data;   ...