{"id":9312,"date":"2022-08-25T11:59:26","date_gmt":"2022-08-25T11:59:26","guid":{"rendered":"https:\/\/www.prepbytes.com\/blog\/?p=9312"},"modified":"2022-12-14T11:40:31","modified_gmt":"2022-12-14T11:40:31","slug":"heap-overflow-and-stack-overflow","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/","title":{"rendered":"Heap overflow and Stack overflow"},"content":{"rendered":"

\"\"<\/p>\n<\/p>\n

The computer\u2019s RAM has a few sections in it. Two of them are heap<\/a> and stack. Both heap and stack store variables. <\/p>\n

Let’s see about Heap and Stack briefly:-<\/p>\n

Both sections of RAM that are Stack and Heap are for storage but there are a few differences some of them are:-<\/p>\n

    \n
  1. The size of stack memory is smaller than the size of heap memory <\/li>\n
  2. Access to stack memory is faster than access to heap memory. <\/li>\n<\/ol>\n\n\n\n\n\n\n\n\n\n<\/tr>\n<\/tbody>\n<\/table>\n

    Heap overflow:-<\/h3>\n

    Heap is a section of RAM that stores dynamic variables. The dynamically allocated variables in the heap don\u2019t follow any order. These variables are allocated using malloc() and calloc() functions and resized using realloc() functions in C and using new keywords in C++. These are inbuilt functions and keywords. These variables can be accessed globally. It\u2019s our responsibility to free that memory space after use that we have allocated. There are two situations that can result in heap overflow:<\/p>\n

      \n
    1. If we continuously allocate memory for variables and we do not free that allocated memory space after use it may result in memory leakage. The reason for heap overflow is because the memory space is limited and the allocated memory is still in use but not available for other processes.<\/li>\n<\/ol>\n

      Code<\/strong><\/p>\n

      \/\/ C program to show heap overflow by \n\/\/continuously allocating memory\n#include<stdio.h>\nint main(){\n    for (int i=0; i<1000000000; i++){\n       \/\/ Allocating memory without \n      \/\/freeing it will cause\n     \/\/ memory crisis\n    int *ptr = (int*)malloc(sizeof(int));\n    }\n}<\/code><\/pre>\n
        \n
      1. If we allocate a large number of dynamic variables.<\/li>\n<\/ol>\n
        Code<\/strong><\/p>\n
        \/\/ C program to show heap overflow\n\/\/ by allocating large number of dynamic \n\/\/  variables\n\n#include<stdio.h>\nint main(){\n    int *ptr = (int *)malloc(sizeof(int)*10000000));\n}<\/code><\/pre>\n
        Stack Overflow:<\/h3>\n
        Stack is also a section of RAM that is used to store local variables. The local variables are temporary variables used inside the function, parameters passed through a function, and their return addresses. All the allocated space in the memory by the local variables is freed automatically after the complete execution of the function. The user does not have any need to free up stack space manually. Stack is a Last-In-First-Out data structure because the last called function is executed first.
        \nIn the RAM, the stack is limited in size. If a program uses more memory space than the stack size then stack overflow will occur, This stack overflow causes a program to crash. There are two cases in which stack overflow can occur:<\/p>\n
          \n
        1. If we declare an array or matrix or any higher dimensional array of huge size.<\/li>\n<\/ol>\n
          Code<\/strong><\/p>\n
          \/\/ C program to show stack overflow\n\/\/ by allocating very large space for 2D matrix\n\n#include<stdio.h>  \nint main() {\n   \/\/ Creating a 2D matrix of size =(10^9 * 10^9) \n  \/\/ results to stack overflow.\n   int mat[1000000000][1000000000];\n}<\/code><\/pre>\n
            \n
          1. If a function recursively calls itself, the recursive functions are pushed onto the stack. In such cases, the stack cannot store large numbers of local variables used by every function call, resulting in an overflow of the stack.<\/li>\n<\/ol>\n
            Code<\/strong><\/p>\n
            \/\/ C program to show stack overflow\n\/\/ due to a non-terminating recursive function.\n\n#include<stdio.h>  \nvoid call(int x){\n    call(x);\n}\n\nint main(){\n   int x = 2;\n   call(x);\n}<\/code><\/pre>\n
            This article tried to discuss Heap overflow and Stack overflow. Hope this blog helps you understand and solve the problem. To practice more problems you can check out  <\/a> at  Prepbytes<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"
            The computer\u2019s RAM has a few sections in it. Two of them are heap and stack. Both heap and stack store variables. Let’s see about Heap and Stack briefly:- Both sections of RAM that are Stack and Heap are for storage but there are a few differences some of them are:- The size of stack […]<\/p>\n","protected":false},"author":52,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"footnotes":""},"categories":[131],"tags":[],"class_list":["post-9312","post","type-post","status-publish","format-standard","hentry","category-heap"],"yoast_head":"\nHeap overflow and Stack overflow | Heap | PrepBytes Blog<\/title>\n<meta name=\"description\" content=\"In this article, we will discuss the differences between Heap overflow and Stack overflow. This is the most important question to learn while preparing for interviews.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Heap overflow and Stack overflow | Heap | PrepBytes Blog\" \/>\n<meta property=\"og:description\" content=\"In this article, we will discuss the differences between Heap overflow and Stack overflow. This is the most important question to learn while preparing for interviews.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/\" \/>\n<meta property=\"og:site_name\" content=\"PrepBytes Blog\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/prepbytes0211\/\" \/>\n<meta property=\"article:published_time\" content=\"2022-08-25T11:59:26+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2022-12-14T11:40:31+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1661428729489-Article%20%281%29.jpg\" \/>\n<meta name=\"author\" content=\"Prepbytes\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Prepbytes\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"3 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/\"},\"author\":{\"name\":\"Prepbytes\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\"},\"headline\":\"Heap overflow and Stack overflow\",\"datePublished\":\"2022-08-25T11:59:26+00:00\",\"dateModified\":\"2022-12-14T11:40:31+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/\"},\"wordCount\":516,\"commentCount\":0,\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1661428729489-Article%20%281%29.jpg\",\"articleSection\":[\"Heap\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/\",\"url\":\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/\",\"name\":\"Heap overflow and Stack overflow | Heap | PrepBytes Blog\",\"isPartOf\":{\"@id\":\"http:\/\/43.205.93.38\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1661428729489-Article%20%281%29.jpg\",\"datePublished\":\"2022-08-25T11:59:26+00:00\",\"dateModified\":\"2022-12-14T11:40:31+00:00\",\"description\":\"In this article, we will discuss the differences between Heap overflow and Stack overflow. This is the most important question to learn while preparing for interviews.\",\"breadcrumb\":{\"@id\":\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#primaryimage\",\"url\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1661428729489-Article%20%281%29.jpg\",\"contentUrl\":\"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1661428729489-Article%20%281%29.jpg\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"http:\/\/43.205.93.38\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Heap\",\"item\":\"https:\/\/prepbytes.com\/blog\/category\/heap\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Heap overflow and Stack overflow\"}]},{\"@type\":\"WebSite\",\"@id\":\"http:\/\/43.205.93.38\/#website\",\"url\":\"http:\/\/43.205.93.38\/\",\"name\":\"PrepBytes Blog\",\"description\":\"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING\",\"publisher\":{\"@id\":\"http:\/\/43.205.93.38\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"http:\/\/43.205.93.38\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"http:\/\/43.205.93.38\/#organization\",\"name\":\"Prepbytes\",\"url\":\"http:\/\/43.205.93.38\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"contentUrl\":\"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp\",\"width\":160,\"height\":160,\"caption\":\"Prepbytes\"},\"image\":{\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/\"},\"sameAs\":[\"https:\/\/www.facebook.com\/prepbytes0211\/\",\"https:\/\/www.instagram.com\/prepbytes\/\",\"https:\/\/www.linkedin.com\/company\/prepbytes\/\",\"https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA\"]},{\"@type\":\"Person\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e\",\"name\":\"Prepbytes\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"http:\/\/43.205.93.38\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g\",\"caption\":\"Prepbytes\"},\"url\":\"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Heap overflow and Stack overflow | Heap | PrepBytes Blog","description":"In this article, we will discuss the differences between Heap overflow and Stack overflow. This is the most important question to learn while preparing for interviews.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/","og_locale":"en_US","og_type":"article","og_title":"Heap overflow and Stack overflow | Heap | PrepBytes Blog","og_description":"In this article, we will discuss the differences between Heap overflow and Stack overflow. This is the most important question to learn while preparing for interviews.","og_url":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/","og_site_name":"PrepBytes Blog","article_publisher":"https:\/\/www.facebook.com\/prepbytes0211\/","article_published_time":"2022-08-25T11:59:26+00:00","article_modified_time":"2022-12-14T11:40:31+00:00","og_image":[{"url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1661428729489-Article%20%281%29.jpg","type":"","width":"","height":""}],"author":"Prepbytes","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Prepbytes","Est. reading time":"3 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#article","isPartOf":{"@id":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/"},"author":{"name":"Prepbytes","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e"},"headline":"Heap overflow and Stack overflow","datePublished":"2022-08-25T11:59:26+00:00","dateModified":"2022-12-14T11:40:31+00:00","mainEntityOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/"},"wordCount":516,"commentCount":0,"publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1661428729489-Article%20%281%29.jpg","articleSection":["Heap"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/","url":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/","name":"Heap overflow and Stack overflow | Heap | PrepBytes Blog","isPartOf":{"@id":"http:\/\/43.205.93.38\/#website"},"primaryImageOfPage":{"@id":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#primaryimage"},"image":{"@id":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#primaryimage"},"thumbnailUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1661428729489-Article%20%281%29.jpg","datePublished":"2022-08-25T11:59:26+00:00","dateModified":"2022-12-14T11:40:31+00:00","description":"In this article, we will discuss the differences between Heap overflow and Stack overflow. This is the most important question to learn while preparing for interviews.","breadcrumb":{"@id":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#primaryimage","url":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1661428729489-Article%20%281%29.jpg","contentUrl":"https:\/\/prepbytes-misc-images.s3.ap-south-1.amazonaws.com\/assets\/1661428729489-Article%20%281%29.jpg"},{"@type":"BreadcrumbList","@id":"https:\/\/prepbytes.com\/blog\/heap-overflow-and-stack-overflow\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"http:\/\/43.205.93.38\/"},{"@type":"ListItem","position":2,"name":"Heap","item":"https:\/\/prepbytes.com\/blog\/category\/heap\/"},{"@type":"ListItem","position":3,"name":"Heap overflow and Stack overflow"}]},{"@type":"WebSite","@id":"http:\/\/43.205.93.38\/#website","url":"http:\/\/43.205.93.38\/","name":"PrepBytes Blog","description":"ONE-STOP RESOURCE FOR EVERYTHING RELATED TO CODING","publisher":{"@id":"http:\/\/43.205.93.38\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"http:\/\/43.205.93.38\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"http:\/\/43.205.93.38\/#organization","name":"Prepbytes","url":"http:\/\/43.205.93.38\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/","url":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","contentUrl":"https:\/\/blog.prepbytes.com\/wp-content\/uploads\/2025\/07\/uzxxllgloialmn9mhwfe.webp","width":160,"height":160,"caption":"Prepbytes"},"image":{"@id":"http:\/\/43.205.93.38\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/prepbytes0211\/","https:\/\/www.instagram.com\/prepbytes\/","https:\/\/www.linkedin.com\/company\/prepbytes\/","https:\/\/www.youtube.com\/channel\/UC0xGnHDrjUM1pDEK2Ka5imA"]},{"@type":"Person","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/3f7dc4ae851791d5947a7f99df363d5e","name":"Prepbytes","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"http:\/\/43.205.93.38\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/232042cd1a1ea0e982c96d2a2ec93fb70a8e864e00784491231e7bfe5a9e06b5?s=96&d=mm&r=g","caption":"Prepbytes"},"url":"https:\/\/prepbytes.com\/blog\/author\/gourav-jaincollegedekho-com\/"}]}},"_links":{"self":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/9312","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/users\/52"}],"replies":[{"embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/comments?post=9312"}],"version-history":[{"count":4,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/9312\/revisions"}],"predecessor-version":[{"id":10171,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/posts\/9312\/revisions\/10171"}],"wp:attachment":[{"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/media?parent=9312"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/categories?post=9312"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/prepbytes.com\/blog\/wp-json\/wp\/v2\/tags?post=9312"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}

    Stack<\/th>\n<\/th>\nHeap<\/th>\n<\/tr>\n<\/thead>\n
    Size of stack memory is smaller<\/td>\nSize of memory<\/td>\nSize of heap memory is larger<\/td>\n<\/tr>\n
    Stack memory is allocated in a Last-In-First-Out (LIFO) manner<\/td>\nOrder of memory allocation<\/td>\nHeap memory is dynamically allocated and It does not follow any order.<\/td>\n<\/tr>\n
    Resizing variables is not allowed in a stack. Once allocated can\u2019t resize<\/td>\nResizing<\/td>\nResizing of variables is allowed in a heap<\/td>\n<\/tr>\n
    Memory is Deallocated automatically<\/td>\nDeallocation<\/td>\nWe have to free the memory occupied.<\/td>\n<\/tr>\n