Page 657 - Computer science 868 Class 12
P. 657
4 char a[]=new char[100];
5 int top=-1;
6 void push(char c)
7 {
8 if(top==100)
9 { System.out.println("Stack full"); }
10 else
11 {
12 a[++top]= c;
13 }
14 }
15
16 char pop()
17 {
18 return a[top--];
19 }
20
21 boolean isEmpty()
22 {
23 return (top==-1)?true:false;
24 }
25
26 char peek()
27 {
28 return a[top];
29 }
30 }
31
32 import java.util.*;
33 public class Convert
34 {
35 Stack ob = new Stack();
36
37 String toPostfix(String inf)
38 //converts an infix expression to postfix
655
Sample Projects 655

