Question

c# prograaming language

1. write a program that generates 10,000 random integers in the range of 0-9 and them in binary search tree.

2. use any sort algorithm (insertion, bubble, quick...) to display a list of each of the integers and how many times they appear.

3. at last, add ruction to the BinarySearchTree class that count the number of edges in a tree.

Write a program that generates 10,000 random integers in the range of 0-9 and store them in a binary search tree. Using one of the algorithms discussed in this chapter, display a list of each of the integers and the number of times they appear in the tree 1. 2. Add a function to the BinarySearchTree class that counts the number of edges in a tree.

Answer 1

#include<stdio.h>
#include<stdlib.h>

static int arr[10000], i=0;

struct node
{
   int key;
   struct node *left, *right;
};

// A function to create a new BST node
struct node *newNode(int item)
{
   struct node *tmp = (struct node *)malloc(sizeof(struct node));
   tmp->key = item;
   tmp->left = tmp->right = NULL;
   return tmp;
}

// A function to do inorder traversal of BST
int inorder(struct node *root)
{
   if (root != NULL)
   {
       inorder(root->left);
       arr[i]=root->key;
       i++;
       inorder(root->right);
   }
}

/* A function to insert a new node with given key in BST */
struct node* insert(struct node* node, int key)
{
  
   if (node == NULL) return newNode(key);

  
   if (key <= node->key)
       node->left = insert(node->left, key);
   else if (key > node->key)
       node->right = insert(node->right, key);

  
   return node;
}

void counteach(int arr[])
{
  
   int v=0;
   int count[10];
   int c=1;
   for(int j=0;j<10000-1;j++)
   {
       if(arr[j]==arr[j+1])
       {
           c+=1;
       }
       else
       {
           count[v]=c;
           c=1;
           v+=1;
       }
   }
   count[v]=c;
   for(int k = 0; k<10; k++)
   {
       printf("\n%d\t%d",k, count[k]);
   }
}

void printtree(int arr[])
{
   for(int j=0;j<10000;j++)
       printf("%d\t",arr[j]);
}

int main() {
int c, n;
struct node *root = NULL;
root = insert(root, 5);
printf("\n\n%s","inserted numbers");
for (c = 1; c < 10000; c++) {
n = rand() % 10;
insert(root, n);
printf("%d\t", n);
}
  
   inorder(root);
   printf("\n\n\nAfter insertion into the tree\n");
   printtree(arr);
   printf("\n\n\nCount of each element inserted\n");
   counteach(arr);
}