Question

A) Write a program to take n elements and insert them into a heap one by one. Include a function to print out the elements in the heap.

B) Write a program to take n elements and insert them into a binary tree. Include a function to print out the elements in the tree.

Add commenting if possible so I can learn from the code. Thanks!

Programming language C++ please.

Answer 1

A)Write a program to take n elements and insert them into a heap one by one. Include a function to print out the elements in the heap.

#include <iostream> using namespace std; // To heapify a subtree rooted with node i which is // an index in arr[]. N is size of heap void heapify(int arr[], int n, int i) { int largest = i; // Initialize largest as root     int l = 2 * i + 1; // left = 2*i + 1     int r = 2 * i + 2; // right = 2*i + 2     // If left child is larger than root     if (l < n && arr[l] > arr[largest])         largest = l;     // If right child is larger than largest so far     if (r < n && arr[r] > arr[largest])         largest = r;     // If largest is not root     if (largest != i) {         swap(arr[i], arr[largest]); // Recursively heapify the affected sub-tree         heapify(arr, n, largest);     } }    // Function to build a Max-Heap from the given array void buildHeap(int arr[], int n) {     // Index of last non-leaf node     int startIdx = (n / 2) - 1;        // Perform reverse level order traversal     // from last non-leaf node and heapify     // each node     for (int i = startIdx; i >= 0; i--) {         heapify(arr, n, i);     } }    // A utility function to print the array // representation of Heap void printHeap(int arr[], int n) {     cout << "Array representation of Heap is:\n"; for (int i = 0; i < n; ++i)         cout << arr[i] << " ";     cout << "\n"; }    // main int main() {    int arr[] = { 1, 3, 5, 4, 6, 13, 10, 9, 8, 15, 17 }; int n = sizeof(arr) / sizeof(arr[0]);   buildHeap(arr, n);   printHeap(arr, n);   return 0; }

B) Write a program to take n elements and insert them into a binary tree. Include a function to print out the elements in the tree.

#include <bits/stdc++.h>

using namespace std;

  

/* A binary tree node has data,

pointer to left child and a

pointer to right child */

struct Node

{

    int data;

    Node* left, * right;

};

  

/* Helper function that allocates a

new node */

Node* newNode(int data)

{

    Node* node = (Node*)malloc(sizeof(Node));

    node->data = data;

    node->left = node->right = NULL;

    return (node);

}

  

// Function to insert nodes in level order

Node* insertLevelOrder(int arr[], Node* root,

                       int i, int n)

{

    // Base case for recursion

    if (i < n)

    {

        Node* temp = newNode(arr[i]);

        root = temp;

  

        // insert left child

        root->left = insertLevelOrder(arr,

                   root->left, 2 * i + 1, n);

  

        // insert right child

        root->right = insertLevelOrder(arr,

                  root->right, 2 * i + 2, n);

    }

    return root;

}

  

// Function to print tree nodes in

// InOrder fashion

void inOrder(Node* root)

{

    if (root != NULL)

    {

        inOrder(root->left);

        cout << root->data <<" ";

        inOrder(root->right);

    }

}

  

// Driver program to test above function

int main()

{

    int arr[] = { 1, 2, 3, 4, 5, 6, 6, 6, 6 };

    int n = sizeof(arr)/sizeof(arr[0]);

    Node* root = insertLevelOrder(arr, root, 0, n);

    inOrder(root);

}