Node<T>::NextNode(void) const //it returns next of the Node
{
return next;
}
template <class T>
vo... T>* head, const T& item) //Adds a node at the end of the linked list
{ //it takes the head of the linked list
Node<T> *newNode, *currPtr=head;... rPtr=currPtr->NextNode(); //goes at the end of the list
newNode=GetNode(item); //Ge
lass
{
public:
int callno; //call number of the book
string bookname; //name of the book
string author; //author of the book
Book(int c_no,string bname,string auth);
void Prin... int c_no,string bname,string auth) //constructor of the Book class
{
callno=c_no;
author=auth;
boo
int StackList[MaxStackSize]; //Stores the values of stack items
int TypeList[MaxStackSize]; //Stores the type of items i.e. 1 for operators 0 for operands
int t... detects whether the item is an operator or a part of operand.
case '+': // detects an addit... pression
while(!s2.StackEmpty()) //it leaves out of the while when all the items are popped from s2
tItems(Person* Record2,int end) //Lists the items of the Record2
{
clrscr(); //clearscreen
for(... e a Person's Record\n";
cout<<"Enter the Number of the Entry than press Enter-->";
cin>>entry;
M... Menu
}
void MainMenu(){ //the screen display of Menu
clrscr();
cout<<" .: MyPhoneBook 1