Given a Binary Tree, print Left view of it. Left view of a Binary Tree is set of nodes visible when tree is visited from Left side. The task is to complete the function leftView(), which accepts root of the tree as argument. The problem is… Read More »Interview Series : Left View of Binary Tree
A Disjoint set which can be viewed as a collection of sets where in no element appears in more than one set. A disjoint set data structure is used to maintain a collection S = {S1, S2, S3, …, Sn} of disjoint dynamic set. We… Read More »Disjoint Sets Data Structure
A queue is a simple data structure that allows elements to be inserted from one end, called the rear (also called tail), and deleted from the other end, called the front (also called head).This behavior is called FIFO (First in First Out). TerminologyThe process of… Read More »Queue – Data Structure
A stack is a simple data structure that adds and removes elements in a particular order.Every time an element is added, it goes on the “top” of the stack. Only an element at the top of the stack can be removed, just like a stack… Read More »Stack – Data Structure
ALGORITHM An Algorithm is a finite set of instruction that perform a particular task. An Algorithm should satisfy following criteria. Input: Zero or more quantities are supplied externally. Output: At least one quantity is produced. Definiteness: Each instruction is clear and unambiguous. Finiteness: Algorithm must… Read More »ALGORITHM
Linear data structure: A data structure is said to be linear if its data item form a linear sequence. Examples of the linear data structure are: (a) Array (b) Linked List (c) Stack (d) Queue Array: An array is a collection of data elements of… Read More »Introduction Of Linear And Non Linear Data Structure
Data structures: A data structure is a way of organizing data items such that data items can be accessed efficiently. Or A data structure is a way of organizing data items that considers not only the items stored, but also their relationship to each other.… Read More »Basic Introduction Of Data Structures
Here, We are performing push and pop operation of stack. #include<stdio.h> #include<conio.h> void push(); void pop(); void main() { int ch,c; clrscr(); do { printf(“\n***SELECT OPERATION OF STACK**\n”); printf(“\n1.PUSH OPERATION\n2.POP OPERATION\n”); printf(“\nEnter you choice::”); scanf(“%d”,&ch); switch(ch) { case 1: push(); break; case 2: pop(); break;… Read More »Stack Push And Pop Operation