Stack Data Structure

When I was reading about Stacks data structure, I found something interesting when trying to insert data into an array, dictionary or a list. Simply increment the index inside the array or Hashmaps/Hashtable like this code below. This reminds me of college when Software Developer students are trying to find the simplest way to implement the code. Awesome!!


Let me explain why this function is beautiful, it's elegant and first of all, it's a boolean. Which means it can do three things at one time. You can call it and pass a parameter to insert into an array, it can reject an insertion and you can call it to know if it inserted or no.

internal bool Push(int data)
{
   if(top >=MAX)
      {
          return false;
      }else
     {  
        stack[++top] = data;
        return true;
      }

}