What is stacks in data structure using c?

Answer 1

queue is an abstract data type that which entities in a collection are kept in order, this makes the sense of fifo(first in first out).

stack is a container of the object which works on the principle of lifo(last in first out)

Answer 2

An example of a stack using arrays (vectors in C++):

#include<iostream>

#include<stack>

#include<vector>

int main()

{

std::stack<int, std::vector<int>> my_stack;

my_stack.push (42);

std::cout << my_stack.top() << std::endl;

my_stack.push (60);

std::cout << my_stack.top() << std::endl;

my_stack.pop();

my_stack.pop();

}

Note that if you do not supply a container, the default container for a stack<T> is a std::deque<T>. Often a vector uses less memory and is faster, however never assume this is always the case.

Answer 3

The following demonstrates how to use a vector (a dynamic array in C++) to implement a stack. However, note that the C++ standard library already has a built-in stack, std::stack, that achieves exactly the same thing. There is no need to implement your own like this.

#include<iostream>

#include<vector>

template<typename T>

class stack

{

private:

std::vector<T> m_stack;

public:

void push(T value) { m_stack.push_back(value); }

void pop() { m_stack.pop_back(); }

const T& top () const { return m_stack.back(); }

};

int main()

{

stack<int> s;

std::cout << "Pushing onto stack..." << std::endl;

for (int v=0; v<10; ++v)

{

std::cout << v << std::endl;

s.push (v);

}

std::cout << "Popping from stack..." << std::endl;

for (int i=0; i<10; ++i)

{

std::cout << s.top() << std::endl;

s.pop ();

}

}

Answer 4

C language doesn't say anything about stacks and queues. You can implement those types, if you want, but first you have to choose a base-type, which defines the type of the stack- or queue-elements.

Answer 5

Stack is a special queue (or list), which has two main operations: push=add-to-the-beginning and pop=get/remove-from-the-beginning.

Note: Generic queues (or lists) have much more operations.