Manak Upadhyay manakupadhyay

Project Title

One Paragraph of project description goes here

Getting Started

These instructions will get you a copy of the project up and running on your local machine for development and testing purposes. See deployment for notes on how to deploy the project on a live system.

	/*
	Evaluation Of postfix Expression in C++
	Input Postfix expression must be in a desired format.
	Operands must be integers and there should be space in between two operands.
	Only '+' , '-' , '*' and '/' operators are expected.
	*/
	#include<iostream>
	#include<stack>
	#include<string>

	/* Doubly Linked List implementation */
	#include<stdio.h>
	#include<stdlib.h>

	struct Node {
	int data;
	struct Node* next;
	struct Node* prev;
	};

	/*
	C++ Program to check for balanced parentheses in an expression using stack.
	Given an expression as string comprising of opening and closing characters
	of parentheses - (), curly braces - {} and square brackets - [], we need to
	check whether symbols are balanced or not.
	*/
	#include<iostream>
	#include<stack>
	#include<string>
	using namespace std;

	// Stack - Object oriented implementation using arrays
	#include <iostream>
	using namespace std;
	#define MAX_SIZE 101

	class Stack
	{
	private:
	int A[MAX_SIZE]; // array to store the stack
	int top; // variable to mark the top index of stack.

Manak Upadhyay manakupadhyay

Project Title

Getting Started

Prerequisites