Data Structures

Search This Blog

2018 Qno2(c)

Get link
Facebook
X
Pinterest
Email
Other Apps

Here's the program:

Time Complexity: 0(1)

Logic for the above program:

NOTE:

n is not clearly defined in the question But it must be:

0<n<arrSize

Get link
Facebook
X
Pinterest
Email
Other Apps

Comments

Circular Queue (Data Structure) in C++

#include<iostream> using namespace std; static const int SIZE=5; //CIRCULAR QUEUE class CircularQueue{ int front; int rear; int arr[SIZE]; public: CircularQueue(){ front=rear=-1; } //enqueue void enQueue(int d) { if(front==0 && rear==SIZE-1) { cout<<"Queue is full\n"; return; } if(front==-1) { front=rear=0; } else { if(rear==SIZE-1){ rear=0; } else { rear=rear+1; } } arr[rear]=d; } //dequeue int deQueue(){ if(front==-1) { cout<<"Queue is empty\n"; return 0; } int d =arr[rear]; if(front==rear){ front=rear=-1; } else { if(front==SIZE-1) { front=0; } else { front++; } } return d; } //display void display(){ if(front==-1){ cout<<"list is empty\n"; } if(front>-1 && rear...

Queue(Data Structure) in C++

#include <iostream> using namespace std; //QUEUE class Queue { static const int SIZE = 5; int front,rear; public: int arr[SIZE]; //constructor Queue() { front = rear = -1; } //-----> methods //ENQUEUE void enQueue(int d) { if(rear == SIZE-1)//or (rear>=SIZE-1) cout<< "Queue is full. Can't add more elements than "<<SIZE-1<<endl; else { if (front == -1) front = 0; arr[++rear]=d; } } //DEQUEUE int deQueue() { if(front==-1 || front>rear)//or (rear>=SIZE-1) { cout<<"Queue is empty\n"; ret...

Binary Search Tree(BST) in C++

#include<iostream> using namespace std; //Node class class Node{ private: int data; Node* left; Node* right; friend class Tree; public: //constructors Node(){ data=0; left=right=NULL; } Node(int d){ data=d; left=right=NULL; } }; //TREE class Tree{ private: Node* root; public: //INSERT function Node* insert(Node* root, int data, bool a){ Node* ptr=new Node(data); Node* temp_Root=NULL; if(root==NULL){ root=ptr; return root; } else if(a==0){ temp_Root=root->left=insert(root->left, data, a); } else{ temp_Root=root->right=insert(root->right, data, a); } return temp_Root; } //DISPLAY void display_Post_Order(Node* root){ if(root==NULL) return; display_Post_Order(root->left); display_Post_Order(root->right); cout<<root->data<<" "; } }; //MAIN function int main(){ //We create a pointer pointing that will...

Powered by Blogger

2018 Qno2(c)

Comments

Post a Comment