Tree: Preorder Traversal Hackerrank Solution

Tree: Preorder Traversal Hackerrank Solution

Wednesday, 1 May 2019 /

Complete the preOrder 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 preorder 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 preOrder function.

Constraints

 Nodes in the tree 

Output Format

Print the tree's preorder traversal as a single line of space-separated values.

Sample Input

     1
      \
       2
        \
         5
        /  \
       3    6
        \
         4  

Sample Output

1 2 5 3 4 6 

Complete the preOrder 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 preorder 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 preOrder function.






Constraints




 Nodes in the tree 






Output Format




Print the tree's preorder traversal as a single line of space-separated values.






Sample Input



     1
      \
       2
        \
         5
        /  \
       3    6
        \
         4  







Sample Output



1 2 5 3 4 6 
Language-C
/* you only have to complete the function given below.  
node is defined as  

struct node {
    
    int data;
    struct node *left;
    struct node *right;
  
};

*/
void preOrder( struct  node *root) {
 if(root){
     printf("%d ",root->data);
     preOrder(root->left);
     preOrder(root->right);
 }
}

Compare the Triplets Hackerrank Solution

Compare the Triplets Hackerrank Solution

Saturday, 9 September 2017 /

Alice and Bob each created one problem for HackerRank. A reviewer rates the two challenges, awarding points on a scale from  to  for three categories: problem clarity, originality, and difficulty.

We define the rating for Alice's challenge to be the triplet , and the rating for Bob's challenge to be the triplet .

Your task is to find their comparison points by comparing  with ,  with , and  with .

• If , then Alice is awarded  point.
• If , then Bob is awarded  point.
• If , then neither person receives a point.

Comparison points is the total points a person earned.

Given  and , can you compare the two challenges and print their respective comparison points?

Input Format

The first line contains  space-separated integers, , , and , describing the respective values in triplet .
The second line contains  space-separated integers, , , and , describing the respective values in triplet .

Constraints

Output Format

Print two space-separated integers denoting the respective comparison points earned by Alice and Bob.

Sample Input

5 6 7
3 6 10

Sample Output

1 1 

Explanation

In this example:

Now, let's compare each individual score:

• , so Alice receives  point.
• , so nobody receives a point.
• , so Bob receives  point.

Alice's comparison score is , and Bob's comparison score is . Thus, we print 1 1 (Alice's comparison score followed by Bob's comparison score) on a single line.

#include <math.h>

#include <stdio.h>

#include <stdlib.h>

  

int main()

{

    int a0,a1,a2,b0,b1,b2,alicepoints=0,bobpoints=0;

   

        scanf("%d%d%d",&a0,&a1,&a2);

     

        scanf("%d%d%d",&b0,&b1,&b2);

    if(a0>b0){

        alicepoints=alicepoints+1;

    }

    

    if(a1>b1){

        alicepoints=alicepoints+1;

    }

   

    if(a2>b2){

        alicepoints=alicepoints+1;

    }

    if(b0>a0){

        bobpoints=bobpoints+1;

    }

    

    if(b1>a1){

        bobpoints=bobpoints+1;

    }

   

    if(b2>a2){

      bobpoints=bobpoints+1;

    }

    

    if((a0=b0)&&(a1=b1)&&(a2=b2)){

        alicepoints=alicepoints+0;

        bobpoints=bobpoints+0;

    }

    printf("%d %d",alicepoints,bobpoints);

   

   

    return 0;

    

}