Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 500369
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T06:04:48+00:00 2026-05-13T06:04:48+00:00

#include <cstdlib> #include <iostream> using namespace std; const unsigned long MAX_SIZE = 20; typedef

  • 0
#include <cstdlib>
#include <iostream>

using namespace std;

const unsigned long MAX_SIZE = 20;
typedef int ItemType;

class Heap {
private:
        ItemType array[MAX_SIZE];
        int elements; //how many elements are in the heap
public:
      Heap( )
       ~Heap( )
       bool IsEmpty( ) const
      bool IsFull( ) const
      Itemtype Retrieve( ) 
      void Insert( const Itemtype& )
};

Let’s say I have this as my header file. In my implementation for this, what is the best way to do Heap() constructor and ~Heap() destructor.

I have

Heap::Heap()
{
   elements = 0;
}

Heap::~Heap()
{
   array = NULL;
}

I am wondering if this is the proper way to destruct and construct an array in this case.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-13T06:04:49+00:00Added an answer on May 13, 2026 at 6:04 am

    array is not dynamically allocated, so the storage for it goes away when the object no longer exists in scope. In fact, you can’t reassign to array; it’s an error to do so.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Ask A Question

Stats

  • Questions 529k
  • Answers 529k
  • Best Answers 0
  • User 1
  • Popular
  • Answers
  • Editorial Team

    How to approach applying for a job at a company ...

    • 7 Answers
  • Editorial Team

    How to handle personal stress caused by utterly incompetent and ...

    • 5 Answers
  • Editorial Team

    What is a programmer’s life like?

    • 5 Answers
  • Editorial Team
    Editorial Team added an answer Check out this post, I think it might help you.… May 16, 2026 at 11:09 pm
  • Editorial Team
    Editorial Team added an answer I think I found the answer Selected Value will then… May 16, 2026 at 11:09 pm
  • Editorial Team
    Editorial Team added an answer It depends on the webservice that provides you the RSS… May 16, 2026 at 11:09 pm

Trending Tags

analytics british company computer developers django employee employer english facebook french google interview javascript language life php programmer programs salary

Top Members

Related Questions

#include <iostream> #include <fstream> #include <cstdlib> using namespace std; const int FILENAME_MAX=20; int main()
Consider the following program #include <iostream> #include<cstdlib> using namespace std; class E { public:
I've try to compile this code: #include <iostream> #include <cstdlib> using namespace std; #define
Consider the following code: #include <cstdlib> #include <iostream> #include <string> #include <vector> #include <algorithm>
I have this simple c++ program #include <cstdlib> #include <iostream> #include <math.h> #include <stdlib.h>
I can't understand why does this code fail with segfault: #include <cstdlib> #include <iostream>
I have the following code: //Comp454 program 2 #include <iostream> #include <string> #include <fstream>
I have a very simple server/client performance test using boost::asio on Windows and it
I've always thought it's the general wisdom that std::vector is implemented as an array,
Here is code in which I am trying to implement a queue using linked

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.