Merge pull request #676 from avi181197/master

Created tree traversal in c

Author: probot-auto-merge[bot]

jobSequencing.cpp

@@ -0,0 +1,69 @@
+// Program to find the maximum profit job sequence from a given array 
+// of jobs with deadlines and profits 
+#include<iostream> 
+#include<algorithm> 
+using namespace std; 
+  
+// A structure to represent a job 
+struct Job 
+{ 
+   char id;      // Job Id 
+   int dead;    // Deadline of job 
+   int profit;  // Profit if job is over before or on deadline 
+}; 
+  
+// This function is used for sorting all jobs according to profit 
+bool comparison(Job a, Job b) 
+{ 
+     return (a.profit > b.profit); 
+} 
+  
+// Returns minimum number of platforms reqquired 
+void printJobScheduling(Job arr[], int n) 
+{ 
+    // Sort all jobs according to decreasing order of prfit 
+    sort(arr, arr+n, comparison); 
+  
+    int result[n]; // To store result (Sequence of jobs) 
+    bool slot[n];  // To keep track of free time slots 
+  
+    // Initialize all slots to be free 
+    for (int i=0; i<n; i++) 
+        slot[i] = false; 
+  
+    // Iterate through all given jobs 
+    for (int i=0; i<n; i++) 
+    { 
+       // Find a free slot for this job (Note that we start 
+       // from the last possible slot) 
+       for (int j=min(n, arr[i].dead)-1; j>=0; j--) 
+       { 
+          // Free slot found 
+          if (slot[j]==false) 
+          { 
+             result[j] = i;  // Add this job to result 
+             slot[j] = true; // Make this slot occupied 
+             break; 
+          } 
+       } 
+    } 
+  
+    // Print the result 
+    for (int i=0; i<n; i++) 
+       if (slot[i]) 
+         cout << arr[result[i]].id << " "; 
+} 
+  
+// Driver program to test methods 
+int main() 
+{ 
+    Job arr[] = { {'a', 2, 100}, {'b', 1, 19}, {'c', 2, 27}, 
+                   {'d', 1, 25}, {'e', 3, 15}}; 
+    int n = sizeof(arr)/sizeof(arr[0]); 
+    cout << "Following is maximum profit sequence of jobsn"; 
+    printJobScheduling(arr, n); 
+    return 0; 
+} 
+
+Output:
+Followi

tree traversal using c

@@ -0,0 +1,118 @@
+//Binary tree traversal:
+ 
+#include <stdio.h>
+#include <conio.h>
+#include <malloc.h>
+struct node
+{
+    struct node *left;
+    int data;
+    struct node *right;
+};
+ 
+void main()
+{
+    void insert(struct node **,int);
+    void inorder(struct node *);
+    void postorder(struct node *);
+    void preorder(struct node *);
+ 
+    struct node *ptr;
+    int no,i,num;
+ 
+    ptr = NULL;
+    ptr->data=NULL;
+    clrscr();
+ 
+    printf("\nProgram for Tree Traversal\n");
+    printf("Enter the number of nodes to add to the tree.<BR>\n");
+    scanf("%d",&no);
+ 
+    for(i=0;i<no;i++)
+    {
+        printf("Enter the item\n");
+        scanf("%d",&num);
+        insert(&ptr,num);
+    }
+ 
+    //getch();
+    printf("\nINORDER TRAVERSAL\n");
+    inorder(ptr);
+ 
+    printf("\nPREORDER TRAVERSAL\n");
+    preorder(ptr);
+ 
+    printf("\nPOSTORDER TRAVERSAL\n");
+    postorder(ptr);
+ 
+    getch();
+}
+ 
+void insert(struct node **p,int num)
+{
+    if((*p)==NULL)
+    {
+        printf("Leaf node created.");
+        (*p)=malloc(sizeof(struct node));
+        (*p)->left = NULL;
+        (*p)->right = NULL;
+        (*p)->data = num;
+        return;
+    }
+    else
+    {
+        if(num==(*p)->data)
+        {
+            printf("\nREPEATED ENTRY ERROR VALUE REJECTED\n");
+            return;
+        }
+        if(num<(*p)->data)
+        {
+            printf("\nDirected to left link.\n");
+            insert(&((*p)->left),num);
+        }
+        else
+        {
+            printf("Directed to right link.\n");
+            insert(&((*p)->right),num);
+        }
+    }
+    return;
+}
+ 
+void inorder(struct node *p)
+{
+    if(p!=NULL)
+    {
+        inorder(p->left);
+        printf("\nData :%d",p->data);
+        inorder(p->right);
+    }
+    else
+    return;
+}
+ 
+void preorder(struct node *p)
+{
+    if(p!=NULL)
+    {
+        printf("\nData :%d",p->data);
+        preorder(p->left);
+        preorder(p->right);
+    }
+    else
+    return;
+}
+ 
+void postorder(struct node *p)
+{
+    if(p!=NULL)
+    {
+        postorder(p->left);
+        postorder(p->right);
+        printf("\nData :%d",p->data);
+    }
+    else
+    return;
+}
+