Skip to main content

Single linklist program in c++(only inserting and display function)

#include<iostream>
using namespace std;

struct node{
int data;
node *next;
};

class sll{
private:
         node *head,*tail;

public:
        sll(){
        head=0;
        tail=0;
        }

        insert(int mydata){
        node *tmp=new node;
        tmp->data=mydata;
        tmp->next=0;
         int select;
        cout<<"Select one of this option\n";
        cout<<"1.insert element at first position\n";
        cout<<"2.insert element at Any position\n";
        cout<<"3.insert element at last position\n";
        cin>>select;
            switch(select){
        case 1:if(head==0){
                    head=tmp;
                    tail=tmp;
                }else{
                tmp->next=head;
                head=tmp;
                }
               break;

        case 2:int cont;
               if(head==0 && tail==0){
                 cout<<"please enter the no. at begin or end first\n";
                 }
                  else{
                        int inst;
                        tail=head;
                        cout<<"Enter the element after you want inserting\n";
                        cin>>inst;
                   while(tail->data!=inst)
                {
                    cont=1;
                    tail=tail->next;
                }
                tmp->next=tail->next;
                tail->next=tmp;
                }
                if(cont==0){
                 cout<<"plzzz enter correct element\n";
                }
               break;


        case 3:if(tail==0){
                 tail=tmp;
                 head=tmp;
                }else{
                while(tail->next!=0)
                {
                    tail=tail->next;
                }
                tail->next=tmp;
                tmp->next=0;
                }
                break;

     default : cout<<"wrong output\n";

            }
        }


      void display()
    {
        node *tmp=head;
        if(tmp == NULL)
        {
            cout << "NULL" << endl;
        }
        else
        {
            while(tmp!=0){
             cout << tmp->data << endl;
             tmp=tmp->next;
        }
        }
    }


};

int main()
{
   sll a;
   char again;
   int select,input;
   do{
   cout<<"Enter the given inputs \n";
   cout<<"1.Insert the input\n";
   cout<<"2.display element\n";
   cin>>select;
   switch(select){

   case 1:cout<<"Enter the element\n";
          cin>>input;
          a.insert(input);
          break;

  case 2:cout<<"Your outputs\n";
        a.display();
        break;

default:cout<<"your select wrong output\n";
  }
   cout<<"Do you want to run again yes press y or Y (or) no\n";
   cin>>again;

   }while(again=='y'||again=='Y');

   return 0;
}

Comments

Popular posts from this blog

Sum of Digit is Pallindrome or not

  Sum of Digit is Pallindrome or not Given a number N.Find if the digit sum(or sum of digits) of N is a Palindrome number or not. Note:A Palindrome number is a number which stays the same when reversed.Example- 121,131,7 etc. Example 1: Input: N=56 Output: 1 Explanation: The digit sum of 56 is 5+6=11. Since, 11 is a palindrome number.Thus, answer is 1. Example 2: Input: N=98 Output: 0 Explanation: The digit sum of 98 is 9+8=17. Since 17 is not a palindrome,thus, answer is 0. Your Task: You don't need to read input or print aything.Your Task is to complete the function isDigitSumPalindrome() which takes a number N as input parameter and returns 1 if the Digit sum of N is a palindrome.Otherwise it returns 0. Expected Time Complexi...

Menu with 5 option & selected option should appear in text box

Q6. Create a menu with 5 options and selected option should appear in text box. Android Program : Activity_main.xml <?xml version="1.0" encoding="utf-8"?> <RelativeLayout xmlns:android="http://schemas.android.com/apk/res/android"     xmlns:tools="http://schemas.android.com/tools"     android:id="@+id/activity_main"     android:layout_width="match_parent"     android:layout_height="match_parent"     android:paddingBottom="@dimen/activity_vertical_margin"     android:paddingLeft="@dimen/activity_horizontal_margin"     android:paddingRight="@dimen/activity_horizontal_margin"     android:paddingTop="@dimen/activity_vertical_margin"     tools:context="com.kishanhaldar.program6.MainActivity">                 ...

Closest Number

Closest Number Basic Accuracy: 11.21% Submissions: 1615 Points: 1 Given non-zero two integers N and M . The problem is to find the number closest to N and divisible by M . If there are more than one such number, then output the one having maximum absolute value .   Example 1: Input: N = 13 , M = 4 Output: 12 Explanation: 12 is the Closest Number to 13 which is divisible by 4. Example 2: Input: N = -15 , M = 6 Output: -18 Explanation: -12 and -18 are both similarly close to -15 and divisible by 6. but -18 has the maximum absolute value. So, Output is -18   Your Task: You don't need to read input or print anyth...