DigitalSkill Loft

 #include <stdio.h> // Function to print tree structure from array void printTree(int a[], int n) {     for (int i = 0; i < n; i++) {         int left = 2 * i + 1;         int right = 2 * i + 2;         printf("\nParent: %d", a[i]);         if (left < n)             printf(" | Left: %d", a[left]);         else             printf(" | Left: NULL");         if (right < n)             printf(" | Right: %d", a[right]);         else             printf(" | Right: NULL");     }     printf("\n-------------------------\n"); } // Function to heapify a subtree rooted at index i void heapify(int a[], int n, int i) {     int largest = i;          // Root index ...

https://www.programiz.com/online-compiler/9F3XFw8LL9vB5  //Program binary search in C language  #include <stdio.h> int main() { printf("Program for Binary search \n"); int a[]={2, 4, 6, 8, 10, 12, 14}; int key,i; int n=sizeof(a)/sizeof(a[0]); int l=0, r=n-1, mid=0; mid=(l+r)/2; printf("\narray elements are"); for(i=0;i<n; i++) {     printf("\t %d",a[i]); } printf("\n length of array=%d",n); printf("\n enter serach value="); scanf("%d",&key); while(l<=r) {  mid=(l+r)/2;     if(a[mid]==key)     {          printf("search key= %d found at index %d \n", key,mid );                break;     }     else if(a[mid]<key)     {         l=mid+1;     }     else     {         r=mid-1;     } } if(l>r) {    printf("search key= %d not found in array \n", ke...

 https://www.programiz.com/online-compiler/8zEhYQfuf2edR //Program for linear search in C language  #include <stdio.h> void main() {     printf("Program for linear search \n"); int a[]={2, 4, 6, 8, 10, 12, 14}; int key,i; int n=sizeof(a)/sizeof(a[0]); printf("\narray elements are"); for(i=0;i<n; i++) {     printf("\t %d",a[i]); } printf("\n length of array=%d",n); printf("\n enter serach value\t "); scanf("%d",&key); for(i=0;i<n; i++) { if(a[i]==key)     {     printf("\n search key=%d \t find on index number=%d ",key,i );     break;     }    }   if(i==n)    {        printf("key\t=%d not found in aaray ",key);           } //printf("serach value=%d",k); }

 Program 1: program for recursive linear search and binary search in c language #include <stdio.h> // Recursive Linear Search int recursiveLinearSearch(int arr[], int n, int key, int index) {     if (index >= n)  // Base case: reached end without finding         return -1;     if (arr[index] == key) // Found the element         return index;     return recursiveLinearSearch(arr, n, key, index + 1); // Search next } // Recursive Binary Search int recursiveBinarySearch(int arr[], int low, int high, int key) {     if (low > high) // Base case: not found         return -1;     int mid = (low + high) / 2;     if (arr[mid] == key) // Found         return mid;     else if (arr[mid] > key) // Search left half         return recursiveBinarySearch(arr, low, mid - 1, key);     else // Search...