TECHY PINK

  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;   ...

  LINKED LIST -- INSERT A NODE AT A PARTICULAR POSITION Given the pointer to the head node of a linked list and an integer to insert at a certain position, create a new node with the given integer as its   attribute, insert this node at the desired position and return the head node. A position of 0 indicates head, a position of 1 indicates one node away from the head and so on. The head pointer given may be null meaning that the initial list is empty. Example  refers to the first node in the list  Insert a node at position   with  . The new list is  Function Description  Complete the function  insertNodeAtPosition  in the editor below. It must return a reference to the head node of your finished list. insertNodeAtPosition has the following parameters: head : a SinglyLinkedListNode pointer to the head of the list data : an integer value to insert as data in your new node position : an integer position to insert the new node, zer...