Unnamed: 0,Questions,Sample_Answers,Student_Answers,Human_Assessment,Model Assessment 0,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,sequentially arranged data items,2, 1,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a type of data organization where elements are arranged in a sequential order, and each element has a clear predecessor and successor. Examples include arrays, linked lists, stacks, and queues.",2, 2,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"it stores data in a linear fashion like array,linked list",2, 3,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure in which elements are arranged sequentially, and each element has a unique predecessor and successor, except for the first and last elements.",2, 4,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data sturcturs which store only one address field.,0, 5,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a type of data structure in which data elements are arranged sequentially, and each element has a unique predecessor and successor (except for the first and last elements). ",1, 6,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data is stored in sequential or linear order .data structure having only one address field and traversal occurs linearly,0.5, 7,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure that stores information in sequential chunks of memory. This includes arrays ,vectors, etc. For example, in a array if we know the starting address, we can access all the elements are each of them are aligned after one another in the memory.",2, 8,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,The used memory structure is stored in continuous blocks like linked lists and arrays,1, 9,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure in which data is stored in linear way,1, 10,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are data structures in which data elements are stored in a linear sequence.,1, 11,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.," data structure which stores data in a linear fashion conscutively. Eg Array, Link List",1, 12,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,arrays and Linked List,1.5, 13,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure resembles a sequential and mostly ordered arrangement of data elements. A linear data structure has an adjacent and successive element with some value WHICH CAN ALSO BE NULL.,1.5, 14,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"in which data is store linearly for ex-linklist,array",1.5, 15,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure progresses in only one dimension. For example, arrays can only be traversed in a horizontal direction, and are an example of linear data structures. Some other such structures are strings, vectors, singly linked lists etc.",1.5, 16,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"The structure involves only a single level- allowing a user to traverse all its components in a single run. The linear data structure is very easy to understand and implement due to its linear arrangement, for example, stack, array, linked list, queue, etc.",1.5, 17,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is known as a data structure that allows data elements to be arranged in a sequential way,1, 18,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,is a data structure in which elements are arraged linearly like array and vector where we store address in a sequence ,0, 19,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,the data structure which stores data in a linear form like array queue ,1, 20,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structures in which data is stored linearly or sequentially are known as linear data structures.,0, 21,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,t is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements.,1.5, 22,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure,1.5, 23,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,liner data structer is arrangement of data in a squencitial way that are related to its previous and next data in some way.,1.5, 24,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"data structure with continuous memory allocation like arrays, queue,stack etc",1.5, 25,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data sturcture where everything is in a striaght line,1.5, 26,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear Data Structure: Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure. In linear data structure, single level is involved.",1, 27,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"The used memory is stored in contiguos blocks. like array, linked list etc.",1, 28,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure in which the data is stored in a linear fashion,1, 29,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure in which elements are arranged in a sequential order, and each element has a unique predecessor and successor except for the first and last elements. ",1, 30,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,The data structures which store data linearly without using any 2d style structure eg array,1.5, 31,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure which uses linear elements and every element connect with its previous and next elements,1, 32,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Array,Linked list",2, 33,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"a linear data structure, such as arrays, vectors, linked list follow linear linking of data points or values, whereas trees and graphs follow non linear linking in a hierarchical manner.",2, 34,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is one which is oriented in a single direction. That is element leads to one other. example: lists, arrays, etc.",2, 35,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,only one connection is between data,2, 36,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure are the ones which are connected linearly, i.e. only one node is connected to either its left or right. Eg.such as arrays, stacks, queues, etc",1.5, 37,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"The data structure like arrays, stacks, queues, linkedlists where values are stored in a sequence one by one.",2, 38,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure in which the current element is connected to next element with only one connection like in linked list or queue or stack,1.5, 39,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,LINEAR DATA STRUTRES ARE THE TYPE OF DATA STRUCTURES WHICH STORES THE DATA IN A LINEAR MANNER .,1.5, 40,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear traversal takes place,0, 41,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,2, 42,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,is a type of data structure where data is present in linear pattern,1.5, 43,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,LInear Data structure are like array which get stroed in linear form,1.5, 44,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A data structure which stored data only in one dimension is called as a linear data structure. eg - int , char , string , 1D array etc",1.5, 45,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the data is arranged in a linear trend. The data is arranged linearly such that the element is directly linked to its previous and the next elements.Also the data can only be stored in one direction.,1.5, 46,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is a type of data structure in which a node only has one pointer to the next node or to NULL,0, 47,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a data structure where elements are inserted linearly,0, 48,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structure stores data in a linear order ,i.e, one after the other. for eg. stack,queue",1, 49,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure in C++ is a data structure where elements are arranged sequentially with each element having a unique predecessor and successor.,2, 50,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is data structure which can only traverse in single direction like linked list,2, 51,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where data is stored and managed in a linear sequence. Data elements in the sequence are linked to one after the other,1, 52,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a type of data structure where the arrangement of the data follows a linear trend,1, 53,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a type of data structure where the data set is arranged in a linear format. Examples are arrays, queues, stacks etc.",1, 54,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A type of data structure structure where one node or one single element of that data structure is linked to ONLY ONE other element.,1.5, 55,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend.,1.5, 56,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"in a linear data structure, elements are arranged sequentially ie one after the other and eac element is attached singly or doubly to adjacent element(s)",0.5, 57,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is a type of data structure in computer science where data elements are arranged sequentially or linearly ,1.5, 58,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structures are those which ,2, 59,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structure is the one in which parent have only one child, not more than that",2, 60,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure the is represented in a linear format. eg arrays linked list. ,1.5, 61,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure where elements are arranged in a sequential order. Examples include arrays, linked lists, stacks, and queues.",2, 62,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,The data structure where the data is arranged in a sequential order where the previous data preceeds the upcoming ones in a linear trend.,1, 63,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is type of data structure which stores data in the form of linear array . ,1, 64,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure where elements are arranged in a sequential order, and each element can have at most two neighboring elements.",0, 65,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data arrangement where elements are stored sequentially, and each element has a unique predecessor and successor, creating a linear order.",1, 66,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure that stores data sequentially ,1, 67,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is the one in which the data is stored sequentially. That is the data is stored is stored one after the other in memory.,1, 68,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is a data structure which is mainly used to store the data. We can access the data using their successors or predecessors. ,1, 69,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,WHICH IS IN THE FORM 1D PLANE AND CAN BE EASILY ITERATIVE,0, 70,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A data structure in which traversal is possible only linearly, i.e, one after the other.",1, 71,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure where elements are arranged in a sequential order, and each element can have at most two neighboring elements.",1.5, 72,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is the one that can be traversed in a single line.,1.5, 73,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structure is one in which the data is linearly arranged like arrays, stacks , queues, etc. ",1.5, 74,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements. ,1.5, 75,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structures in which values are stored contiguously in memory,1, 76,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0.5, 77,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"It is a type of data structure where the data follows a linear type. example Array, LinkedList The data are arranged linearly like the element is linked to its before ,next elements.",0, 78,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,In this the data is stored in linear sequence.,1.5, 79,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,where traversal is be linear ,1, 80,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"value is stored one after another , uniformly connected in 1D faishon",1, 81,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"elements are stored sequentially, and each element has a unique predecessor and successor, example:- array",1, 82,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,That store data in arrays or linear form,0.5, 83,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure ,1.5, 84,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,in which element is attached to its previous and next adjacent linearly.,1, 85,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is input in linear way just like array,0, 86,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,EX-array,1, 87,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are structures which can be used only in one direction,1.5, 88,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,1.5, 89,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are data structures in which data elements are stored in a linear sequence.,1, 90,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,where data is connected to each other,2, 91,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,1.5, 92,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A ,0.5, 93,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"linear ds is one in which one node/entity is connected only two other entities, i.e. successor and predecessor",1.5, 94,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure which stores contiguous data and in one direction only,1, 95,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"If values can be inserted,stored and retrieved in linear fashion(via indexing ). Involves contiguous memory allocation. ",1, 96,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linked list and array are an example of linear data structures in which there is no height/level.,1, 97,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure in which elements are arranged in a sequential order, like a one-dimensional array or a linked list.",1, 98,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structures are arranged sequentially and every element is connected to previous and next element.,0, 99,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure where input can be stored in a contiguous block of memory. eg : Arrays and Stacks,2, 100,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure which stores data in a linear fashion ,0.5, 101,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,The data structures which contiguously succed in one direction for ex array; ,1, 102,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are the data structures used to store linear or single values ,1, 103,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure that organize the data linearly,1, 104,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear Data Structure: Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure.,1.5, 105,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a data structure where elements are arranged sequentially and each element can be traversed in a single run.Example:array,1.5, 106,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"data is stored in a linear sequential manner, elements are connected two way except first and last one",0.5, 107,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements. As the elements are stored linearly, the structure supports single-level storage of data only. Examples are arrays, linked list etc.",1.5, 108,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure in which elements are stored in contiguous memory locations. For example - Array.,2, 109,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a type of data structure in which data elements are arranged sequentially, with each element connected to its previous such as in arrays, linked lists, and stacks.",2, 110,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a type of data structure in which elements are organized sequentially, or in a linear fashion. This means that each element has a predecessor and a successor, except for the first and last elements. Common examples of linear data structures include arrays, linked lists, and stacks. Linear data structures are used for various applications where data needs to be processed in a sequential manner.",1.5, 111,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"a type of data structure in which data is stored linearly. it has fixed or dynamic size.eg: array,linked list.",2, 112,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a linear data structure is a way of storing data in which only one pointer is used to point the individual data nodes or sub data nodes. ,1, 113,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,t is a type of data structure where the arrangement of the data follows a linear trend,1, 114,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 115,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is connected to only one next node. Example arrays , linkedlists",1, 116,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is a 1dimensional data structure that have similar elementrs ,1, 117,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements.,1, 118,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a kind of data structure that is has only one connected to a specific value for ex arrays, linked list, queue...... Trees are not linear data structures",1, 119,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structure are like that they don't have any branching.,0, 120,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structure organizes data in a sequential order, like arrays and linked lists.",1, 121,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure in which elements are arranged sequentially, and each element has a unique predecessor and successor, except for the first and last elements.",1.5, 122,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structure is a type of data structure in which data elements are organized sequentially and each data element is connected to its previous and next data element to form linear element. Element are stored in specific order in liner data structure.,1.5, 123,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Arrays, Linked list, strings, vectors are all linear data structure. All the elements can be accessed linearly in one go.",1.5, 124,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"a data structure in which the insertion and traversal happens in one directions only. Eg: array, linked list, stacks.",1.5, 125,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend,1, 126,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structures are those data structures which dont goes in 2 direction like vectors or arrays,0.5, 127,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 128,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,LINEAR DATA STRUCTURE ARE DATA STRUCTURE IN WHICH DATA IS STORED IN A LINEAR FASHION SUCH AS ARRAYS,1.5, 129,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,LINEAR DATASSTRUCTURE ARE THOSE WHICH DO NOT HAVE HIRECHY LIKE ARRAY AND LINKED LIST,1, 130,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data sturcutre are data structure in which data is stored in a linear manner,1, 131,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend ,1, 132,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"data is stored in a sequence,elements are coonected but first and last element is not",0.5, 133,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure as the name suggests has the data arranged linearly meaning that we can traverse in two directions at most. Example of such data structure is array and linked list;,1.5, 134,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,WHERE DATA IS STORED IN A LENEAR ORDER ,1, 135,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 136,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure.,1, 137,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure,1.5, 138,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure in which various operations can be implemented in with linear time complexity.,1.5, 139,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., The data elements are arranged linearly such that the element is directly linked to its previous and the next elements. like arrays,1, 140,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structures are data structures in which data elements are stored in a linear sequence. They include: Arrays, Linked Lists, Stacks, Queues",2, 141,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"linear data structure is a collection of elements where each element has a unique predecessor and successor, and they are stored in a sequential order, making it easy to access and process them sequentially. Common examples include arrays, linked lists, stacks, queues, and vectors.",1.5, 142,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a structure int which a single node has only one link ,0.5, 143,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure which stores memory in a contiguous manner.,1.5, 144,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Where we can traverse every element of the data structure given a starting element,1, 145,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structures are the data structures in which the elements(or data) are stored in linearly manner, such as queue, stack, etc.",1, 146,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure in which data is arranged sequentially.,1, 147,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure can store data in a linear manner. eg) LinkedList,1, 148,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 149,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements. As the elements are stored linearly, the structure supports single-level storage of data.",2, 150,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure where elements are arranged in a sequential order, and each element can have at most two neighboring ",1.5, 151,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a data structure in which elements can be accesed in one direction and arranged in 1Deither top or bottom and can have one node connected further.,1.5, 152,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is that is 1 dimensional,0.5, 153,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"in these data structure,data is inserted linearly.eg array",1, 154,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,t is a type of data structure where the arrangement of the data follows a linear trend. ,1, 155,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure where data is sequentially stored or linearly attached to its previous data.,1.5, 156,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 157,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure which is connected linearly that is in a single direction.,1, 158,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"a data structure having no levels and the nodes in that can be traversed in linear order. for example array, singly linked list etc",1.5, 159,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"a linear data structure is one in which one can insert, traverse in uni direction only.",1, 160,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,The structure which can store values in a linear fashion(it can grow in one directon only),1, 161,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a linear data structure has contigouos memory allocation ,1, 162,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., It is a data structure where the data elements are inserted sequentially or lineraly.,1.5, 163,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"DATA STRUCTURE THAT CAN STORE DATA LINEARLY ONLY.FOR EX ARRAY,LINKED LIST",2, 164,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structure is the structure type where data is stored in a sequential manner. The current data is directly linked to the previous data. Such sequential structure thus supports single level link storage.,2, 165,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,the data structures that are stored sequentially are known as linear data structures,1.5, 166,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is that in which we traverse all data members of that data structure linearly i.e. we have to search each and every member.,1, 167,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are data structures in which data elements are stored in linear sequence.,1, 168,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,If a data structure organizes the data in sequential order example array,2, 169,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 170,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure which is well connected like- arrays.,1, 171,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear Data Structures are a type of data structure in computer science where data elements are arranged linearly.,1, 172,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are data structures in which data elements are stored in a linear sequence.,1, 173,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a type of data structure where the arrangement of the data follows a linear trend,1, 174,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structures for which memory needs to be allocated beforehand,1, 175,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure arranges elements sequentially in a straight line, such as arrays, linked lists, stacks, queues, and strings.",2, 176,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,array,0.5, 177,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structures are data structures in which data elements are stored in a linear sequence. Eg: Array, Linked Lists",2, 178,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data that is stored in a contiguous manner like array.,1.5, 179,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., A type of data structure where the data follows a linear trend,1.5, 180,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,stores data in contiguous memory locations,1, 181,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"The data structure in which elements are stored in a linear fashion that is the time complexity of traversal of data structure is O(n) i,e, traversable using one loop",1.5, 182,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,where data is sorted in linear order,0.5, 183,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structure is a structure where elements are arranged sequentially, like arrays or linked lists.",2, 184,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,which is connected to both previous and next pointer by similar node,1, 185,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"linear data structures are a type of data structure in where elements are arranged linearly. Each element has a previous and next element, except for the first and last elements.",1.5, 186,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,datastructure in which data is stored in a continuous manner,1, 187,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"When the data is stored in a linear format , it is called linear data structure eg 1d array , linked list etc.",2, 188,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"In which the elements is connected to its previous adjacent element and next adjacent element. for example singly linked list, 1d array.",1.5, 189,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"The structure involves only a single level- allowing a user to traverse all its components in a single run. The linear data structure is very easy to understand and implement due to its linear arrangement, for example, stack, array, linked list, queue, etc.",2, 190,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.," Linear data structue is where elements are arranged sequentially, and each element has a unique predecessor and successor, except for the first and last elements. It's like a chain where elements are linked one after the other. ",1.5, 191,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure in which we traverse in a linear way or one direction only,1, 192,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A LINEAR DATA STRUCTURE IS A STRUCTURE IN WHICH DATA IS INSERTED IN A CONTINUATION MANNER,1, 193,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a type of data structure in which data is arranged in a linear trend,1, 194,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear search is the simplest approach employed to search for an element in a data set. It examines each element until it finds a match, starting at the beginning of the data set, until the end. The search is finished and terminated once the target element is located.",1, 195,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is a structure to store data in a single directed mermory block,1, 196,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Structure in which data is stored sequentially.,1, 197,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,The linear data structure is a data structure in which data is stored linearly that is one can easily traverse through the data stored in a linear manner,1.5, 198,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structure is a format of storing data in such format that the data is stored in one dimension only, which means you traverse from one address to one other address only",1, 199,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure where elements are arranged linearly where each and every element is attached to its previous and next element.,2, 200,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a linear data structure is a data structure in which each element points to a single next element,2, 201,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged linearly where each and every element is attached to its previous and next element.,2, 202,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent,2, 203,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Data is arranged in a linear/Line structure. Ex - array, linked list, vector,etc",1.5, 204,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements.,2, 205,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a type of data structure where the arrangement of data follows linear trend,1.5, 206,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"it is a data structure which has sequence and is liner like stack,arry ,queue;",1.5, 207,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 208,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear Data Structures are a type of data structure in computer science where data elements are arranged sequentially or linearly. Each element has a previous and next adjacent, except for the first and last elements.",2, 209,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,the data stored in a linear manner i.e traversal is in single direction and insertion and deletion occurs at one end,1.5, 210,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Where one node/element is connected to one other element only,1.5, 211,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a type of data structure in which elements are arranged sequentially, one after the other. ",1.5, 212,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structure is type of structure which stores data in linear format. Eg: Array, Stack, Queue, Linked List.",1.5, 213,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 214,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure ,0, 215,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structure is data structure which traverse in IS, example arrays.",1, 216,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure in which data is stored in a contiguous memory location and goes in 1 direction like in arrays,2, 217,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure means data is stored one dimensionally for example array,2, 218,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear Data structure is a type which stores data in a linear fashion . We can only access next Data value if we have address of previous one.,2, 219,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a type of structure in which we store the data in ,2, 220,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linaer data structuren is used to store the data in sequential manner.,2, 221,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"like array, linked list in which you can linearly traverse",1.5, 222,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,structure in which the data is stored in linear fashion.,1.5, 223,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,The ds is linear all elements are linked and ,1, 224,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"linear means in a single line . a data structure which requires the full memory together . ex - arrays , linked list . ",1, 225,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Data structure like arrays, linked list in which we can traverse in only one direction.",1, 226,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"structure in which data is stored in linear format like array vector,map",1, 227,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is one in which the data is linked together or stored together linear sequence eg array,1.5, 228,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure.,2, 229,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data Structure which stores data in linear fashion and each element is attached to its neighbour.,2, 230,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., a type of data structure where the arrangement of the data follows a linear trend,2, 231,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure that occupy continuous block of memory,2, 232,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Array,Linked list",1, 233,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures have only two,0, 234,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,in which serach the data in one traverse or(linearly),1.5, 235,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure stores the data in a sequential manner. The data is not scattered across the memory but is stored in a linear form. Example of a linear data structure is array,linked list,etc",2, 236,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"it is data structure that stores data in sequential manner one after another and not in a random ,manner",2, 237,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a data structure in which elements are stored in a linear structure.,1.5, 238,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structures that occupy a continous block of memory.,1.5, 239,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is the data structure which has only one level and stores data in one line ,1.5, 240,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent,1.5, 241,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is a sequence of data elements in which each element has a unique predecessor and successor and create bya one-dimensional arrangement,1.5, 242,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,elements stored in linear sequence or structure ,1.5, 243,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend,1.5, 244,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a linear data structure points only in one direction like array,1.5, 245,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data stored in a line like Linked list or array,1.5, 246,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a type of data structure in which data elements are arranged linearly,1.5, 247,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure in which data is stored in contiguous location ,1.5, 248,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is the type of datastructure in which the memory shared by the elements is consecutive,2, 249,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is an arrangement of data in which the data is arranged linearly. An example is linked list.,2, 250,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a type of data structure where the arrangement of the data follows a linear trend like linkedlist ,1.5, 251,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"linked list ,stack,queue ",1.5, 252,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a linear data structure is a type of data structure in which all the data are stored adjacent to each other with the help of node as they can store data and also the address of adjacent node.,2, 253,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is the struture where we traverse in 1 dimension,1, 254,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,where data is sorted in linear order,1, 255,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"data structures that are linearly connected. eX array ,linked list",1.5, 256,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a type of data structure in which data elements are organized sequentially, one after the other. Each element in a linear data structure has a unique predecessor and successor, except for the first and last elements, which have only one adjacent element. Linear data structures are typically used to store and manipulate a collection of data in a linear or sequential manner.",2, 257,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a type of data structure where the arrangement of the data follows a linear trend,1.5, 258,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where data is stored and managed in a linear sequence. ,1.5, 259,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0.5, 260,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0.5, 261,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Data Structures which can be created using discrete memory location that is need not be contiguous memory locations such as linked list, trees, graphs,etc.",1.5, 262,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., data structure where the arrangement of the data follows a linear trend,1.5, 263,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,arrangement of data follow linear trend,1, 264,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., A LINEAR DATA STRUCTURE IS LINEAR TYPE OF STRUCTURE ,1, 265,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure in which memory allocated is linear like arrays for eg.,1.5, 266,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,IN LINEAR DATA STRUCTURE THE DATA IS STORED IN STRAIGHT OR SEQUENCIALY,1, 267,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is a type of data structure in which we can link our node to one node only like linked list . in linear data structure one node can only attach to another single node.,1.5, 268,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data struture is the one in which the data flows in one direction .,1.5, 269,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,singly link list,1, 270,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Where every data is linked or connected to a single data ,1, 271,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data is stored in linear manner,1, 272,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"linear data structures is data structure in which data is stored in linear structure. example-linked list,array,stack and queue",2, 273,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is a strucutre which does not have any linked children and can be traversed in a single go.,1.5, 274,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data is stored in contiguous memory locations in linear data structure,1.5, 275,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,DATA STRUCTURE WHERE ARRANGEMENT OF DATA FOLOWS A LINEAR TREND,1.5, 276,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structures are those structures in which the data is stored in linear trend. Linear data structures are simple and easy to use however they are not that memory efficient as compare to non linear data structures. For ex- Arrays , Stacks, Linkedlists",2, 277,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure where continuous memory blocks are allocated,1, 278,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure linked list or queue where nodes are linked and accessed my traversal.,1.5, 279,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend,1.5, 280,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure. ,2, 281,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend,1.5, 282,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a data structure where elements are arranged sequential manner where each and every element is attached to its previous and next adjacent is called a linear data structure.,1.5, 283,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is a structure where data is stored in a line.,1.5, 284,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,In this data structure data is stored linearly ,1, 285,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is a type of structure in which data is stored linearly in form of arrays and linked list,1.5, 286,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a type of data structure in which each element is connected to its adjacent element like in linked list,1.5, 287,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structure is a data structure in which data ,1.5, 288,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure like linked lists or queue in which nodes are connected in a LINEAR FASHION and are accessed linearly like in arrays.,1.5, 289,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a linear data structure is the one in which data is stored on cotagious memory allocations . for example :array ,1.5, 290,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend.,1.5, 291,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"it is type of structure in which data is stored linearly (in a row). Ex-2D array, single linkedList",1.5, 292,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"linear type data structure are linearly connected examples are array, linked list",1.5, 293,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A structure which stores and organizes the data in a linear manner like an array.,1.5, 294,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A data structure that is in 1 D like array , linked list etc.",1.5, 295,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure where elements are arranged in a sequential order, and each element can have at most two neighboring elements.",1.5, 296,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"In linear data structure, data is arranged sequetially and adjacentllyone after another example- arrays, ",1.5, 297,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are which in which datais connected linearly unlike non linear which has parent and siblings ,1.5, 298,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"In linear data structure data inputted can only be accessed in a sequential order consecutively one by one and only in one direction , it is the very basic data structure example arrays.",1.5, 299,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,The data stored in a linear manner i.e. traversal is in single direction and insertion or deletion occurs from single end only.,1.5, 300,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"a type of data structure continuous data elements are stored . Eg- Array, Linked list",1, 301,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linea,1, 302,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it helps to sequently and linearly adjustment of data,1.5, 303,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linearly connected that is only one data is connected to other,1.5, 304,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"it is a type of data structure which occupies memory in a linear format. Which means that that the next element in the sturcture takes, the next memory location ",1, 305,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., In linear data structure data is stored linear manner one after other. for ex linked list. ,1.5, 306,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,its a data structure where the arrangement of data follows a linear path.,1.5, 307,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,the data structure in which data is connected in forward and backward manner only.,1.5, 308,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 309,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,In this data is stored in linear form,1.5, 310,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.," where elements are arranged in a sequential order, and each element can have at most two neighboring elements. eg: array",1, 311,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structures where data is stored in a contiguous linear manner where a data record is connected to the next adjacent and the previous data record and no other record. ,1.5, 312,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 313,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"data structure which are arranged lineraly that is in a single row for example array, linked list, stack , queue.",1.5, 314,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structure is a data sytructure where the data is stored in a line meaning that only one dat node comes after another data node.,1.5, 315,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are data structures in which data elements are stored in a linear sequence,1.5, 316,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Array is an example of linear data structure where the arrrangements of data follws in linear trend,1, 317,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a data structure in which memory allocation is continuous,1, 318,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,type of data structure in which an element is directly connected to the next element and all elements are placed linearly.,1, 319,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements. As the elements are stored linearly, the structure supports single-level storage of data",1.5, 320,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linked list and arrays are linear data structures.Basically when data is either stored in continuous memory blocks like in array or when a data structure holds the address to its next data point.,1, 321,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 322,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is a data structure in which data is organised or stored in contiguous block of memory,1, 323,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure in which data is stored in a linear way i.e one by one ,1.5, 324,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is type of data structure in which each element is linked to its adjacent elements eg linkedlist ,1, 325,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements. ,1, 326,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged linearly where each element is attached to its previous and next adjacent,1, 327,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure in which the operations are done with the linear time complexity,1.5, 328,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"In linear data structure , data is arranged sequentially and adjacently one after another Example - arrays, linked lists",1.5, 329,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure that uses linear space,1, 330,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged sequentially or linearly is called a linear data structure. ,1, 331,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"those which can be traversed in a single line, i.e. those with only next pointer",1, 332,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A data structure which follows a linear format,i.e we can traverse from one node to the node just after that or the node which is linearly connected to it.For example array and linked list.",1.5, 333,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is structure in which we store our data loike different things have different data structures,1, 334,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A type of data structure which only exists in one dimension,1, 335,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A type of data structure in which data is arranged in linearly.,1, 336,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"DATA STRUCTURES are structures like trees, graphs, arrays used to store information in a linear manner",1.5, 337,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"where the data is stored is stored and accessed in a linear way one after the other. eg:- arrays, stack,queue ",1.5, 338,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged in a linear way or in a sequence way and we can traverse all the elements in a single way.,1, 339,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,DATA STRUCTURE IN WHICH DATA IS ARRANGED IN LINEAR ORDER THAT IS END OF ONE IS CONNECTED TO FRONT OF ANOTHER.,1, 340,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure which is only one dimensional. it grows in only one dimension ,1.5, 341,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,WHERE ELEMENTS ARE ARRANGED SEQUENTIALLY OR LINEARLY.,1.5, 342,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Collection of nodes in a linear order in knowns as Linear data structure. eg Linked list, Stack, Queue",1, 343,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure in which data elements are linearly or sequencially ,1, 344,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are data structures in which data elements are stored in a linear sequence.,1, 345,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is a type of data structure where data elements are arranged sequentially or linearly.,0.5, 346,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure in which elements or data is linearly or sequentially distributed.,0.5, 347,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure in which data is stored in linear fashion(Single Line).,1, 348,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is type of data structure in which ke in case of array and pointers ,0, 349,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A data structure in which the elements are stored in a linea rsequence. Eg- Arrays, Linked List",1.5, 350,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a linear data structure is a data structure where elements are arranged in a sequential order data is arranged ,0, 351,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure in which data traversed in a continue fashion .,0.5, 352,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"a linear data structure is one which extends in a straight line and has no branching some examples of linear data structures are array , singly linked list",2, 353,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is just using a data structure containing data and pointer.,1, 354,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,in which data elements are stored in linear sequence,2, 355,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a type of data structure where the arrangement of the data follows a linear trend.,1, 356,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure which traverses linearly in a sequential manner.,1, 357,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,liner arrangement/organisation/collection of the data. ex Array,2, 358,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data is data structure in which ,1, 359,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear Data Structures are a type of data structure in computer science where data elements are arranged sequentially or linearly. Each element has a previous and next adjacent, except for the first and last elements.",2, 360,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,array,1, 361,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a type of data structure in which each element is connected to its adjacent element like link list.,1, 362,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,in which data is stored in continuous manner i.e. data in memory is given in a chunk for ex array,0, 363,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure in which elements are organized sequentially, and each element has a unique predecessor and successor, except for the first and last elements. This means that you can traverse the elements in a linear order, moving from one element to the next or the previous one.for example stack ,queue,linked list.",0.5, 364,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is arranged linearly in system memory and can be traversed fully in one traversal.,2, 365,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend,0.5, 366,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,continuous data elements stored is referred as linear data structure linear data structure,0.5, 367,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"where elements are connected linearly like link list, ",2, 368,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a liner data structure is a data structure which stores data in linear sequence and every element is attached to its previous element.ex-array. ,2, 369,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure which can be traversed in a single direction only,1, 370,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear Data Structure in which the data elements are linearly or sequentially distributed.,0.5, 371,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear Data Structures are a type of data structure in computer science where data elements are arranged sequentially or linearly. Each element has a previous and next adjacent, except for the first and last elements.",1, 372,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,array,0.5, 373,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear Data Structure: Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure,1, 374,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a linear data structure stores data in linear sequence ex array,2, 375,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure formed by contiguous block of memory.,0.5, 376,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"linear data structures are the structures which can be traverse in one run example array,",1, 377,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Structre that can be traversed in single direction,0.5, 378,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend. ,0.5, 379,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure where data element are arranged sequentially or linearly.,0.5, 380,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a data structure with order/level as 1.,2, 381,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are data structures in which data elements are stored in a linear sequence manner,0.5, 382,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is a way to organise data in a single direction,1, 383,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure where elements are arranged sequentially, and each element is connected to its previous and next adjacent elements.",0.5, 384,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,array,0.5, 385,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structures that can be traversed in a single direction,2, 386,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,an linear data is a collection of nodes and data are arrange in linear order,1, 387,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,in which data are stored in linera sequence,0.5, 388,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"linear data structure is like binary tree, linkedlist, queue, stack etc",1, 389,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., linear data structure having oinly oine reference pointer,0.5, 390,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"In this data structure the data is stored linearly [previous and forward pointers are used] example ->array,linked list. ",0.5, 391,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structures which can be accessed linearly or sequentially.,2, 392,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a way of storing the data following a linear trend,1, 393,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"the data where we store values in a way that it is connected to only one value like linked list, array etc",2, 394,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure. ,0.5, 395,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,ARRAYS AND LINKED LIST ARE LINEAR DATA STRUCTURE,0.5, 396,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,that involves the use of one pointer or has an linear storage capacity,0.5, 397,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"array, linked list etc",0.5, 398,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure in which data can be accessed linearly.,0.5, 399,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a set of values with similar data types where one node points towards only one another node.example array,0.5, 400,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A DS in which the elements are allocated memory in the storage in consecutive memory locations,0.5, 401,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure that can be traversed in one direction only.,0.5, 402,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"a linear data structure is one in which there is no hierarchy. all the values and instances of the data structure exist at same level. eg: single Linked list, array.",0.5, 403,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,every node stores the address or reference of the next node in the list and the last node has the next address or reference as NULL. ,2, 404,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure where data elements are arranged seqentially or linearly where each and every elemnt is attached to its previous and next adjacant is called linear data structure,0.5, 405,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Elements are arranged in sequential manner. every element is attached to previous,0.5, 406,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structures are data structures in which data elements are stored in a linear sequence. They include: array ,stacks linked list.",0.5, 407,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"The data structure in which data is arranged in an linear fashion like array,linkedlist",1, 408,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements. As the elements are stored linearly, the structure supports single-level storage of data.",0.5, 409,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure where element are arranged linearly or sequentially,0.5, 410,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a structure in which arrangement of data forms a linear trend,1, 411,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linked list,2, 412,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,that stores data in one dimensional form for example an array ,1, 413,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,in which data is stored in a linear format ex arrays,2, 414,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,where the arrangement of the data follows a linear trend,1.5, 415,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"In linear,every element is connected to its adjacent element.",1.5, 416,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure that stores ,1.5, 417,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"these are structures in which data is stored in a linear sequence ex. linked list , array.",1.5, 418,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure which ,2, 419,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"The data is stored in linear manner it has a follows a sequence eg. array,linked list etc;",1.5, 420,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"data structures which store the data linearly i.e. all the data can be traversed linearly. eg. linked list, array",0.5, 421,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.," A linear data structure is a type of data structure where data elements are organized sequentially, one after the other. Each element has a unique predecessor (except for the first element) and a unique successor (except for the last element) in the sequence. This means that every element (except the first and last) has exactly one element that precedes it and one element that follows it.",0, 422,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structures are those structures in which data elements are stored in linear sequence,1.5, 423,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements. As the elements are stored linearly, the structure supports single-level storage of data.",1.5, 424,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure,2, 425,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements,0.5, 426,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,which has data linearly in a sequential manner,2, 427,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is a structure where elements are arranged sequentially.,0.5, 428,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent ,1, 429,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"a set data structure which contain linkeadlist,array",1, 430,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"As it's name suggest, in linear data is a data structure where data is stored in linear fashion for example arrays, linkedlist etc.",0, 431,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a data structure which goes every value for searching throught out the array,2, 432,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure that uses linear space ,0, 433,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structures are arrangements of data elements in which the elements are stored sequentially, and each element has a unique predecessor and successor, except for the first and last elements.",0, 434,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a type of data structure where the arrangement of the data follows a linear trend,1, 435,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,arrangement of data in linear manner ,1, 436,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data strucutre is a data strucutre in which elements has a sequence and each each element has a unique predecessor and successor.,0, 437,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure in which data is arranged linearly.or sequentially,0, 438,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Those Data Structures in which traversal could be done only in a linear way.,2, 439,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure single,0, 440,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is a data structure in which elements are in a sequence In and data elements are arranged in a linear or one-dimensional method,0, 441,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"linked list, array",2, 442,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend.,0, 443,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure where data is stored in a linear way means data is stored one after another in 1d manner like arrays or linked lists,0, 444,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure.,0, 445,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,2, 446,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a type of data structure where the arrangement of the data follows a linear trend. ,0, 447,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure,0, 448,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where elements are arranged linearly where each and every element has its previous and next adjacent elements is called a linear data structure,0, 449,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"a type of data structure like array, linked list, vector, map, etc which can be extended in 1 direction.",1.5, 450,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 451,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure in which sequential order is followed in insertion deletion.,1, 452,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is where one data node can only point to one data node of the same type. In this structure, we uasually traverse the whole data structure to find nodes/elements. Examples - Arrays, Vectors, Linked Lists",2, 453,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements. As the elements are stored linearly, the structure supports single-level storage of data.",1.5, 454,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a structure which stores contiguous data in one dimensional form,1, 455,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., which are able to perform operations like insertion in only one direction,0.5, 456,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., a type of data structure where the arrangement of the data follows a linear trend,1, 457,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure that allows data elements to be arranged in a sequential or linear order,1, 458,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 459,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Array,0.5, 460,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure are those in which elments are stored in linear sequence,1, 461,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are data structures in which data elements are stored in a linear sequence.,0, 462,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are data structures in which data elements are stored in a linear sequence.,1, 463,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,datastructure which store the data linearly and all the data can be traversed linearly,1.5, 464,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.," data elements are arranged sequentially, one after the other.",1, 465,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structures dealing with,0, 466,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Structure in which arrangement of data,0, 467,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.," Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure. In linear data structure, single level is involved. Therefore, we can traverse all the elements in single run only. Linear data structures are easy to implement because computer memory is arranged in a linear way. Its examples are array, stack, queue, linked list, etc.",2, 468,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A data structure where elements are arranged sequentially, and each element is connected to its previous and next element. except first and the last element",1, 469,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.," A linear data structure is a data structure in which elements are arranged in a linear or sequential order, where each element is connected to its previous and next elements, except for the first and last elements. ",1, 470,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged sequentially or linearly,1, 471,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 472,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a linear data structure is used to store data in a linear and simplified form,1, 473,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,where data is stored in a row in one dimension,0.5, 474,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 475,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,array,0.5, 476,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure in which elements are arranged sequentially, one after the other. Common examples include arrays and linked lists.",2, 477,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A type of data where linear trend is followed.,1, 478,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure which are arranged in linearly form ,1, 479,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure only has one level and performs linear searching in the data structure,1.5, 480,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure that stores data in a linear form one after another e.g. linked list,2, 481,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure are those in which element are stored in linear sequence,1, 482,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure are those in which elements are stored in linear sequence,1, 483,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a data structure which allows the data to be arranged in a sequential order.,1, 484,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"many kind of data , of structure ",0, 485,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure which incorporates a linear input stream and the flow of data follows a linear data,1, 486,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 487,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a data structure which is linearly structured and is arranged in horizontal pattern,1, 488,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,in which sata stores sequentially,1, 489,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,one dimension ,0.5, 490,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear Data Structures are a type of data structure in computer science where data elements are arranged sequentially or linearly. Each element has a previous and next adjacent, except for the first and last elements",1, 491,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,this type of data structure will save data in liner way,1, 492,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure that occupies continuous blocks of memory,0.5, 493,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure of degree 1.,0.5, 494,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a type of data structure in which the elements are arranged sequentially, and each element is connected to its previous and next element (except for the first and last elements). In a linear data structure, data elements are stored in a linear or sequential manner, making it easy to traverse the elements in a single pass.",1.5, 495,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.," A linear data structure is a one-dimensional collection of elements where each element has a unique predecessor and successor, except for the first and last elements.",1, 496,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linked List,0.5, 497,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,type of data structure where the arrangement of the data follows a linear trend.,1, 498,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is single dimensional data structure which can be traversed linearly,1, 499,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear Data Structures are data structures in which elements are linearly or sequentially arranged where each and every element is attached to previous and adjacent next element. ,1, 500,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure which stores data in a linear form . for example -> linked list.,1, 501,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,the data structure in which we traverse all the data members lin,0.5, 502,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,One in which data is inserted in one direction only.,1, 503,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structure is a data structure in which data is stored in a linear format such that previous data is linked to the subsequent data.,2, 504,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure in which elements are arranged sequentially.,1, 505,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are those ,0, 506,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are data structures in which data is stored in linear sequencehich data elements are stored in a linear sequence,1, 507,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Data structure in which elements are arranged linearly or sequentially,one after the other.",1, 508,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structures in which data is stored in contiguous manner.,1, 509,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure stores data elements in a sequential order.,1.5, 510,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,they are data structure like array and linked list etc where data is stored in linear form one after other,1.5, 511,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a 1-D data structure ,0.5, 512,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Data structures which store data in lienar form are called linear data structures. For example: Array, Linked List,etc.",1, 513,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,in this type of data structure data is stored in a sequential manner,1, 514,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure where data is arranged sequentially ,1, 515,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structures in which the flow of insertion of elements is in a single direction for example array and linked lists,1.5, 516,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structures are data storage elements which can be traversed linearly,1, 517,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,,0, 518,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a linear data structure is a data structure whose size is decided at compile time example array. example of non linear data structure is linked list.,0, 519,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,LINK LIST with has only 1 node linked with its next,0.5, 520,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structures are data structures in which data elements are stored in a linear sequence.,1, 521,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a type of data structure that stores data linearlly in a line,1, 522,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements. As the elements are stored linearly, the structure supports single-level storage of data.",2, 523,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure that can be traversed using linear seach,0, 524,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a type of data structure where elements are arranged in a linear or sequential order..eg stack,queueetc",2, 525,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure in which data is arranged lineary with accessing previous and next d.,0.5, 526,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure only has one level and performs linear searching in the data structure. We can therefore traverse all elements in a single run.like arrays etc,0.5, 527,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure where data is arranged linearly ,1, 528,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Where data is inserted sequentially or linear fashion from either of two the ends or both ends,1.5, 529,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Those data strucures which can store data in linear form.,1, 530,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,elements in sequential order,1.5, 531,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linked list ,1, 532,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,array,1, 533,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,method of finding ,0, 534,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure which stores data in a continuous manner,0.5, 535,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,ata structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure,1.5, 536,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structure are linledlist, array , stack , queue , in which data is stored linearly",1.5, 537,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"in linear data structure , the data arrangement follows the linear trend , means the data forward is linked to previous data",2, 538,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,every node stores the address or reference of the next node or has adjacent elements ,1, 539,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it stores data in contiguous memory loation,0, 540,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure,2, 541,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements. fOR EXAMPLE IN LINKED LIST, one node is directly connected to other , so it is a type of linear data structure",2, 542,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure that can be traversed in one order only. example array.,1, 543,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure traversed in one order,1, 544,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,ARRAY ,0.5, 545,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,arrangement of data with linear trend,1, 546,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,traversed in 1 order,0.5, 547,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"data structures that travels in one direction forward, backward, downward or forward ",1, 548,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,where data is inserted sequentially or linear fashion from either of two the ends or both ends,1, 549,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear data structures store data in a linear sequence for example array,queue,stack",2, 550,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,an arrangement of data linearly ,0.5, 551,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,array ,0, 552,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., Linear data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent.,1.5, 553,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.," A linear data structure is a data structure where elements are arranged in a sequential order, and each element has a unique predecessor and successor, except for the first and last elements. Examples include arrays, linked lists, and queues.",2, 554,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,the data is stored and arranged and memory is allocated in a linear manner,1, 555,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend.,1, 556,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear Data Structures are a type of data structure where data elements are arranged sequentially or linearly. they can be linearly traversal using indexes like in arrays.,2, 557,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"examples are arrays ,linked list . it include all those data structures which where all the elements are connected in a single manner that is each element is connected to only one element",2, 558,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"example array, address used to store data occurs one by one ",0.5, 559,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a type of data structure where the elements are arranged in a sequential order, and each element can be accessed, traversed, and processed in a linear or sequential manner. In a linear data structure, each element has exactly one predecessor and one successor, except for the first and last elements.",2, 560,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., A STRUCTURE in which arrangement of data ,0, 561,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"In linear data structure, the data elements are stored in linear order.",1, 562,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,array,0, 563,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data structure that has elements in sequential order,1, 564,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure that allocates contiguous memory to store data,0.5, 565,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure that allocates contiguous memory to store data,0.5, 566,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend. The data elements are arranged linearly such that the element is directly linked to its previous and the next elements,1.5, 567,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,It is a type of data structure where the arrangement of the data follows a linear trend. ,1, 568,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure is used to store data linearly i.e in continuous memory.,0.5, 569,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,linear data structure i data element is arranged sequentially to each nect and adjacent,1, 570,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"which move in one direction only like array ,single linked list.",0.5, 571,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"linked list, array",0.5, 572,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structure is a type of data structure where the data is inserted in a linear or sequential form. For example array,2, 573,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data strucute arrange linearly ,1, 574,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A LINEAR DATA STRUCTURE ALLOWS TRAVERSAL IN SINGLE DIRECTION EITHER FORWARD OR BACKWARD AND TAKE O(N) TIME TO TRAVERSE.,0, 575,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"They are a type of data structure where data elements are arranged sequentially or linearly. Each element has a previous and next adjacent, except for the first and last elements.",2, 576,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"Linear Data Structures are a type of data structure in computer science where data elements are arranged sequentially or linearly. Each element has a previous and next adjacent, except for the first and last elements.",2, 577,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure in which the elements are stored in a linear fashion ex. Linear Linked List,2, 578,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Linear data structure stores data in a sequencially manner.,1.5, 579,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A linear data structure is a structure where elements are adjacent to each other and is arranged sequentially ,1.5, 580,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"LIKE LINKEDLIST, STACKS, QUEUES, ARRAYS, THAT ARE DIRECTED IN ONE MANNER (STRAIGHT)",1, 581,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,where the elements are stored in a linear structure that is one element can point to only one element,1, 582,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure., data structure where arrangement of data follows a linear trend.,1, 583,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,it is a data structure which is linear,0.5, 584,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,type of data where arrangment of the data follow a linear trend ,1, 585,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,A data structure where all new data is inserted in a linear sequential manner and data traversal is also in a linear manner,1.5, 586,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,data entries stored in lionear fation,1, 587,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,that takes in linear complexity,0, 588,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,having continos memory location allocated,0.5, 589,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,a data structure in which only one element is added after another,1, 590,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,array linked list,0.5, 591,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,"A linear data structure is a data structure in which elements are arranged in a linear or sequential order, such as a list, array, or linked list. Elements in a linear data structure are accessed and processed in a sequential manner.",2, 592,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure.,1.5, 593,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,whiThe structures which stores data of same data typeat contiguous memory. Ex- array,1, 594,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are examples of linear data structure.,Which is connected all together in a straight line,0.5, 595,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal",2, 596,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations on a data structure include insertion (adding elements), deletion (removing elements), retrieval (accessing elements), and traversal (visiting all elements). Additionally, some data structures support operations like searching, sorting, and updating elements.",0.5, 597,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , searching ",2, 598,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations on data structures include insertion, deletion, searching, traversal, access, and modification of elements, as well as various specific operations depending on the type of data structure.",2, 599,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,searching,1, 600,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Data structures are used to store and manage data efficiently. Common operations that can be performed on data structures include: 1- Data structures are used to store and manage data efficiently. Common operations that can be performed on data structures include: Insertion,Deletion,Sorting,Searching.",2, 601,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,sorting etc",1.5, 602,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, updation and seaching are some of the most common operations on data structures. However, not all the operations are supported in all data structures,. For ex, we cannot update a set data structure or we cannot search in queues and stacks, etc.",1.5, 603,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Traversal , searching ,deletion ,insertion",2, 604,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion",2, 605,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Data Structure is the way of storing data in computer’s memory so that it can be used easily and efficiently. There are different data-structures used for the storage of data. It can also be defined as a mathematical or logical mode.,1, 606,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, traversal ,Sorting",2, 607,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, insertion, deletion, traversal",1, 608,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, traversal",1, 609,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching",2, 610,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, traversal, searching sorting etc.",0.5, 611,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Common operations that we can perform on any data structure is 1.Insertion 2.Deletion 3.Search 4.Traversal 5.Sorting 6.Merging,1, 612,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,It is the way of storing data in computer’s memory so that it can be used easily and efficiently. There are different data-structures used for the storage of data. It can also be defined as a mathematical or logical model of a particular organization of data items.,1, 613,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,we can use queue and stack and binary tree such that we can reduce the overall time complexity of the algorithem ,1.5, 614,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,1, 615,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Operations like Traversal, Searching, Insertion, Deletion can be performed on data structures.",1, 616,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,1, 617,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Searching – We can easily search for any data element in a data structure. Sorting – We can sort the elements either in ascending or descending order. Insertion – We can insert new data elements in the data structure. Deletion – We can delete the data elements from the data structure.,1, 618,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , searching, sorting , updatation, deletation and many other",1, 619,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, updating, searching etc.",1, 620,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"push, pop, peek are commo functions that can be performed on data structures ",1, 621,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion,merging/combining , splitting",2, 622,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Traversal, Searching ,Finding Height etc.",1, 623,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on data structures are insertion, deletion, updation , traversal , searching.",1, 624,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common oper insertion, deletion, searching, traversal, and manipulation of data. ",1, 625,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"The most common operations that can be performed are insertion, deletion, updation.,searching etc;",1, 626,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, sorting, deletion and insertion",1, 627,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion,updation",1, 628,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"traversal, value printing, insertion, deletion, searching, sorting, finding extrema (minima and maxima) etc.",1, 629,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Traversal, Searching, Deletion",1, 630,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insert,delete,update,search",0, 631,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insert new element, delete an element, iterate through the elements",2, 632,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Trees: insertion, deletion, searching, updating. Stacks and Queues: push, pop, enqueue, dequeue, isEmpty",1, 633,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,display",1, 634,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION,DELETION,UPDATATION,SEARCHING",2, 635,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,sorting,insertion,updation,deletion",0.5, 636,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,searching sorting insertion deletion ,1, 637,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"inserting , deletion , searching , sorting",1, 638,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Search, inseart, delete",1, 639,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , searching",1, 640,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion , Deletion , Searching , sorting",1, 641,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on a data-structure are Insert, Traverse, Update, Delete, Search",2, 642,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence, Common operations on data structures include: Insertion Deletion Search Traversal Access Update Sorting Merging Searching and Sorting Algorithms Counting Mapping and Transformation Filtering Stack and Queue Operations Graph Traversal Heap Operations Hashing Balancing Resizing,2, 643,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, traversal",1, 644,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,Deletion, Access,Search,Traversal,Update,Sorting,Searching",1, 645,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion.and traversl",1, 646,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, traversal, searching, sorting",1, 647,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,sorting,insertion,deletion",2, 648,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Some of the common operation are insertion, deletion, searching and sorting.",2, 649,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion , Searching ,Deletion.",1, 650,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, updation, traversal, deletion and searching",1, 651,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, sorting, searching",2, 652,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion, ",1, 653,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching ,sorting,insertion ,traversal,deletion",2, 654,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal, searching, sorting",1.5, 655,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, sorting, searching",2, 656,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Traversing,Searching, Insertion,Deletion",2, 657,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"We can perform searching, sorting, insertion, deletion.",2, 658,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion, updation",1.5, 659,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,op in ds Access/Search: Arrays: Linked Lists: Trees: Hash Tables: Insertion/Append: Deletion: Push: Add an element to the top of the stack. Pop: Remove and return the top element. Peek: View the top element without removing it. Queue ,2, 660,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations on a data structure include insertion, deletion, searching, and traversal.",2, 661,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion , deletion , updation , traversal , search",2, 662,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Basic operations that can be performed in a data structure are Insertion of data, Deletion of Data, Updation of Data and Traversal of data structures",2, 663,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Some commmon functions that can be performed on data structures are insertion, deletion, traversal etc.",2, 664,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion ,searching ,modify,",2, 665,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, searching, sorting",2, 666,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Access/Search: Arrays: Linked Lists: Trees: Hash Tables: Insertion/Append: Deletion: Push: Add an element to the top of the stack. Pop: Remove and return the top element. Peek: View the top element without removing it. Queue ,2, 667,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,traversal,searching,updating.",2, 668,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations which can be performed on a data structure are : insertion, deletion, searching, sorting, etc.",2, 669,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,earching – We can easily search for any data element in a data structure. Sorting – We can sort the elements either in ascending or descending order. Insertion – We can insert new data elements in the data structure. Deletion – We can delete the data elements from the data structure,2, 670,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion , Search, Traversing",2, 671,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion,2, 672,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,Deletion, Traverse",2, 673,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Traversing, searching, deletion ,create, sort ,update,merge",2, 674,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , searching ",2, 675,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, updation",2, 676,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion , search, traversal,sorting etc",2, 677,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion and searching",2, 678,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , searching ",2, 679,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,sorting,insertion,deletion",2, 680,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching",2, 681,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,Deletion,Searching and updation",2, 682,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on a data structure are they can be used for insertion , deletion and better memory usage etc",2, 683,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion,2, 684,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"data manipulation , data insertion ,etc",2, 685,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION,DELETION",2, 686,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion ,traversal",2, 687,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"the most common operations to be performed on a data structure include insertion into data structure, deletion from the data structure and traversing through the data structure.",2, 688,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insert, delete, update",2, 689,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insert delete update,2, 690,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, searching, sorting",2, 691,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"data can be added and stored, can be pudated, be traversed, and and be extracteed from a data structure.",2, 692,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence," Common operations on data structures include insertion, deletion, searching, and traversal (iteration or access of elements).",2, 693,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Searching, Updation,Addition, Subtraction, Division, Multiplication",2, 694,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Insertion and Deletion ,1, 695,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,traversals.",1.5, 696,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"deletion, insertion, traversal",1.5, 697,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion , deletion , Traversal,",1.5, 698,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, updation, deletion",1, 699,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION, DELETION, UPDATION,SEARCHING",1.5, 700,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"The common operations are:Insertion,deletion,searching,sorting",2, 701,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, searching, updation, sorting",2, 702,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, Updation , Searching",2, 703,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, Traversal",1.5, 704,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations on data structures include insertion, deletion, searching, traversal and updation.",2, 705,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Common operations that can be performed on data structures include: 1. **Insertion**: Adding new elements to the data structure. 2. **Deletion**: Removing elements from the data structure. 3. **Search**: Finding a specific element within the data structure. 4. **Traversal**: Visiting and processing all elements in the data structure. 5. **Access**: Retrieving or updating specific elements at a given position. 6. **Sorting**: Rearranging elements in a specific order. 7. **Merging**: Combining two or more data structures into one. 8. **Splitting**: Dividing a data structure into multiple parts. 9. **Updating**: Modifying the value of existing elements. 10. **Size/Length**: Determining the number of elements in the data structure. 11. **Empty Check**: Checking if the data structure is empty. 12. **Peek/Top**: Viewing the top element (common in stacks and queues). 13. **Push/Pop**: Adding or removing elements from the top (common in stacks). 14. **Enqueue/Dequeue**: Adding or removing elements (common in queues). 15. **Min/Max**: Finding the minimum or maximum element. The specific operations available depend on the type of data structure being used. Different data structures offer different trade-offs and are suited for specific tasks.,2, 706,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updation,searching,sorting",2, 707,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal, rotation etc are some of the operations that can be performed in a data structure.",2, 708,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching etc.",1.5, 709,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,0, 710,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Insertion and Deletion,1, 711,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,common operations that can be performed on data structure are insertion deletion,1, 712,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"operations are searching , sorting , insertion , deletion , swapping",2, 713,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion ,Deletion ,Storage, Traversal",2, 714,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"inseration,deletion,searching",1.5, 715,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations include insertion, deletion, traversal, searching, and sorting.",2, 716,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence," Common operations on data structures include insertion, deletion, searching, traversal, and modification of elements.",2, 717,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on a data-structure are insertion, deletion, searching and sorting",2, 718,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, updation",1.5, 719,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, traversal, searching, and Sorting(sometimes)",2, 720,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence, we can do saerching sorting inserting deletion with the help of data structures,2, 721,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"we can add , substract, divide 2 data structuress",0.5, 722,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,Deletion,Manipulation",0.5, 723,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION, DELETION, UPDATE",1.5, 724,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,INSERTION DELETION TRAVERSAL,1.5, 725,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,manipulation",0.5, 726,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,sorting, insertion,deletion",1.5, 727,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"isertion,deletion,searching,updation,sorting",2, 728,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"The common operations in a data structure are insertion, updation and deletion. ",1.5, 729,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERT, DELETE, SEARCH, SORT",1.5, 730,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,0, 731,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Searching, Sorting, Insertion, Deletion",2, 732,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion Sorting Searching",2, 733,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,traversal deletion insertion,1.5, 734,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, sorting, insertion, deletion, traversal,etc",2, 735,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, Traversal, Searching, Creation, Selection, Update, Merge, Sort, Split",2, 736,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,. Deletion, Traversal, Sorting, Merging/Combining, Splitting ,Counting",2, 737,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion sorting searching,2, 738,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion",1, 739,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion of elements. search for a particular element etc",2, 740,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion , deletion, searching",2, 741,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"traversal, insertion, deletion, searching",, 742,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,deletion,searching etc",1.5, 743,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"the common operations are insertion,deletion, and traversal",1.5, 744,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Searching,sorting,insertion,deletion.",1.5, 745,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Insertion/Searching,0.5, 746,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching",1, 747,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,search,delete",1.5, 748,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching etc",1.5, 749,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion ,searching,traversal,updation",2, 750,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,traversal/insertion/deletion/searching,2, 751,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, searching, sorting, deletion",2, 752,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,traversal,deletion,searching",2, 753,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, sorting , insertion, deletion",2, 754,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal, searching and sorting.",2, 755,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"the common operation performed are insertion,deletion,searching",1.5, 756,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal, searching, sorting",2, 757,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Traversal, Insertion, Searching, Sorting, Deletion, Updation",2, 758,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION,DELETION,MODIFY,UPGRADE",2, 759,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, updation, traversal",2, 760,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, updation, traversal",2, 761,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion , Traversing , Deletion , Searching",2, 762,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, sorting, insertion, deletion, merge, traversal are the various operations performed on the data structure .",2, 763,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence, We can easily search for any data element in a data structure.,0.5, 764,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, manipulation",1.5, 765,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, updation, deletion",1.5, 766,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,0, 767,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION ,DELETION AND UPDATION",1.5, 768,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Searching – We can easily search for any data element in a data structure. Sorting – We can sort the elements either in ascending or descending order. Insertion – We can insert new data elements in the data structure. Deletion – We can delete the data elements from the data structure.,2, 769,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, sorting, insertion, deletion, traversing",2, 770,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence," insertion, deletion, retrieval, and traversal of elements.",2, 771,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,0, 772,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Manipulation of Data, Traversing, etc.",1, 773,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, updating, traversal atc",2, 774,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Insertion and Deletion,1, 775,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching",1.5, 776,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion ,traversal",1.5, 777,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insert,delete,search,sort",2, 778,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations on data structures include insertion, deletion, traversal, search, and sorting.",2, 779,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, sorting, searching, etc",1.5, 780,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, traversing, searching, deletion.",2, 781,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,Deletion,Searching,Sorting",1.5, 782,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , updation",1, 783,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"to store data , their sorting, searching,deletion of data.",1.5, 784,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Searching, Sorting ,Deletion,search",2, 785,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,common operations that can be are traversing printing etc,0, 786,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, sorting, insertion, deletion",2, 787,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,TRAVERSAL INSERTION DELETION,1.5, 788,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,traversing etc",1, 789,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,ansraversing. Searching. Inserting. Deleting. Sorting. Merging,2, 790,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal",1.5, 791,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,traversal",1.5, 792,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion ,updation, traversing,",2, 793,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, Traversal",1.5, 794,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal",1.5, 795,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Traversal, Searching, Deletion",2, 796,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , transversal",1.5, 797,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"seaching,sorting,insertion,deletion",2, 798,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, traversal, searching, sorting.",2, 799,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching traversing,sorting",2, 800,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,searching sorting inserting deletion,2, 801,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"traversal,sort,delete,insert",2, 802,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"seaching,sorting,insertion and deletion",2, 803,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching , sorting , insertion , deletion and traversing ",2, 804,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion ,Deletion,Searching",1.5, 805,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, traversal",1.5, 806,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion: Adding a new element or data item into the data structure. This operation can occur at the beginning, end, or at a specific position, depending on the data structure. Deletion: Removing an element or data item from the data structure. Similar to insertion, deletion can occur at different positions within the data structure.",2, 807,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insert, search, delete, view",1.5, 808,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"traversing,searching,inserting,deleting,sorting",2, 809,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Searching, Sorting, Insertion and deletion.",2, 810,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, updation, searching",2, 811,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, searching, traversal, deletion",2, 812,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, sorting, traversal",2, 813,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, Searching, Updation, traversal",2, 814,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching ,sorting , updation, travesal and deletion etc",2, 815,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"creation,insertion,traversal,searching ,deletion,etc",2, 816,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion",1, 817,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,updation,deletion,traversal.",2, 818,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Insertion deletion searching,2, 819,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , searching , storage",2, 820,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion and deletion,2, 821,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insert, deletion , search , sorting, rotations",2, 822,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching , sorting, manipulation of data, traversing",2, 823,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion , Searching , Sorting",2, 824,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, Updation, Creation",2, 825,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Searching – We can easily search for any data element in a data structure. Sorting – We can sort the elements either in ascending or descending order. Insertion – We can insert new data elements in the data structure. Deletion – We can delete the data elements from the data structure.,2, 826,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal and searching",2, 827,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,traversal",2, 828,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"common operations that can be performed on Data strucures are--storing of data,deletion,insertion, searching.",2, 829,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,insertion,deletion.",2, 830,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Creation,insertion,traversing,searching,deletion",2, 831,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updation,reverse",2, 832,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Traversal,Delete,Search,etc",2, 833,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, Traversing and Searching",2, 834,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,traversing(searching)",2, 835,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,searching sorting insertion and deletion,2, 836,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations on data structures include insertion, deletion, search, traversal, and manipulation of data.",2, 837,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION,DELETION,TRAVERSAL,SEARCHING ETC,",2, 838,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,sorting,insertion,deletion,updation",2, 839,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion updating traversal,2, 840,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Updation,deletion,insertion,sorting etc",2, 841,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching,traversing",2, 842,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updation",2, 843,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"inserting elements, deleting elements, searching for elements, updating for elements, printing the data",2, 844,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Selection, Deletion and Updation",2, 845,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching , sorting , insertion , deletion ",2, 846,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,sorting,",1.5, 847,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insetion,deletion,traversal",2, 848,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal, searching",2, 849,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"SEARCH, INSEERT, DELETE, MAX, MINCOUNT OF DATA RECORDS, COUNT OF DUPLICATE RECORDS",1.5, 850,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, sort,",1.5, 851,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"access, insertion, deletion, search, traversal, sorting, merging, counting",2, 852,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, hashing, chaining, array, linkedlist, binary tree, graph",2, 853,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,INSERTION DELETION SEARCHING SORTING,2, 854,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,0.5, 855,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,0.5, 856,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, count, size, clear , sorting, empty, etc.",2, 857,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,searching sorting insertion deletion,2, 858,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,cmmon operations are insertion deletion ,1.5, 859,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION , DELETION,B SEARCHING, ",1.5, 860,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion and searching",2, 861,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION , SEARCHING , DELETION AND UPDATION",2, 862,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , traversing , searching",2, 863,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion ,searching traversal",2, 864,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION,DELETION,SEARCHING",2, 865,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, insertion, traversing , deletion",2, 866,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, searching",2, 867,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,deletion,traversal",2, 868,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"The common operations that can be performed on a data structure are insertion, deletion, transversal, searching and storage.",2, 869,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, update, deletion, traversal",2, 870,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,INSERTION DELETION UPDATION ,2, 871,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, searching are common operations that can be performed on a data-structure.",2, 872,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insert delete update traverse ,2, 873,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,traversal",2, 874,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"SEARCHING , SORTING, INSERTION, DELETION.",2, 875,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Searching – We can easily search for any data element in a data structure. Sorting – We can sort the elements either in ascending or descending order. Insertion – We can insert new data elements in the data structure. Deletion – We can delete the data elements from the data structure.,2, 876,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Searching – We can easily search for any data element in a data structure. Sorting – We can sort the elements either in ascending or descending order. Insertion – We can insert new data elements in the data structure. Deletion – We can delete the data elements from the data structure. More items...,2, 877,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"addition, subtraction, multiplication,division, modulus, power",0.5, 878,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion, traversal , updation etc. ",1.5, 879,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Operation like transversal, deletion, insertion",1.5, 880,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insert, delete, update",2, 881,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching,sorting",2, 882,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"The common operations that can be performed on a data-structure are insertion,deletion,searching",2, 883,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching, traversals, deletion",2, 884,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion, traversal , searching",2, 885,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion,Creation ",2, 886,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Searching, Sorting, Traversal",1.5, 887,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, implementation, deletion",1.5, 888,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion,traversal,sorting.",2, 889,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion , Deletion , Searching , sorting",2, 890,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"search, insertion, deletion",2, 891,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, updation, traversal",2, 892,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Insertion Deletion Searching,2, 893,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"data insertion , data deletion , data searching , data updation , data traversing , data outputting ",1.5, 894,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertin, Deleteion, Searching",2, 895,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion traversal,1.5, 896,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,0, 897,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updation,selection,sorting",1.5, 898,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion updation,1.5, 899,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"sort, search",1, 900,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion , transversal",1, 901,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,sorting,insertion,deletion",2, 902,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,sorting,insertion,deletion,etc.",2, 903,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Searching, Sorting, Insertion and Deletion",2, 904,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"operations used are insertion ,deletion,sorting,searching .",1, 905,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, insertion, updation",2, 906,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Search, insert, delete, max, min, count of data records, count of duplicate records",1, 907,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,0, 908,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion , updation , searching, sorting.",1, 909,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion ,searching ,deletion ,traversal",2, 910,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Data Structure is the way of storing data in computer’s memory so that it can be used easily and efficiently. There are different data-structures used for the storage of data. It can also be defined as a mathematical or logical,2, 911,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching and sorting,deletion,insertion",2, 912,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion traversal updation,2, 913,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,searching sorting insetion deletion,2, 914,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion, searching",2, 915,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, searching, sorting",1.5, 916,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,data storage and manupulation,1.5, 917,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion updating searching,1.5, 918,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching,traversal,updation are some of the most common operations performed in data structure",1.5, 919,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion updation searching sorting,1.5, 920,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Traversing, Searching, Insertion, Deletion, Creation, Updation",2, 921,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching ,sorting ,insertion deletion",2, 922,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , searching , updating , deletion",2, 923,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,Deletion,updation,traversals",1.5, 924,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion",1, 925,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion , Deletion , Update , Searching, Sorting.",1.5, 926,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, updating, searching",1.5, 927,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertions,Deletions,Traversal,Searching,Reversing.",1.5, 928,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,varios operations like insertyion deletion etc,1.5, 929,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal",1.5, 930,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, searching, sorting, traversing, storage",1.5, 931,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, sorting, searching, deletion",1.5, 932,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,traversal",2, 933,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal, searching, sorting etc.",2, 934,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"COMMON OPERATIONS ARE INSERTION,MODULUS,DELETION,ETC",1, 935,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,Updation,Deletion",1.5, 936,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,DELETION AND SORTING ,2, 937,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Insertion Deletion,1.5, 938,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , searching , updating ",2, 939,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,deletion,searching",1.5, 940,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,deletion,searching,sorting",2, 941,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, searching , various traversalss",1.5, 942,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Sorting & Searching,2, 943,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"common operations that can be performed are insertion ,deletion, traversing,merging,sorting,searching.",1.5, 944,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion Traversal",1.5, 945,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,array linked list trees hash tABLES insertion append ,1.5, 946,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , update ",1, 947,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion ,searching",1, 948,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, searching",1, 949,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching",2, 950,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, sorting, searching",1.5, 951,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, traversal and searching",1, 952,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, creation, deletion, merging",1, 953,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion,searching",1, 954,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence," is the way of storing data in computer’s memory so that it can be used easily and efficiently. There are different data-structures used for the storage of data. It can also be defined as a mathematical or logical model of a particular organization of data items. The representation of particular data structure in the main memory of a computer is called as storage structure. For Examples: Array, Stack, Queue, Tree, Graph, etc.",2, 955,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insert delete and search,1, 956,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,0, 957,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching,updating",1, 958,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,sorting,searching,traversal",1, 959,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, Traversal, Search, Data Storage, Sorting etc",1.5, 960,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,searching sorting deletion insertion,1.5, 961,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal",0.5, 962,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion,update",1.5, 963,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"sorting,searching,insertion,deletion,traversal",0.5, 964,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,traversal,searching",1.5, 965,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, Searching, Updating, Various forms of Traversal.",1.5, 966,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion.deletiom,0.5, 967,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,searching sorting insertion deletion,1.5, 968,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION , DELETION ,",1, 969,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal,searching ,sorting etc",1.5, 970,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, Updating, Searching",1.5, 971,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"traverser,insertion,deletion,updation etc",0.5, 972,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion,searching,soritng",1.5, 973,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,searching and sorting,0.5, 974,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion",0.5, 975,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updation etc.",0.5, 976,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"traverse, search, inserting , deleting and updating ",1.5, 977,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"linked list , stack , queue, heap, graphs , insertion, deletion",0.5, 978,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching etc.",1.5, 979,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,0, 980,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion searching sorting,0.5, 981,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion,0.5, 982,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion searching,0.5, 983,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"traversal, searching, deleteion, update",0.5, 984,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Traversing. Searching. Inserting. Deleting. Sorting. Merging ,0.5, 985,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence," operations like traversal, insertion, deletion, updation, searching can be done.",1.5, 986,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion, updation. ",0.5, 987,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"+,-,*,/,%",1.5, 988,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion , updation and traversals of data",0.5, 989,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updating etc.",1.5, 990,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,traversal, searching, deletion",0.5, 991,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, seaching storage",1.5, 992,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion,updation",0.5, 993,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updation etc",0.5, 994,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion,traversal ,searching",0.5, 995,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Search Insert Delete Sort,1.5, 996,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,selection,deletion",0.5, 997,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"various CRUD operations can be performed on data structures such as : updation ,deletion, traversal, insertion",0.5, 998,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"we performed the avl,bst,bt. dynamic programming,linked list",1.5, 999,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,0, 1000,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"traversing, searching, insertion, deletion",0.5, 1001,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, searching, sorting.",1.5, 1002,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"create,update,delete,search,tarverse",0.5, 1003,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Searching – We can easily search for any data element in a data structure. Sorting – We can sort the elements either in ascending or descending order. Insertion – We can insert new data elements in the data structure. Deletion – We can delete the data elements from the data structure,0.5, 1004,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion searching, ",0.5, 1005,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,updation,deletion,selection",0.5, 1006,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Traversals, searching, inserting, deletion etc",0.5, 1007,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, searching, sorting, updating etc",0.5, 1008,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,traversal deletion insertion etc,0.5, 1009,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , selection , deletion , sorting",0.5, 1010,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updation,searching,sorting",0.5, 1011,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"The common operations performed are insertion, traversal, deletion",2, 1012,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,. deletion , traversal , searching, sorting",0.5, 1013,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insert,Delete and Update",0.5, 1014,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"there are many operations like insertion,deltetion,searching",0.5, 1015,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, searching, traversing",2, 1016,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"arrays, linked lists, stacks, queues,trees, graph, hash tables, heaps,",0.5, 1017,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Data structures can be used for storing data, searching data,inserting or deleting data",0.5, 1018,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, updation, searching",0.5, 1019,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"TRAVERSAL,INSERTION, DELETION, MERGING ,SEARCHING",1.5, 1020,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion searching updation rotation etc,0.5, 1021,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, updating and deletion",1.5, 1022,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations on a data structure include insertion, deletion, search, access, traversal, and update.",0.5, 1023,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION, DELETION, UPDATE",0.5, 1024,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion,updation ",0.5, 1025,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversals",1.5, 1026,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,sorting,stack,queue,trees",0.5, 1027,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, ",1.5, 1028,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,Updation,Deletion",0.5, 1029,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Some common operations that can be performed on a data structure include: Accessing: Retrieving an element from the data structure, either by its position or by a specific key. Insertion: Adding a new element to the data structure. Deletion: Removing an element from the data structure. Search: Finding an element within the data structure, either by its value or by a specific key. Update: Modifying the value of an existing element in the data structure.",0.5, 1030,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,searching sorting insertion deletion,0.5, 1031,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,nsertion: Adding an element to the data structure. Deletion: Removing an element from the data structure. Search: Finding an element in the data structure. Access: Retrieving an element from the data structure. Update: Modifying an element in the data structure.,1.5, 1032,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updation,traversal",0.5, 1033,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION , DELETION , TRAVERSAL , PRINT ,",0.5, 1034,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,storing a data in different form and ways,0.5, 1035,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION , DELETION, SEARCHING, TRAVERSAL ETC",1.5, 1036,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"sorting, searching, hashing, chaining, array",0.5, 1037,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion , deletion,searching....etc",0.5, 1038,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"storing, insertion, deletion, searching etc.",0.5, 1039,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion ,searching, traversal ,sorting",0.5, 1040,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching,traversal",0.5, 1041,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching ,sorting,insertion,deletion",0.5, 1042,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"traverse,insert,delete,create,",1.5, 1043,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, sorting, searching, traversal",0.5, 1044,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,arthmatic operator,0, 1045,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent .,0, 1046,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion ,sorting, searching",2, 1047,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations are INSERTION, DELETION, SEARCHING, UPDATING",2, 1048,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Data Structure Operations – Searching – We can easily search for any data element in a data structure. Sorting – We can sort the elements either in ascending or descending order. Insertion – We can insert new data elements in the data structure. Deletion – We can delete the data elements from the data structure.,2, 1049,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, sorting,insertion ,deletion, rotation(in some structure)",2, 1050,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion traversal,1.5, 1051,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Searching,Sorting,Insertion, Deletion ",2, 1052,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"seaching,sorting,insertion",1.5, 1053,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Some common operations are :- Insertion, Deletion, Searching, Sorting, Travesal",2, 1054,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion,Deletion,Searching,Traversal",2, 1055,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,traversal ,sorting, deletion,updation etc ",2, 1056,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Insertion deletion storage traversal,1.5, 1057,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,insertion,deletion,traversal,sorting",2, 1058,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion ,1, 1059,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Searching ,Sorting, Insertion, Deletion ",2, 1060,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"traversal, insertion,deletion, searching.",2, 1061,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , selection , searching",1.5, 1062,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"traversing, searching, insertion , deletion ,sorting ,merge,split ,etc",2, 1063,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion , traversal , searching etc.",2, 1064,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion,1, 1065,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, sorting, insertion, deletion",2, 1066,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,,0, 1067,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,traversing,insertion,deletion,sorting",2, 1068,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insert ,delete , update, reverse ",1, 1069,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,traversal,searching",2, 1070,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,SEARCHING SORTING INSERTION building bst,1.5, 1071,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion traversal and searching,2, 1072,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion , Deletion , Sorting , Searching",2, 1073,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , delete , traversal",1.5, 1074,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"SEARCHING , SORTING , INSERTION ,DELETION",2, 1075,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insert,delete,search,traverse,update,etc",2, 1076,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion, updation,searching, sorting, traversal",2, 1077,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updation,searching,sorting,traveasal",2, 1078,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, sorting , deletion , insertion.",2, 1079,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"many , many , structure of data , array set ",0, 1080,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , traversal,updation,searching,sorting",2, 1081,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"deletion,insertion,updation",1, 1082,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insert,update,delete,search for an element",1.5, 1083,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"sorting, insertiomn, deletion, updation",2, 1084,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,storing data in different forms,0, 1085,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion deletion ,searching deleting",1.5, 1086,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"common operations that can be performed on a data-structure are insertion ,deletion, searching, traversal , ",2, 1087,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insert,update and delete",1, 1088,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , update , search , deletion",1.5, 1089,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion sorting searching traversal,2, 1090,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, search, traversal, sorting",2, 1091,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, Traversal",1.5, 1092,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,sorting,insertion,deletion",2, 1093,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, searching ",1.5, 1094,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, Searching, Sorting, ",1.5, 1095,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insert , delete , traverse, update , delete, etc.",1.5, 1096,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching,traversing,deletion,insertion",1.5, 1097,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, traversal, searching.",1.5, 1098,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"search , insert, delete, sort",1.5, 1099,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updation,traversal.",1, 1100,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"inserting,deleting,searching,updating,sorting",1.5, 1101,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , searching ",1, 1102,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,searching,sorting,deletion",1.5, 1103,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Various operations such as insertion,deletion,traversal,searching etc.",2, 1104,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence," Insertion, deletion, search, and traversal.",1.5, 1105,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,storing,0.5, 1106,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal, sorting, seaching",2, 1107,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"common operations include inserting, deteting and storing a data.",1, 1108,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insert,delete,print,search",1.5, 1109,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion",1, 1110,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, sorting, insertion, deletion, traversal",2, 1111,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , searching ,sorting , traversal",2, 1112,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, Searching, Traversal",1.5, 1113,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion , sorting, searching, updation",1.5, 1114,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"sorting ,searching ,data balancing by link list and trees",1, 1115,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, searching,and many other.",1.5, 1116,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"deletion,insertion,updation",1, 1117,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion, traversal",1, 1118,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insert search delete,1, 1119,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,traversal,searching",1.5, 1120,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion",1, 1121,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Searching, sorting ,insertion ,deletion etc",2, 1122,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"operations such as insertion ,deletion ,searching",1, 1123,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion , deletion and searching",1, 1124,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Common operations like insertion,deletion can be performed on a data-structure.",1, 1125,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching",1, 1126,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, updation, traversal",1.5, 1127,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion ,traversal",1, 1128,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching,sorting",1.5, 1129,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updation",1, 1130,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal",1, 1131,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , traversal",1, 1132,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"operations like insertion,deletion,traversal can be performed",1, 1133,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence," insertion, searching, deletion",1, 1134,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"INSERTION, DELETION, SEARCHING etc.",1.5, 1135,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Searching, Traversal, Deletion",1.5, 1136,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Traversals insertion deletion searching,1.5, 1137,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion updation,1, 1138,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updation,traversal",1, 1139,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,INSERTION AND DELETION,1, 1140,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"search,sort,delete,insert",1.5, 1141,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion updation deletion,1, 1142,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, sorting",1, 1143,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, searching, deletion.",1, 1144,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,the common operations that can be performed on a data-structure are 1)searching 2)sorting 3)insertion 4) deletion 5)traversal,2, 1145,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"innsert , delete , update,search",1.5, 1146,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion,1, 1147,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, searching, sorting",1.5, 1148,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"SEARCHING , SORTING , INSERTION , DELETION , ACCESS , TRAVERSAL,",2, 1149,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion updation traversal,1, 1150,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"SEARCHING,SORTING,INSERTION,DELETION",1.5, 1151,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion(push) , Deletion(pop), find(search)",1, 1152,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,traversal",1, 1153,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"search,insert,delete",1, 1154,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion,traversal,searching,updating,,soting etc",2, 1155,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,selection,updation",1, 1156,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence," Searching, Traversing, Insertion etc.",1, 1157,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion ,updation",1, 1158,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion searching,1, 1159,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, updation and deletion",1, 1160,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,updation",1, 1161,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Searching . Sorting . Insertion , Deletion",1.5, 1162,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searching, sorting, insertion, deletion.",1.5, 1163,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, searching etc.",1.5, 1164,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,searching sorting insertion deletion,1.5, 1165,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"searcing,sorting,insertioin,deletion,etc.",2, 1166,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"traversal, searching, insertion ,deletion",1.5, 1167,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,searching sorting delete insert etc.,2, 1168,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion , deletion and traversal ",1, 1169,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,TRAVERSAL/INSERTION /DELETION/UPDATION/SEARCHING,1.5, 1170,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion, ",1, 1171,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching",1, 1172,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion , Treversal, Searching ",1.5, 1173,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Insertion , Deletion ,Searching ",1, 1174,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Operations like insertion,deletion,traversal and searching can be performed on data structures",1.5, 1175,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"SEARCHING, INSERTION, DELETION",1, 1176,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversals, rotations",1, 1177,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"SEARCH , SORT ",1, 1178,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"Recursion , Searching ,sorting",1, 1179,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,searching sorting insertion,1, 1180,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,searching,updating,sorting,traversal",2, 1181,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insert delete print travedsal,1, 1182,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion , search",1, 1183,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insert delete traverse update,1, 1184,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion ,1, 1185,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion,deletion,traversal",1.5, 1186,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,insertion deletion updation,1.5, 1187,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,Data Structure Operations – Searching – We can easily search for any data element in a data structure. Sorting – We can sort the elements either in ascending or descending order. Insertion – We can insert new data elements in the data structure.,1.5, 1188,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"You can insert,delete,update the information.You can sort and arrange the data using hashing,trees etc.",1.5, 1189,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure − • Insertion − adding a data item • Deletion − removing a data item • Traversal − accessing and/or printing all data items • Searching − finding a particular data item • Sorting − arranging data items in a pre-defined sequence,"insertion, deletion and searching",1, 1190,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",first in last out based applications,1.5, 1191,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used to manage function calls in programming (the call stack), handle undo operations in applications, and solve problems where a Last-In, First-Out (LIFO) order of operations is required. They are also used in algorithms like depth-first search and in parsing expressions.",1, 1192,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack to perform LIFO operations stack is used in implementing recurrsion,1, 1193,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used to implement last-in, first-out (LIFO) behavior, making them suitable for managing function calls, expression evaluation, and other situations where items need to be processed in reverse order of their arrival.",1.5, 1194,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use when want that the which we inserted at last should we get at top.,2, 1195,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression.",1.5, 1196,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack is used where the operation of last in first out is required,1, 1197,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks are LIFO data structure that supports insertion and deletion from top helps in accessing the top most value. It is helpful in many practical applications and a method is which it is commonly used is called monotonic stack.,1, 1198,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",For operations where we have to use the principle of Last in First Out(LIFO) Eg. sorting in reverse order in linked list,1.5, 1199,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks to store data in an array in a way of last in first out,0.5, 1200,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A stack is a linear data structure in which elements are accessed, inserted and deleted from one end called the top of the stack. Stack follows the LIFO ( Last In First Out) approach. Two basic operations on a stack are push and pop.",1, 1201,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to collect data on top of each other . It makes data more easily accessible .,2, 1202,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",f,0.5, 1203,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks in applications where we need to access the elements in descending order of their insertion. For example a web browser uses stack to browse through web pages.,1.5, 1204,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",it is a linear data structure. we used it too stored elements .it works on operation first come last oot,1.5, 1205,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks operate on the priniciple of LIFO (Last In First Out). They can emulate the process of recursion without multiple function calls. They are useful in recursion removal, traversals in binary trees, backtracing algorithms etc. ",1.5, 1206,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used to manage function calls, memory, and data in a Last-In-First-Out (LIFO) manner, making them suitable for scenarios like function call management, expression evaluation, and undo functionality.",1, 1207,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression.",1.5, 1208,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",its for remembering part like its used in recursion it keeps track of the previous data that we have stored in it,0.5, 1209,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","FIFO,first in first out technique is used which allows as to execute first enterred or freshely entered element to be executed",0.5, 1210,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks are used when we want to store data in a specific order.,0.5, 1211,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks are used to implement first in last out,1, 1212,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators.,0.5, 1213,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,1.5, 1214,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to implement Last in First out (LIFO) concept.,0.5, 1215,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks are used as a container in which the elements enter from the top and are removed from bottom,1.5, 1216,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A stack is a linear data structure in which elements are accessed, inserted and deleted from one end called the top of the stack. Stack follows the LIFO ( Last In First Out) approach. Two basic operations on a stack are push and pop.",0.5, 1217,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","For Last IIn First Out operations (LIFO) like iterative binary tree /binary search tree traversals, tower of hanoi etc.",1, 1218,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks when we want to store data in LIFO order that is last in first out fashion,1.5, 1219,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used to manage data in a Last-In-First-Out (LIFO) manner. Common applications include function call management, expression evaluation, and backtracking in algorithms.",2, 1220,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack provide a optimized data structure to remove and insert a element from top,2, 1221,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to remove recursion in data structures,1, 1222,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","its based on the principle of LIFO so where we have to accumlate things first and then we have to do some operations ...like in recursion ,,,general life example pile of books",1, 1223,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks for LIFO order traversal where last inserted element is first to be removed.,1, 1224,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","We use stacks as it gives us a data structure oriented with the Last In First Out principle. This is of great significance in real-life, to immitate stack of any particular thing, and in programming, to implement level order traversal of binary trees",1, 1225,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",leaffolster,0, 1226,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stack Data Structure allows users to put elements on top and remove the elements from the top only. Thus, in problems such as Bracket Matching, Infix to Postfix where stack is the data structure that comes into play.",1, 1227,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks data structure is LIFO(last in first out) when we require an operation where we need to retreive the most recent value inserted, like in recursive stack, the browser's recent and next pages or in an operation using concept of stack of cards, we can use stacks to implement them in code.",2, 1228,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","LIFO list, when we want to see the first inserted element at last.",2, 1229,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",WE USE STACK WHICH IS A TYPE DATA STRUCURE AND HELPFULL IN STORING AND RETRIVING DATA AS IT WORKS ON THE PRINCIPAL OF LAST IN FIRST OUT,2, 1230,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",last in first out principle,2, 1231,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,2, 1232,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack when we need last pushing and first poping ,1, 1233,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack use to store many data and help operate them easily ,1, 1234,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stack is a FILO(First in Last out) data structure , and hence is use generally used when we have to a recursive code into an iterative code.",1, 1235,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",It can be used to reverse the elements of a structure . it can be used for evaluating expressions consisting of operands and operators. Stacks can be used to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. It can be used for systematic Memory Management.,1.5, 1236,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks are highly useful in replacing recursion with iteration.,1.5, 1237,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","LIFO (Last-In, First-Out) behavior Function call management Expression evaluation Undo operations Backtracking Parsing and syntax checking Memory management Task scheduling Expression parsing and evaluation Resource management History management Undo/redo functionality",1.5, 1238,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Functions that can be performed on stacks are push,pop,top().",2, 1239,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used to manage and track function calls, handle expression evaluation, and implement undo/redo functionality, among other applications.",1, 1240,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc."," stacks are a versatile and important data structure used in a wide range of applications to manage data in a LIFO manner, making them an essential tool for many programming and algorithmic tasks.",1, 1241,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","when we want the elements in a specific order , we use stack. also since recursion takes a lot of time so to remove recursion we use stack.",1, 1242,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.", for evaluating expressions consisting of operands and operators. ,1, 1243,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks to extract data in a Last in first out order (LIFO). Stacks can be used to backtrack data.,2, 1244,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks for reversing an array or vector as it is a first in and last out type of data structure.,2, 1245,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stackA Stack can be used for evaluating expressions consisting of operands and operators. to ,1, 1246,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","stacks use lifo (last in first out) which is a useful principle in certain operations where time complexity reduces to O(1). Its application include poynomial operations, infix to postfix, postfix to prefix etc.",1, 1247,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for first in last out,0.5, 1248,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",because it take less space ,1, 1249,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","we use stack when we need to use first in last out, it is used to store data in the order of which they appear",1, 1250,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to implement the basic principle of LIFO(Last in First out). Stacks are also used as a replacement for recursion ,1, 1251,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used to manage function calls, store temporary variables, and track execution history in algorithms. They follow the Last In, First Out (LIFO) principle",1, 1252,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks for evaluating statements which has operations which is related to comparing or matching the expression with the parenthesis.,1, 1253,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to store data in an efficient manner,1, 1254,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.", Undo/Redo Operations: Expression Evaluation: Balancing Parentheses:,1, 1255,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","We use stacks to manage data in a last-in, first-out (LIFO) order, often for tasks like function call management and backtracking in algorithms.",1, 1256,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack follows LIFO format and helps to remove use of recursion,1, 1257,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks are used to implement First In Last Out operations. That is when the last data set that goes in is the first to come out.,1, 1258,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks to store data and then we can perform the operations in LIFO format.,1, 1259,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack as it is LIFO last in first out,1, 1260,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",To make searching easier and to save data in a linear form,1, 1261,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Function Call Management: Undo/Redo Operations: Expression Evaluation: Balancing Parentheses:,1, 1262,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to store data in a way that we get the recent data first (LIFO principle).,1, 1263,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack is a LIFO(last in first out) data structure. It is often used to replace recursion. The element which is inserted at the end is popped first in a stack,1, 1264,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators,1, 1265,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we can use stack by either making use of in-built library or implementing it using other data structures like linked list ,1, 1266,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1267,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stack Is A Kind Of Abstarct Data Type Which Is Used To serve with collection of data to gain some operation , It Perform Operation Like Push Pop isEmpty,isFull,It Follow LIFO",1, 1268,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A stack is an abstract data type that serves as a collection of elements, with two main operations:Push, which adds an element to the collection, and Pop, which removes the element from collection.",2, 1269,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","to find the front element , it follows LIFO",0, 1270,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to follow lifo order,0, 1271,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks are commonly used for memory management,0, 1272,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to get LIFO mechanism (last in first out),1, 1273,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1274,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","push ,pop",1, 1275,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",it works on the LIFO(first in first out) so we want to utilize lifo property so we usage stacks,1, 1276,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",mainly to use it in place of recurison(wihtout recursion) in LIFO type,1, 1277,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks is used for stacking the stuff and memroy.,",1, 1278,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1279,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stack or queue instead of arrays/lists when we want the elements in a specific order i.e. in the order we put them (queue) or in the reverse order (stack),2, 1280,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for some purpose like undo option as it last in is first out,0.5, 1281,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1282,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1283,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","stack is lifo ds. last-in-first-out. they are used in call-stacks, and replacing recursion in program",1.5, 1284,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",follow leofo,0, 1285,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stack is known for it's first in first out feature. So, if we want to retrieve the data that is stored in last, we use stacks.",1.5, 1286,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","when computer runs, there are lot of tasks at hand and it need to prioritise and and execute tasks in an order, these tasks can be stored in stack.",1.5, 1287,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used to manage data in a last-in, first-out (LIFO) manner, making them suitable for tasks like function call management, expression evaluation, and undo functionality in applications.",1.5, 1288,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks so that we can access and insert data in a particular order.,1.5, 1289,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",It works on the LIFO(Last In First Out) principle. We use it where we want to utilize this LIFO property.,1.5, 1290,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.", Since stacks work on LIFO principle so they are used to perform the operations where we need the last data we have stored to be used first.,1.5, 1291,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","stack is a first in last out type data struture , we use it when we want to exract the data which we have put recently.",1.5, 1292,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Leave IN first out,1, 1293,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",The stack is a LIFO and has O(1) complexity,0.5, 1294,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to store and retrieve data form one specific end. IT IS USED FOR UNDO AND REDO COMMANDS IN VARIOUS APPLICATIONS.,1, 1295,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used to manage function calls, store temporary variables, and track execution history in algorithms. They follow the Last In, First Out (LIFO) principle.",1.5, 1296,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",data structure that stores data and it is a last in and first out type of structure,1.5, 1297,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack follows Last In first Out pattern which is a useful method to store data. It is mainly used to store search history and also to reverse an array or string.,1.5, 1298,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks when we want elements to be stored in a LIFO (last in first out) manner.,1, 1299,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used for tracking program execution and managing memory in a Last-In, First-Out (LIFO) manner. ",1.5, 1300,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used in computer science and programming for several important purposes: 1. **Function Call Management**: Stacks are used to manage function calls in many programming languages. Each time a function is called, a new ""frame"" is pushed onto the stack to store its local variables and return address. When the function returns, its frame is popped from the stack. 2. **Expression Evaluation**: Stacks are used to evaluate expressions, such as mathematical expressions. They can be used to convert infix expressions to postfix (or reverse Polish notation) and then evaluate them efficiently. 3. **Undo Mechanisms**: Stacks are often used to implement undo functionality in applications. Each action that changes the state of an application is pushed onto a stack, and the user can undo these actions by popping them from the stack. 4. **Parsing**: Stacks are used in parsing and compiling code. They help keep track of nested structures, such as parentheses in mathematical expressions or curly braces in code. 5. **Backtracking Algorithms**: In algorithms like depth-first search, stacks are used to store the path or state, allowing the algorithm to backtrack when necessary. 6. **Memory Management**: Stacks are a fundamental part of a program's memory management. Local variables and function call information are stored on the stack, making it efficient for memory allocation and deallocation. 7. **Implementing Data Structures**: Stacks can be used as a building block for other data structures, like implementing undo/redo functionality in text editors. 8. **Task Scheduling**: Stacks can be used in managing the execution of tasks or processes, such as in the call stack of a multitasking operating system. In essence, stacks are a simple and efficient data structure that facilitates various operations and algorithms by following the Last-In-First-Out (LIFO) principle, where the last element added is the first one to be removed. This makes them valuable in scenarios where you need to keep track of the order of operations or elements.",1.5, 1301,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks to store data. stack gives you easy access to insert and delete data.it saves memory wastage.,0, 1302,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks to store the data which can be used at the termination of the program.,0, 1303,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks to efficiently do pushing and poping operation ,1, 1304,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1305,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack follows LIFO So the element which is inserted last can be taken out first and used,1.5, 1306,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks can be used to to impliment better memory allocation adn storing data for sorting ,0, 1307,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for backtracking.It can also be used to convert one form of expression to another form.,1.5, 1308,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",For its last in first out (LIFO) functionality.,1, 1309,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. It can be used for systematic Memory Management.",1.5, 1310,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used for managing function calls, expression evaluation, and undo mechanisms due to their Last In, First Out (LIFO) structure.",1, 1311,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc."," Stacks are used for managing function calls and maintaining a last-in, first-out (LIFO) order of elements.",1, 1312,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used computer programming in various aspects because it if first in last out type of data structure, we use this for evaluating the expressions which have operators and operands.",1, 1313,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to reverse the output,0, 1314,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to store the data in such a format that only the last entered element can be operated upon. The use case of stacks is critical because it represents how data is stored in actual memory. We use stack to convert a recursive code into iterative one.,1, 1315,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. It can be used for systematic Memory Management.",1.5, 1316,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack to to assemble our inputs in same order in which inserted that is last in first out.,1, 1317,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to make use of LIFO concept which corresponds to last in first out.also can be used as an alternate to recursion in many places,1, 1318,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",STACKS IS LIFO LAST IN FIRST OUT IN THIS WAY WE CAN STORE THE DATA IN THAT FORMAT AND USE DATA AS WE NEED,1, 1319,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",FOR BACKTRACKING ,0, 1320,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks are used as they perform lifo last in first out which is also helped in removing recursion,1, 1321,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",because it gives elements in a specific order,0.5, 1322,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",data structure that stores data ,0, 1323,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks follow the LIFO principle (Last in first out). Stacks are really important and find their application in recursion (recursive call stack of compiler), web browsers and many more. Also, since stacks store values in reversed format, they are helpful in devising problem solving algorithms",1.5, 1324,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",TO PERFORM LAST IN FIRST OUT OPERATION,1.5, 1325,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1326,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators.,1, 1327,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",For evaluation of operands and operators,1, 1328,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to implement the last-in-first-out concept.,1, 1329,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for LIFO order i.e. Last In First Out,1, 1330,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","We use stack or queue instead of arrays/lists when we want the elements in a specific order, in the order we put them or in the reverse order, Queues and stacks are dynamic while arrays are static",195, 1331,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","stacks are crucial for managing tasks that require a sequential and LIFO approach, making them a fundamental data structure",1.5, 1332,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",when we need to use the principal of last in first out then we need stack,1, 1333,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","stacks uses LIFO technique. one can perform different operations such as push, pop, top(to see the top element) etc. the main idea to use stack is easy retrieval of the data.",1, 1334,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",when we want to access the last element inserted firstly,1, 1335,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Mostly we use stacks for LiFo operations that is LAST IN FIRST OUT.,1, 1336,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks to access elements in a last in first out manner.,1, 1337,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack can be used in any processes for execution of the function recursively etc.It follow LIFO order(LAST IN FIRST OUT).,1, 1338,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks to store the data. It use last in first out technique,1.5, 1339,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators.,0.5, 1340,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks are used for storing values in FIFO form,0, 1341,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to use LIFO last in first out approach.,0.5, 1342,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for following lifo(last in first out) principle in data structure ,0.5, 1343,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",time complexity in stack insertion in o(1) therefore it takes less time to insert,0, 1344,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. It can be used for systematic Memory Management.",2, 1345,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for evaluation of questions involving operators and operands,0.5, 1346,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack is used to arrange data where we need to use them in first first in last out order.,0, 1347,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks for efficient memory management and also tells how memory management takes place when recursion is happening.,1, 1348,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks gives us the benefit of LIFO i.e. last in first out. so if we need operation to perform like that we use stacl.,0.5, 1349,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks whenever we have to work on last in first out principle,0.5, 1350,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks are used as a substitiute to recuression.There are lot of recursive code that can be easily solved using stacks,1, 1351,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks to return last element first i.e. LIFO (last in first out),0.5, 1352,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks to store data in a particular order.,0, 1353,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",WE USE STACK FOR LIFO(LAST IN FIRST OUT) WHEN WE WANT TO ACCESS THE LAST ENTER DATA FIRST.FOR EXAMPLE-STACK OF BOOKS,0.5, 1354,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks can be used for backtracking, performing functions with the LIFO algorithm",0.5, 1355,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack the applications with Last in first out algorithim like undo functions,0.5, 1356,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","We use stacks to maintain the LIFO(last in first out) order , it is used when we maintain the data structure to access the last element that we have inserted.",0.5, 1357,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","We use stack when we want the elements in a specific order, i.e., in reverse order of insertion(in stack).",0.5, 1358,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.", used for evaluating expressions consisting of operands and operators,0.5, 1359,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to make use of LIFO concept (LAST IN FIRST OUT),0.5, 1360,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stack to retrieve data again. Concept of stack is extensively used in making recursive fundtion stack.,1, 1361,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators.,0.5, 1362,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stack or queue instead of arrays/lists when we want the elements in a specific order i.e. in the order we put them (queue) or in the reverse order (stack). Queues and stacks are dynamic while arrays are static. So when we require dynamic memory we use queue or stack over arrays.,1, 1363,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. It can be used for systematic Memory Management.",2, 1364,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks are used to implement the last in first out algorithm,0.5, 1365,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used to manage function calls, expression evaluation, memory allocation, and other scenarios where last-in, first-out (LIFO) behavior is required.",1, 1366,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",used for evaluating expressions consisting of operands ,0.5, 1367,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.", We use stack instead of arrays/lists when we want the elements in the reverse order.,0.5, 1368,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks to use its property of LIFO. in some cases it is much easier to use. like while traversing,0.5, 1369,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",First In Last Out,0, 1370,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",It follows LIFO order and helps us to solve many problems like parenthesis checking problem,0.5, 1371,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to use a data structure of a LIFO category which is beneficial in removal of recursion as the recursion itself got used in function stack,1, 1372,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to perform last in first out operations,0.5, 1373,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used for last-in, first-out (LIFO) operations, often in function calls and expression evaluation.",0.5, 1374,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to store data in first in last out format linearly,0.5, 1375,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to implement a data structure in which value which is inserted last can be accessed first.;,0.5, 1376,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",when we have to use last in first out we use stacks,0.5, 1377,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack mainly for last in first out property.,0.5, 1378,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stackes to store abundant data linear in a order using LIFO.,0.5, 1379,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stack can be used in expression conversion, like, infix to postfix, infix to prefix, postfix to infix, and prefix to infix. The time complexity of all the operations of a Stack is O(1).",0.5, 1380,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Undo/Redo functionality in applications. Parsing and evaluating expressions. first in last out ,1, 1381,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1382,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",WE USE STACKS IF WE WANT OUR OUTPUT IN SOME SORT OF ORDER OR TO REVERSE OUR OUTPUT AS IT USES LIFO PROPERTY,1, 1383,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",because it gives the data in a particular order like last in first out,0.5, 1384,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form.",2, 1385,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",because of the first in and last out,0.5, 1386,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",It is used during function call and stores function in last in first out format,0.5, 1387,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks work on LIFO order that is last in first out . It is commonly use to reverse the data . Because anything inserted in it comes out in reverse out,1.5, 1388,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack works in a LIFO (Last In First Out) format so it becomes easier to access the last element and traverse in reverse order,1, 1389,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks come in handy for backtracking and removal of recursion.,2, 1390,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","when elements have to be inserted and deleted from one end of the data structure, LIFO property",1, 1391,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks is used for backtracking and removal for recursion.,2, 1392,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators. ,1, 1393,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",For tasks requiring LIFO(last in first out) format storing of data.,1, 1394,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stack instead of arrays/lists when we want the elements in a specific order or the reverse order (stack). Stacks are dynamic while arrays are static. So when we require dynamic memory we use queue or stack over arrays.,1.5, 1395,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1396,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",it is a datastructure which follows lifo lastinfirst out it is mainly used for backtracking,1.5, 1397,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for implementiong LIFO principle,1, 1398,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks if we want to store data in specific manner as it follows lifo and it is easily accessible .,1, 1399,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack works on last in first out so when we want to access recent data more frequently there stack is used,1, 1400,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",For their LIFO structure + they are one of the simplest linear Data Structures to use/implement,1, 1401,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks are a fundamental data structure used in computer science and programming for various purposes because of their simplicity and specific characteristics. ,1, 1402,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We can use stacks to remove recursion in data structures.,1.5, 1403,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1404,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",For implementing LIFO principal.,1, 1405,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack when we want last in first out output.,1, 1406,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to get the last in first out data ,1, 1407,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","stacks are helpful when we want to store data in a LIFO (last in first one out) principle, for example the undo/redo feature",1, 1408,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks are one way data structure. We use stacks as it allows us to push data from top and can be extracted from Only Top i.e. Last In First Out.,1, 1409,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we can use stack for backtracking,1.5, 1410,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack to store the data in the order of last in first out .,1, 1411,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for opertions involving first in last out,1, 1412,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks to store data that needs to be accessed in last in first out manner.,1, 1413,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","parsing, reversing data, backtracking etc",2, 1414,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks work on principle LIFO (last in first out) .We use stacks to store data one over another and to access the last inserted data first . ,1, 1415,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for operations involving first in last out,1, 1416,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we store data in stack so that the last element that is inserted will be used first(LEFO),0.5, 1417,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for backtracking,1.5, 1418,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. ",2, 1419,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",FOr Last in First out applications stack is used,1, 1420,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",evaluating expressions consisting of operands and operators,1, 1421,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",easier to insert data and view data. ,1, 1422,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack to store data,0.5, 1423,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used to build data structures that follow,""Last in first out""-LIFO principle.",1, 1424,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for LIFO,1, 1425,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks use the LIFO methodology. According to this the data which is inserted last,is outputted first. Stacks are useful because of ",1, 1426,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks to add and remove data when data is stored spomewhere,1, 1427,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","It is a linear data structure which is used in situation where we need to access the elements from the last. The last element is stored at the top and it works on the principle of LIFO, for eg, a stack of books, we access the most recently used book from the top.",1, 1428,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",To take advantage of LIFO property of stack.,1, 1429,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks to store data in reverse order and get the last inserted data first,1, 1430,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for evaluating expressions consisting of operands and operators,1, 1431,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","We use stacks to manage data in a last-in, first-out (LIFO) order.",1, 1432,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",it is a linear data strucutre which is used to access elements i.e LAST IN FIRST OUT,1, 1433,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks can be used for Backtracking.,1.5, 1434,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","it is a LIFO data structure, element inserted first is taken out at the last",1, 1435,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks helps in LIFO operation ,1, 1436,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1437,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","when we want LIFO (Last In First Out ) type data structure we use stack, stacks are also used in recursive calls",1.5, 1438,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks have many different applications, we use stacks to make recursive codes non recursive, we use stacks to print the preorder traversal of a binary tree in an iterative form",1, 1439,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack works on the principle of Last In FIrst Out. Stack can be used for removal of recursion,2, 1440,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks can be used for Backtracking (LIFO) last in first out,2, 1441,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",evaluating expressions consisting of operands and operators,2, 1442,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks to store in such a manner that when we want to perform operation on the datas which are stored in stack then operation can be performed one by one from the last data store in stack(as stack work on the principle of last in first out).,2, 1443,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack because it has fifo property ,1.5, 1444,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","WHEM DATA RECORDS ARE TO BE IN A FIXED ORDER, BY ONE",1, 1445,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to solve problem extra space is used in which an element is inserted last is popped first,2, 1446,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are a fundamental data structure used in computer science and programming for various reasons. They are designed to follow the Last-In-First-Out (LIFO) principle, which means that the last element added to the stack is the first one to be removed. Stacks are used in a wide range of applications because of their simplicity and efficiency",2, 1447,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack to add data in a lifo manner,2, 1448,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",sTACK IS LIFO .We use stack or queue instead of arrays/lists when we want the elements in a specific order.,2, 1449,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for less memory use,1, 1450,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",using stack library,0.5, 1451,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks give us the usecase of LIFO(last in first out) which helps us in level-wise traversal in tree. Also helps in a problem called balances parenthesis.,2, 1452,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks for last in first out(LIFO) applications,2, 1453,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",LIFO LAST in first out principle is follwed we use stacks to remove recursion or simply store multiple data based on fifo,2, 1454,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",STACK IS VERY USEFULL,1.5, 1455,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks in order to solve the problems involving first in last out like chrome tabs. like where recent data is to be used earlier,2, 1456,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A stack is a linear data structure in which elements are accessed, inserted and deleted from one end called the top of the stack. Stack follows the LIFO ( Last In First Out) approach.",2, 1457,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks as they are simple and time efficient . in stacks we can only insert element and delete element from top.not like linked list where we can insert and delete element from anywhere and it is also a complex process,2, 1458,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",when we want to the last element inserted,2, 1459,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",FOR LESS MEMORY USE,1, 1460,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to access elements in reverse order as it is first in last out,2, 1461,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",So that the data required last but occur first can be used lately,2, 1462,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack follow first in first out law. Stack is used for storing linear data,2, 1463,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks follow the principle of Last in first out. It is used for one way storage and display and recursion.,2, 1464,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks are used when data is to be stored in LIFO order that is last in first out,2, 1465,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",WE USESTACKS TO SAVE DATA IN LIFO FORMAT AND EFFICIENTLY SAVE SPACE AND MEMORY IN THE PROGRAM BY USING NECESSARY ELEMENTS,2, 1466,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks because it can easily perform the LIFO(Last In First Out) operation i.e. the last element inserted into the stacks are also the first one to be removed.,2, 1467,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",as we can easily reverse uses the principle of lifo,2, 1468,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.", For last in first out(LIFO) fashion ,2, 1469,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators.,2, 1470,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators,2, 1471,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators.,2, 1472,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack uses the concept of LIFO. ,1, 1473,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0.5, 1474,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","stack follows LIFO(last in first out), it is used to simply work",2, 1475,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks as it has LIFO characteristics that is last in first out in which the element entered in last is on top moreover stack provides the structure to insert the data and doesn't take a lot of memory,2, 1476,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",it is based on the concept of first in last out i.e the element which insert first is last out,2, 1477,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks to remove recursion which takes an overhead for every function call.,2, 1478,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack is a LIFO structure. so used where ,1.5, 1479,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks for using the principle LIFO ...so that we can get the last element first out and vice versa ...thgrough this we acn perform various data structure operations . ,2, 1480,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack is a form where the data is stored in the form of buddle of books.A Stack can be used for evaluating expressions consisting of operands and operators. ,2, 1481,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",It uses LIFO (Last In First Out). It can be used for something like if we want to know which operation was done in last. Ex- undo and redo. The last operation done can be undo and redo.,2, 1482,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for its quality of last in first out,2, 1483,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks are used for function call management and undo/redo operations in programming.,2, 1484,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",When we want to select the element that entered last ,2, 1485,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Function Call Management, Undo/Redo Operations, Expression Evaluation, Balancing Parentheses",2, 1486,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","to perform, operations and checking parathesis and for backtracking",2, 1487,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Follows LIFO Principle If we want to push the element at the top ,2, 1488,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","stacks is used for various purposes like we cannot go to every memory location if there is a huge data , through stacks we can access large no of data very easily in less time and can alter update insert delete and manage in efficient manner stack is a type of advance data structures in real life it is used in various applications like google photos etc ",2, 1489,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks work on LIFO (last in first out). So, stack is used when we need toextract the last inserted data first.",2, 1490,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",if we want elements in a specific order,2, 1491,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",For the lifo principle (last in first out),1.5, 1492,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for memory management ,1.5, 1493,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to implement first in last out ,1.5, 1494,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","because of its special LIFO principle, last in first out, which helps up in stuff like coutning frequency of different elements, and etc.",2, 1495,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack is used in any process to executing.,1.5, 1496,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stack can be used for evaluating expressions consisting of operands, operators and for Backtracking",1.5, 1497,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack due to its Last In First Out property which help us in many real life problems.,1, 1498,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks when we have to enter data in a sequential manner with focusing on rule of first in first out.,1, 1499,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",when we need last in first out.,1.5, 1500,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to perform operation where we have to undo and redo the operatioms,2, 1501,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks are used when data records are to be used in a fixed order. LIFO principle is used i.e. the data record on the top of the stack is the one thats inserted last and is used first of all the other records in the stack,1.5, 1502,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to evaluate expressions consisting of operands,1.5, 1503,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack to remove recursion or to maintain a order of insertion that serves LIFO principle that is LAST IN FIRST OUT.,2, 1504,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks are used ,1.5, 1505,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A stack is a linear data structure in which elements are accessed, inserted and deleted from one end called the top of the stack. Stack follows the LIFO ( Last In First Out) approach. Two basic operations on a stack are push and pop",2, 1506,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks can be used for evaluating expresssions consitings if operators and operands,1.5, 1507,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",by easing reversal process using lifo principle,2, 1508,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to convert one form to another and store values in Last In First Out manner,1.5, 1509,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc."," Stack can be used in expression conversion, like, infix to postfix, infix to prefix, postfix to infix, and prefix to infix.",1.5, 1510,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks when we want to implement last in first out method. for example when we want to print preorder traversal of a tree we push right element first and then the left element into a stack.,1, 1511,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack for its last in first out property,1, 1512,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",when we want to do operation in last in first out order,2, 1513,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack i.e last in first out it helps one to manage recursion i.e with the help of call stack one can easily understand process of recursion . ,2, 1514,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",last in first out insertion and deletion is done in a particular order and also to remove recurssion,1.5, 1515,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are commonly used in for managing function calls and expression evaluation. They adhere to the Last-In-First-Out (LIFO) principle. Stacks facilitate memory management, backtracking, and parsing. They also power undo functionality in applications and manage browser history for navigation. .",2, 1516,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks is use to operend and operation,1.5, 1517,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for using LIFO(last in first out) data structure,2, 1518,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",To perform operations and checking parenthesis and for backtracking,1.5, 1519,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to implement recurssion in which last in first out,2, 1520,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stack to store data elements where we need the property of first IN and LAST out.,1.5, 1521,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for their first in first out property,1.5, 1522,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",So that we can enter a node or data in the front and we can delete the required or desired node from the last i.e from the top.,2, 1523,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","STACKS ARE USED FOR PURPOSE OF filo, which means first input first output they have many appplications in data structure.",1.5, 1524,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we can use stack to reduce recursion,2, 1525,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",It can be used for Backtracking as it has LIFO structure,1.5, 1526,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",it implements LIFO principle (last in first out) ,1.5, 1527,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks to EASILY ACCESS THE MEMORY THAT IS ENTERED IN THE END AS IT IS MOST LIKEABLE TO BE USED FREQUENTLY OR IN COMING TIME. IT IS PREFERABLY MUCH NEEDED THE RECENT DATA THAT IS INSERTED.,2, 1528,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A Stack uses LIFO, thus it can be used in postfix, prefix, infix and while working with operators and operands.it is used in memory management.",1.5, 1529,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","STACKS USE LIFO PROPERTY , IT MAKES OPERATION ON DATA STRUCTURE VERY EASY.",1, 1530,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to ustilise the LIFO approach which is beneficial for recursion internally and also as a substitute for recursion,1, 1531,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",TO BE MORE PRECISE AND SYSTEMATING IN A CODE.,1, 1532,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks can be used in a first in last out basis,1.5, 1533,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for evaluating expressions consisting of operator and operand,1.5, 1534,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1535,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",To approach LIFO rule and used in internal recurssion,1, 1536,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks is used for evaluating expressions consisting of operands and operators.,1, 1537,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack is based on LIFO(Last In First Out) principle. So when recent data is to used then stack is used.,1, 1538,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks has a property called last in first out.so in such cases they are used. ,1, 1539,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A stack is a Last-In First-Out data structure so they can be used when we require such an implementation of a structure.,2, 1540,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to evaluate expression,1.5, 1541,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for LIFO applications like recursion ,1.5, 1542,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to follow lifo principal,0, 1543,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks a linear data structure which follows FIFO structure.,2, 1544,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to apply lifo nd to minimize recursice stack space,2, 1545,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack is a LIFO. A Stack can be used for evaluating expressions consisting of operands and operators.,2, 1546,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks when we need the last operated operation like undo and redo operation and traversing between web pages,1.5, 1547,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.", last in and first out thing matters,1, 1548,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",because to store data ,1, 1549,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stack or queue instead of arrays/lists when we want the elements in a specific order i.e. in the order we put them (queue) or in the reverse order (stack). Queues and stacks are dynamic while arrays are static. So when we require dynamic memory we use queue or stack over arrays.,2, 1550,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for last in first out sequence,1, 1551,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1552,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks worked on the LIFO principle so it is useful where we have to access recently inserted data,0.5, 1553,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","memory management , backtracking,expression parsing",0.5, 1554,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Last In first out principle, some applications: depth first traversals of trees, and recursive call stack",1.5, 1555,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",it can be used to convert on data type to another,1.5, 1556,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",if we want elements in a specific order we can use stack ,0.5, 1557,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",first in last out,1.5, 1558,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","if we want something that we will fill at last and we have to use it first.it works on last in first our(LIFO) principle.""Valid Parenthesis"" ,etc problems uses stacks ",1.5, 1559,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",when we have to use last in first out condition for the problems,0.5, 1560,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack is used for evaluating expressions consisting of operands and operators,1.5, 1561,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,1.5, 1562,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",backtracking,1, 1563,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A stack is a linear data structure in which elements are accessed, inserted and deleted from one end called the top of the stack. Stack follows the LIFO ( Last In First Out) approach. Two basic operations on a stack are push and pop.",1, 1564,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks is a LIFO data structure which means last in first out which means the last inserted data is pushed first used in problems like valid parenthesis.,1.5, 1565,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",When we want to access the elements as per the LAST IN FIRST OUT order,1.5, 1566,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",used for LIFO implementation so can be used in web browsers.and games,0.5, 1567,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",FILO,1.5, 1568,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators. ,0.5, 1569,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks can be used to store data where ,0.5, 1570,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stack when we want output in LIFO form like in deletion in leaf node of tree.,0.5, 1571,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stack or queue instead of arrays when we want the elements in a specific manner or order,0.5, 1572,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operato,1.5, 1573,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",USED FOR LIFO.,0.5, 1574,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1575,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",type of data structure using first in last out concept,0.5, 1576,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack is used of dynamic memory allocation and it is easy to axis element ,1.5, 1577,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",store or hold,0.5, 1578,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack is used where condition is first in first out,0.5, 1579,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A stack is an abstract data type that consists of a predefined capacity. It allows adding and removing elements in a particular order *op on ds: Traversing. Searching. Inserting. Deleting. Sorting. Merging,0.5, 1580,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","STacks follow LIFO (last in first out), it is used to perform operations on the data structure from the top top.",0.5, 1581,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",To remove recurssion.,0.5, 1582,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",IT IS A DATA STURUCTURE WHICH FOLLOWS LIFO ,1, 1583,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks are used to extract data in LIFO format we also use stacks for reccursion removal,1.5, 1584,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to implement in lifo order.,1, 1585,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1586,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","stack uses the principal of last in first out ,that ",1, 1587,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",when we need the element to be inserted first and deleted last,1.5, 1588,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",when we want to use data in reverse order,1, 1589,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to store elements and to call recursively ,1.5, 1590,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Used for recursive calls and applying the LIFO principle,1, 1591,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",sometimes we only need access to the top element and by introducing this constraint we can improve our time complexity of many operations.,1, 1592,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks when we need to access the latest value first in a program as stacks work on principle of LAST IN FIRST OUT.,1, 1593,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stack or queue instead of arrays/lists when we want the elements in a specific order i.e. in the order we put themor in the reverse order ,1.5, 1594,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.", for evaluating expressions consisting of operands and operators,1, 1595,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to work on this principle LIFO-last in first out ,1, 1596,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A stack is a linear data structure in which elements are accessed, inserted and deleted from one end called the top of the stack. Stack follows the LIFO ( Last In First Out) approach",1.5, 1597,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",where ever we need LIFO fashion of data structute we use stacks,2, 1598,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. It can be used for systematic Memory Management.",2, 1599,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack to store data in arranged manner ,1.5, 1600,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",it works on principle of last in first out. used in tree traversal without recursion,1.5, 1601,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",works on Last in First out principal we can access the top element,1.5, 1602,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A stack is an abstract data type that consists of a predefined capacity. It allows adding and removing elements in a particular order. When every time an element is added, it goes to the top of the stack. Stack enables all data to operations at one end only.",2, 1603,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to implement the concept of LIFO,1, 1604,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1605,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to remove recursive calls,1, 1606,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1607,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to store data in a sequential manner in a dynamic way and lastest data is displayed at the top.,1, 1608,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",when we have to apply Last In First Out Operation eg Undo and Redo button,0.5, 1609,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A stack is an abstract data type that consists of a predefined capacity. it follows lifo principle,1, 1610,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks use LIFO principle. so we use stack if we want to get the data in a way where we get the last inserted data first.,0.5, 1611,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","function call and recursion, expression evalution,undo functionalty,Parsing and Syntax Analysis, Depth-First Search (DFS) Memory Management ",1.5, 1612,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks when we want elements in a specific order,1, 1613,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators.,1, 1614,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",BECAUSE OF LIFO,0.5, 1615,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking,",1, 1616,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",recursion calling,0.5, 1617,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used for managing function calls, undo/redo, tracking order, and expression evaluation.",1, 1618,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of push and pop and LIFO principal,1.5, 1619,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1620,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","to use the property of last in first out.Stacks are used for managing function calls, undo/redo, tracking order, and expression evaluation. ",1, 1621,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to remove recurssion,0.5, 1622,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",To implement recursion. Last In FirstOut,1.5, 1623,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are handy when you want to keep track of function calls in a program. Each time a function is called, its information is pushed onto the stack. When the function completes, it's popped off the stack. This helps manage the flow of execution and memory efficiently. ",0.5, 1624,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used because they provide a simple and efficient way to store and manage data. Here are some reasons why we use stacks: Last-in-First-Out (LIFO) Order: Stacks follow the LIFO principle, meaning that the last element added to the stack is the first one to be removed. This order is beneficial in several scenarios like function call execution, maintaining undo-redo functionality, and handling recursive algorithms. Function Calls: Stacks are commonly used in programming languages to manage function calls. When a function is called, its local variables and execution context are pushed onto the stack. Once the function completes its execution, the variables and context are popped from the stack, allowing the program to continue from the point before the function call. Memory Allocation: Stacks are used in memory allocation and deallocation, particularly in low-level programming languages like C and C++. Local variables and function call contexts are allocated on the stack, making it easy to allocate and release memory automatically.",1, 1625,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",it works on first in last out,0.5, 1626,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Function call management: Stacks are used in programming to manage function calls and their local variables. Expression evaluation: Stacks can be used to evaluate expressions, especially in converting infix expressions to postfix (Reverse Polish Notation)",1, 1627,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","When a function is called, the current state of the program is pushed onto the stack.",0.5, 1628,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks are mainly used where one have to extract the data which is to be inserted at last,1, 1629,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to store datat and store it itn the way that the data last inerted will me removed firstluy,1.5, 1630,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack for backtracking algorithm and memory allocation AS FIRST IN LAST OUT,2, 1631,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",add data in a LIFO manner,2, 1632,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators. ,2, 1633,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","to store such type of data where we have to get the last inputted data first, ",1, 1634,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. It can be used for systematic Memory Management.",2, 1635,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to use LIFO (last in first out) operation,1, 1636,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for evaluating expressions consisting of operands and operators,1, 1637,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",To control how memory is allocated and deallocated. To reverse a string. To parse operations. To convert one form of expression to another form. To perform backtracking. To enforce a FILO logic. To reason about a program.,2, 1638,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack is used to insert elements in specific and particular order so that deletion takes place in reverse order ,1, 1639,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.", it follow lifo order of data insertion,0.5, 1640,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators. Stcks also used for backtracking.,0.5, 1641,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks follow LIFO(last in fist out) principle.Also it takes less time than arrays in mostly every operations.,1, 1642,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","We use stack we need the ""Last in First Out"" usability of the stack. Generally used to stack data over each other. ",1, 1643,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. It can be used for systematic Memory Management.",1, 1644,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack when we want data in the form of last in first out(LIFO format),1, 1645,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",LIFO and FILO,0.5, 1646,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",evaluating expressions consisting of operands and operators. ,0, 1647,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to know the consistency the operations ,0, 1648,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1649,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack use Last In First Out principle which helps in task realted to it like reversal of a array data structute ,1.5, 1650,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","we use stacks so that we can easily store and manipulate elements in a particular order. Stacks follow the LIFO (Last In First Out) or FILO (First In Last Out) principle, which means that the element that is inserted last, comes out first and the element that is inserted first, comes out last 1.",0.5, 1651,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A stack is a linear data structure in which elements are accessed, inserted and deleted from one end called the top of the stack. Stack follows the LIFO ( Last In First Out) approach. Two basic operations on a stack are push and pop.",1.5, 1652,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stack or queue instead of arrays/lists when we want the elements in a specific order i.e. in the order we put them (queue) or in the reverse order (stack). Queues and stacks are dynamic while arrays are static. So when we require dynamic memory we use queue or stack over arrays.,1, 1653,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks use LIFO STRUCTURE LAST IN FIRST OUT and it is convenient to use thats why we use this,1, 1654,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",it is used for systematic memory management.,0, 1655,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stcks as it uses the last in first out principle (LIFO) helps us to store address of previous data i.e. nodes ,1, 1656,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",For adding the elements and in order that is first in last out,0, 1657,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stack or queue instead of arrays/lists when we want the elements in a specific order i.e. in the order we put them (queue) or in the reverse order (stack). Queues and stacks are dynamic while arrays are static. So when we require dynamic memory we use queue or stack over arrays.,0.5, 1658,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",It is used for backtracking algorithms,0.5, 1659,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks beacuse it ues last in and first out method,1, 1660,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators,0, 1661,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",LFO FLO,0, 1662,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to store data in a linear form when we need to insert an element and access it in the last as stack uses the property of LIFO(last in first out),1, 1663,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to store data lineraly and for property of first in last out,0, 1664,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are a fundamental data structure used in computer science and programming for various purposes. They are based on the Last-In-First-Out (LIFO) principle, which means that the last item pushed onto the stack is the first one to be popped off. Stacks are used for a wide range of applications due to their simplicity and efficiency",1, 1665,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",evaluating expressions consisting of consisting operands and operations,0, 1666,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used for managing data in a Last-In, First-Out (LIFO) manner, often for tasks like function call management and expression evaluation.",1, 1667,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",A Stack can be used for evaluating expressions consisting of operands and operators.,0, 1668,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for lifo operations(last in first out),1, 1669,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",UNDO/REDO FUNCTIONALITY,0, 1670,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack is used where data is stored by the principle of first in last out,0, 1671,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack for first in last out,0, 1672,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack for performing first in last out operation on stored data,0, 1673,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to know the consistency of the operations,0, 1674,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",locate the exact location ,0, 1675,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","stacks are used to store data anfd the stored data can be extracted in a lifo(last in first out ) way and is thus used independently as well as in correspondence with other data structures to store data of int,string,pointer etc type",1, 1676,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",because it uses last in first out method ,1, 1677,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for getting last inserted element to be first out (LIFO),0.5, 1678,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used to manage function calls, maintain state, and handle backtracking in algorithms and data structures.",0.5, 1679,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for lass in first out ,0.5, 1680,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,0, 1681,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to understand recursion,0, 1682,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for last in and first out operations,1, 1683,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to get last inserted element to be first out,0, 1684,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Memory Management ,function call management ,expression evaluation",0, 1685,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stack uses last in first out method to manage data,1, 1686,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Last In First Out implementation,1, 1687,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for evaluating expressions consisting of operands and operators,0, 1688,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","We use stack to perform LIFO operations that is last in first out, example loading previous web pages ",1, 1689,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used for evaluation expression for like prefix, postfix, infix expression and their conversion in each other. Stacks are also used for backtracking.",, 1690,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks to store data in a sequential manner following last in first out.,, 1691,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",because it follows LIFO(last in first out) order,, 1692,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",To follow the principle of Last in first out(LIFO).,, 1693,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","stacks follow LIFO principle . So whenever we want to implement LIFO, we use stack ",, 1694,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to store elements in lifo structure and for backtracking.,, 1695,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",it follows a firsr in last out,, 1696,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A stack is a linear data structure in which elements are accessed, inserted and deleted from one end called the top of the stack. Stack follows the LIFO ( Last In First Out) approach. Two basic operations on a stack are push and pop.",, 1697,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stack is used to store data linearly such that each element of a tree which is pushed into it,is inserted at the beginning.",, 1698,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stack whenever we want to use LIFO(last in first out) operation. Mostly used in recursion.,, 1699,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","To manage function calls and maintain a last-in, first-out (LIFO) order.",, 1700,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to do the lifo type that when we want to need first entered data in last,, 1701,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",it uses last in first out method,, 1702,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks use the principle of LIFO(last in first out), which is useful in many logics when we are required to store a data first but want to remove it lastly. for example itterative way og getting preorder of Binary Tree.",, 1703,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to access recently entered data works on LIFO principle,, 1704,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks is used for last in first out operations.,, 1705,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","because of its fashion of operation i.e., lifo, when we need to extract the lastly input elements first ",, 1706,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks when we require last entry first,, 1707,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Stacks can be used for Last in First Out ,, 1708,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",satcks follows last in first out. it can be used when we want to get the latest entry first and the fist entry last.,, 1709,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack to store data without losing,, 1710,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks when we want the elements in a specific order,, 1711,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",when we want the element that has been entered last to be taken out first (lifo),, 1712,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to implement LIFO(last in first out),, 1713,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to access the elements that we inserted the last,, 1714,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks is a linear data structure similar to array as it is used to store multiple elements on the basis of property last in first out ,, 1715,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to get element in specific order we can get in reverse order by pushing in staclk,, 1716,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,, 1717,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",basically stack is based on last in first out whenever we need this type of operation we use stack,, 1718,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to evaluet expressions ,, 1719,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks to push an element in the stack.,, 1720,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",when we need elements in specifec order,, 1721,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to make priority in our data structure,, 1722,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","used where we want to store data in LIFO (Last IN First Out),order",, 1723,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",,, 1724,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack is used to create a pile of data,, 1725,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to access element in first in last out order,, 1726,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to implement LIFO (Last IN First out),, 1727,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",backtracking can be efficiently done when using stacks,, 1728,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",when we require dynamic memory we use stacks. it follows lifo property,, 1729,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",because it follows LIFO (LAST IN FIRST OUT).,, 1730,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks we need to arrange data elements according to the LIFO(Last in first out) principle,, 1731,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",To store the data in LIFO (LAST IN FIRST OUT) manner,, 1732,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","helps to perform recursive code. reduces time complexity, and reduce buffer storage.",, 1733,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",reduces time complexity and space complexity,, 1734,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",IN THIS WE USE LIFO PRINCIPLE,, 1735,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",LIFO for arrangement and storing of data;,, 1736,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",LIFO,, 1737,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to access the last recent element we have added ,, 1738,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Use stack as they work on Last in first out principle. It is a linear data structure where recent data can be accessed first rather than the older data.,, 1739,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stack when we want elements in a specific order according to the last in first out(LIFO),1, 1740,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks implement fifo so to get last inserted item,1, 1741,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",it works on lifo principle,1, 1742,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",For operators and operands,0.5, 1743,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",TO REVERSE THE DATA AS STACKS ARE LAST IN FIRST OUT,1, 1744,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",LIFO data structure where elements inserted at last will be used first ,1, 1745,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks can be used for Backtracking,",1, 1746,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack a linear ds is used because of its unique property of last in first out. It is evan use for recusrion removal,1, 1747,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use stacks in situations where we we need to make use of its first in last out property ,1, 1748,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",type of data structure uses 'lifo' and used for ,1, 1749,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stacks are used in computing and various applications because they provide a convenient way to manage data in a Last-In, First-Out (LIFO) manner.",1.5, 1750,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",for LIFO (last in first out),1, 1751,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks so that we can put the data elements in a specific order.,1, 1752,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",lifo(last in first out),1, 1753,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",used to store in lifo,1, 1754,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","it is a LIFO type data stucture i.e, last in and first out",1, 1755,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","It is a LIFO type data structure(last in,first out)",1, 1756,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","for first in and last out like in plate,books.. also in backtracking",1, 1757,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",evaluating expressions consisting of operands and operators,1, 1758,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack is used to store data linearly in a manner that we can retrieve data that had been input last.,1, 1759,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.", evaluating expressions consisting of operands and operators,1, 1760,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc."," Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression.",1.5, 1761,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",last in first out (lifo)principal ,1, 1762,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stacks are used to add or remove the elements in a particular order.,1, 1763,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",last in and first out ,1, 1764,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",WE USE STACK WHEN WE WANT TO OBTAIN THAT DATA FIRST WHICH WAS LAST ENTERED. IT CAN BE USED FOR THE PURPOSE OF REVERSING.,1.5, 1765,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A stack is a linear data structure in which elements are accessed, inserted and deleted from one end called the top of the stack. Stack follows the LIFO ( Last In First Out) approach. Two basic operations on a stack are push and pop.",2, 1766,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack is a data structure which works on last in first out principle. It is used when information is to be stored in such a way that follows LIFO principle,1, 1767,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",Because of the First in First out [LIFO] property. This helps us in reverse level order traversal,1, 1768,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we can easily acces the recently added data in stack as it follows LIFO(Last IN First OUT).,1, 1769,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",We use stacks for storing elements and backtracking ,1, 1770,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",LAST IN FIRST OUT TYPE OF DATA STRUCTURE WHEN WE WANT TO ACCES DATA IN ONE WAY,1, 1771,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to access top element for traversals without recursion,, 1772,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",FOR TIMES WE NEEDE FIRST IN LAST OUT OPERATION TO FOLLOW. MOSTLY WHEN WE NEED TO STORE THE 'FIRST IN' DATA AND USE IT LATER .,1.5, 1773,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",last in first out,1, 1774,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",stack is a data strucutre which work on last in first out principle it is used to ,1, 1775,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",as is follows LIFO therefore last inserted data is available at the top...therefore when we want to access data in reverse order we use stack...also it is used to store records of function calls(function call stack),1, 1776,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to remove recursive functions,2, 1777,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",we use ,0, 1778,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",reversal,0.5, 1779,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",use stacks to use the principle of first in last out ,1, 1780,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",as it follows therefore last inserted data,1, 1781,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",to remove recursive function,2, 1782,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. It can be used for systematic Memory Management.",2, 1783,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.","Stack is used to store data in the LIFO format and can perform operations like push,pop etc.",1.5, 1784,Why do we use stacks?,"Stacks follow the LIFO method, and addition and retrieval of a data item take only Ο(n) time. Stacks are used where we need to access data in the reverse order of their arrival. Stacks are commonly used in recursive function calls, expression parsing, depth-first traversal of graphs, etc.",in order to collect data one above the other like first in last out,1.5, 1785,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pop, push",1, 1786,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full, Operations on queues include: 1. Enqueue: Adds an element to the rear of the queue. 2. Dequeue: Removes and returns the element from the front of the queue. 3. Peek/Front: Returns the element at the front of the queue without removing it. 4. IsEmpty: Checks if the queue is empty. 5. Size: Returns the number of elements in the queue.,0.5, 1787,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insertion and deletion,1.5, 1788,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Common queue operations include enqueue (insertion at the rear), dequeue (removal from the front), checking if the queue is empty, and getting the front element without removal.",1, 1789,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insertion and deletion,2, 1790,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(),dequeue(),peek() or front(),rear(),isFull(),isEmpty(),size()",0.5, 1791,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion ,deletion(queue can be used for level order traversal in a bst)",1.5, 1792,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Queue is a FIFO data structure that supports insertion at the end and removal from the front and is used in places we need a queue like ordering.,2, 1793,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,For operations where we have to use the principle of FIFO(First in First Out) Eg. in Binary trees we can do level order traversal by queue very easily,1, 1794,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion, deletion",0.5, 1795,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"The operations that can be performed on queues are enqueue(),dequeue(),peek(),isEmpty(),size()",2, 1796,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pop, push_back,",1, 1797,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push ,pop",0.5, 1798,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insertion deletion,1.5, 1799,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"it works on principle first come first out .we can insert, delete, search elements in it",2, 1800,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Front() - Check element at front. Enqueue() - insert at end. dequeue() - delete from front.,1.5, 1801,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"The main operations on queues are ""enqueue"" (insertion) to add elements to the back and ""dequeue"" (removal) to remove elements from the front. Additional operations may include ""peek,"" ""size,"" ""isEmpty,"" ""isFull,"" ""clear,"" and priority queue operations for specific queue types.",1, 1802,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(),dequeue(),peek(),rear(), isFull(),isEmpty()",0.5, 1803,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,pop at the front push at the back and front to avail data,2, 1804,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"LIFO,last in first out",1, 1805,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Operations like enqueue, dequeue, front, isEmpty can be performed on Queues.",1.5, 1806,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue, dequeue and queue traversals",0.5, 1807,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue() - Insertion of elements to the queue. Dequeue() - Removal of elements from the queue. Peek() - Acquires the data element available at the front node of the queue without deleting it. isFull() - Validates if the queue is full. isNull() - Checks if the queue is empty.,2, 1808,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion at end, removal from front and pop and see",1, 1809,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, front, size, is_empty etc",0.5, 1810,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push , pop , peek are the hat can be performed on queue",1.5, 1811,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion,deletion,combining,splitting",2, 1812,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,First In First Out Operations like,1.5, 1813,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue and Dequeue operations can be performed on queue,0.5, 1814,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full," enqueue , dequeue , checking if the queue is empty, and finding the size of the queue.",1, 1815,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue and dequeue,2, 1816,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"peek(), dequeue(), enqueue(), initialize() , isempty()",0.5, 1817,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,front(getting the front element int queue) basically FIFO",1.5, 1818,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"we can do insertion, deletion, traversal and finding extrema etc on queues which is a data structure implemented in FIFO manner.",1, 1819,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"We can perform enqueue, dequeue, front, back,",2, 1820,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,search",0.5, 1821,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, get front element(front()), get back element(back())",1.5, 1822,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue (q.push(x)), dequeue(q.pop()), isEmpty(), q.front() (gives the first value inserted), FIFO data structure",0.5, 1823,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,display",2, 1824,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"POP, PUSH,EMPTY, ETC",1, 1825,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",0.5, 1826,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue",2, 1827,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"queues follows FIFO so we can push , pop, check empty etc.",1.5, 1828,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,",1, 1829,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue() , Dequeue() operations can be performed on Queues",2, 1830,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue , Dequeue , size , isEmpty",1, 1831,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Operations that can be performed on Queues are: enqueue() or push(), dequeue() or front() or pop(), empty(), size()",0.5, 1832,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue Dequeue Peek/Front IsEmpty IsFull Size Clear Priority Queue Operations Double-Ended Queue (Deque) Operations,2, 1833,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Operations that can be performed on queues are enqueue,dequeue,front().",1.5, 1834,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Common operations on queues include enqueue (adding an element to the rear), dequeue (removing an element from the front), checking if the queue is empty or full, and examining the front element without removal.",1, 1835,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,peek,traversal",0.5, 1836,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue , pop , front , peak, size , isEmpty()",2, 1837,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue.dequeue,peek,isempty etc",0.5, 1838,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,In queues pop and push operations are performed,1, 1839,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue , Dequeue , Top().",1.5, 1840,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque,deque, getting front value of queue",2, 1841,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion - enqueue, deletion- dequeue, peek - get first element, check if queue is empty, check if queue is full",2, 1842,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque,deque, ",2, 1843,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,queue works on fifo first in first out technique insertion can be done on queues ,2, 1844,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion, deletion, traversal, searching",2, 1845,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion, deletion, checking if it is empty ",2, 1846,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Queues support enqueue (insertion), dequeue (removal), peek (accessing the front element), and isEmpty operations.",2, 1847,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"we can insert elements using Enqueue(), we can delete data using Dequeue(), we can find the front node using Peek(), and we can check wherether its full or null using functions like isFull() and isNull() respectively.",2, 1848,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push and pop are the operations ,2, 1849,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue - It adds an element to the end of the queue. Dequeue - It removes an element from the front of the queue. Peek - It returns the element at the front of the queue without removing it. IsEmpty - It checks if the queue is empty. IsFull - It checks if the queue is full.,2, 1850,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Common operations on queues include enqueue (to add an element to the rear), dequeue (to remove an element from the front), and checking if the queue is empty or full.",2, 1851,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push ,pop , queue , dequeue ",2, 1852,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue, Dequeue and Queue Traversals",2, 1853,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion,deleton, traversal. QUEUE work in FIFO format. An exception case is priority queue.",2, 1854,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push from back pop from front ,front element enque ,deque",2, 1855,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, search",2, 1856,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insert delete size clear,2, 1857,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"to store data, enqueque, dequeue",2, 1858,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Common Operations we can perform on a queue : push (inserting at end), pop(removing from front),",2, 1859,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue , Dqueue , push, pop , peek , isFull , isNull",2, 1860,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push back, pop from front ",2, 1861,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push pop front rear,2, 1862,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Dequeue,Enqueue,isEmpty,isFullTraversal",2, 1863,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue, isEmpty, peak, rear,size ,isFull",2, 1864,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push , pop ",2, 1865,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push_back, pop_front, front, size",2, 1866,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion(rear), deletion(front), isEmpty,peek etc",2, 1867,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue",2, 1868,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,ad and remove ,2, 1869,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"dequeue,enqueue etc",2, 1870,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,insertion ,deletion",2, 1871,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue,Dequeue,Front",2, 1872,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Insertion, deletion ",2, 1873,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push pop front rear,2, 1874,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, deque,peek,front ,rear",2, 1875,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 1876,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,first i nfirst out type of functions,2, 1877,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"queue works on the principle of FIFO. that is First In First Out. the most common operations to be performed on queues are push operation, pop operation, top operation to get front and rear",2, 1878,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque, deque",2, 1879,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pushback,popfront,fronmtsize",2, 1880,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Insert at end, delete from front, storing , searching ,basically last in first out",2, 1881,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,pop and push function,2, 1882,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Common operations on queues include enqueue (adding an element to the rear), dequeue (removing an element from the front), checking if the queue is empty, and getting the front element without removing it.",2, 1883,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,We can pop and push from beginning in queue. Size also.,2, 1884,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Insertion , Deletion , Push , Pop ",1, 1885,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Where we need the data inserted first to be retrieved firstrieved ,0.5, 1886,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque,deque,size, front element",2, 1887,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Insertion , Deletion, Traversal",1, 1888,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Push, pop, top",1, 1889,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,The queue operations are as follows: 1.enqueue 2.dequeue 3.isEmpty 4.isFull 5.size,2, 1890,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Queues support enqueue (insertion), dequeue (removal), peek (accessing the front element), and isEmpty() operations.",2, 1891,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"inqueue, dequeue, front, raer, empty, full, size",2, 1892,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue() - Insertion of elements to the queue. Dequeue() - Removal of elements from the queue. Peek() - Acquires the data element available at the front node of the queue without deleting it. isFull() - Checks if the queue is full. isNull() - Checks for empty value,2, 1893,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"FIFO operations, pushing element, popping element, etc.",1, 1894,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Queues can perform insertion, removal and updation in FIFO(First In First Out) manner. ",1, 1895,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Common operations that can be performed on queues, which are a type of linear data structure, include: 1. **Enqueue (Push)**: Adding an element to the rear or end of the queue. 2. **Dequeue (Pop)**: Removing the element from the front or head of the queue. 3. **Peek/Front**: Viewing the element at the front of the queue without removing it. 4. **Size/Length**: Determining the number of elements in the queue. 5. **Empty Check**: Checking if the queue is empty. 6. **Clear**: Removing all elements from the queue, effectively emptying it. 7. **Priority Queue Operations**: In a priority queue, additional operations like inserting elements with associated priorities and extracting the element with the highest priority. 8. **Circular Queue Operations**: In a circular queue, additional operations include checking if the queue is full and handling circular wrapping when the rear and front pointers reach the end of the queue. Queues are commonly used in scenarios where data needs to be processed in a first-in-first-out (FIFO) order, such as task scheduling, print job management, and breadth-first search algorithms. These operations enable efficient data handling in such situations.",2, 1896,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,isEmpty()",1, 1897,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"queue reversal, insertion, deletion etc",1, 1898,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque,push,deque",1, 1899,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 1900,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,add and remove,1, 1901,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,oueues are linear dtat structure on which different operation can be performed such as sorting insertion deletion of elements ,1, 1902,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"operations performed on queues are enqueue , dequeue ,peek ",1.5, 1903,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Deletion from top, insertion from end",1, 1904,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,isempty",1, 1905,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Queues support enqueue (insertion) and dequeue (removal) operations, as well as peeking to view the front element and checking if the queue is empty.",1.5, 1906,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Common operations on queues are enqueue (insertion) and dequeue (removal) of elements, checking if the queue is empty, and finding the size of the queue.",1, 1907,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Insertion which is enqueue() and deletion which is dequeue() operations can be performed on queues.,2, 1908,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, front",1, 1909,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 1910,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,we can perform enqueueing dequeueing we acn check if the queue if full or empty.,1.5, 1911,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"we can sort, search ",0.5, 1912,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,enqueue,dequeue",2, 1913,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,ENQUEUE TOP DEQUEUE PUSH POP ,1, 1914,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,ENQUEUE AND DEQUEUE,195, 1915,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, top , dequeue, push, pop",1.5, 1916,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue,dequeue,isempty",1.5, 1917,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,front,rear,empty,full,size",2, 1918,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"the push , pop, and peek operations can be performed in queues.",2, 1919,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,FIRST IN FIRST OUT,0, 1920,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 1921,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full," Enqueue , Dequeue , Peek, isFull , isNull ",2, 1922,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue Dequeue Peek ,1.5, 1923,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"inserting data at the front, removal of data from front traversal",1.5, 1924,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,we can find who is at start and end of the queue,1.5, 1925,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(), dequeue(), peek(), front(), rear(), isFull(), isEmpty(), size()",2, 1926,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"These operations are fundamental for managing and processing data in a First-In-First-Out (FIFO) order, which is the characteristic behavior of queues.",1.5, 1927,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insertion deletion first in first out,1.5, 1928,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, rear, isEmpty",2, 1929,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue",1, 1930,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push(),pop(),empty()",1, 1931,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueueing, dequeueing, traversal",1, 1932,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,we can use queue as First in first out data structure.It is also used for doing levelorder traversal in binary trees,1, 1933,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"It uses first in first out technique. we can get front,insertion,deletion with queues",1, 1934,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue,dequeue.",1, 1935,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Push/Pop/front,0, 1936,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,FIFO first in first out insertion and deletion,1, 1937,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,for following fifo(first in first out) principle in data structure,0.5, 1938,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque,dequeue,traversal,searching etc",1, 1939,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue() front() rear() isFull() . isEmpty() ,2, 1940,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue/dequeue/peek,1.5, 1941,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 1942,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push(),pop(),front(),back()",0, 1943,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,queues gives us first in first out,0.5, 1944,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, traverse",0, 1945,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push->used to insert an element in queue. pop->used to remove an element from queue. front-.>used to see the first element of the queue. empty->return true if queue is empty,0, 1946,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pop ,insertion ,searching ,sorting",0, 1947,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue, Dequeue, Front, Rear, isFull, isEmpty",2, 1948,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,FIFO WE CAN ACCESS THE DATA IN FIRST IN FIRST OUR FORMAT,0.5, 1949,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, isFull, isNull",2, 1950,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue , dequeue , underflow , overflow",2, 1951,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"We used stack to maintain priority that is first in first out , first come first serve basis.",0.5, 1952,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue, Dequeue, isEmpty, isFull are the various operations performed on queues.",2, 1953,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push or pop,0, 1954,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, enqueue, dequeue",0.5, 1955,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Insert,update,delete",0, 1956,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue operation,Dequeue operation,Front Operation,isEmpty Operation",2, 1957,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full, enqueue () Inserts an element at the end of the queue i.e. at the rear end. The following steps should be taken to enqueue (insert) data ... Operation 2: dequeue () Operation 3: front () Operation 4 : rear () Operation 5: isEmpty ():,2, 1958,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue() - Insertion of elements to the queue. Dequeue() - Removal of elements from the queue. Peek() - Acquires the data element available at the front node of the queue without deleting it. isFull() - Validates if the queue is full. isNull() - Checks if the queue is empty.,2, 1959,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, traversal, search, sort",0, 1960,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue (to add an element to the rear), dequeue (to remove an element from the front), peek (to see the front element without removal), and checking for empty/full conditions.",2, 1961,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"we can perform enqueue, dequeue, front,back",1.5, 1962,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque, deque, peek, front, isEmpty, size, isFull,etc.",2, 1963,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push_back(), push_front(), pop_back(), pop_front(), enqueue(), dequeue(), ",0.5, 1964,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Insertion ,Deletion ,Sorting etc..",0, 1965,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,top etc",0, 1966,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue - insertion at the end , dequeue - deletion from the front , front - get the value at the front",2, 1967,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"operations include like pop,view ",0, 1968,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Queue operations include enqueue and dequeue, following first-in, first-out (FIFO) order.",1, 1969,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"backtracking, traversal, enqueue, dequeue, front",1, 1970,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, isempty, front.",2, 1971,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push(),pop(),front() etc",0, 1972,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,we do operations which required first in and first out property,0.5, 1973,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, traversal, backtracking.",1, 1974,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"ENQUE,DEQUE,isFull(),isNull()",2, 1975,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue: Adding an element to the rear. Dequeue: Removing an element from the front. Peek/Front: Viewing the front element. Checking if the queue is empty.,2, 1976,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue",1, 1977,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,INSERTION(PUSH) DELETION(POP) TOP(TO GET THE TOP ELEMENT) ISEMPTY(TO CHECK WHETHER THE QUEUE IS EMPTY OR NOT),0.5, 1978,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue and dequeue,1, 1979,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,we can perform enqueue dequeue on queue,1, 1980,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion , traversal, deletion",0, 1981,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque,deque,front which returns front element,back which returns last element,empty which checks if it is empty",2, 1982,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"We can enqueue that is push , dequeue that is pop, we can find its size etc",1, 1983,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push(), pop(), front(), back()",0, 1984,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue dequeue,1.5, 1985,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"follows FIFO property. push, pop, empty",2, 1986,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue , dequeue",1.5, 1987,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(),dequeue(),isfull()",2, 1988,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Queue follow FIFO(First in first out). Inbuilt functions like q.front(),q.pop(),q.insert() and user defined function for insertion,sorting,seaching can also be performed.",2, 1989,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,operations like push and pop are performed on Queues,1.5, 1990,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 1991,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,peek,pop,isfull,isempty",2, 1992,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 1993,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, front, rear and isempty",2, 1994,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,in Queue data can be inserted at start and deleted from start,0.5, 1995,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque, dequeue",1.5, 1996,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 1997,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Operations that can be performed on queues are Push, Pop, Traverse.",2, 1998,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque,deque,isfull,isnull,push,pop",2, 1999,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enque , deque etc.",1.5, 2000,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,first in last out,0.5, 2001,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, front",1.5, 2002,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue (insertion), dequeue(deletion)",1.5, 2003,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Push, Pop , empty",1.5, 2004,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push pop ,1, 2005,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"we can perform prefix,postfix ,infix operations using queues level order traversals ",0.5, 2006,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion, removal, to check if empty",1.5, 2007,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion from end, deletion from front, traversal, updation.",1.5, 2008,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue Dequeue,1.5, 2009,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Queues follow FIFO order ( first in first out ) . It is used to access the first inserted element first . ,1, 2010,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion, removal, to check if empty",1.5, 2011,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, size,front",1.5, 2012,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue() ,dequeue(), isFULL() ,isEmpty()",2, 2013,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,peek,isnull,isfull",2, 2014,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue , dequeue",2, 2015,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue() - Insertion of elements to the queue. Dequeue() - Removal of elements from the queue. Peek() - Acquires the data element available at the front node of the queue without deleting it. isFull() - Validates if the queue is full. isNull() - Checks if the queue is empty,2, 2016,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, empty(), top()",2, 2017,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion, deletion, front",1.5, 2018,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"OPERATIONS WHICH CAN BE PERFORMED ON QUEUES ARE-POP,TOP.",1.5, 2019,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion , deletion etc",1.5, 2020,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Prefix,postfix,infix operations are performed on queue",1, 2021,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,pop ",2, 2022,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"FIFO- enqueue , dequeue",1.5, 2023,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(), dequeue(), empty() and top();",2, 2024,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,front and empty",1.5, 2025,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,finding peek element",2, 2026,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Common queue operations include enqueue and dequeue check if the queue is empty, and determine its size.",2, 2027,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pop, push,",1.5, 2028,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue(),Dequeue(),isfull(),isempty().",2, 2029,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue dequeue ,1.5, 2030,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"First In First OUT operations,push pop, viewing top element ",1.5, 2031,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion,deletion,check",1.5, 2032,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue ( push in STL) , dequeue ( pop in STL) , front(to show the element in front)",2, 2033,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"you can get the front value of the queue q.front(), you can get insert elements, q.push(), you can pop elements from both front and back, etc.",1.5, 2034,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Selection, Insertion, Updation and Deletion",1.5, 2035,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue and dequeue,2, 2036,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",2, 2037,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion , deletion , traversal, pop, sorting",1, 2038,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop",1, 2039,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pop view, ",0.5, 2040,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"fifo adding element, removing element, add, pop we can view top element",1.5, 2041,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"emque, deque, ",1, 2042,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2043,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue: Add an element to the end of the queue. Dequeue: Remove an element from the front of the queue. IsEmpty: Check if the queue is empty. IsFull: Check if the queue is full.,2, 2044,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push and pop,1, 2045,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"first in first out like push, pop etc",1, 2046,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"front ,back, push, pop, size, empty",1.5, 2047,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue , dequeue , peek , isfull ",1.5, 2048,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,LIFO ,0, 2049,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"INSERTION,DELETION.,SEARCHING AND SORTING ALSO PERFORM",0.5, 2050,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2051,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,ENQUEUE AND DEQUEUE,2, 2052,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion , deletion ",1, 2053,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,deque,pop insert",2, 2054,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push and pop,1, 2055,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,accessing first element from front and also last element from last from rear(),2, 2056,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue, dequeue",2, 2057,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion,deletion,traversal,reversal",1.5, 2058,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Queues are very useful that follows the principle of first in first out. They are useful for getting the last tlement stored in first. Process like enqueueing and dequeuing are folllowed. ,2, 2059,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion at rear end, deletion at front end, traversal ",1.5, 2060,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,OPERATION WHICH CAN BE PERFORMED INSERTION DELETION POPPING PUSHING INSERTING ,2, 2061,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"We can perform the FIFO(First In First Out) i.e. the first element inserted into queue is the first to be popped out. We use pop() operation and insert() ,search operation too in the Queues.",1.5, 2062,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,pop push isempty print enqueue dequeue front ,1, 2063,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"dequeue,enqueue",2, 2064,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"ENQUEUE, DEQUEUE, PEEK ,ISEMPTY,SEARCH.",2, 2065,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue() - Insertion of elements to the queue. Dequeue() - Removal of elements from the queue. Peek() - Acquires the data element available at the front node of the queue without deleting it. isFull() - Validates if the queue is full. isNull() - Checks if the queue is empty.,2, 2066,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,top and pop operations can be performed on Queues,0, 2067,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push(data), pop(), front()",1, 2068,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion deletion, ",0, 2069,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, q.rear(), q.,front()",2, 2070,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(push an element), dequeue(pop an element), size, top,",2, 2071,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",2, 2072,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,We can enqueue and dequeue in a queue.,1, 2073,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"dequeue, enqueue",2, 2074,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion , deletion , which we can say pushing the element , popping the element , by saving them as front and rear element .searching cn also be done easily.",1.5, 2075,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue() ,dequeue() ,front() , peek() ,isFull() ,isNull()",2, 2076,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,FIFO (First In First Out),1, 2077,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion(push),deletion(pop),and useability of its important characteristics FIFO",2, 2078,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(),dequeue(),isempty().",1.5, 2079,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue and Dequeue,2, 2080,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insert, delete, size, clear",2, 2081,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push and pop,1, 2082,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Pushing an element at the last,Popping an element from the front",2, 2083,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push to insert data , pop to delete data , peek to see the top element of the queue , print to output the inserted data , delete to delete the data , and update to update the data ",2, 2084,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Queue supports push. pop, front, empty and full operations.",2, 2085,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,pop push isempty pop,2, 2086,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,front etc",1.5, 2087,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"dequeue , enqueue,peek,front",2, 2088,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push pop front isempty,1.5, 2089,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2090,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,we can use queues to first in first out data structure.,1.5, 2091,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion,deletion,checking the top element,checking if queue is full.",1.5, 2092,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"deque,enqueue,etc.",1, 2093,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue and dequeue,1, 2094,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"operations are push,pop,size,front",1.5, 2095,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"inqueue,dequeue,size, clear",2, 2096,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue to insert element at last of queue, Dequeue to pop elements, peek to see element at first or last",1.5, 2097,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(add element to the bottom of the queue or the start of the list),dequeue(remove the fist element of the list),front(display the bottom most element).",1.5, 2098,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"q.push(); q.pop(), q.front();",1.5, 2099,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2100,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(),dequeue(),front(),rear()",2, 2101,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push and pop,1, 2102,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue(insert) dequeue(delete) front element rear element locating,1, 2103,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue dequeue peek isfull isempty,1.5, 2104,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue() , Peek() , isFull(), isNull()",1, 2105,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pop()-to delete front element, front()-to return front element, push()-to insert data",1, 2106,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,first in and first out operation,1.5, 2107,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push pop front empty size rear,1.5, 2108,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque ,deque ",2, 2109,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,peep,front",1.5, 2110,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Common operations on queues include enqueue (insertion), dequeue (deletion), peek (viewing the front element), and checking if the queue is empty. These operations allow for the orderly management of data, ensuring that items are processed in a first-in, first-out (FIFO) manner. ",2, 2111,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"q.push(),q.front(),q.pop()",1.5, 2112,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enque and deque,2, 2113,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque , deque,front ,rear, ",2, 2114,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion(enqueue),deletion(dequeue).first in first out",1.5, 2115,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"in Queues we can can PUSH , POP , ",2, 2116,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Insertion, deletion, searching",2, 2117,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Insertions,Deletions,Searching,Traversal,Reversing,Enqueue,Dequeue.",1.5, 2118,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"operations are to view front,insert in it, and it works on fifo. which means first inpuit first output.",2, 2119,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insertion deletion traversak,1.5, 2120,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue, dequeue, peek, isempty, isfull",2, 2121,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, front, is_empty, push, pop",1.5, 2122,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"front(), empty(), push(), pop(), ",2, 2123,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"A queue uses FIFO, it helps in level order traversal in trees,",2, 2124,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"OPERATIONS PERFORMED ON QUEUES ARE INSERTION , DELETION ,MODULUS,ETC",1.5, 2125,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",1.5, 2126,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,ENQUEUE AND DEQUEUE ETC.,2, 2127,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Queue Dequeue,2, 2128,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue and dequeu ,1.5, 2129,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue , Dequeue etc.",1.5, 2130,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueues and dequeues,2, 2131,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue,",1, 2132,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Sorting, Searching",1, 2133,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"we can perform actions like insertion,deletion,searching,sorting,enque,deque",1, 2134,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue, Dequeue, is Empty, isFull, Peek",2, 2135,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,inqueue dequeue front,0.5, 2136,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue , dequeue, ",1, 2137,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pushing,popping,",0.5, 2138,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion using push, deletion using pop , checking if queue is empty , getting data in front of queue.",1, 2139,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,to check if queue is empty or not",1, 2140,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue(),Dequeue() ,Peek() ,",2, 2141,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(push at last), dequeue(pop from front), q.fornt (the first element inserted), q.empty(Is queue empty or not)",2, 2142,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, overflow underflow",0.5, 2143,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,we can perform deque,1, 2144,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue: Add an element to the end of the queue. Dequeue: Remove an element from the front of the queue. IsEmpty: Check if the queue is empty. IsFull: Check if the queue is full. Peek: Get the value of the front of the queue without removing it.,2, 2145,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insert delete and search,1, 2146,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2147,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insertion and deletion,1.5, 2148,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,peek,is empty, clear , iteration",2, 2149,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, search, circular queueing",0.5, 2150,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enque dequeu,1.5, 2151,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pop, push, isempty, top",1.5, 2152,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, isempty",0.5, 2153,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Operations:pop,push,peek or top.it follows FIFO principle which means first in first out .it is very useful in doing many problems and also in level order traversal of tree",1.5, 2154,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,front,empty",0.5, 2155,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue and Dequeue,1.5, 2156,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push and pop can be performed,0.5, 2157,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insertion deletion ,0.5, 2158,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,ENQUEUE DEQUE FRONT EMPTY SIZE ISFULL,1.5, 2159,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,queue follows FIFO data structure which means the first inserted elements are printed first. they are used in various traversals of binary tree,0.5, 2160,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, front, rear, empty, size",0.5, 2161,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,front,rear",1, 2162,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque,deque",1, 2163,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push and pop,1, 2164,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push ,pop, peek",0.5, 2165,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,empty",1, 2166,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue , dequeue, rear, front, peak.",0.5, 2167,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Stack uses push and pop as two of its operations. The pop operation functions to remove the element from the list, while the push operation functions to insert the element in a list. Queue uses enqueue and dequeue as two of its operations",1.5, 2168,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push() and pop() front().,1, 2169,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insertion deletion,1.5, 2170,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",1, 2171,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2172,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enque and deque,1, 2173,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"top, empty, pop, push, find",1, 2174,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue() Dequeue() Isfull() Isnull() Front() ,0.5, 2175,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,q.rear(),q.front()",1, 2176,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push , pop , front ,size",0.5, 2177,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"ENQUEUE,DEQUEUE.PUSH,POP,ISFULL,ISEMPTY",1.5, 2178,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,queues are used to perform FIFO extraction,1, 2179,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,front,isempty.",0.5, 2180,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, get front, get size, check is epmty",1.5, 2181,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Insertion in the back , deletion in the front .(fifo principal)",1.5, 2182,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertin, deletion,search",0.5, 2183,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque,deque,search etc",1.5, 2184,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,queues can be push which means elements can be added form back and deleted from front,1.5, 2185,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push pop sort find ,0.5, 2186,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop",1, 2187,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"PUSH, POP, TOP are the name of some operations of queues. push is used for isertion, top displays the first value inserted and pop removes first value inserted.",0.5, 2188,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,front,size",1, 2189,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2190,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,traversal,searching",0.5, 2191,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion , deletion and update the elements ",1.5, 2192,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion(enque) ,deletion(deque) of element in queue",1, 2193,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue() - Insertion of elements to the queue. Dequeue() - Removal of elements from the queue. Peek() - Acquires the data element available at the front node of the queue without deleting it. isFull() - Validates if the queue is full. isNull() - Checks if the queue is empty.,0.5, 2194,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push ,pop,peek",1, 2195,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"updation,deletion,insertion,selection",0.5, 2196,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Searching, travarsals",1.5, 2197,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"first in first out data structure that can be used to enqueue,dequeue,get the first element",0.5, 2198,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"traverrsal deletion and insertion at front,back,middle circular queue",1, 2199,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2200,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",0.5, 2201,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"operations performed on queues are, dequeue, enqueue and ",0.5, 2202,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion (push), deletion(pop), update",1.5, 2203,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,front,empty",0.5, 2204,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue() - Insertion of elements to the queue. Dequeue() - Removal of elements from the queue. Peek() - Acquires the data element available at the front node of the queue without deleting it. isFull() - Validates if the queue is full. isNull() - Checks if the queue is empty.,1, 2205,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, front",0.5, 2206,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue (Push). Dequeue (Pop):, Front (Peek) , IsEmpty, Size (or Length), Clear:",1, 2207,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqeue,deqeue",1.5, 2208,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue() ,Dequeue(), Peek(), IsFull()",0.5, 2209,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"DELETION ,INSERTION,CHECK IF QUE IS EMPTY OR FULL, UPDATE",1, 2210,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue() - Insertion of elements to the queue. Dequeue() - Removal of elements from the queue. Peek() - Acquires the data element available at the front node of the queue without deleting it. isFull() - Validates if the queue is full.,0.5, 2211,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",1, 2212,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Queue operations include enqueue, dequeue, peek, checking if empty, and checking if full (for a fixed-size queue).",1.5, 2213,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,FILO and push and pop operations,1, 2214,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push_back(),pop-back(),",0.5, 2215,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"dequeue, enqueue, empty, full",1.5, 2216,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pop,push,front,size",0.5, 2217,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion at end (enqueue), deletion from front (dequeue)",1, 2218,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue,dequeue,peek/front,isempty,isfull,size",0.5, 2219,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,The operations can be performed on queues: Enqueue: Adds an element to the rear of the queue. Dequeue: Removes and returns the element at the front of the queue. Peek/Front: Returns the element at the front of the queue without removing it. Size: Returns the number of elements currently in the queue. Is Empty: Checks if the queue is empty.,1, 2220,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue dequeue,0.5, 2221,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue: Adding an element to the rear (end) of the queue. Dequeue: Removing an element from the front of the queue. Peek/Front: Viewing the element at the front of the queue without removing it.,0.5, 2222,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",1, 2223,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"ENQUEUE , DEQUEUE, ISEMPTY , SIZE , FRONT ELEMENT",0.5, 2224,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push(),pop(),front(),",1, 2225,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"ENQUEUE (INSERTION), DEQUEUE (REMOVAL)",0.5, 2226,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"sorting, searching, hashing, chaining, array, pop ,push",0.5, 2227,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,deque,priority....",1, 2228,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,we can store data in queue in such a way that we can take out the data which is stored first,0.5, 2229,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"queue follow FIFO,Enqueue() - Insertion of elements to the queue. Dequeue() - Removal of elements from the queue. Peek() - Acquires the data element available at the front node of the queue without deleting it. isFull() - Validates if the queue is full. isNull() - Checks if the queue is empty.",1.5, 2230,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,FIFO(first in first out),0.5, 2231,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue() - Insertion of elements to the queue. Dequeue() - Removal of elements from the queue. Peek() - Acquires the data element available at the front node of the queue without deleting it. isFull() - Validates if the queue is full. isNull() - Checks if the queue is empty.,0.5, 2232,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"ENQUEUE(insertion at end) ,DEQUEUE(deletion at start),",1, 2233,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, peek, isFull, isNull",0.5, 2234,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"dequeue, enqueue",1, 2235,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue(),Dequeue(),peek(),isFull(),isNull().",2, 2236,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, deque,isempty,isfull,ispeak",2, 2237,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue(), Dequeue(), is_Empty(), front_value()",1.5, 2238,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Basic Operations for Queue in Data Structure Enqueue() - Insertion of elements to the queue. Dequeue() - Removal of elements from the queue. Peek() - Acquires the data element available at the front node of the queue without deleting it. isFull() - Validates if the queue is full. isNull() - Checks if the queue is empty.,2, 2239,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"we can perform operations like priority queue, sorting and all FIFO(first in first out) base operationlike as in arrays ",0, 2240,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push and pop,0, 2241,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue() - Insertion of elements to the queue. Dequeue() - Removal of elements from the queue. Peek() - Acquires the data element available at the front node of the queue without deleting it. isFull() - Validates if the queue is full. isNull() - Checks if the queue is empty.,2, 2242,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push ,pop,sort,search ",0, 2243,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Insertion, Deletion, Searching, Sorting",0, 2244,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Push Pop,0, 2245,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pushing ,poping ,enque,deque",1, 2246,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue ,dequeue, isEmpty(), front",1.5, 2247,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,peek,isFull,isNull",2, 2248,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue and dequeue,1, 2249,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue , dequeue",1, 2250,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue i.e. insertion, dequeue i.e deletion from the queue ",1, 2251,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push , pop , front , empty",0.5, 2252,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(),deque(),peak(),rear(),isEmpty(),size(),isFull()",2, 2253,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue, dequeue , front, isempty",1.5, 2254,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue ",1, 2255,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue , dequeue, isNull , front ",1, 2256,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2257,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enque, deque, deletion from both ends,sorting",1, 2258,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pop ,push ,front, insert.",0, 2259,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"front element,size,enqueue,dequeue",1, 2260,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue dequeue isfull,1.5, 2261,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Common operations on queues include enqueue (adding elements to the rear) and dequeue (removing elements from the front).,1, 2262,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue,Dequeue,size,isEmpty",1.5, 2263,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,for fifo operations(first in first out),0, 2264,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"ENQUEUE , DEQUEUE ,DELETION FROM BOTH ENDS ",1, 2265,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,first in first out we can insert and remove in a queue,0, 2266,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2267,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"poping, enqueue ,dequeue",1, 2268,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, sort , search.",0, 2269,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,stack ques ,0, 2270,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"queues are used to store data and the stored data can be extracted in a FIFO(first in first out) manner .the following operations can be performed on queues :enqueue,dequeue,isempty(),size().",1, 2271,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"dqueue ,enqueue,pqueue",1, 2272,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,front,rear",0, 2273,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full," Queues support two primary operations: ""enqueue"" to add an element to the back and ""dequeue"" to remove an element from the front",, 2274,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push ,pop ,front",0, 2275,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insertion fat end deletion from front ,0, 2276,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2277,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue,empty(),top()",1, 2278,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push , pop",0, 2279,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insertion deletion searching,0, 2280,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue, Dequeue, peek",1.5, 2281,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue, dequeue",1, 2282,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"DEQUEE,Enqueue()",1, 2283,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue",1, 2284,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"PUSH_REAR, POP_FRONT",1, 2285,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,first in and first out ; we can insert and remove in a queue.,2, 2286,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push(),pop(),isEmpty(),front()",2, 2287,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, traversal",1, 2288,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push , pop, front, isempty",1, 2289,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,top.",1, 2290,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",1.5, 2291,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,nsertion of an element in the Queue (enqueue) Deletion of an element from the Queue (dequeue) Display of/viewing all the elements in the Queue (peek or front) Check if the queue is empty (IsEmpty) Check if the queue is full (IsFull),1, 2292,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"to delete data(pop),to insert data(push),checking whether its empty(empty),checking if its full(isfull)",0.5, 2293,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Operations such as enqueue,dequeue for insertion and deletion in a queue can be performed.",1.5, 2294,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Adding and removing elements.,1, 2295,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,FIFO structure operation like perfomance,0.5, 2296,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"dequeue, enqueue, pqueue",1, 2297,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"It follows the principle of FIFO(first in first out), this is used if we want to get levelorder 0of binary tree or if we want to get top view of a binary tree.",2, 2298,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",1, 2299,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,queues are used for first in first out operations.,1, 2300,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"operation in which the fashion of operation is fifo, where we need to extract the firstly input elements first",0.5, 2301,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(pushes data) , dequeue(pops data), front(gives front element), empty(checks if queue is empty)",2, 2302,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, ",1, 2303,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"operations such as insertion ,deletion, searching can be used on queues, where insertion is done from the back and deletion is done from the front",2, 2304,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop, front,empty,",2, 2305,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue , dequeue and front.",1.5, 2306,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push,pop,front etc",2, 2307,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue",1, 2308,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,queue enque front rear isempty isfull,1, 2309,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(),dequeue(),isempty(),size(),front()",2, 2310,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",1, 2311,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,they can be used for backtracking. A Stack can be used for evaluating expressions consisting of operands and operators. It can also be used to convert one form of expression to another form.,2, 2312,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"operations such as push ,pop, front element ,rear element",2, 2313,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue Dequeue and peek etc,0.5, 2314,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Insert,Delete are some operations.",1, 2315,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"fifo order, push, pop",1.5, 2316,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2317,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"FIFO- First In First out , used to store data in form of FIFO order",1, 2318,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",1, 2319,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,push and pop,1, 2320,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion, deletion, ",1, 2321,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue , dequeue",1, 2322,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"operations like enqueue(), dequeue(), and peek() can be performed",1.5, 2323,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue and dequeue,1, 2324,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, top, front , isempty, etc",2, 2325,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,we can perform push pop operations,1, 2326,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue() Dequeue() Push() Pop() isEmpty(),1, 2327,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"(first in first out) pop (from fromt), insert(at last)",1, 2328,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pop,insertion(first in first out)",1.5, 2329,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,INSERTION AND DELETION,1, 2330,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"deque,isfull,isempty",2, 2331,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insertion deletion updation,1, 2332,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,we can insert element at the end and delete element from the front,1, 2333,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Insertion (enqueue), Deletion (deletion)",1, 2334,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,1)dequeue 2)enqueue 3)seek() 4)isfull() 5)isnull,2, 2335,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enque deque,1, 2336,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insertion deletion,0.5, 2337,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push, pop, getTop, isEmpty",2, 2338,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Common operations on queues include: Enqueue: Adding an element to the rear (end) of the queue. Dequeue: Removing an element from the front of the queue.,1, 2339,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",1, 2340,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"pop(),push(),top()",1.5, 2341,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,FIFO i.t first in first out,0, 2342,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,we can insert in a queue usng push and pop an element from a queue using pop it is used in situaqtions where we need to have a first in first out property.pushing and popping is called enqueu and dequeue. ,1, 2343,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"top, isempty, enqueue,dequeue etc",2, 2344,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",1, 2345,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push ,pop,front,empty,",2, 2346,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue(), dequeue(), Peek, Front etc",2, 2347,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,fifo(first in first out),0, 2348,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"fifo order, push, pop, front",1.5, 2349,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push_back(), pop(), first()",1, 2350,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"push_back(),pop(),first()",1, 2351,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue, full , isfull, isempty",1.5, 2352,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue, isfull, isnull",1, 2353,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion, deletion, searching.",1, 2354,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue dequeue,1, 2355,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"A queue is a data structure that supports operations like enqueue, dequeue, and follows the FIFO principle.like enque form last, pop from front.",1, 2356,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue ,dequeue",1, 2357,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue ",1, 2358,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue , dequeue , front , empty ",2, 2359,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,PUSH()/POP()/FRONT(()/SIZE()/EMPTY(),2, 2360,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"Enqueue, Dequeue: Remove an element from the front of the queue. IsEmpty: Check if the queue is empty. IsFull: Check if the queue is full. Peek: Get the value of the front of the queue without removing it.",2, 2361,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion,deletion,searching,popping",1, 2362,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Insertion and Deletion,1, 2363,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,Dequeue",1, 2364,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,We can push or pop elements ,1, 2365,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"ENQUEUE, DEQUEUE, DELETION",1, 2366,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue, dequeue",1, 2367,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"ENQUE , DEQUE ; {INSERT , DELETE }",1, 2368,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,first in first out,0, 2369,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,initialization of queue usage and permanently deleting the data from th memory,0, 2370,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"insertion(push from rear),deletion(pop from front),searching(through pop and traverse)",1, 2371,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue dequque,1, 2372,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2373,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,enqueue dequeue front rear,1.5, 2374,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full, enqueue and dequeue,1, 2375,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"enqueue,dequeue",1, 2376,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,insertion in last and deletion from front,1, 2377,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,Enqueue() - Insertion of elements to the queue. Dequeue() - Removal of elements from the queue. Peek() - Acquires the data element available at the front node of the queue without deleting it. isFull() - Validates if the queue is full. isNull() - Checks if the queue is empty.,2, 2378,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,"You can enqueue to insert the element and dequeue to delete data.ALso, you can print the top element.",1, 2379,What operations can be performed on Queues?,The below operations can be performed on a queue − • enqueue() − adds an item to the rear of the queue • dequeue() − removes the item from the front of the queue • peek() − gives the value of the front item without removing it • isempty() − checks if the queue is empty • isfull() − checks if the queue is full,,0, 2380,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",where time complexity is o,1.5, 2381,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching, also known as sequential searching, is a basic algorithm for finding a target value within a list or array by sequentially checking each element one by one until a match is found or the end of the list is reached. It has a time complexity of O(n), where ""n"" is the number of elements in the list.",1, 2382,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching by compairing one by one each element,1.5, 2383,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching, or linear search, is a simple search algorithm that sequentially checks each element in a data structure until a match is found or the entire structure has been traversed.",0.5, 2384,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we visit every elements of the data structures.,2, 2385,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear search is the simplest search algorithm. It is also known as sequential search. In linear search, the list is simply traversed, and each element in the list is matched with the element whose location needs to be found.",1, 2386,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",we traverse every element one by one linearly and where the element is present we return it.,1.5, 2387,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is searching that requires O(N) searching time. This means that on avg every element will be checked once.,0.5, 2388,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in this we traverse each and every element from starting and then search our required element,2, 2389,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we can search a key element by comparing every element of array,1, 2390,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",1.5, 2391,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0.5, 2392,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",comparing and traversing through each element ,2, 2393,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching, as the name suggests is the algorithm that searches elements in a data structure linearly i.e it goes with the order the elements are inserted",1, 2394,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching of element linearly. in time complexity ofo(n),1.5, 2395,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Search through every element of a linear structure like array or string and returning the index of first match. return a non-index value (generally -1) if not found. It has O(n) time complexity.,0.5, 2396,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching, or linear search, is a simple search algorithm that sequentially checks each element in a data structure (e.g., an array or a list) to find a specific target element. It continues the search until the target element is found or until all elements have been examined. Linear search has a time complexity of O(n), where ""n"" is the number of elements in the data structure.",2, 2397,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","It is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",1, 2398,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in which we search each index one by one for indexes ,1.5, 2399,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we search an element one by one and by comparing it by every element ,0.5, 2400,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Iterating through each element of a data structure to find a particular element is known as linear searching.,2, 2401,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","A linear search is the simplest approach employed to search for an element in a data set. It examines each element until it finds a match, starting at the beginning of the data set, until the end. ",1, 2402,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.", linear search or sequential search is a method for finding an element within a list.,1.5, 2403,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Search is searching algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",0.5, 2404,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A sequential search algorithm that starts from one end and goes through each element of a data structure until the desired element is found or the other end.,2, 2405,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching by traversing every element in the memory is known as linear seacrhing,1, 2406,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","inear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set",1.5, 2407,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",every element is compared until key is found.,0.5, 2408,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching happens in an array data structure where we compare a key with each element present in the array to find the desired element at a particular index,2, 2409,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.", searching technique where elements in a collection (such as an array or list) are checked one by one from the beginning until the desired element is found or the end of the collection is reached.,1, 2410,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is when the element is searched in linear form comparing each elements in the data structure,1.5, 2411,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in this we have to find a element from a list and travel every element in list to find that element,0.5, 2412,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is a technique to find a target element within the data structure by traversing it only once,2, 2413,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching refers to traversing all data points or indices in data structure and has O(n) asymptotic time complexity where n is length of the data container. ,1, 2414,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Traversing the elements one by one and checking whether that element is equal to the one we're searching for. ,1.5, 2415,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",simply comparing the whole data with data that is to be found. eg simple for loop ,0.5, 2416,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Searching allows user to scan the elements from left to right/right to left, it checks for a key value and as soon as the key value is found we can print it.",2, 2417,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching algorithm takes time complexity of O(N) where every element is compared with the key element to be searched, if the element is found then true is returned or else false is returned after the whole n operation.",1, 2418,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when a single loop is used to find the elements.,1.5, 2419,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",SEARCHING WHICH USES UNIDIRECTINAL TRAVERASAL,0.5, 2420,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching for element on each index one by one,2, 2421,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,1, 2422,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching means to search or traverse only in one direction,1.5, 2423,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching in linear data like array element searching,0.5, 2424,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a searching algorithm in which the element to be searched is compared with every element of the array. it is not a good technique for arrays with large number of elements as its worst case time complexity is O(N) where N is size of the array.,2, 2425,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","A linear search is the simplest technique used to search for an element in a data set. It compares each element until it finds a match, starting at the beginning of the data set, until the end. The search is finished and terminated once the target element is found.",1, 2426,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching searches the whole of the data structure to find a value.,1.5, 2427,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear search, also known as sequential search, is a straightforward method for searching for a specific element within a list, array, or any other linear data structure. In a linear search, you start at the beginning of the data structure and check each element one by one until you find the target element or reach the end of the structure",0.5, 2428,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Search is a sequential search that starts at one end and goes till the end of the structure through each element till the required element is found.,2, 2429,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching, also known as sequential searching, is a straightforward method for finding a specific element in a data structure by examining each element one by one until a match is found or the end of the data structure is reached.",1, 2430,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversing each data in single direction,1.5, 2431,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",It is a type of data structure where data is stored and managed in a linear sequence. Data elements in the sequence are linked to one after the other,0.5, 2432,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in which we traverse all the elements in array one by one,2, 2433,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","When we start traversing an array at one end and travel through each element to the very end to search for the given element, it's called linear search.",1, 2434,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A technique of searching where we start searching and keep on traversing the full data structure until we find the element.,1.5, 2435,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",method of finding an element in a data structure by iterating every element once,0.5, 2436,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A linear search is the simplest search algorithm . it searches for an element in a data set by oing to each element one by one until it finds a match.,2, 2437,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",check for every element in any data structure that the element is present or not,1, 2438,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in this serach we search by comparing every element present in array or any data structure,1.5, 2439,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is done on linear data structure to find the element,0.5, 2440,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching involves use of a for loop that searches for the target value in the array by traversing from first element to the last element in a sequence.,2, 2441,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching involves iterating through a data structure (like an array) to find a specific element. It checks each element one by one until a match is found or the end of the data structure is reached.,2, 2442,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is the ,1, 2443,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversing an array of nodes in linear fashion,2, 2444,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear search, also known as sequential search, is a simple and straightforward searching algorithm used to find a specific element within a list or array. In a linear search, you start at the beginning of the list and examine each element one by one until you find the target element you are looking for or until you have checked all elements in the list.",1, 2445,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a simple algorithmic technique for finding a specific element within a list or array by sequentially checking each element one by one until a match is found.,2, 2446,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching element by traversing the form first index to last index or to the index where it is present,1, 2447,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search refers to sequential searching of a data where you start form the starting index of a data structure and traverse the whole data strructure while comparing the current value to the value to be searched for.,2, 2448,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a type of searching where we go to each node or data to search the value that we want to find. we go to every node and compare it with the data that we have to find.,1, 2449,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",lenear serching in O(N),2, 2450,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching in which the element to be searched is tested against every element,1, 2451,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear search, also known as sequential search, is a basic searching algorithm that works by sequentially checking each element in a collection (such as an array or a list) until a match is found or the end of the collection is reached.",2, 2452,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching data in a structure linearly with one loop,2, 2453,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a searching technique in which we go through the entire data structure linearly that is we go to each element one by one and check whether that is the element we are looking for.,2, 2454,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Every element is considered as a potential match for the key and checked for the same,1.5, 2455,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","searching in which every element is compared for the key , till the end and its worst case complexity is O(n)",2, 2456,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it works on sorting in which whole arry works,1, 2457,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search is used to search element within a data structure . It one by one checks element of the list in for or while loop,2, 2458,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.", linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched.,1, 2459,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in O(N) ie every element is compared from start to end with each element,2, 2460,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","visiting every element of data structure on by one and comparing(on,time complexity) ",2, 2461,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",each element is cheeked or traversed to find a specific element ,1, 2462,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching through each element in an array one by one,1, 2463,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",to search every element in a data structure one by one ,1, 2464,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",start with first elemet and go the end element one by one and where the element is found return that element,1, 2465,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traverse the data structure start to end in linear way ,1, 2466,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching for an element in an array,1, 2467,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching a number element by element in an array,1, 2468,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is applied on unsorted array in which the whole array is accessed in search of the data,1.5, 2469,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",the searching in which we traverse the data structure by visinting all element only once.,1.5, 2470,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we search one by one element,1, 2471,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching for elements by traversing the whole linked list in a straight line ,2, 2472,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching through an array line,1, 2473,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in a linear data structure by traversing it simply from start to end in order,2, 2474,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",visit every element once and compare,1.5, 2475,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when data is compared one -by one with each element stored in the data structure.,2, 2476,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in a data structure where element is searched from one order,2, 2477,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching, or linear search, is a method of finding a specific element in a collection (e.g., an array) by sequentially checking each element until the target element is found or the entire collection is searched. It has a time complexity of O(n) for an array with 'n' elements.",2, 2478,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",It has a time complexity of O(n). We search by traversing the whole array index by index.,2, 2479,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",In linear searching we traverse the data structure from the start and keeps moving to the next element till the time we don't find the element.,1.5, 2480,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A type of searching which is done in linear fashion means in a consecutive manner.,1, 2481,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching which works such that there is an iterator which travese the whole array and when the element is found it stops or maybe move forward if the task is something else,1.5, 2482,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching in 1D array,1, 2483,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Data is searched linearly (O(N)),1.5, 2484,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","In Linear Searching, each element is checked sequentially, one by one.",1.5, 2485,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is all about iterating through a data structure (like an array) to find a specific element. It checks each element one by one until a match is found or the end of the data structure is reached.,1.5, 2486,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",each element is traversed and compared with the required value and the operation is termination when it is found,1.5, 2487,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching that checks from one end and moves to the other end checking all elements.,1.5, 2488,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search is when we trsverse ans compare every element of the data structure one by one taking TC = log(n^2).,0, 2489,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search is a simple searching technique that traverses through each element sequentially in a data structure to find a specific target. It has a time complexity of O(n),2, 2490,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching, also known as linear search or sequential search, is a straightforward method for finding a specific target element within a list or array of elements. In linear searching: 1. You start from the beginning (first element) of the list. 2. You compare the target element you're looking for with each element in the list one by one, in order. 3. If you find a match, you return the index (position) of that element in the list. 4. If you reach the end of the list without finding the target element, you typically return a ""not found"" indicator. Linear searching is a simple but relatively inefficient search algorithm, especially for large lists, as it may require checking every element in the worst case. However, it is suitable for unsorted lists and serves as a basic example of how to search for an element in a collection of data. Other search algorithms, like binary search and hash-based search, are more efficient for sorted or larger datasets.",2, 2491,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a process of searching where we start from one end and traverse till the end until the element is found.,1.5, 2492,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is finding any element by traversing through the whole data structure.,1, 2493,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is used for searching in datastructures like array it uses one pointer and it is comparativelt slow,1, 2494,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0, 2495,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Each element is matched with the the particular key by iterating through full data structure,1, 2496,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is used to search a particular data piece though the means of going though every elements comparing,1, 2497,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",1.5, 2498,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","O(n), in this type of searching, every element is looked up once",1.5, 2499,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is theway in which a array is searched lineraly,1, 2500,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching involves checking each element in a list sequentially until a match is found or the end of the list is reached.,1.5, 2501,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a method of finding an element within a data structure by checking each element in sequence until the desired element is found.,1.5, 2502,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search is the simplest search in which we start from the first element and go through to the all element to get our required result.,1.5, 2503,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",When we traverse through every single element once,1.5, 2504,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",It is an algorithm that searches data starting form first element to the last making its time complexity of O(n).,2, 2505,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it starts from one end and ends until travesing the whole search material,1, 2506,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is searching for any element linearly,0.5, 2507,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching refers to transversing data from one end to the other in a single line.checking all the elements one by one. its time complexity is o(N).,1, 2508,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",LINEAR SEARCHING IN THIS WE SEARCH FOR ELEMNT AT EVERY PART OF DATA STRUCTURE IT IS NOT A FAST WAY OF SEARCHING ,1, 2509,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",SEARCHING IN A LINER WAY LIKE WE DO IN ARRAYS AND LINKED LIST,1, 2510,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a method of searching the element through taking a pointer and checking each element for search in an array can be termed as linear searching,1.5, 2511,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","a sequential search algorithm that starts at one end and goes through each element of a list untill the desired element is found l,otherwise search continues till the end of the data set",1.5, 2512,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",each element is comapared one by one in single traversal,1, 2513,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is the process of iteration over every element in a linear data structure like an array and trying to find the desired value. it takes O(N) time.,1.5, 2514,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",ALL ELEMENTS ARE CHECKED ONE BY ONE,1, 2515,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0, 2516,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search or sequential search is a method for finding an element within a list.,1, 2517,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",inear search or sequential search is a method for finding an element within a list.,1, 2518,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching each and every node one by one ,1, 2519,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in array from 0 to n or we can say searching of time complexity of O(n).,2, 2520,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search is defined as the searching algorithm where the list or data set is traversed from one end to find the desired value.,1.5, 2521,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search is suitable for small collections or situations where the data is not ordered or where you don't have additional information that allows for more efficient searching methods,1.5, 2522,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching while traversing the whole structure is linear searching,1, 2523,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in linear search we find an element in a data structure sequentially but traversing the array/LL.,1, 2524,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we search for a particular key while accessing every element that comes before it,1, 2525,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching of a data in linear traversal,0.5, 2526,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching technique in which we search for the target element by element starting from index 0.,0.5, 2527,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","In linear searching,we search for our data by visiting every node one by one.And we dont have sorted data.so we dont know the exact position of data or can't even predict it.",1.5, 2528,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is technique which uses o(n) time complexity.,1.5, 2529,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",method for finding an element within a list.,0.5, 2530,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear search, also known as sequential search, is a basic searching algorithm that works by sequentially checking each element in a collection (such as an array or a list) until a match is found ",1.5, 2531,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it searches element from first index to the last index. it has time complexity of n.,1, 2532,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in o(n) time,0.5, 2533,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",element is searched one by one in a given array,1, 2534,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched.,1, 2535,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching elements in an array by going to every index one by one and comparing each value with the key,1, 2536,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is a searching technique i which elements in data are traversed linearly or one by one without any certain algorithm.,1, 2537,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","it is a searching technique where traversal takes place in one direction, where each element is traversed once until the target has been found.",1, 2538,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in linear data structure by traversing and comparing each element with one another is called linear searching,1, 2539,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is one in which we search in one direction only,1, 2540,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a method in which traverse is done in one direction vising each element.if number of element is n time complexity of searching is O(n),1, 2541,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is when we compare and check where the element is one by one in the same order/direction.,1, 2542,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","In this type of search, we traverse and find the element we're looking for by iterating through the elements in a sequence.",1, 2543,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",IT IS CHECKING EVERY ELEMENT OF ARRAY ONE BY ONE LINEARLY,1, 2544,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching is when each element is checked, and if there is a match, the element is found.",1, 2545,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching the data by travesing the whole data once is called linear searching,1, 2546,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is that in which we search each and every element until we find our target value.,1, 2547,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",1.5, 2548,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",triversing the element one by one and check,0.5, 2549,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversing data from one end to other end in a single line by checking elements one by one ,1, 2550,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",When we are Iterating through every element in a datastructure,0.5, 2551,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A linear search is the simplest approach employed to search for an element in a data set.,1, 2552,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",1.5, 2553,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Traversing any data structure each element line by line.,1, 2554,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching that can be done in only one direction is called linear searching,1, 2555,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear search is a basic searching technique that sequentially checks each element in a collection until a match is found, or the entire collection is checked.",1, 2556,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversing the elements one by one and check,0.5, 2557,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",It is a sequential searching algorithm in which we search data from start to end of the data structure.,1, 2558,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we search for an element and compare it with every element present in a data structure.,1, 2559,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found,1, 2560,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","searching all elements one by one, it has time complexity of O(n)",1, 2561,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","the searching which takes O(n) time to take i.e., can be done using single traversal",1, 2562,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",all elements are checked one by one ,0.5, 2563,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching involves sequentially checking each element until a match is found.,1, 2564,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in o[ n] time complexity where n is number of node,1, 2565,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversing each value of a data structure and equating each value of the data structure with the value to be searched.,1, 2566,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","in this , we compare the key value with all the values present one by one.",1, 2567,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","when we want to search something linearly eg in 1D array , so we traverser it linearly to get the desired element so this is called linear searching",1, 2568,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",we search element by comparing the target from first index to last index of array linear with O(n) time.,1, 2569,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in a sequential manner one by one,0.5, 2570,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching is a basic search algorithm that looks for an element sequentially from the beginning to the end of a collection (e.g., an array). It stops when it finds the target element or reaches the end.",1.5, 2571,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is traversing to each and every element and checking whether it is present or not,1, 2572,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",LINEAR SEARCHING IS THE METHOD IN WHICH WE CHECK ALL THE VALUES IN A STRUCTURE ONE BY ONE AND COMPARE THEM WITH THE VALUE WE WANT TO FIND.,1, 2573,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in which we search the data structure element by element in a linear manner,1, 2574,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",a linear searching is based on o(n^2) time complexity that search element by traversing every node ,1, 2575,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search is type of search when we check all elements for the desired element,1, 2576,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Traverses through data sequentially to search for target element,1, 2577,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is when we traverse each element one by one and see if it is equal to the target we are searching.,1, 2578,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching is a method in which an element is searched one by one, if the element does not match in the array it skips to the next element in the array until it finds it or array is finished",1, 2579,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search is when we access any array element by element until we find the desired value or key.,2, 2580,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Traversing the entire array/ linked list using a loop until the required element is found,2, 2581,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search is where we access an array element by element until we find the key.,2, 2582,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.", a sequential search algorithm that starts at one end and goes through each element,1.5, 2583,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Seaching one by one starting from the 0 index till the last index accessing each element.,2, 2584,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a asearching technique which takes O(n) time it compares each element in the structure with the key to be searched,2, 2585,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0, 2586,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is searching which does searching by picking every element and time complexity O(N),2, 2587,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",search for a particular element by comparing with every value of array,2, 2588,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a type of searching in which we start from first element and goes through each element of the list until the desire element got found .,2, 2589,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in linear search we traverse the entire data,1.5, 2590,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching a data structure element by element where time complexity of insertion is Order of log(n),1, 2591,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear search, also known as sequential search, is a straightforward and basic method for searching for a specific element within a collection of data, such as an array or a list. In a linear search, you start at the beginning of the data structure and examine each element one by one, moving from the first element to the last, until you find the target element you're looking for or determine that it is not present.",2, 2592,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a searching method in which the time complexity is n. we compare the key element with all other elements.,2, 2593,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in a straight line in an order,1.5, 2594,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching each element one by one.,2, 2595,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",liner searching is traversing through the entire data structue and comparing each element.,2, 2596,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traverse each data 1 time. Time complexity-O(n),1.5, 2597,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching refers to searching for an element by traversing the linear data structure in one direction element by lement,2, 2598,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching an element by checking each element until we get one in a linear way.,2, 2599,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it access the element one by one and this goes till the last element is reached,2, 2600,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we compare all the elements like the first element with every element in the array and so on for the next elementd,2, 2601,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A search that traverses from beginning to end until element found,2, 2602,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a searching teachnique in which w compare each and every element in the data structure with the input element until we find a match or end of data structure is reached.,2, 2603,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching all elements till data is found in On complexity,2, 2604,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is searching in a line . Traversing each element from starting to search the required element . ,2, 2605,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in which we traverse from beginnig to end,2, 2606,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching elements one by one in an array or vector,2, 2607,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching for a value in a given data structure vuia traversing it completely chceking its element one by one,2, 2608,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",we traverse through all the elements one by one until we find the required element.,2, 2609,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Traversing each piece of data one by one.,1.5, 2610,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",he simplest approach employed to search for an element in a data set.,2, 2611,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching with O(logn) time complexity,0.5, 2612,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is the most basic searching technique in which a key is set and key is the matched to all elements of the array during traversal,2, 2613,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",LINEAR SEARCHING IS A SEARCING TECHNIQUE WHICH FINDS FOR AN ELEMENT IN A SINGLE DIRECTION i.e checking each element one by one.,2, 2614,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",seraching by comparing single elemnts of array to given to searched value.,2, 2615,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching refers to searching of data one by one in a sequential order.,2, 2616,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linera searching means to search data one by obe by by comparing the given element with each index value one by one in a proper porder,2, 2617,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","We traverse and access the data structure linearly, going to each element one by one linearly.",2, 2618,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching with O(n) time complexity,1.5, 2619,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is searching data by traversing to each element one by one and checking them,2, 2620,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",a search algorithm that starts at one end and goes through each element of a list until the desired element is found,2, 2621,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a simple search algorithm that examines each element in a list or array one by one until a match is found or the entire list is checked.,2, 2622,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in linear searching a key is given and we build a function which uses that key to find the respective number,2, 2623,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.", A linear search is the simplest approach to search for an element in a data set. It examines each element until it finds a match.,2, 2624,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching done in n time complexity and done with a single loop where we traverse loop on a single time,2, 2625,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searchin data in a single line is Linear search,1.5, 2626,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",sequential search algorithm,1.5, 2627,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching done by comparing each element of the array or linked list with the value to be searched in a linear (first to last) manner.,2, 2628,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","linear searching is the type of searching which happens in an O(N) fashion, it traverses through each element of the datastructure one by one to find the required elements",2, 2629,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",comparing values with each element in the data structure,2, 2630,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","starting from the beginning of the data set, until the end The search is finished and terminated once the target element is find",2, 2631,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A linear search is the simplest approach employed to search for an element in a data set,2, 2632,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in linear searching the data are searched/traversed one by one(all the data are stored adjacent to each other),2, 2633,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a searching where we traverse in a single line or dimension .,2, 2634,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",ALL ELEMENTS ARE CHECKED ONE BY ONE,2, 2635,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching using a loop in On time complexity,2, 2636,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a simple searching algo to find a specific element from,2, 2637,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",the simplest approach employed to search for an element in a data set,2, 2638,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",2, 2639,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching an element in an array bt traversing,2, 2640,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is searching element in an array,2, 2641,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching through a data structure going through all of its discrete data such as all memory locations of an array which gives us its time complexity to be O(N).,2, 2642,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",which search the elements in one go timecomplexity is n,2, 2643,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",WHERE WE SEARCH the element from start to end until we find it like searching a page one by one,2, 2644,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",LINEAR SEARCHING IS TYPE OF SEACH WHICH TAKE PLACE ONE BT ONE IF WE SEARCH ANY DATA THEN IT COMPARE EACH AND EVERY ELEMENT,2, 2645,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching every node/data element line by linaer without skipping anyone,2, 2646,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",IT IS A TECHNIQUE TO SEARCH ANY ELEMENT IN O(N) TIME COMPLEXIBILITY.,2, 2647,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear seaching is a type of searching in which we can only search an element by traversing throughout the array/linked list from starting to ending not in between them.,2, 2648,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we traverser in a linear maner to find the data,2, 2649,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching an element in an array by traversing full array and searching for the target value by comparing(checking whether it is equal or not) it with every value stored in an array.,2, 2650,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when time complexity is O(n) where n is number of elements ,2, 2651,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","In this, the data structure is traversed linearly",2, 2652,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear traversal from 0 to n-1 index of the data structure,2, 2653,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is when we go to every element in an array to check if the element is matching the elment we need to find. It's complexity is a highr therefore we prefer binary search.,2, 2654,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is traversing that is visiting each and every element of the data structure,2, 2655,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",SEARCHING LINEARLU WITH SINGLE SATA AND SINGLY LINKED VALUES AND ADDRESSES IS SEARCHING LINEARLY,2, 2656,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found.,2, 2657,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",here we traverse all the elements till we find the required element,2, 2658,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","nodes are accessed one after another,as they are linked ",2, 2659,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search is the search in which we iterate thgrough the array element by element to search fir the given element.,2, 2660,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.", Time Complexity A linear search is the simplest approach employed to search for an element in a data set. ,2, 2661,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching where data is arranging in a linear way,2, 2662,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is trversing in order linear and searching for element. time complexity is O(n),2, 2663,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0, 2664,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when each data of linerar data structur can be stored,2, 2665,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching an element linearly in the whole list. in it the loop goes in the full array to find the element to be searched in the loop,2, 2666,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in this we search element in an array by traversing the array,2, 2667,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is searching for the given element by each element in the given list or array.,2, 2668,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",nodeas are accesed one after other. pointer moves one node at a time.,2, 2669,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is searching the element in a data structure by comparing that element in that linear data structure,2, 2670,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search is used on a collections of items. It relies on the technique of traversing a list from start to end by exploring properties of all the elements that are found on the way.,2, 2671,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",It a method of searching in a linear Data Structure.,2, 2672,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversing an array or linked list by reaching to each and every node,2, 2673,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A way of searching in which the target element is searched for by comparing it with each element in the data structure one by one.,2, 2674,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a type of searching which is performed on linear data structure ,2, 2675,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear search, also known as sequential search, is a basic searching algorithm that works by sequentially checking each element in a collection (such as an array or a list) until a match is found or the end of the collection is reached.",2, 2676,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching an element in array by traversing through full array and compairing each element with target,2, 2677,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching in linear time i.e. O(N) time,2, 2678,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",In linear searching we traverse one by one to all memory locations and side by side compare the preceding data values then arrange them in a sorted manner ,2, 2679,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",In linear searching we traverse the entore data structure visiting each value and comparing it with the key we want to search.,2, 2680,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is the searching which is done on each node one by one ,1.5, 2681,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is one where the searching takes place by comparing each element,1.5, 2682,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",its the simplest searching method that wer use ,2, 2683,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching and comparing each element one by one,2, 2684,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","it is the brute force method of searching for an element in the data structure. we traverse the whole data structure in hopes of finding the element, it take big O(n) time complexity.",1.5, 2685,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",to search the elements in linear manner(arranged in ascending order,1.5, 2686,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","searching starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",1.5, 2687,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching means searching through a data structure in linear time complexity.,2, 2688,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching for a element in a data structure by traversal in only one direction.,1.5, 2689,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching elements one at a time.,2, 2690,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",comparing each element one by one to search the required element,1.5, 2691,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Traversing through all the elements one by one in a linear order in a linear data structure and checking with the given key to be found is linear searching.,1.5, 2692,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted."," a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set",2, 2693,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search is perforded to search an element is a data structure. it search element on by one with the time complexity of O(n).,1.5, 2694,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",we search for the data in a line meaning we start from the starting till the end without skipping.,1.5, 2695,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in which search is done by sorting data and then one by one comparring data with the key to be searched,1, 2696,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is based on comparing keys with array element performed basically on sorted data,2, 2697,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",travsersing all elements of a data structure one by one,1.5, 2698,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in which the Algorithm starts from one end and compares every element till the end,1.5, 2699,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",search for element in a data structure sequentially,1, 2700,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching every element to reach to the desired one,2, 2701,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in this we traverse the whole array or vector one by one to find the particular element.,1.5, 2702,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching means going to each element and check if it is same it requires 0(n) time complex.,2, 2703,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching refers to finding an element by going through each and every element,1.5, 2704,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in this searching every element is visited till the expected element is not found,1.5, 2705,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0, 2706,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search is use to search the element ,2, 2707,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching for an element in a data structure in linear time complexity O(n),1.5, 2708,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in linear manner in o(n) time complexity,1.5, 2709,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",The searching method which takes O(n) time to search an element.,1.5, 2710,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search is where we traverse through the data structure in a linear order .,2, 2711,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching that takes O(n) time where n is the length of data structure,2, 2712,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a process where we can search a element in a linear way i.e one after another,1.5, 2713,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","search data ina an linear data , wh",2, 2714,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",comparing values with each element in the data structure one-by-one,1.5, 2715,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A searching algorithm which traverses the list until it finds the required element.,1.5, 2716,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a searching method to find an element by searching each element sequentially,2, 2717,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","when all te data elements are traversed one after the other util the desired element is found, it is searched in a linear way,",2, 2718,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","in linear seaarching ,the key is compared with every element in the data structure to give true or false.it has a TC of O(n).",1.5, 2719,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",SEARCHING WHICH IS DONE LINEARLY THAT IS IT GOES ONE BY ONE TO EVERY ELEMENT LINEARLY TO GET THE REQUIRED ONE.,1.5, 2720,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in linear search we search the key element with all the elements of the data set in a linear sequential manner from the first to last index,2, 2721,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",SEARCHING UNTIL THE ELEMENT IS FOUND.,1.5, 2722,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Checking every digit one by one if it is correct or not.,2, 2723,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",simplest way to search an element ,1.5, 2724,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is technique of searching a element sequentially in a data structure in O(n) time complexity.,1, 2725,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0, 2726,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search is the simplest approach employed to search for an element in a data set. ,1.5, 2727,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching every element it encounter in linear fashion(element by element).,2, 2728,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a method of searching elements in a data structure by manually checkng every element that whether it is the required element.,0.5, 2729,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",To search for elements in a data structure by traversing all of them linearly.,1.5, 2730,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0, 2731,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversing each data one by one ,1, 2732,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a searching method that completes the search in linear time i.e O(n),0, 2733,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching every data given in data structure one by one having O(n) time complexity.,2, 2734,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",to traverse the array and search the element ,1, 2735,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",2, 2736,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","When we search the element by traversing in sequentail manner eg stacks, queues, arrays, linked list",1.5, 2737,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",a sequential search algorithm that starts at one end and goes through each element of a list,2, 2738,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is ,1.5, 2739,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",2, 2740,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",if we use only one iterator to search.,1, 2741,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0, 2742,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in which we have to compare key in full data structure from start to end linearly.,1.5, 2743,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear search, also known as sequential search, is a straightforward method for searching for a specific element in a collection of data, such as an array or a list. In a linear search, you examine each element in the collection one by one until you find the desired element or determine that it is not present.",0.5, 2744,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A searching algorithm wherein we traverse each element of the data structure and compare it with the key we need to find,0.5, 2745,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching for an element in a data structure by traversal in only one direction,2, 2746,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",method for finding an element within a list one by one ,0.5, 2747,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching and comparing one by one,1.5, 2748,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is a type of searchng where we search from first index to last index without skipping any element,1.5, 2749,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching that is used for linear data structure/traversed in single direction from start to end,2, 2750,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Simplest approach employed to search for an elements in a data set,0.5, 2751,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0, 2752,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",method of searching in which we linearly search for an element accessing every element in between,1.5, 2753,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",IN THIS SEARCHING THE ELEMENT ARE SEARCH ONE BY ONE AND ITS TIME COMPLEXITY IS N2,0.5, 2754,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is one where we traverse the whole data structure to find the particular element that we wish to find.,1.5, 2755,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",When we search for a key by comparing it with every element.,0.5, 2756,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",that take linear time for searching and have complexity o(n),2, 2757,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching for an element in data structure by traversing in single direction,1.5, 2758,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.", linear search is the simplest approach employed to search for an element in a data set,1, 2759,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",search the element or data in a linear manner or sequentually.,1.5, 2760,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching searches the data in linear time i.e. 0(1).,1, 2761,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",· Linear Search is defined as a sequential search algorithm ,1.5, 2762,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is a searchng in which we compare every element and find the required element that we want,1, 2763,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching every element one by one .,1.5, 2764,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",method of searching in which we linearly search for an element accessing every element in between ,1.5, 2765,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching for an element in an data structure in a single direction traversal time complexity O(N) ,1, 2766,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0, 2767,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",search squentail each element,1, 2768,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is searching in which we traverse whole array and TLLE is O(n),1.5, 2769,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","It examines each element until it finds a match, starting at the beginning of the data set, until the end. ",1.5, 2770,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when each element of the linear data structure is compared with the search key. Complexity - O(1) ,2, 2771,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching the data sequentially or linearly,1.5, 2772,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",IT IS THE SERCHING DONE BY picking,1, 2773,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","when collision happens in hash table, the new value will get inserted to the next place (index+i)%M",2, 2774,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search or sequential search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched.,1, 2775,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",its a searching technique where we search a value one by one ,1.5, 2776,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",a linear seaRrch involves a time complexity of O(N) and involves the seaching in every array index or list node .,1.5, 2777,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching algo that starts at one end at end at the other,1, 2778,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we search data linearly in a data structure then it is called linear searching,1, 2779,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversing throught each element if key is found return its address,1.5, 2780,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching every single element one by one in a linear fashion,1, 2781,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching by traversing in one direction,2, 2782,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in linear searching all the elements are traversed in a datastructure until a given ,1, 2783,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching the data sequentially or linearly,1, 2784,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0, 2785,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversing a contiguous block of memory in one pass,1, 2786,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is the simplest sequence to search an element in a linear data ,2, 2787,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching of element traversing nodes one after the another in a linear chain,1, 2788,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is searching the elements one by one ,2, 2789,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is that when in lineaer manneer,1, 2790,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching element one by one ,1.5, 2791,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we compare the element in bubble sort fashion ,2, 2792,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",stating from the first element reaching till the end unless the key to be searched is not found.,1, 2793,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in this we check every element present in our data structure with the target elemet,1.5, 2794,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Its the simplest approach to search an element . it searches element linearly .,2, 2795,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Traversing in single direction for searching of elements.,2, 2796,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,1.5, 2797,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",sequential searching in a data structure in which data is stored in a linear sequence .,2, 2798,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we traverse a linear data structure from start to end to search.,1, 2799,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","A linear search is the simplest approach employed to search for an element in a data set. It examines each element until it finds a match, starting at the beginning of the data set, until the end.but the timecopmletixty is more as compared to binary searching.",2, 2800,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we traverse the data linearly to search an element then it is called linear linear searching.,1, 2801,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",start from the beginning of the list or array and compare each element with the target value you are searching for. we continue this process until we either find the target value or reach the end of the list without finding it.,1.5, 2802,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when searching data in linear sequence ,2, 2803,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",type of searching in which eacH data element is searched from beginning till the end ,2, 2804,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",METHOD TO FIND ONE ELEMENT IN LIST BY CHECKING SEQUNTIALLY EACH ELEMENT,1.5, 2805,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search is used to search an element in a linear array by traversing compollkete array and comparing values in it to the key,2, 2806,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching for each elements,2, 2807,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a simple sequential search through a list,1, 2808,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",simplest approach to search for an element in a data,2, 2809,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",lin linear searching we linear searched data with help of key,1, 2810,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is simple searching algo performed on a list in O(n) complexity,2, 2811,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",to search data linearly,2, 2812,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",that takes O(n) time to search an element,1.5, 2813,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","IT is also known as sequential search, is a simple method for finding a target element within a list. It works by sequentially checking each element in the list until a match is found or the entire list has been searched.",2, 2814,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching is a basic searching algorithm used to find a specific element in a list or an array. It traverses the list or array sequentially, starting from the beginning, until the desired element is found or the end of the list is reached. It compares each element in the list with the target element, and if there is a match, the search is successful. This method is called linear searching because it performs a linear scan through the elements of the collection.",2, 2815,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched.,2, 2816,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a simple searching algorithm used to find an element in a list or array,1, 2817,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in which linear time is taken to search an element,2, 2818,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a type of searching in which user have to traverse every element of the data structure to search any element.,1.5, 2819,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversing each element of array(or any storing data structure) one by one.),2, 2820,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","linear search algorithm used to find a specific element within a collection of data, such as an array or a list. In a linear search, the algorithm sequentially checks each element in the collection, one by one, until it finds the target element or determines that the element is not there",2, 2821,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching of elements in a linear data structure is known as linear searching such as searching for element in linked list or array,2, 2822,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",to trsaverrse the aaray linearly and search for the element,1, 2823,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",seaching in which we have to serch every node/data one after another until we found the desired data,2, 2824,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear search is also called as sequential search algorithm. It is the simplest searching algorithm. In Linear search, we simply traverse the list completely and match each element of the list with the item whose location is to be found. If the match is found, then the location of the item is returned; otherwise, the algorithm returns NULL.",1, 2825,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in which only 1 loop used,2, 2826,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",he simplest approach employed to search for an element in a data set.,1, 2827,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",2, 2828,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search is a method for finding an element within a data structure. It checks each element of the list until a match is found or the whole list has been searched.,2, 2829,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",comparing all the values in linear DS with given data,1, 2830,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A linear search is the simplest approach to search for an element in a data set.,0.5, 2831,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is the simplest approach employed to search an element.,0.5, 2832,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is where we go to every element of the structure to search the element until we find the element. We reach the end of the structure if we cannot find the element.,0.5, 2833,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","A linear search is the simplest approach employed to search for an element in a data set. It examines each element until it finds a match, starting at the beginning of the data set, until the end. The search is finished and terminated once the target element is located.",1, 2834,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","linear searching is a type of searching in which we traverse all elements one by one, it's time complexity is O(n).",1.5, 2835,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",seraching in a single direction,0.5, 2836,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",1, 2837,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching that can be done in only one direction ,1, 2838,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","In linear searching , the number is compared to all the values.",0.5, 2839,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching an element in data structute while traversing it from start to end . Like traversing array from first index to last index,1, 2840,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching process in which each node(/data) is traversed,0.5, 2841,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","What is linear searchingLinear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",1, 2842,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search is a method for finding an element within a list. It sequentially checks each element of the list until a match is found or the whole list has been searched.,1, 2843,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we traverse in data linearly ,1, 2844,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",going to each and every element once and search for it,1, 2845,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is ,0, 2846,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching the elements by going one to one on each element,1, 2847,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",1, 2848,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Comparison of the target element with the current element in the list.,0.5, 2849,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",near Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list .,1, 2850,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A linear search is the simplest approach employed to search for an element in a data set.,1, 2851,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",SIMPLEST APPROACH IMPLIED TO SEARCH FOR AN ELEMENT IN A DATA SET,1, 2852,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",comparing each value of the data structure with the given value and searching accordingly,1, 2853,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",seraching one by one,0.5, 2854,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is techinque of searching a key in a data structure but traversing all the elements in data structure and comparing one by one.,1, 2855,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching that's done by going through each element,1, 2856,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a basic search algorithm that checks each element in a data structure sequentially until a match is found,1, 2857,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A linear search is the simplest approach employed to search for an element in a data set.,1, 2858,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when searching isd done in 0(n) time traversing to all elements linearly,1.5, 2859,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",he simplest approach employed to search for an element in a data set.,0.5, 2860,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in linear searching we search for an element by comparring element one by one in a linear form,1, 2861,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traverse through data sequentially to search ,1, 2862,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching implement data searching by travering each node indiviadually,1, 2863,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",simple approach to search a data element in a set.,1, 2864,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","A linear search is the simplest approach employed to search for an element in a data set. It examines each element until it finds a match, starting at the beginning of the data set, until the end. The search is finished and terminated once the target element is located.",1, 2865,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search implements data searching by traversing each subsequent node ,1, 2866,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",each element is checked one by one until the whole array or linked list is traversed,1, 2867,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is a type of searching that search for an element by traversing whole array,1, 2868,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traverse through data sequentially to search,1, 2869,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",sertching elements one by one ,1, 2870,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching onr by one,0.5, 2871,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in liner search we traverse every data and where we find given data we exit,1, 2872,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",where we traverse a linear data structure form,1, 2873,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is a type of searching that search an element in data,0, 2874,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","it is a straightforward and fundamental method for searching for a specific element in a list or array of data. In linear searching, you examine each element in the data structure one by one, from the beginning to the end, until you find the target element you are looking for or until you reach the end of the list.",1, 2875,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",checks each element on by one till the element is found,1, 2876,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching by traversing all elements of a data structure,1, 2877,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",he simplest approach employed to search for an element in a data set.,0.5, 2878,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A method to search an element in linear data structure by comparing each element ,1, 2879,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is searching an element in an array by traversing each and every element in data structure using loops.,2, 2880,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",It includes traversing the data in a linear order to search an element.,1.5, 2881,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",we go to each element and check wheathewr it matches with the key or not.,1, 2882,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in a single direction.,1, 2883,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is a form of searching in which data is traversed through in a linear format ,1, 2884,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","in this, searching starts at the beginning and we traverse till the end until we found the element.",1, 2885,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching a element in linear data structure from starting to end in a sequential order,1.5, 2886,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in an array o(n) traversal,0.5, 2887,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversing through the entire structure with time complexity of O(n),1, 2888,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching traverses the whole data structure one by one and then compares the value for searching.,1, 2889,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Sequentially checking each element in a data structure.,0.5, 2890,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",where we go to each element at once and search it takes o(n ) time,1, 2891,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",visit every node in a tree one by one in 1-D,1, 2892,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searing a particular element one by one by traversing a complete array/linked list. This has O(n) time complexity.,2, 2893,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",to search for an element traversing linearly through the whole data structure,1, 2894,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Traversing through all elements from 0th index,1.5, 2895,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",type of searching in which the time complexity is of order O(n). key is compared with each and every element,1, 2896,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",a brute force searching method which compares all elements to key,1, 2897,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","linear searching, we traverse through whole linear data structure like array and check all elements. if element equal to given element, found",2, 2898,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching takes tine complexity of O(n) and t iterates through every entry till it reaches the entry to be searched.,2, 2899,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",seARCHING ELEMENT BY TRAVERSING FROM END OR STARTING ,1.5, 2900,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A linear search is a simple search algorithm that sequentially checks each element of a list until it finds an element that matches the search key,2, 2901,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we go to every element one by one and find theh desired element ,1, 2902,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","TC o(n),it visits each and every",1, 2903,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversing through a data structure using loop and comparing the value to the given value,1, 2904,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is searching which uses 2 loops hence with n square time complexity which is not effective,0, 2905,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching an element in O(n) time ,1, 2906,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","It examines each element until it finds a match, starting at the beginning of the data set, until the end. ",2, 2907,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching using linear data structure and in o(n) time complexity,1, 2908,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching every data one by one till we reach our desired vaue,1, 2909,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching element in linear form.,1, 2910,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching all elements in a order of time complexity,1, 2911,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0, 2912,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","it traverses the whole data structure until the required element is reached , it takes O(n) time",1, 2913,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",sequential search that starts at one end and goes through each element of a list until the desired element is found,1.5, 2914,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching means to search an element in an array one by one,1, 2915,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in linear data structure from one end to other,1, 2916,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Time complexity O(n) , it visits each and every element ",1, 2917,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in linear searching data is accessed linearly . means one level by level,1, 2918,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching for the element by visiting every element of the array linearly. ,1, 2919,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching all elements one by one with time complexity 0(N),1, 2920,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is putting smallest in starting then seocnd smallest in second position and so on,0, 2921,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",To search the data in linear order one after other,0, 2922,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in only one order; by accessing each element atleast once,1, 2923,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching done in one dimensional data structure,1, 2924,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",USING KEY TO TRAVERSE DATA STRUCTURES LIKE ARRAY AND LINK LIST AND FOR SEARCHING AN ELEMENT,0.5, 2925,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",start at one end and goes till last end,0.5, 2926,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching the data sequentially,1, 2927,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",comparing the key value one by one with every value present in the array or list to search element,2, 2928,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is traversing each element of the data structure in a linear sequence ,1.5, 2929,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we seach linearly,2, 2930,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",to find an element compariing every other from beginneing,2, 2931,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in linear searching we get index by dividing elemnt by size of hash table,2, 2932,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching in a linear data structure ,2, 2933,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.", Linear searching is a simple search algorithm that checks each element in a collection one by one until a match is found or the entire collection is traversed.,2, 2934,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in this type of searching each element is compared one by one and then if value matches the key it is returned,2, 2935,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Its hthe simplest approach to finding an element in an array,2, 2936,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is searching a element in linear time by traversing element by element,2, 2937,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in linear searching we only traverse the data structure linearly ,2, 2938,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",element to be search in stopred in a variable and then we traverse the whole array to check if element exists or not .,2, 2939,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",iterating one by one element conssecutively ,2, 2940,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",seraching element by going one to one to that and check that the element we are searching is that element and element is same or notdata and check ,2, 2941,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search is a method for finding an element within a list by checking each element sequentially,2, 2942,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",binery search,0, 2943,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching every element in a order time complexity O(n),2, 2944,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in linear searching the list or data set is traversed from one end to find the desired value.,2, 2945,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",when we search data one by one and it's time complexity is o(n) for each data,2, 2946,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",What is linear searching explain? What is Linear Search Algorithm | Time Complexity A linear search is the simplest approach employed to search for an element in a data ,2, 2947,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search or sequential search is a method for finding an element within a list.,2, 2948,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a searching techinque that search data in continuous memory.,2, 2949,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,, 2950,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is a single way of searching one by one.,2, 2951,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching for elements but the elements are accessed through the starting node and traverse through the whole structure,2, 2952,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a method of searching sequentially and in a particular straight line order.,2, 2953,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",comparison of the target element with the cur,2, 2954,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",IN LINEAR SREACHING WE TRAVERSE THROUGH ALL THE ELEMENT TILL WE FIND THE DESIRED VALUE TO BE INSERTED AND TAKES O(N) TIME COMPLEXITY,2, 2955,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set.",2, 2956,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching whole array one by one in linear manner. when element matches then the for loop ends.,2, 2957,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A type of searching in which the time complexity is O(n). The key is compared with each and every element,2, 2958,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search is used to search for an element by linearly traversing through the data and comparing the data.,2, 2959,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","We examine each element until we find a match, starting at the beginning of the set, until the end ",2, 2960,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",WHEN WE SEARCH ELEMENT BY ELEMENT LIKE IN LIBRARY OR IN PARKING LOT. HAS TIME COMPLEXITY O(N).,2, 2961,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in only one direction at a time,2, 2962,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",LINIEAR SEARCH IS COMPARING ONE BY ONE TO EACH ELEMENT UNTIL THE REQUIRED ELEMENT IS FOUND,2, 2963,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in linear data,2, 2964,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",the simplest approach employed ti search for an element in data set,2, 2965,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",a type of searching where we traverse each data entry in a given data structure in a linear manner...it takes O(n) time complexity,2, 2966,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,, 2967,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",that search ,0, 2968,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversing each element one by one,2, 2969,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",a searching in which we travel each and every elemnt and compare it with every element to find it . its cpomplexity is o(n).,2, 2970,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching each element of array,2, 2971,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",one by one seraching,2, 2972,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Every element is considered as a potential match for the key and checked for the same. If any element is found equal to the key, the search is successful and the index of that element is returned. If no element is found equal to the key, the search yields “No match found”.",2, 2973,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is like searching in arrrays in linear format.,2, 2974,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as arrays or lists, are accessible in incrementing memory location. Linear search compares the expected data item with each of the data items in the list or array. The average case time complexity of linear search is Ο(n) and the worst-case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching in O(n),1, 2975,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 2976,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","The main difference lies in the way they select elements for placement. Insertion sort considers one element at a time and places it in its correct position, while selection sort finds the minimum (or maximum) element and swaps it with the first element in the unsorted portion. Both have quadratic time complexity, but insertion sort tends to perform better in practice due to fewer comparisons and data movements.",2, 2977,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",both have a similar time complexity but we in selection sort we compare all the elements to each other whereas in insertion we compare element before it,0.5, 2978,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the final sorted array one item at a time, while selection sort repeatedly selects the minimum element and places it at the beginning. Insertion sort is more efficient for small lists, while selection sort is consistent but not very efficient.",1.5, 2979,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort we first find the minimum element and then compare it to every other element and in selection sorts we swap every consecutive element.,1, 2980,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",0.5, 2981,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort we find the minimum element first and then compare it with other elements.whwreas in selection sort we traverse the element and swap it with its previous element if required ,2, 2982,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In Insertion sort, we insert the elements while maintaining a sorted order while in Selection sort we select the smallest element and place in the first index similarly do this for others",1, 2983,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","nsertion Sort: Builds the sorted portion of the array one element at a time. Stable sorting. Time complexity is O(n^2). Suitable for small datasets and nearly sorted data. Selection Sort: Repeatedly selects the minimum (or maximum) element from the unsorted portion and swaps it. Not stable sorting. Time complexity is O(n^2). Suitable when minimizing swaps is important, but generally less efficient.",1.5, 2984,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 2985,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort and selection sort are two popular sorting algorithms, and their main difference lies in how they select and place elements in a sorted sequence.",2, 2986,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 2987,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in time complexity ,1, 2988,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort and selection sort are different in crucial ways that results in different time and space complexities.,1.5, 2989,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion works on a time com,2, 2990,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort places each element in a sorted order, starting from the second element. Each element is inserted at the place where it satisfies the ascending condition and greater elements are moved ahead accordingly. Selection sort is different and selects the smallest element from the data set and places it at the 0th index. Then repeats this process for 2nd smallest element at 1st index and so on. Both have O(n^2) average time complexity.",1.5, 2991,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the sorted part of the array by inserting elements one at a time. Selection sort repeatedly selects the smallest element and swaps it into its correct position. Both have O(n^2) time complexity, but insertion sort can be more efficient for nearly sorted data.",0.5, 2992,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1, 2993,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort sort the array in a already sorted subarray like a element is inserted into sorted array while selection sort selects the data for particular index ,0.5, 2994,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 2995,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In selection sort, we find the maximum/minimum element in the data structure and place it at the end/start of the data structure. In insertion sort we place the data at its correct position by swapping.",1.5, 2996,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Main differences: Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",0.5, 2997,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",2, 2998,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,1, 2999,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort requires fewer swaps than insertion sort but more comparisions.in section sort we find a min or max element and fix it at an end of array and repeat for the rest of the array. but in insertion sort we insert the elemnts of the array at a end from there original places. ,0.5, 3000,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted",2, 3001,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in selection sort we compare the element with each other where as in insertion sort we dont comapre two elements,1.5, 3002,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",N comparisons Time complexity (O(N)) ,0.5, 3003,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,1, 3004,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion Sort builds the final sorted array one element at a time by comparing each element and inserting it into its correct position. Selection Sort divides the input into a sorted and an unsorted region, repeatedly selecting the smallest (or largest) element from the unsorted region and moving it to the sorted region.",2, 3005,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in inserted sort one element is selected and put in its right position whereas in selection sort one element is set as minimum and then compared and later updated,1, 3006,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in selection sort we use unsorted array to find a place where given element is to be fitted a minimum element and in insertion sort we used sorted array to find,1.5, 3007,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3008,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort and selection sort both work in quadratic time complexity but one insert value in the sorted data structure whereas other swaps it in place.,2, 3009,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In insertion sort, we take an element and insert it to the front of the array at the place where it is less than the element before it, and greater than the one after it, and we do it for all the elements. In selection sort, we ""select"" an element and compare it to all the elements after it, and insert it acoordingly.",1.5, 3010,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is ,0.5, 3011,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element and then puts it at its right position, while insertion sort scans the sorted part to find the correct position to place the element",1, 3012,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Selection sort goes through the unsorted part to find the minimum element whereas insertion sort goes through the sorted part and finds the correct place to insert the element.,1, 3013,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,2, 3014,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element ,Selection sort requires fewer swaps than insertion sort, but more comparisons.",1.5, 3015,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3016,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,1, 3017,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Selection sort search unsorted part to find min value but insertion sort search sorted part to find the correct place for element,0.5, 3018,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",2, 3019,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,1, 3020,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort requires fewer swaps than insertion sort, but more comparisons. Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1.5, 3021,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",In insertion sort,2, 3022,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," In insertion sort, the algorithm maintains two sublists within the given list: one sublist of sorted elements and one sublist of unsorted elements. It starts with a single element (the first one) in the sorted sublist and iterates through the unsorted sublist, repeatedly taking an element from the unsorted sublist and inserting it into its correct position within the sorted sublist. This process is repeated until all elements are in the sorted sublist. where asIn selection sort, the algorithm divides the list into two sublists: the sorted and the unsorted sublists. It repeatedly finds the minimum (or maximum) element from the unsorted sublist and swaps it with the first element in the unsorted sublist. This process is repeated until the entire list is sorted.",0.5, 3023,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort traverses the unsorted part to find the minimum element and insertion sort traverses through the sorted part to find the correct position to place the element.,1.5, 3024,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the sorted part of the array one element at a time, while selection sort repeatedly selects the minimum element from the unsorted part and moves it to the beginning.",1, 3025,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",inplace and outplace,2, 3026,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","in selection sort, The algorithm repeatedly finds the minimum element in the unsorted part and swaps it with the leftmost element of the unsorted part, thus expanding the sorted part by one element whereas in insertion sort he algorithm picks up an element from the unsorted part and places it in the correct position in the sorted part, shifting the larger elements one position to the right.",0.5, 3027,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. ",1.5, 3028,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In selection sort, the input array is divided into two parts: a sorted part and an unsorted part. The algorithm repeatedly finds the minimum element in the unsorted part and swaps it with the leftmost element of the unsorted part. Whereas, in insertion sort, the input array is also divided into two parts: a sorted part and an unsorted part. The algorithm picks up an element from the unsorted part and places it in the correct position in the sorted part, shifting the larger elements one position to the right",0.5, 3029,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort sorts the first(smallest) element first and in selection sort the largest(last) element is sorted first.,2, 3030,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1, 3031,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons",1.5, 3032,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is a simple sorting algorithm that works by dividing an array into two parts: a sorted part and an unsorted part. The sorted part is initially empty, and the unsorted part contains all the elements of the array. The algorithm then iterates over the unsorted part, removing one element at a time and inserting it into the correct position in the sorted part.",1, 3033,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort first two member are selected where to enter the new element and in selection sort smallest element is selected and placed in first place,1.5, 3034,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is done while inserting the elements while selection sort is done after the insertion part is done,0.5, 3035,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,2, 3036,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the sorted array one element at a time, while selection sort repeatedly selects the smallest (or largest) element from the unsorted part of the array and swaps it with the first unsorted element.",1, 3037,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort scans the unsorted part to find the minimum element and insertion sort scans the sorted part to find the minimum element.,1.5, 3038,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3039,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the sorted portion on the left side, while selection sort builds the sorted portion on the right side. Insertion sort is often more efficient than selection sort for small or nearly sorted lists, as it can have a best-case time complexity of O(n). Selection sort consistently has a time complexity of O(n^2), regardless of the initial order of the elements. In both algorithms, the number of comparisons is proportional to n^2 in the worst case, but insertion sort can be more efficient in practice for some data distributions.",2, 3040,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the sorted portion of the list one element at a time by taking each element and inserting it into its correct position within the sorted portion, while selection sort repeatedly selects the minimum element from the unsorted portion and moves it to the front of the sorted portion.",2, 3041,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",time complexity of insertion sort -O(n) and that of selection sort is O(n^2),0, 3042,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort scans the unsorted part whereas the latter seaches the sorted one,0, 3043,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort can find the data in the unsorted array and the min element is swapped whereas the array needs to be sorted for it to work.,0, 3044,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",INSERTION SORT IS DONE ACCURATELY WERE TO PUSH THE MINMUM ELEMENT WHILE SELECTION SORT IS DONE IN MINIMUM ELEMENT FIND KARKE INSERT KARTA HAI,1, 3045,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in selection sort we sort using the minimum element and in insertion sort we use a random element to sort the data.,1, 3046,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion Sort: Builds the sorted array one element at a time, by repeatedly inserting the next element into its correct position within the already sorted portion of the array. Selection Sort: Divides the input list into a sorted and an unsorted region. It repeatedly finds the smallest (or largest, depending on sorting order) element from the unsorted region and swaps it with the first element of the unsorted region.",2, 3047,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort sorts the data while insertion whereas selection sort sorts data after ,2, 3048,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In insertion sort, we insert the the element at its right place. In selection sort, we swap the minimum element of the array with its correct position.",2, 3049,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",2, 3050,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in selection sort it takes starting element as sorted and then sorts the leftout array by comparing with sorted ones,1, 3051,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,1, 3052,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",It scans the already sort part to find the correct place the element. Selection sort scans the unsort part to find the minimum element ,1, 3053,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","IInsertion sort an They differ in how they select and place the elements in the sorted list. Insertion sort works by dividing the list into two parts: a sorted part and an unsorted part whereas Selection sort works by dividing the list into two parts: a sorted part and an unsorted part. It finds the minimum element in the unsorted part and swaps it with the leftmost element of the unsorted part, expanding the sorted part by one element",1, 3054,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion the search is performed taking random element whereas in selection sort search is performed by taking minimum element ,1, 3055,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort : insert values one by one in correct order as if previous values are sorted and inserting correspondig to it Selection Sort: picking value one by on and putting it to its right sapce,2, 3056,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",time complexity of insertion sort is:-O(n) and selection sort is:- O(n^2),1, 3057,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",the worst case time complexity is different,1, 3058,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3059,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort works on unsorted part and insertion sort works on sorted part,1, 3060,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3061,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3062,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3063,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3064,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","insertion sort and selection sort are two popular sorting algorithms, and their main difference lies in how they select and place elements in a sorted sequence.",1, 3065,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3066,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3067,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3068,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort and selection sort are two popular sorting algorithms. The main difference between them lies in how they select and place elements in a sorted sequence Selection sort scans the unsorted part of the input array to find the minimum element, while insertion sort scans the sorted part of the array to find the correct position to place the element",2, 3069,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion-pick a value and insert and the right position sleected value should be stored at the maximum possible locastion,2, 3070,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort selects the element from the array, usually starts from first index, and compares it to all the elements and puts it to its right place. while insertion sort works like deck of cards, a card is picked and compared to the values to it's left and placed to it's correct left place by shifting the elements to its right by one.",2, 3071,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3072,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the sorted part of the array incrementally, while selection sort selects the minimum element and swaps it into its correct position.",1, 3073,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted.",2, 3074,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion Sort and Selection sort are different.,0, 3075,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort finds the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",1.5, 3076,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is an in-place comparison-based sorting algorithm that builds the final sorted array one item at a time, while selection sort is a selection-based sorting algorithm that divides the array into two parts, a sorted and an unsorted sub-array. and Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1.5, 3077,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3078,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",In insertion sort We compare every element with other but selection element are compared with smallest,1.5, 3079,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted.",1.5, 3080,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the sorted array one element at a time, while selection sort repeatedly selects the smallest (or largest) element from the unsorted part of the array and swaps it with the first unsorted element.",1.5, 3081,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort finds minimum value in unsorted portion and insertion find correct place for the element in sorted portion,1.5, 3082,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort finds the minimum elemenSelection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort.",2, 3083,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort compares every element at the left side of the array whereas selection sort replaces the minimum value and places it at the first index of the array.,1.5, 3084,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort builds the sorted portion of an array by inserting elements sequentially. Selection sort repeatedly selects the minimum element and moves it to the sorted portion.,1, 3085,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort and selection sort are two common sorting algorithms used to arrange elements in a specific order (usually ascending or descending). They are similar in that they both have a time complexity of O(n^2) in the worst case, making them less efficient than more advanced sorting algorithms like quicksort or merge sort. However, they differ in their approach to sorting: 1. **Insertion Sort**: - It builds the sorted portion of the array gradually from left to right. - It starts with the first element as the sorted portion and then iterates through the unsorted portion. - For each element in the unsorted portion, it compares and inserts the element into its correct position within the sorted portion. - It works well for small data sets and can be efficient for nearly sorted data. 2. **Selection Sort**: - It divides the array into two parts: the sorted portion and the unsorted portion. - It repeatedly selects the minimum (or maximum) element from the unsorted portion and swaps it with the first element in the unsorted portion. - This process continues until the entire array is sorted. - Selection sort has a constant number of swaps, making it preferable when the cost of swapping elements is high compared to comparisons. In summary, insertion sort gradually builds the sorted portion of the array by inserting elements into their correct positions, while selection sort gradually selects the minimum (or maximum) element and moves it to its appropriate place in the sorted portion. Both algorithms are not the most efficient sorting methods for large datasets but can be useful in specific situations or as learning exercises due to their simplicity.",2, 3086,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort goes to the sorted part and find the correct position for the element while selection sort takes you to the unsorted part and find the minimum element.,1.5, 3087,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",they have different time complexities in the best and worst case.,0, 3088,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort,0, 3089,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3090,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",In selection sort elements are compared and indexes are moved,0, 3091,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort sorts the elements whilst inserting the element whereas selection sort is used to select particular data to perform sorting on ,1, 3092,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1, 3093,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","insertion sort sees the values and inserts in the correct place, meanwhile selection sort swaps the two values",1, 3094,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1.5, 3095,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the sorted sequence one element at a time, while selection sort selects the smallest element and swaps it with the first unsorted element.",1, 3096,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the sorted part of the array gradually, while selection sort selects the minimum element and places it in the correct position.",1.5, 3097,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Selection sort got through the unsorted array to find the minimum element while insertion sort go through the sorted array to find the correct position of element.,1, 3098,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3099,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3100,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3101,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is to pick an element and insert it at the position between biggger and smaller element and while slection sort is to select an element an match it with every else element in the list,1.5, 3102,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3103,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",INSERTION SORT THE ELEMENT IS INSERTED THEN CHECKED WHERE THE ELEMENT IS TO PLACED LIKE HOLDING OF CARDS AND IN SELECTION SORT A PIVOT ELEMENT IS SELECTED AND THEN IT ,1.5, 3104,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",THYE ARE DIFFERENT AS INSERTION SORT WORKS ON UNSORTED PART SELECTION SORT WORKS ON SORTED ART,1, 3105,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3106,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","selection sort scans the unsorted part to find the minimum element,while insertion sort scans the sorted part to find the correct position to place the element",1.5, 3107,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort finds minimum value in unsorted way,1, 3108,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is like sorting a pack of cards while selection sort requires you to find the minimum element and swapping with the first and so on. In best case insertion sort has O(N) tune complexity. however selection sort always has N SQUARE TIME COMPLEXITY,1.5, 3109,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort key is pcked and placed at correct postn and in selection key is selected and compared to swap,0.5, 3110,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort: it inserts data in a asc or dsc order by inserting data in-between where selection sort allows the data to be sorted one by one manner;,1, 3111,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1, 3112,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1.5, 3113,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort is based upon comparing while insertion sort ,0, 3114,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1, 3115,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","n selection sort, the input array is divided into two parts: a sorted part and an unsorted part. In insertion sort, the input array is also divided into two parts: a sorted part and an unsorted part. The algorithm picks up an element from the unsorted part and places it in the correct position in the sorted part, shifting the larger elements one position to the right.",1.5, 3116,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","selection sort repeatedly selects the minimum (or maximum) element and places it in its final position, while insertion sort builds the sorted portion of the list one element at a time",1.5, 3117,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort we compare the sungle value with whole elements of array while in slel,0, 3118,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","in insertion sort the data is partially sorted because of the limitations of the algo, whereas in selection sort the data is more complex and unsorted so as to provide a sorted result",1, 3119,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","selection sort works by selecting an element and then comapring every element with it for sorting, insertion sort inserts a particular element in a sorted position in the array",1.5, 3120,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","in insertion sort, the elements are first inserted in the middle and rest are shifted towards the right side of the array, and in selection sort we swap the values of array in insertion sort manner.",1, 3121,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3122,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort and selection sort are different as in insertion sort we take first element and compare all adjacent element and after every comparison we get the least value at its correct position whereas in selection sort we get the largest value at its correct position.,1.5, 3123,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is inplace and involves insertiona and selection sort involves swapping.,1.5, 3124,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In insertion sort ,we input values in a systematic manner and in selection sort we compile in such a manner that values comes in a systematic manner.",0.5, 3125,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion increases the pointer but selection goes to the same point every time it occurs,0.5, 3126,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in selection smallest data is compared and swapped and in insertion smallest data is inserted.,1.5, 3127,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3128,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","while inserting the values,insertion sort is performed. in selection sort, a pivot element is selected and it is further sorted",1, 3129,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1.5, 3130,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","selection sort takes more time complexity and more iterations than insertion sort, where as in insertion sort it is more efficient than selection sort",1, 3131,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3132,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","insertion sort is where we take the last/first element and place it at its correct position, whereas in selection sort we find the element which is the smallest and put in the first place and so on.",2, 3133,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons",2, 3134,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort you keep on sorting while adding a new value where as in selection sort all the values are added ad then sorted ,, 3135,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",In selection sort we take one element and compare it with all other element and then swap .in insertion sort we take 1 element and then start checking if an element is smaller we swap.it requires minimum no of operation,2, 3136,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort we find the correct place of the element and insert it between the appropriate two elements and in selection sort we select the element and shift it one by one to make it reach its correct location.,1, 3137,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Selection sort finds the minimum element in the array first whereas the insertion sort find the correct position of the element in the sorted parts of the data structure.,2, 3138,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3139,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort scans the SORTED ELEMENTS while selection sort scans the UNSORTED ELEMENTS.,0.5, 3140,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort sorts in a single cycle whereas selection sort uses multiple cycles,1, 3141,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Selection sort find the minimum element and place it at correct position and insertion sort places any element at correct position.,1, 3142,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3143,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection s",2, 3144,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3145,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",In insertion sort data is inserted in asc or desc but this is not in case of selection sort,0.5, 3146,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",2, 3147,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort and selection sort are two popular sorting algorithms, and their main difference lies in how they select and place elements in a sorted sequence.",0.5, 3148,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Main differences: Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1.5, 3149,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3150,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort inserts elements into the correct position within the sorted portion, while selection sort repeatedly selects the minimum (or maximum) element and swaps it with the next element in the sorted part.",2, 3151,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3152,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In insertion sort data is shifted , and in selection sort data is swapped",0.5, 3153,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort works on the basis of weight.,0, 3154,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",2, 3155,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort we place smallest element at its correct place and in selection sort we place max element at its correct place in each traversal ,2, 3156,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3157,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort key is placed and placed at the end and in selection sort ikey is placed by comparing the other elements,0.5, 3158,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the sorted array one element at a time, while selection sort selects the minimum and swaps it with the current element.",1.5, 3159,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort sorting starts form first element in selection sorting start form lasr,0, 3160,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3161,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3162,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",In selection sort-> Here you compare 2 adjacent element in array and swap it and after every iteration one elemeent would be at its correct position and in insertion sort you insert element 1 by 1 in required order here you use shifting of an array,0.5, 3163,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort find the minimum element in array the place it at first index for ascending but insertion divide arrai in sorted and unsorted part and put unsorted element in sorted part.,1, 3164,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1, 3165,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion Sort repeatedly takes elements from the unsorted part and inserts them into their correct position in the sorted part. Selection Sort repeatedly selects the minimum element from the unsorted part and moves it to the beginning of the sorted part,2, 3166,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted",1, 3167,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",SELECTION SORT WORKS WHEN WE ASSUME THE FIRST ELEMENT TO BE THE MINIMUM AND THEN TRAVERSE THE STRUCTURE BY CHANGING OUR ASSUMED VALUE IF ANY MORE MINIMUM ELEMENTS ARE PRESENT WHEREAS SELECTION SORT REPLACES THE ELEMENT TO THEIR CORRECT PLACE.,1.5, 3168,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3169,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1, 3170,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort takes less time then selection sort,0.5, 3171,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort searches for the minimum element and inserts it but insertion sort inserts element in its right place using loop,1, 3172,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In insertion sort it is like inserting cards at the correct place , first we take the first element and then shift all the other elements till we find its right place. In selection sort we find the largest element and put it in the end and then we continue to put the second largest on second last position",1.5, 3173,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3174,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in selection sort we find the minimum element from the unsorted array and in insertion sort we place element in the sorted portion of that array.,2, 3175,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3176,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","in selection sort, we find the minimum element from an unsorted array and in insertion sort we place element in the sorted poition of that array.",2, 3177,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. ",2, 3178,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In insertion sort we insert an element from the unsorted section of the array and place it in its appropriate place in the sorted section. In Selection sort, we select the min element form the array and place it at the start, repeating the same process while increasing the starting position by an increment of 1.",2, 3179,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted.",2, 3180,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3181,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort takes selects minimum element in unsorted array and sort it but in insertion sort it insert element in sorted array in its correct position,2, 3182,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort inserts new elements in a sorted array whereas selection sort,2, 3183,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In selection sort, the input array is divided into two parts: a sorted part and an unsorted part. The algorithm repeatedly finds the minimum element in the unsorted part and swaps it with the leftmost element of the unsorted part, thus expanding the sorted part by one element. Selection sort has a time complexity of O(n^2) in all cases.while in insertion sort In insertion sort, the input array is also divided into two parts: a sorted part and an unsorted part. The algorithm picks up an element from the unsorted part and places it in the correct position in the sorted part, shifting the larger elements one position to the right. Insertion sort has a time complexity of O(n^2) in the worst case, but can perform better on partially sorted arrays, with a best-case time complexity of O(n).",2, 3184,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort and selection sort differ in the number of swaping of numbers been held during sorting ,2, 3185,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in selection sort we find min/max push it to last index then select rest and perform the same and in insertion sort we take elements insert them one by one in a new array based on if its greater or smaller,2, 3186,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3187,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","in insertion sort, wecompare the elements from the end of the list and copy them to the right till we find an element less than the key. In selection sort, we we sort the elements from the front and send the largest to the end of the list.",2, 3188,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3189,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort inserts new element in a sorted array. Whereas selection sort ,1, 3190,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort works by comparing elements and inserting element to it's correct position,1, 3191,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3192,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1.5, 3193,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In insertion, we sort such that largest element take up the rightmost place. While, selection sort in which we take the smallest element in the leftmost position.",2, 3194,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion first sorts the data then perform the operations while the selection sort does not sort the data ,1.5, 3195,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort we use a pivot element,0, 3196,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort makes the array sorted one by one by comparisons while insertion sort divides array to sorted and unsorted array ,1.5, 3197,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","in insertion sort we insert the input element in its right place from the starting, while in selection sort we first input the data fully and then we sort the data by finding out the smallest integer in the unsorted part of array and swap it with the element in its right place.",2, 3198,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort sorts data in parts and selection sort traverses whole ds multiple times,1.5, 3199,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort searches in a sorted array while selection sort searches in an unsorted array ,1, 3200,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3201,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort scans the unsorted part to find the minimum element whereas insertion sort scans the sorted part to find the correct position of the element,1.5, 3202,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","insertion sort where data is shifted to sort the array, whereas in selection sort elements are swapped ",1.5, 3203,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",2, 3204,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",2, 3205,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. ",2, 3206,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3207,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3208,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3209,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",yes in one case we push the greater elemnt in the end and in another we push smaller element in front.,0, 3210,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3211,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort works on unsorted data and selection sort works on sorted data,1, 3212,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",The difference lies in how they select and place the elements.,0, 3213,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort elements are sorted one by one and are put in a sorted array in one side and in selection sort first element is taken as max and all elements are put wrt to it,2, 3214,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3215,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort checks the unsorted part to find the minimum element, while insertion sort checks the sorted part to find the correct position to place the element. ",2, 3216,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the sorted list incrementally, inserting elements into their correct positions, while selection sort repeatedly selects the minimum element and places it at the beginning of the sorted portion.",2, 3217,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3218,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1.5, 3219,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3220,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",In insertion sort we insert and sort the data at same time while in selection sort we sort all the data,1.5, 3221,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted.",2, 3222,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1.5, 3223,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sorts sorts in parts which selection sort traverses through the datastrucutre multiple times,1.5, 3224,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",In selection sort we need to have a given number of elements while insertion sort allows us to sort data as we get it.,2, 3225,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",2, 3226,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",2, 3227,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort when values get inserted into the linked list then it gets inserted in a such a way that aall the datas get sort whereas in selection sort only certain specific part gets sorted,1.5, 3228,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","insertion sort , sorts when the number is being inserted it travels through the whole array whereas selection sort selects each element and travesrse the whole array and put them in the right place",2, 3229,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort key is placed and placed by comparing at the end and in selection selection sort key is placed by comparing the other elements,1.5, 3230,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort compares the smallest and keep at its index while selection keeps on comparing element until the position is found,1.5, 3231,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","sertion sort and selection sort are both simple sorting algorithms used to arrange elements in a specific order, typically in ascending or descending order. While they are both considered ""quadratic"" time complexity algorithms (O(n^2)) and are not the most efficient sorting methods for large datasets, they differ in how they perform the sorting.",2, 3232,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort find the min element and shift to its right or left of the array in selection sort we find the min element and swap with its +1 element,2, 3233,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted",2, 3234,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3235,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort ,1, 3236,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In selection sort, we pick up a single element and check what could be the appropriate position of that element whereas in the insertion sort we go pick up chunks of the array and try to sort it.",2, 3237,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion complete in one cycle and other is complete in many circles,1, 3238,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3239,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",IN INSERTION SORT FIRST WE INSERT AND THEN SORT AND SELECRTION SORT IN WHICH WE COMPARE FIRST FROM STARTING,1, 3240,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3241,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort and selection sort are two popular sorting algorithms, and their main difference lies in how they select and place elements in a sorted sequence.",2, 3242,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3243,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort we insert the elements at its correct posion in the array and in selection sort we compare the minimum elements and awap it to the front,1.5, 3244,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3245,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3246,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","in insertion, the sorting is done by inserting elements while in other the element is selected to sort the element",1, 3247,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",there swaapping echniques are different,1, 3248,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort happens like we search an element in a deck of cards. while selection sort happens when we sort among selected elements. ,1, 3249,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",time complexity is different,0.5, 3250,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Selection sorts SCANS THE SORTED while insertion sorts starts with unsorted element,1, 3251,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort finds the unsorted part to find the minimum element, while insertion sort finds the sorted part to find the correct position to place the element.",2, 3252,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3253,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",differ by time complexity.,0.5, 3254,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",2, 3255,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Main differences: Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",2, 3256,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",2, 3257,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3258,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3259,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","insertion sort is different from selction sort ,as inserion sort sorts on the the basis of insertion meanwhile the selection sort sorts on thew basis of the selection",1, 3260,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",basically the main difference is how data is swapped. in insertion sort the loop sort first two adjacen elements and goes on until whole array is sorted while in selection sort the algorithm first select the smallest element then put it in first index than other put it in second index until whole array is sorted,1, 3261,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3262,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort takes each value and inserts it in its sorted position whereas selection sort selects the minimum element from the sub-array and places it on the first element of the sub-array iterating through the entire array one by one.,2, 3263,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3264,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.", insertion sort we sort while inserting the elements and in selectionn sort we comapare the every element with every element.,1, 3265,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",2, 3266,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3267,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort we sort from the start that is the exact opposite of bubble sort while in selection sort,1, 3268,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort enters one element at a time in the sorted array whereas selection sort appends the smallest element of the unsorted array to the end of the sorted array.,1.5, 3269,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0.5, 3270,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Builds the sorted array one element at a time, by repeatedly inserting the next element into its correct position within the already sorted portion of the array. Selection Sort: Divides the input list into a sorted and an unsorted region. It repeatedly finds the smallest (or largest, depending on sorting order) element from the unsorted region and swaps it with the first element of the unsorted region.",2, 3271,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. ",2, 3272,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Selection sort inserts element according to its position while insertion sort works by pushing larger elements to end,1.5, 3273,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort ,0, 3274,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","IN insertion sort we take the value and insert it at the proper location, while in slection sort we select the values in sequence and replace them with the smallest value ahead of it.",1.5, 3275,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",we swap in selection sort and minimum element is shifted in insertion sort,1.5, 3276,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3277,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is slow process but selection sort is fast,1.5, 3278,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort smallest element is selected and placed in correct placed in position while in insertion sort elements are compared and placed in correct position ,1.5, 3279,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3280,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",the major difference is in sort elements are arranged in ascending order where in selection sort the element are arranged in random order.,1.5, 3281,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1.5, 3282,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort scans sorted part and selection sort scans unsorted part ;,2, 3283,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort scans the unsorted part to find the minimum element while insertion sort find the correct position to insert an element.,1.5, 3284,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3285,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is stable whereas selection is unstable,1.5, 3286,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort. elements inserted into a queue,1.5, 3287,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3288,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion Sort shifts every element forward to insert a element in its correct position where as selection sort just swap the postion of 2 elements.,1.5, 3289,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion is basically inserting elements at there place whereas selection sort works by selection the wrongly placed elemets and inserting them,1.5, 3290,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In Selectin Sort, at first, the minimum or the maximum number from the list is obtained.In Insertion Sort, the values are inserted in a list/array wherein some of the values are previous sorted.",1, 3291,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3292,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3293,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort uses the sorted part while selection sort goes through the unsorted part,1.5, 3294,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1, 3295,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3296,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3297,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted array to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. ",1.5, 3298,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort we sort the elements by inserting an element accordingly where in selection it doest not,1.5, 3299,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort insert one element to the partial sorted array in selection it works on sorted array and finds the min or the max elements,2, 3300,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3301,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort use the unsorted part to find the minimum element, while insertion sort use the sorted part to find the correct position to place the element",2, 3302,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3303,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3304,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is faster than selection,1.5, 3305,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Selection sort find the minimum element in an unsorted array while selection is used in case of sorted array.,1, 3306,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is more time efficient than selection sort,2, 3307,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","in insertion sort we select an element from the given list and then we compare it from the other elements and sort it accordingly,whereas in selection sort we compare every element to the element present just after that element.",2, 3308,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3309,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","selection sort requires that the given data set be complete, in insertion sort data set can be updated",2, 3310,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",2, 3311,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",time complexity of insertion sort is O(log n) while of selection sort is O(n).,1.5, 3312,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort sorts the elements at the time of the insertion by comparing it with the elements and we get the sorted elements accordingly while in selection sort the elements are picked from the array and we get the smallest element after every loop we go through in it.,1.5, 3313,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," Selection sort traverse the unsorted part to find the minimum element, while insertion sort scans the sorted partselection sort looks for the minimum element and then compare them to other elements for sorting whereas insertion sort inserts the element in its right place. Selection sort requires fewer swaps than insertion sort.",1.5, 3314,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",THEY USE DIFFERENT MECHANISM TO SORT DATA STRUCTURES.,1.5, 3315,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort we compare the i'th element with the rest of the array and if the ,2, 3316,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",IN SELECTION SORT SMALL DATA COMES FIRST.,1, 3317,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort works by taking each element in the array and inserting it into its correct position, while selection sort works by selecting the smallest element and placing it at the beginning of the array.",1.5, 3318,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort compare every element ,2, 3319,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3320,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3321,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion we compare every element with every element while in selection we select one element and then compare it with the rest.,1.5, 3322,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort is used when new element is inserted while Selection Sort is used to first select and append it to first.,1.5, 3323,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","selection sort basically picks up the min element and places it in front and so on where as insertion sort checks one card ,place it in right position.",1.5, 3324,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,2, 3325,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3326,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","in best case , selection can take o(n) time ",1.5, 3327,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3328,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort places element in correct position while selection sort finds minimum element from already inserted and then insert at it correct position.,2, 3329,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort has lee time complexity in comparison of selection,1.5, 3330,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","the main diference is Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",2, 3331,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",In insertion sort element is inserted at its right place in the sorted part from the unsorted part. In selection sort smallest element is elected from the unsorted part of array and append at the sorted part.,1.5, 3332,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1, 3333,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3334,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In insertion sort, the input array is also divided into two parts: a sorted part and an unsorted part.In selection sort, the input array is divided into two parts: a sorted part and an unsorted part.In insertion sort, the input array is also divided into two parts: a sorted part and an unsorted part.",1.5, 3335,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3336,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3337,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort we find appropriate position to insert a particular element and in selection we select for the articular position having vALUE GREATER THAN ON RIGHT SIDE AND LESSER THSAN ON LEFT SIDE,1.5, 3338,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","nsertion sort builds the sorted portion of the list one element at a time, while selection sort selects the smallest (or largest) element from the unsorted part and moves it to the end of the sorted part. ",1.5, 3339,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort inserts the key at the appropriate position while sleection sort selects an element in each pass and places it at its correct position.,0.5, 3340,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1.5, 3341,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",we use selection sort to scan unsorted list to find the minimum element whereas it can be used in sorted listto find current position,2, 3342,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion we find minimum element and give it a position. in selection we ,1.5, 3343,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",1.5, 3344,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","insertion sort when data is inserted into another after comparison, selection inserted after comparing with a particular element small front , large back",0.5, 3345,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",In insertion we compare every element while in selection sort element and then compare it with the rest.,1.5, 3346,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3347,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort finds the minimun element and replaces it with the starting elements,1.5, 3348,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",IN SELECTION SORT WE PUT THE SMALLEST ELEMENT IN FIRST .. INSERTION WE SORT THEM ONE BY ONE,0.5, 3349,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3350,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Selection sort: searches for the minimum element in unsorted part and Insertion sort places in the element correct position in the sorted part.,0.5, 3351,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,1.5, 3352,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort works by getting min element in each traversal and insertion sort finds correct position of an elements and places it ,0, 3353,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3354,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3355,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion done on indexes,2, 3356,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is efficient when array is sorted and selection sort is efficient also in unsorted array,0, 3357,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3358,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion we directly insert the element but in selection every element is selected and then inserted.,1.5, 3359,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort finds the minimum element and replaces it with starting element,1.5, 3360,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort sorts by finding the correct position for a particular element whereas selection sort finds the minimum element,1.5, 3361,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3362,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3363,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",sadf,0, 3364,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",1, 3365,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort -> each node is compared with the selected node ( each node is selected one by one ); while insertion sort is when once the comparison is done then we donot compare those elements again,1, 3366,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort element is inserted in the sorted list at correct postion while in selection sort correct position of element is find out and then swapped,1.5, 3367,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion takes min element to sort and selection take sorted order mearurement,1, 3368,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort we compare the values of datas at the time of insertion only like if a>b the i will place a ahead of b or like-vise selection sort takes the first value of data compare it with the rest and if it is greater than any value it will swap it with that.,1.5, 3369,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1, 3370,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort,1.5, 3371,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insetion sort considers the array or other data to be sorted ,1.5, 3372,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3373,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort data is inserted into its correct place in the array but in selection sort minimum values get arranged first from starting.,1.5, 3374,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",they have different time and space complexities,1, 3375,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort finds the max or min element and places in it's correct position in the array whereby it searches for the max and min by traversing the entire array where in insertion sort it checks neighbouring elements and then shifts the element to it's correct position by shifting the elements to the correct position and no max and min are found and then swapped,1.5, 3376,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3377,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort ,1, 3378,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is an in-place comparison-based sorting algorithm, while selection sort is a selection-based sorting algorithm.",1, 3379,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3380,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort when array highly sorted and selection when array not sorted,1, 3381,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.", in how they select and place elements in a sorted sequence.,1, 3382,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in selection sort we continuosily put the smallest element in the front and in insertion sort we select an element and put it at its right place in array,1, 3383,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertio,1.5, 3384,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1, 3385,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort needs fix no of elements which can be sorted while insertion sort involves insertion while sorting,1, 3386,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1.5, 3387,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. ",1, 3388,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3389,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1, 3390,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted. ",1, 3391,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3392,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",as it selects and places the element in a sorted manner with least time and space complexity.,1, 3393,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort starts comparision form last element and go towards 0th index keep on swapping values until a value smaller than new value appears and in selection sort we compare 0th index element with other elements and if a smaller element is found then it swapped with the 0th index and it is done until whole list is traversed and then we repeat procedure for next element,1, 3394,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Bubble Sort and Insertion Sort are stable sorting algorithms, meaning that they preserve the relative order of equal elements in the sorted array, while Selection Sort is not stable.",1.5, 3395,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3396,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort sorts,1, 3397,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort sorts the array partially and selection sorting highly sorts,0.5, 3398,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",1.5, 3399,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted.",1, 3400,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1.5, 3401,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort sorts elements when they are being inserted(dunamic) it also has better average time complexity than selection sort while selectoin sort is used when elements are already present,1, 3402,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",. Insertion sort builds the sorted array incrementally; selection sort selects the smallest element and places it at the start. ,1, 3403,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1, 3404,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in selection sort we swap the two adjacent data and insertion sort we ,1, 3405,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.", 6. Insertion sort builds the sorted array incrementally; selection sort selects the smallest element and places it at the start.,1.5, 3406,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort ,1, 3407,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort is faster ,1.5, 3408,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3409,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort and selection sort are different in the following ways: Insertion Sort: In insertion sort, the array is divided into a sorted and an unsorted part. Initially, the sorted part contains only the first element. The algorithm repeatedly selects the next element from the unsorted part and inserts it into its proper position in the sorted part by shifting the larger elements to the right. Insertion sort is an in-place sorting algorithm. Selection Sort: In selection sort, the array is divided into a sorted and an unsorted part, similar to insertion sort. But instead of inserting elements into the sorted part, the algorithm repeatedly finds the minimum element from the unsorted part and swaps it with the first element of the unsorted part. The sorted part grows by one element in each iteration. Selection sort is also an in-place sorting algorithm. Differences: Insertion sort inserts an element into its correct position in the sorted part, selection sort directly swaps the minimum element to the beginning of the unsorted part. Insertion sort has a best-case time complexity of O(n) when the array is already sorted, while selection sort has a fixed time complexity of O(n^2) regardless of the input order. Insertion sort has an adaptive nature, meaning it performs efficiently on partially sorted arrays. Selection sort does not have this adaptability. Insertion sort can be implemented as either a stable or unstable sort depending on the implementation, while selection sort is generally unstable.",1.5, 3410,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3411,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","nsertion Sort: It works by dividing the list into two parts, a sorted and an unsorted part. election Sort: It repeatedly selects the minimum element from the unsorted part of the list and places it at the beginning",1, 3412,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort uses dynamic data while selection sort uses static data and their algorithms are quite different too.,1, 3413,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3414,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort check the middle value and compare it if less then right if more then left and selection use pivot to find centre ,1, 3415,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","SELECTION SORT Divides the input list into two parts: the sorted part on the left and the unsorted part on the right. It repeatedly selects the minimum OR maximum element from the unsorted portion and swaps it and inserrion sort Builds the sorted array or list one element at a time. It iterates through the unsorted portion of the array and, for each element, moves it into its correct position within the sorted section of the array.",1.5, 3416,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort we find the minimum element and shift it to its left or right with respect to its corresponding elements. In selection sort we traverse the whole array and find the minimum element and swap it with the max element,1.5, 3417,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1.5, 3418,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3419,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. ",1, 3420,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",difference in time and space complexities,1.5, 3421,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","election sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. ",1.5, 3422,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort:To sort an array of size N in ascending order iterate over the array and compare the current element (key) to its predecessor, if the key element is smaller than its predecessor, compare it to the elements before. Move the greater elements one position up to make space for the swapped element.Selection sort:The algorithm repeatedly selects the smallest (or largest) element from the unsorted portion of the list and swaps it with the first element of the unsorted part. This process is repeated for the remaining unsorted portion until the entire list is sorted. ",1, 3423,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1.5, 3424,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion we insert the data at a place in sorted manner and in selection sort we select one data then sort it,0.5, 3425,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1.5, 3426,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort and selection sort are two popular sorting algorithms, and their main difference lies in how they select and place elements in a sorted sequence.",0, 3427,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3428,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Main differences: Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",2, 3429,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in selection sort we select the index of largest element and we compare that index with index of all elements if we find the element bigger than that of our selected index we change our index to the indexof bigger element.whereas in insertion sort we compare all elements one by one. the worst case time complexity is good in selection sort than in insertion sort ,1, 3430,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion adds sorted values to a new array and in insertion we choose one element and compare all value to it ,0.5, 3431,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. ",2, 3432,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",2, 3433,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3434,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort can be used in case of dynamic data insertion where as selection sort cannot be used for it.,0.5, 3435,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is better to implement when the data is partially sorted but in selection sort sorting can be done with disorganized data,0.5, 3436,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted.",0.5, 3437,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",2, 3438,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3439,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3440,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",the,0, 3441,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3442,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort is a simple sorting algorithm that works similar to the way you sort playing cards in your hands. The array is virtually split into a sorted and an unsorted part. Values from the unsorted part are picked and placed at the correct position in the sorted part. The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from the unsorted part and putting it at the beginning. The algorithm maintains two subarrays in a given array.,2, 3443,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is dynamic whereas selection sort is static,0, 3444,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","election sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",2, 3445,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",2, 3446,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",SLECTION SORT -MIN ELEMENT IS FOUND WHILE INSERTION SORT SCANS SORTED POSITION TO PLACE THE ELEMENT ,2, 3447,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3448,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3449,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort is a unstable sorting algo and insertion sort is stable,0, 3450,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort goes through unsorted array to find minimum element while insertion sort goes through sorted array to find the correct position of elemant,2, 3451,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," Insertion sort and selection sort are sorting algorithms. Insertion sort builds the sorted list one element at a time, while selection sort repeatedly selects the minimum element and places it at the beginning.",1.5, 3452,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. ",2, 3453,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is dynamic where as selection is static,0.5, 3454,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","election sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1.5, 3455,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3456,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort sort minimum elkement and insertion sort put elemrent in array using loop,1.5, 3457,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort select the minimum element and insertion sort put element at right position,1.5, 3458,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1.5, 3459,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Main differences: Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",2, 3460,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is better to implement when the data is data is partially sorted whereas selection sort is more efficient with disorganized data,0.5, 3461,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort --- it ,0, 3462,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort find the minimum element in unsorted part and insertion sort find the correct element to place at its correct position,1.5, 3463,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection and searches for the minimum element,1, 3464,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3465,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3466,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3467,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1.5, 3468,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort find the minimum element in unsorted part and insertion sort find the correct element to place at it's correct position,1.5, 3469,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted",0.5, 3470,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the sorted portion by inserting elements in the correct position, while selection sort selects the minimum (or maximum) and moves it to the sorted portion.",, 3471,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3472,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. ",1.5, 3473,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3474,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort and selection sorts are different because insertion sort ,0, 3475,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3476,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3477,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",In selection sort all the numbers are compared to a single value while insertion sort puts the sorted values in a different array,0, 3478,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3479,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",we insert the smallest element first in the insertion sort whereas in selection sort it finds an unsorted part and places it.,1, 3480,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3481,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort and selection sort are two popular sorting algorithms, and their main difference lies in how they select and place elements in a sorted sequence.",1, 3482,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort searches the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",0.5, 3483,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","In insertion sort,elements are put it into their correct palce.",0, 3484,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort builds the final sorted array one element at a time, while selection sort selects the minimum element and swaps it with the first unsorted element.",2, 3485,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion takes o(n) in best caseand but in selectiopn sort swaap takes o(n2) in worst case and best case also as we compare with each element,2, 3486,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","insertion sort select element directly into position, and selection sort ",0, 3487,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3488,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort",1.5, 3489,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3490,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3491,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",they both use different algorithm like insertion adds sorted elements in a diffrent array,0, 3492,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3493,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort inserts smaller element at the front of the linked list and larger element on the back whereas selection sort swaps the elements in the same array an puts it in ascending or descending order.,2, 3494,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3495,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted.,0, 3496,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion takes longer time,0, 3497,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3498,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3499,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion arranges element from last but selctioon from first,0, 3500,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion a value is placed according to position in an array and in selection its done by swapping values .,1.5, 3501,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort is dynamic and selection is for static data,0, 3502,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3503,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in selection sort every data is compared while this i snt he case in insertioj sort ,0, 3504,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort used to store an element and selection sort used to select an element.,0, 3505,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3506,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","inQueue(), deQueue(), push(), pop()",0, 3507,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort- smallest element of the whole array is placed at front in each iterationfron,0.5, 3508,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3509,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",time complexity of insertion sort is less than the time complexity of selection sort,0, 3510,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort and selection sort are two popular sorting algorithms, and their main difference lies in how they select and place elements in a sorted sequence.",0.5, 3511,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in spacecomplexity,0, 3512,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort scans the unsorted part and insertion scans the sorted part ,0, 3513,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons",1.5, 3514,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort place smallest first while selection place largesr,0, 3515,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3516,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element.",1.5, 3517,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort sorts while inserting of elemnts dynamically; selection sort places largest element at last and so on (therefore array needs to pre exist),1, 3518,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort data can be sorted dynamically which is not the case in selection sort ,0, 3519,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3520,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","election sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",1, 3521,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion - dynamic selection-static,0, 3522,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort places a new element at its correct position where as selection sort,0, 3523,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion includes first accessing the element and finding the position to be inserted . Selection sort arranges the data in after swaps such that lowest goes to the end and data becomes sorted till a particular place every time data is traversed.,2, 3524,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",they have different time complexities,1, 3525,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion we keep giving on eelemnt but selection needs fixed eno. of elements,1, 3526,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion as soon as element come we insert but in selection we change its positions then we arrange it,1, 3527,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Insertion sort : each value is being compared from first value. Selection : Traversing through two loops,1, 3528,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion Sort builds the sorted array one item at a time, whereas Selection Sort repeatedly selects the minimum element and moves it to the beginning of the unsorted portion.",1, 3529,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3530,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",1, 3531,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort we can give data DYNAMICALLY while in selectyion sort data is given beforehand,1, 3532,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3533,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","insertion works like a deck of cards ,first we will take an element, then another and check if it is larger or smaller then the previous element then we place it before the previous element is it is smaLLER ND VICE VERSA , ",1.5, 3534,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted.",1.5, 3535,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3536,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",their main difference lies in how they select and place elements in a sorted sequence.,1, 3537,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","in insertion sort we select the element and then compare nit one with with other ,in selection sort we select a element and the make it highest node after that compare it with other",1.5, 3538,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3539,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort has a time complexity of O(n^2) while Insertion sort has a time complexity of O(n^2) in the worst case, but can perform better on partially sorted arrays, with a best-case time complexity of O(n). in all cases.",1.5, 3540,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort scans the unsorted par to find the minimum element while insertion sort scans the sorted part,2, 3541,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",2, 3542,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. ",2, 3543,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort uses divide and conquer technique but insertion does not.,1, 3544,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3545,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list."," Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",2, 3546,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,0, 3547,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",2, 3548,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in insertion sort we can give data dynamically ,2, 3549,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",INSERTION SORT IS DYNAMIC IN NATUE IT IT CAN WORK WHEN WE DO NOT KNOW THE DATA SET SIZE IT SORTS THE VALUE AS THE VALUES ARE INSERTED WHEREAS SELECTION SORT WORKS FOR STATIC DATA ITEM WHEN THE NO.OF ELEMENT ARE FIXED IT TAKE O(N^2) TIME COMPLEXITY AND HAS NO OPTIMISTAION,2, 3550,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted. In summary, both algorithms have a similar time complexity, but their selection and placement methods differ.",2, 3551,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort ,2, 3552,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Inselection sort the largest element is Push to the back and In insertion sort the key is inserted in the right place. Insertion sort is dynamic in nature ,1.5, 3553,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection sort works on the unsorted part of the data while insertion sort works on the sorted part of the data,1.5, 3554,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",Selection sort finds the unsorted part to find the minimum element and insertion sort scans the sorted part to find the position to insert the element at.,1.5, 3555,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",SELECTION USED TO FIND THE MINIMUM ELEMENT WHILE INSERTION CAN BE USED TO FIND THE RIGHT POSTION TO PLACE THE ELEMENT IN SORTED ARRAY,2, 3556,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",selection moves max element at end where as insertion sort works by swapping elements ,1.5, 3557,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. ",2, 3558,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",both are different,1.5, 3559,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element",2, 3560,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,, 3561,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,, 3562,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Insertion sort is more efficient than selection sort when the input array is partially sorted or almost sorted, while selection sort performs better when the array is highly unsorted.",2, 3563,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,, 3564,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",in inesertion sport we find ,1.5, 3565,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,, 3566,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,, 3567,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.","Main differences: Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",2, 3568,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",insertion sort works by selection each element while selection sorts one by one. ,1, 3569,How are insertion sort and selection sort different?,"Both sorting techniques maintain two sub-lists, sorted and unsorted, and both take one element at a time and place it into the sorted sub-list. Insertion sort works on the current element in hand and places it in the sorted array at the appropriate location maintaining the properties of insertion sort. Whereas, selection sort searches the minimum from the list.",,, 3570,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,dividing the array into 3 sub arrays based on pivot point,2, 3571,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. It then recursively applies the same process to the sub-arrays until the entire array is sorted.,1.5, 3572,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we find a pivot element and store all the numbers smaller to it on the left and bigger on the right and do this operation recursively,0.5, 3573,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quicksort is a divide-and-conquer sorting algorithm that works by selecting a 'pivot' element and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. It then recursively sorts the sub-arrays.,1, 3574,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we find a pivot point and the fix a pointer on first and last position swap them untill the pivot pont comes.,1.5, 3575,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"it works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",0.5, 3576,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we find the pivot point first and the start traversing it from either first or last,1, 3577,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is based on divide and conqueror strategy. We first select a pivot and then place it at its correct location. Then we recursively do that for the left and right of that pivot element. On avg it requires O(NlogN) Time and O(1) space while in worst case it requires O(N2) time.,0.5, 3578,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Divide and conquer technique , array is divided into smaller subparts based on their value",2, 3579,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,1, 3580,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,QuickSort is a sorting algorithm that works on the Divide and Conquer algorithm that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array.,1.5, 3581,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0.5, 3582,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,with the help of partition and dividing,1, 3583,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0.5, 3584,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we assume a pivot element in array(suppose we take it last element of array).now will iterate a loop and will compare the element with pivot one swap the element ,2, 3585,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quicksort partition the array around a pivot element where left left array is smaller than pivot and right array is larger than pivot. It is recusively called till each subarray is sorted on it's own. It is an inplace sorting technique but it is not stable.,1.5, 3586,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works by selecting a ""pivot"" element, partitioning the array into two subarrays: elements less than the pivot and elements greater than the pivot. It recursively applies this process to the subarrays. It's efficient with an average time complexity of O(n log n) but can degrade to O(n^2) in the worst case.",1, 3587,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," It works by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked.",2, 3588,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,logn,0.5, 3589,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,1, 3590,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is a sorting algorithm where we select a pivot element and place that element at its correct position. Then we recursively call the quick sort function again for the remaining elements.,1.5, 3591,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is one of the most efficient sorting algorithms. It works by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked.",0.5, 3592,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked.",2, 3593,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It is a divide-and-conquer algorithm that makes it easier to solve problems.,0.5, 3594,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,first we find a pivoit point and arrange the elements bigger than pivoit point to the right and smaller elements towards right of pivoit point. we repeat these steps for each of the sub arrays towards left and right of pivoit point which result in sorted array.,2, 3595,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3596,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,uickSort is a sorting algorithm based on the Divide and Conquer algorithm that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array,1.5, 3597,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Divide And Conquer Technique the array/linked list divided into smaller subparts about a pivot until single element reamains which implies that it is sorted this is done recursively,0.5, 3598,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3599,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick Sort is a divide-and-conquer sorting algorithm. It works by selecting a ""pivot"" element and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively.",2, 3600,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort uses a pivot point and compares the element throught it where it aims to position the pivot point to the right position and in doing it would sort the complete array;,0.5, 3601,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"in quick sort, we do partion of array many times and then exchange the minimum term with its pivot value and then merge it",1, 3602,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works on the priciple of partitioning/pivoting and the pivot element in the first traverse gets to iits correct place,1.5, 3603,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quick sort uses the principle of partitioning the data container and sort the smaller containers, then join the sorted partitioned containers together while resorting them, creating a sorted sequence in the end.",0.5, 3604,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, we select the last element, and partition the array in such a way that the elements less than the last element are on the left side of the last element and the ones greater are on the right side and finally the last element is placed at the place where the elements less that the last element end. Now function recursively calls for left and right half of the partition.",2, 3605,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0.5, 3606,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick Sort repeatedly selects a pivot element, puts all elements less than it on its left, and greater elements on right. Thus putting the pivot at its right position. Then recursion is called for left and right subpart, and so on. Avg Time Complexity - O(NLogN)",2, 3607,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,The algo works by partitioning the array and then swapping the smaller elements in comparison to the pivot element that is chosen at the beginning of the algo.,1, 3608,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in it we first find any random element then compares every other element to sort the array,1.5, 3609,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked",0.5, 3610,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,2, 3611,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,1, 3612,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,1.5, 3613,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort work on compairing 2 elements and changing their position as per the condition of sorting applied,0.5, 3614,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"its divide and conquer sorting technique, an element is chosen and then placed at its coorect position and the the function is called recursively for the left and right part of this element.",2, 3615,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"It requires a pivot element and creates partitions explaination -> .It works by breaking an array into smaller ones i.e. partitions and swapping the smaller ones, depending on a comparison with the pivot element picked.",1.5, 3616,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In quick sort we first select a pivot element. Then we iterate the array to put all the elements smaller than the pivot to the left of the pivot and those bigger than pivot to the right of the pivot. Then we recursively sort the array to the left of pivot and then the array to the right of pivot.,1, 3617,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort works through the following steps: Choose a pivot element. Partition the list into two sublists - elements smaller and larger than the pivot. Recursively apply quick sort to the sublists. Combine the sorted sublists and the pivot to get the fully sorted list.,2, 3618,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,users use divide and conquer technique by partitioning the data set around a pivot element.,0.5, 3619,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works by selecting a pivot element, partitioning the array into two subarrays, and recursively sorting those subarrays.",1, 3620,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort is a divide-and-conquer sorting algorithm that works by selecting a ""pivot"" element and partitioning the array into two sub-arrays, one with elements less than the pivot and the other with elements greater than the pivot. This process is recursively applied to the sub-arrays until the entire array is sorted.",0.5, 3621,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"The key process in quickSort is a partition(). The target of partitions is to place the pivot (any element can be chosen to be a pivot) at its correct position in the sorted array and put all smaller elements to the left of the pivot, and all greater elements to the right of the pivot.",2, 3622,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"breaking an array into smaller ones and swapping the smaller ones, depending on a comparison with the pivot element picked",1, 3623,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick Sort uses divide and conquer technique to sort the unsorted array. A pivot element is chosen and partitioning is done across it.,1.5, 3624,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it keeps on sorting and continuously decreases the size of sorted array.,1, 3625,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",1, 3626,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3627,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"QuickSort is a sorting algorithm that works by dividing an array into two parts: a smaller part and a larger part. It selects an element called the pivot and partitions the array around it. The elements smaller than the pivot are placed to its left, and the larger elements are placed to its right. This process is repeated recursively on the left and right sub-arrays until the entire array is sorted",2, 3628,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3629,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort separates the elements in two parts using pivot element and then the sorting is done,1, 3630,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort uses algorithm,0, 3631,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quicksort is a divide and conquer sorting algorithm that works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively.,2, 3632,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is an algorithm, it works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",1, 3633,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,20, 3634,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," It is a divide-and-conquer algorithm that works by selecting a ""pivot"" element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively.",2, 3635,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works by selecting a ""pivot"" element from the array and partitioning the other elements into two sub-arrays, those less than the pivot and those greater than the pivot, and then recursively sorting these sub-arrays.",1, 3636,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3637,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort selects a pivot index about which the data comparisons are made and sorting is done.It is an inplace sorting algorithm which sorts the data in worst case time complexity of O(n^2),1, 3638,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works on the algorithm where the array is divided in half and half again and again and then the elements are sorted and organised.,1, 3639,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,QUICK SORT WORKS BY SWAPPING THE ELEMENT BY ITS CORRECT POSITION AND IS DONE IN O(N2),1, 3640,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,We take a pivot point and try to place it in the correct sorted position and then we recursively sort the left and right side of the pivot point.,1, 3641,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is a sorting algorithm that works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. The sub-arrays are then recursively sorted. This process is repeated until the entire array is sorted. Quick sort is known for its efficiency and is widely used in practice.,1, 3642,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort uses a pivot element and two pointers up and down which traverse the array or data structure finding a smaller element than pivot and greater than pivot and replacing till the data is sorted,1, 3643,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, we take a pivot and split the array around that pivot. we take 3 arrays around that pivot. the elements smaller than pivot are on one side and the elements larger than pivot are on the other side.",1, 3644,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"reaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked",1, 3645,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort uses the radix sort inside and ,1, 3646,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3647,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort It works by breaking an array into smaller parts and swapping the smaller ones, depending on a comparison with the 'pivot' element picked",2, 3648,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. ",2, 3649,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we take a pivot point and try to place it in its correct position . pivot point can be either the first element or last or any random element,2, 3650,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"on divide and conquer principle , choose pivot element and move it to correct location and sort left to it and all the values right to it. ",2, 3651,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3652,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"in place sorting by dividing array into two parts, greater than and smaller than the pivot value",1, 3653,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3654,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it checks adjacent elements and swap them,1, 3655,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we choose pivot element of our choice to the ,1, 3656,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort work by the use of pivot,1, 3657,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3658,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3659,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3660,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3661,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3662,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,1, 3663,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick Sort is a divide-and-conquer algorithm that sorts an array by partitioning it around a pivot element. The pivot element can be chosen in different ways, such as the first element, a random element, or the median element. The array is divided into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot. The sub-arrays are then sorted recursively using the same method",2, 3664,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divide and conquer principle,1, 3665,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,By finding the pivot element and putting it in it's correct place. ,2, 3666,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quick sort has 2 function, 1st one selects, a number at random recursively calls elements before that and after that to another function, and then it for each of them a random element is selected and this is done till null",1, 3667,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works by selecting a ""pivot"" element, partitioning the array into two subarrays – elements less than the pivot and elements greater than the pivot, and then recursively sorting the subarrays. This process continues until the entire array is sorted.",2, 3668,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,We sort element in quick sort in O(logn) and here we create a pivot so as to ,0.5, 3669,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In this sorting algo , we choose A PIVOT ELEMENT of our choice according to the condition. ",1, 3670,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",1.5, 3671,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm12345. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively. Quicksort is one of the most efficient sorting algorithms",1.5, 3672,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3673,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,By setting pivot in array,0.5, 3674,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3675,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quicksort is a divide and conquer sorting algorithm that works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively.,1.5, 3676,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it randomly takes an element as pivot and divides and sorts the two portions and this repeated until it is completely sorted,2, 3677,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It follows divide and conquer method in an efficient manner making it fast.,1, 3678,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,placing pivot element at its right place by comparing elements lesser than the pivot element.,1, 3679,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort is a divide-and-conquer sorting algorithm that works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. Quick sort has an average time complexity of O(n log n).",1.5, 3680,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort is a popular and efficient sorting algorithm that follows the divide-and-conquer strategy to sort a list or array of elements. It works as follows: 1. **Partitioning**: - Select a ""pivot"" element from the array. The choice of pivot can affect the algorithm's performance, but a common approach is to choose the last element in the array. - Rearrange the elements in the array such that elements less than the pivot are moved to its left, and elements greater than the pivot are moved to its right. The pivot itself is now in its correct sorted position. - This partitioning process effectively divides the array into two subarrays: one with elements less than the pivot and one with elements greater than the pivot. 2. **Recursion**: - Recursively apply the quick sort algorithm to the two subarrays created in the partitioning step. This means sorting the subarray of elements less than the pivot and the subarray of elements greater than the pivot. - Continue this process until you have subarrays of size 1 or 0, which are, by definition, sorted. 3. **Combine**: - Since each subarray is now sorted, combining them with the pivot in the correct position results in a fully sorted array. Quick sort is highly efficient, especially for large datasets, because it has an average-case time complexity of O(n log n). However, its worst-case time complexity is O(n^2) if the pivot selection consistently results in unbalanced partitions. To mitigate this, various techniques, such as choosing a median-of-three pivot or using randomized pivot selection, can be employed. The choice of the pivot and the partitioning process are key factors in the algorithm's performance, but when implemented correctly, quick sort is one of the fastest and widely used sorting algorithms.",2, 3681,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quick sort has a pivot point. the element lesser than the pivot element goes to the left side array while those greater than the pivot element goes to the right part of array. it divides the array into smaller parts and sorts it in a way that when the smaller arrays are merged, it is sorted.",1.5, 3682,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it works on the principal of divide and rule,1, 3683,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we find pivot elemnt and place it at the right place by comparing elements lesser than that,1, 3684,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,This sorting technique includes comparing mid values to others ,0, 3685,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Generally last elemenmt is considered as pivot and after comparing with it partitioning is done,0.5, 3686,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort is used to sort the given data by dividing the elements in half and then performing the required the sorting on the data,1, 3687,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. ",2, 3688,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,O(nlogn),0.5, 3689,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quicksort is one of the most efficient sorting algorithms. It works by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked",1.5, 3690,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort works by selecting a pivot element and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. The process is then applied recursively to the sub-arrays.,1.5, 3691,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works by selecting a pivot element and partitioning the array into two subarrays, then recursively sorting these subarrays.",1.5, 3692,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In quick sort we take a pivot element and comparison the array with that pivot element then on swapping element based upon pivot element we got our sorted array.,1, 3693,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3694,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"It finds a pivot element and places it in it's correct place, and this process is reapeated for all the elements.",0.5, 3695,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3696,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we choose and one division then we shift all bigger element before it and smaller after it and so on.,0, 3697,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3698,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,IN QUICK SORTS WE BREAK THE ARRAY IN HALF UNTIL WE REACH THE LAST ELEMNT AND THEN SORT AND RECONSTRUCT THE ARRAY,0.5, 3699,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,WE USE PIVOT OF AN ELEMENT AND HEN SORT FROM THERE,0.5, 3700,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it makes a partition function and applies sorting seprately which makes it the fastest sorting technique,0.5, 3701,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"It works by selecting a pivot element from the array and partitioning the other elements into two sub arrays , according to whether the are less than or greater than the pivot",1.5, 3702,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in this we take one element as a pivot point ,0.5, 3703,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quick sort works by finding a pivot element and then recursively placing it at its right position by comparison with other values, It has a partition and a sort function which it uses to be able to sort the given values. ",1.5, 3704,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,keys are compared and swap with next one if later one is small,0.5, 3705,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it is an unstable sort which divides and sorts by halving the given struct;,0, 3706,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," Breaking an array into smaller ones and swapping the smaller ones, depending on a comparison with the 'pivot' element picked.",1, 3707,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked.",1.5, 3708,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quicksort works on divide and conquor technique. dividing the queue multiple times at each step and then sorting,1.5, 3709,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. ",1.5, 3710,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort is a sorting algorithm that divides an array into smaller subarrays based on a pivot element12345. The pivot element can be chosen in different ways, such as the first element, a random element, or the median element",1, 3711,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is widely used in practice and is often the sorting algorithm of choice due to its speed and efficiency.,1, 3712,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort we take a pivot element and place it in the right posotuion in the array then we do the same for the left and the right of the array,1, 3713,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"in quick sort you have to define a pivot element (which is usually the first element) and then compare the position of the pivot with rest of the elements and once its position is found, replace it with the element at that place",1.5, 3714,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it has a partition element and it sorts the other elements around that element,0.5, 3715,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we use pivot and partitions for the given array to sort the rest of the elements,1.5, 3716,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it is a divide and conquer approach. ,1, 3717,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort is a sorting algorithm in which we find the mid element and then so some operation according to it.,1, 3718,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort workss in o(nlogn ) time complexity,1, 3719,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"breaking an array into smaller ones and swapping the smaller ones, depending on a comparison with the pivot element picked.",1, 3720,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works by taking a pivot element and dividing array into parts acc to pivot element and backtracks the array by compairing elements,1, 3721,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it first partition the median element the merge it,0, 3722,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,by creating partition it places small data in left and big data in right of that element which is selected for partition,0.5, 3723,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,partitions are made in a given array ,0.5, 3724,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",2, 3725,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is a sorting algorithm that works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. The sub-arrays are then recursively sorted. This process is repeated until the entire array is sorted. Quick sort is known for its efficiency and is widely used in practice.,1.5, 3726,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3727,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort takes place by making various buckets.,0, 3728,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," It works by breaking an array into smaller ones and swapping the smaller ones, depending on a comparison with the 'pivot' element picked.",1, 3729,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sorts works on the base of buckets around pivot value and then those bucket arrays are sorted further in recursive manner.,0, 3730,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works by findng pivot element and then swapping it with first element and then recursive checking if element on left is less than pivot and element on right is greater than pivot,1.5, 3731,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort is a sorting technique that ,0, 3732,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort uses the divide and conquer rule by choosing a pivot element and then dividing the array at that element.,1.5, 3733,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3734,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,We break the array into smaller parts and sort the elements with respect to the pivot element.,0, 3735,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort break the array into smaller parts and sort the array based on the selected pivot element.,0, 3736,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,A quick sort places an element at its correct position in each traverse.,0, 3737,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it takes a pivot point and sets the pivot at the accurate position and the elements left to it have lower value and are sorted using same technique using recursion,1.5, 3738,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it basically works on pivot value and its works on swapping value if the value or upper bound is more so it will swapp the value,1, 3739,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3740,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It works on priciple of pivot. Firstly a pivot is slelected and then comparison with respect to pivot does the sorting,1.5, 3741,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"It works by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked.",1, 3742,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is a highly efficient sorting algorithm and is based on partitioning of array of data into smaller arrays. A large array is partitioned into two arrays one of which holds values smaller than the specified value,1.5, 3743,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. For this reason, it is sometimes called partition-exchange sort.",2, 3744,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it works in a sorted array in which the array is divided into buckets and the element to e searched is searched in that patrticular bucket/sub array ,0, 3745,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick Sort is a sorting algorithm that recursively divides an array based on a chosen pivot element.,1, 3746,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it basically takes pivot value and compare,0.5, 3747,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort works on Divide and Conquer Rule. It uses a pivot index and does sorting on the partions.,1, 3748,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort uses h e partition function to be able to sort values.,0.5, 3749,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-array,1, 3750,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it traverse through the array and put each element at its correct place and shifts rest of the array,0.5, 3751,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,a pivot element is chose and the elements less than the pivot element are transfered to the left of the pivot element and the elements greater than the pivot element are moved to the right of the pivot element,2, 3752,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort divides the problem into the smaller sub problem sets and using recursion it can be solved,1, 3753,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort uses a pivot element to partition and recursively sort subarrays.,1, 3754,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,is size decrease with sorting,0, 3755,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3756,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,array is branched out into elements and then compared and put together,0, 3757,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Here you get pivot element and by partition function you place it to its correct position and then with the help of recurion you divide the array in 2 parts and do the same thing again . At last all the element will be sorted,2, 3758,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it choose pivot elemnt and place it at right place and use partition metrhod,1, 3759,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array,1.5, 3760,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick Sort is a divide-and-conquer sorting algorithm that partitions the array and recursively sorts the subarrays. It's efficient for large datasets.,1.5, 3761,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3762,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,QUICK SORTS WORK BY PICKING UP THE PIVOT ELEMENT AND THEN SORTING THE STRUCTURE BY REPLACING THE PIVOT ELEMENT AT THE RIGHT PLACE.,1.5, 3763,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quicksort Algorithm An array is divided into subarrays by selecting a pivot element ,1, 3764,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works by partitioning array using a pivot and swapping then by smaller ones using pivot only. its time complexity is O(logn),2, 3765,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,first we find remainder when divided by 10 to power i where i is the number of round and sort all those remainder with count sort until sorting is not completing,0, 3766,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort partitions the array then recursively partitions smaller arrays then puts them in the right position,1, 3767,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In Quick sort we take a pivot element and then see which element is greater and which element is less than the pivot. We ,mostly use recursion and backtracking to do it . Whereas it can also be done iteratively ",1, 3768,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"it works in a recursive manner in which first a pivot point is sorted, then the array is divided into left and right sub array and with recursion, their pivot is also sorted and their subarrays are sorted",1, 3769,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we find the pivot element and then divide the array and recursively repeat the steps.,2, 3770,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"an element is made the pivot element, the pivot element is placed at its correct position and then Recursion is used",2, 3771,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"in quick sort, we find the pivot element and then divide the array and recursively repeat this step and then sort.",2, 3772,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick work as one element is fixed as pivot element,1.5, 3773,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3774,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3775,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3776,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,time complexity o(nlogn) it picks pivot and gets elemnts less than it left side and greater element in right side,1.5, 3777,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,comparing each element by its next element and swappig them,0, 3778,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort is a In quick sort, it creates two empty arrays to hold elements less than the pivot element and the element greater than the pivot element and then recursively sort the sub-arrays",0, 3779,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3780,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,partitions of a sorted array are made and is done recusively followed by a merger,1.5, 3781,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3782,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort inserts the elements at the position where it belongs, with time complexity of n*log(n). the takes next element from right of the sorted list.",2, 3783,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3784,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,comparing each element by its next element and swapping them.,0, 3785,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works by partitioning data structure further and further,1, 3786,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,works on the partition technique,1, 3787,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"it works on the divide and conquer method, it selects a pivot element and divides the array into subarrays on the basis of that pivot element, all subarrays are sorted and combined at the end",2, 3788,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In quick sort we use pivot point and try to sort in such a way that we get the pivot point and then sort the rest array.,2, 3789,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3790,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we use a pivot elements to do the searching ,1, 3791,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is used to find a pivot and by using that pivot we sort array elements and keep the smaller elements on the left of the pivot and on right we put larger elements,2, 3792,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works by dividing the array in two parts in left and right of pivot that we select and then put the smaller lements in left side and grater elements than pivot in the right part and repeat the same with left and right part till the array gets sorted.,2, 3793,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,chooses a pivot and sorts first left of pivot then right of pivot,1.5, 3794,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it works using a pivot element and replaces it by comparing to all . ,1.5, 3795,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works by finding a pivot element,1, 3796,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort work by selecting pivot element from the given set of data and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot,2, 3797,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"it uses pivot and partitions , divide and conquer rule to sortthe given array",1.5, 3798,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is one of the most efficient sorting algorithms. It works by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked.",2, 3799,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Uses a pivot element, and each left and right of pivot is sorted ,then function is recursively called for each subarray.",1.5, 3800,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot",2, 3801,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3802,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3803,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3804,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3805,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort,we fix a pivot and then the sorting is done according to the comparison made with the pivot of all the other numbers.The numbers are then arranged in increasing order.",2, 3806,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in this we take one element as pivot and bring elements lesser than it on left side of array and greater than it on right side of array,1.5, 3807,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," It works by selecting a 'pivot' element from the array and partitioning it into further 2 sub arrays, according to whether they are less than or greater than the pivot. The sub-arrays are sorted recursively after partitioning.",2, 3808,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,by taking a pivot element and changing positions of the remaining elements,1.5, 3809,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3810,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It works by breaking an array into smaller ones and swapping the smaller ones,0.5, 3811,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works by selecting a pivot element, partitioning the array into two sub-arrays, and then recursively sorting the sub-arrays.",1.5, 3812,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3813,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is one of the most efficient sorting algorithms. It works by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked.",2, 3814,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it has log(n) complexity and chosses a pivot which when placed in right position divides array in 2 parts one contain the elements less than the pivot and the other greater than the pivot it then call the same process recursively ,1.5, 3815,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3816,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3817,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"in quick sort an element is assumed as pivot and a helper function places the pivot at the correct position and sorts the left and right side of the pivot (left: elements less than pivot , right: elements more than pivot) and then recursive call on left and right side.",2, 3818,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quick sort is a recursive sorting technique which has an average time complexity of O(NlogN). It chooses a pivot, puts the pivot in a suitable position and moves all the elements smaller than pivot to the left of pivot and all the elements greater than pivot to the right of pivot",2, 3819,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,By creating a pivot in the given data structure we can separate it into various arrays of lesser and greater values allowing us to sort the data and merge the sorted arrays.,2, 3820,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot",2, 3821,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot",2, 3822,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0.5, 3823,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it uses rescursion to sort ,1.5, 3824,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,provides the problem into the smaller sub problems,1.5, 3825,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort partitions the array and sort them ,2, 3826,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick Sort is a highly efficient, divide-and-conquer, and comparison-based sorting algorithm. It works by selecting a ""pivot"" element from the array and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. The process is then recursively applied to the sub-arrays until the entire array is sorted. ",2, 3827,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we find a pivot point and sort the array by breaking it into many part,2, 3828,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. This means that each iteration works by dividing the input into two parts and then sorting those, before combining them back together.",2, 3829,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays,1.5, 3830,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it uses pivot to sort the data by sepertaion the element,1.5, 3831,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,take a pivot element and elements smaller than that element go in one set and bigger than that go to other set . and this partitioning go over and over until it is sorted,2, 3832,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort breaks the array into two parts with pivot recusrsively sort both arrays,2, 3833,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we create partion i array to sort the structure ,0.5, 3834,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,QUICK SOPRT IS VERY USEFULL BY HELP OF MAKUNG BUCKETS,0.5, 3835,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0.5, 3836,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively. ",2, 3837,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0.5, 3838,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,there is a partions element which seprates the array in two pars and recurcive call is made to sort the array,1.5, 3839,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort is a divide and conquer technique of sorting,2, 3840,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Here we take every element one by one and place it at it's correct sorted position ,0.5, 3841,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0.5, 3842,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works by swapping the adjacent elements and reordering themselves,0.5, 3843,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0.5, 3844,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,a pivot element is choosen and two data structure is divides into two parts and then comapared. quick sort uses divide and conquer rule,2, 3845,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",2, 3846,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",2, 3847,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,first we take a suitable pivot and then divide it in 2 array and then sort that specific part of arrauy and then update the pivot,1.5, 3848,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,by taking key element and divding in sub arrays,1.5, 3849,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot",2, 3850,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. ",2, 3851,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort is a a type in shorting it chocess a midan and divide again and again to arrange the data in a way ,1.5, 3852,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"in quick sort, we take a pivot element and divide the array into two arrays comparing each element with the chosen pivot element.",2, 3853,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0.5, 3854,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it sorts according tro it selkf quickly,1, 3855,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort the main role is the pivot in which we find the element from whose left all elements are smaller than it and on right all elements are bigger than it. then we sort it further. we can also take the pivot as random element,2, 3856,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it sorts the array by dividing it into two halves and sort them after this it merge both the halves,2, 3857,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In quick sort we select a pivot element and shift it so that all elements before it are lesser than it and all elements after it are greater. We then recursively apply quick sort on the right sub array and left sub array of the pivot.,2, 3858,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,partitions are created so the pointer to search the element visits nodes in less time complexity,1, 3859,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,by getting the pivot element and through its principle.,1.5, 3860,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is one of the most efficient sorting algorithms. It works by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the pivot element picked.",2, 3861,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,firstly we find a pivot. then we put the elements greater than pivot to its right and smaller than pivot to its left by swapping.,1, 3862,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it works on the counting sort method,0.5, 3863,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort selects a pivot and partitions the elements into smaller and larger than the pivot and then recursively sorts the sub arrays.,2, 3864,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,We choose a partition and then sort the left and right side of that partition recursively till the whole array is sorted.,1, 3865,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is a sorting algorithm that works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. The sub-arrays are then recursively sorted. This process is repeated until the entire array is sorted. Quick sort is known for its efficiency and is widely used in practice.,2, 3866,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"by partition algorithm, first we choose pivot element and sort either side of it",1.5, 3867,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,We choose a pivot element and then arrange smaller elements on left of it and larger elements on its right side,2, 3868,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0.5, 3869,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3870,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort swaps and sorts the data,1.5, 3871,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,by recursion around a pivot element,1.5, 3872,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it divide the data into two halves and then sort each of them then merge both,2, 3873,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divide and conquer first a pivort is selectedf then put into sorted position than in the other halves again same pivort is selected than put into correct position,1.5, 3874,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3875,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,very fast as compared to other,1.5, 3876,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"breaking an array partition into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the pivot element picked.",1, 3877,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",1.5, 3878,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It uses the divide and conquer logic.,1.5, 3879,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it divides the array into partitions and then starts to compare them.,1, 3880,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works by selectiong a pivot element from the array and partiton the array into two sub arrays wrt pivot element,1.5, 3881,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3882,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3883,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it partioins a data structure recursively and joins the sorted part of the same broken part ,1.5, 3884,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3885,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divide and conquer algorithm,1.5, 3886,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort basically works mainly on partition function and is a recursion based sorting.suppose we are given an array then we have to take a pivot element and make partition function accordingly again again ,1.5, 3887,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,by taking pivot and taking two parts of pivot and then further sorting,1.5, 3888,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"selecting a 'middle' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the middle",2, 3889,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked.",2, 3890,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3891,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in this we find the pivot element in the array and then push all the values greater than the pivot element on the right side and smaller elements on the left side,1.5, 3892,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort a pivot element is selected and then array is divided in two parts one containing elements less and other containing greater in this way pivot element will get its correct position in sorted array,1, 3893,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick an element with uniquee property is made as a pivot and all other elements are arranged on the left and right side of the pivot in ascending o descending order,1, 3894,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we select an element called pivot and then divide the array in 2 kinds one smaller than the pivot and one greater than the pivot ,1, 3895,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Pivot Selection: Quick sort selects a pivot element from the array. The choice of pivot can vary, but a common approach is to pick the last element in the array. Partitioning: The array is partitioned into two subarrays: elements less than the pivot and elements greater than the pivot. The pivot is placed in its final sorted position. This is done by moving elements around so that all elements smaller than the pivot are on its left, and all elements greater are on its right. Recursion: Quick sort is then applied recursively to the two subarrays, one on each side of the pivot, until the entire array is sorted. Combination: As the subarrays are sorted, they are combined to form the fully sorted array.",1.5, 3896,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works on partition ,1.5, 3897,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It works on recursion,1.5, 3898,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"By partitition algorithm,first we choose pivot element and sorting eiher side of it .",1.5, 3899,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3900,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3901,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"taking a pointer to the head, last or mid node as pivot and then dividing the array into 3 parts, less than pivot, equal to pivot and greater than pivot.",1.5, 3902,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"in quick sort,we find the frequency of every element present in the list and then we sort it according to the frequency and the index of the corresponding element in the frequency list or array.",1.5, 3903,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,basically it divides array in a specific order and thenm continous follow it and then arrange it,2, 3904,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"by creating a pivot against which elements are sorted, into greater and lower arrays",2, 3905,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"It picks a pivot element and breaks the array into smaller parts, one containing elements less than the pivot and other containing greater than pivot.",1.5, 3906,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it uses divide and conquer algorithm by selecting a pivot element from the array,2, 3907,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort if the method where a pivot point if taken and through recursion the different parts of the divided parts keeps on takig place.,1.5, 3908,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it uses partition method for sorting .,2, 3909,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,SORTS DATA STRUCTURES ,1.5, 3910,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort splits the data structure into smaller segments and sorts the smaller segments and join the smaller segments again to form the original sorted list ,1.5, 3911,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,IT WORKS ON THE PARTITIONAL ALGORITHM.,2, 3912,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort uses pivot which is a number and breaks down the array into half according to the pivot and sorts them then merges them together.,1.5, 3913,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"divide and conquer , finding correct position of the elments and placing it.",1.5, 3914,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is recursive algorithm which partion the array according to pivot in such a way so tha smaller elements are on the left of pivot and greater are of right of it.,2, 3915,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3916,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3917,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort uses pivot and partiton it around that less on left of pivot and more on right of pivot. ,1.5, 3918,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3919,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort works by recursively placing the elements one by one to their correct position by using partitions.,2, 3920,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3921,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it works on recursion ,1.5, 3922,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3923,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"first we choose a random value and place it in its correct order, then we arrange all other elements greater than it at its right side and lower than it at its left side. repeat for every element.",2, 3924,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works on the basis of fsorting the array acc to the partiton index,1, 3925,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"It works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. ",2, 3926,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Choose a pivot element(first, last, middle or random) . Insert its at its right place and then call quicksort for left and right subpart of the array.",1, 3927,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",1, 3928,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,qui,0, 3929,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"The key process in quickSort is a partition(). The target of partitions is to place the pivot (any element can be chosen to be a pivot) at its correct position in the sorted array and put all smaller elements to the left of the pivot, and all greater elements to the right of the pivot.",1.5, 3930,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It works on the concept of pivot.,1.5, 3931,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3932,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3933,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively.",0.5, 3934,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It takes a pivot element and makes partitions accordingly. then quick sort is recursively applied on sub-arrays (for instance) until ,1.5, 3935,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it uses the divide and conquer logic to sort the item by dividing them in a recursive way,1.5, 3936,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it works on divide and conquer algorithm,0.5, 3937,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays,2, 3938,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort take out an element as pivot and place element lesser than it on its left and greater than it on the right.and we again change the pivot,1.5, 3939,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divide the array by partation the compare to sort,1.5, 3940,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divide and conquer finding correct position of the element and placing,0.5, 3941,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3942,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it divides data into 3 parts recursively and sort the data,0.5, 3943,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,IN THIS WE PUT ONE ELEMENT AT ITS RIGHT POS WHER IN LEFT HAND SIDE ALL ELEMNETS ARE SAMALL AND OPP IN RIGHT SIDE,1.5, 3944,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort selects an element as pivot and compares the rest of the data structure with it and then the sorted elements are placed orderly.,0.5, 3945,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"It select a pivot element, places the smaller elements before the pivot, greater elements after the pivot, this places the current pivot to its right place.this function is called recursively.",1.5, 3946,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,counting sort,1.5, 3947,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divide and conquer ; Finding correct position and placing it ,1.5, 3948,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort basicailly works mainly on partition function and is a recursion based sorting suppose we are given an array then take pivot element and make partition using that piviot ad so on,2, 3949,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it uses a pivot and half the array into 2 and thed do it further then sort it and combines again,1.5, 3950,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it ,1, 3951,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quicksort is a sorting algorithm based on the divide and conquer approach where an array is divided into subarrays by selecting a pivot element.,1, 3952,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3953,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it takes a pivot element and makes partitions and it is recursively applied.,1, 3954,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it devides data into 3 parts recursively and sort the data,2, 3955,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,using divide and conquer concept time complexity o(logn),1, 3956,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3957,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,partation ,1, 3958,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,safd,1, 3959,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3960,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,a partition is formed ; key is compared with that partition of the array being divided into half continuously,1, 3961,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we find a index by partition function and then passed right partition array and left partition array and then sort it .,1.5, 3962,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3963,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"we take a random value compare all the values with it and break it in subparts like s1{all the smaller values} , s2{the random value} and s3{the larger value} and it will go on till the values disintegrate completly then it will compare and arraange the data in sorted order",1.5, 3964,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,1.5, 3965,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,its works based on partitioning it finds the root and insert its left and right respectively for every subtree ,1, 3966,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"it involves the making partitions to ,such that the larger on left and smaller elements are on the left",1, 3967,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3968,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works on the partition algorithm and sort the data with it.,1.5, 3969,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it sorts elements taking new element,1.5, 3970,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it works on the principle of partition of the array and the sorting the paritioned array by placing the key in its correct position ,1, 3971,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,by rapidly dividing the array and finding the pivot element and then backtracking recursion to put every element in its correct place,1, 3972,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3973,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we find a index by partition function and then passed both its right and left partition. then,1.5, 3974,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3975,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,partioning of array using pivot element and then combining the array,2, 3976,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,by dividing the input in two parts and sorting those before combining them back ,1.5, 3977,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"it uses partition method, creates a pivot and create a partition wrt to pivot by arranging elements less than pivot on the left and reaminging on the right",2, 3978,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 3979,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"array into smaller ones and swapping the smaller ones, depending on a comparison with the 'pivot' element picked.",2, 3980,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,by creating a pivot element and then dividing arrray into 2 sub arrays then futher ,1.5, 3981,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot",1, 3982,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it creates a pivot and the place it to the right position then accordingly sets the other element i.e. to the left all small and right all greater,1.5, 3983,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we make a particular elemet as pivot with all smallar and greater element than that pivot on its eiter sides..then we start comparing first and last element with each other and perform normal sorting,1.5, 3984,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort first it searches for the largest element then it put the largest element at the last place . similarly it put the next height element before the last place.,1, 3985,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a sorting algorithm based on the divide and conquer approach where An array is divided into subarrays by selecting a pivot element (element selected from the array). While dividing the array, the pivot element should be positioned in such a way that elements less than pivot are kept on the left side and elements greater than pivot are on the right side of the pivot. The left and right subarrays are also divided using the same approach. This process continues until each subarray contains a single element. At this point, elements are already sorted. Finally, elements are combined to form a sorted array",1, 3986,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,1, 3987,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,works by dividing the input into 2 parts and sorting those before combining them back.,1.5, 3988,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,element is placed where it belongs and seprated in 2 parts,1.5, 3989,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it has pivot element and we compare it correspondingly then sort,1, 3990,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we use a partition function to make a partition element and then compare the elements with respect to it and then we recusrsively call quick sort function for both the sides of the partition.,1, 3991,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divde and then contour take a pvt and then acc. to the pvt we divide in 2 parts in ascending order and hence continuing this gives a sorted array or list.,0.5, 3992,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works on divide and conquer algorithm,1, 3993,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it breaks array into smaller parts and swapping smaller parts on the comparision with the pivot element,1, 3994,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,BY DIVIDIMG INPUT IN TWO PARTS AND SORTING THOSE BRFORE RE COMBINING ,1.5, 3995,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element p",1.5, 3996,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works by using a pivot and then reurssilvely calling itself in divided elemts,1, 3997,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,7. Quick sort works by selecting a pivot and partitioning elements into smaller and larger subsets.,1, 3998,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divides a large data array into smaller ones,0.5, 3999,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we use partion of element which are present in linear dataand pick the pivot element,0.5, 4000,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4001,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we divide the array int osmaller and then compare smaller value with pivot element,1, 4002,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we recursively divide the given array or list into two parts by taking a PIVOT element . Left part smaller than pivot and right part greater than pivot,1, 4003,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,QuickSort is a divide-and-conquer sorting algorithm that works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively. This process continues until the entire array is sorted.,1, 4004,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort is a sorting algorithm that works by selecting a pivot element and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then recursively sorted. Here is the step-by-step process of how quick sort works: Select a pivot element from the array. There are various ways to choose the pivot, but the most common approach is to select the last element in the array. Partition the array into two sub-arrays: elements less than or equal to the pivot and elements greater than the pivot. This is done by iterating through the array and swapping elements to ensure the elements less than or equal to the pivot are on the left of the pivot, and those greater than the pivot are on the right. At the end of this process, the pivot will be in its final sorted position. Recursively apply the above steps to the sub-arrays on the left and right of the pivot until the entire array is sorted. At each recursive step, choose a new pivot element and partition the sub-arrays.",1.5, 4005,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4006,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick Sort is a sorting algorithm that works by selecting a ""pivot"" element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. This process is then applied recursively to the sub-arrays. Quick Sort has an average time complexity of O(n log n).",1, 4007,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"it works with the help of using a pivot. each element is compared with and accordingly divided into 2 subarrays, one containing elements greater than pivot and other lesser. it happens till each element is sorted and at the the subarrays are combined.",2, 4008,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort takes a pivot element from the array which compares the whole array into two parts.,1, 4009,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,using array and createing array of 0 to 9 and storing value and comparing them,1, 4010,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it works as we first partition and then recursively sort sub arrays,1.5, 4011,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we find a pivot point in the array then shift the elements left or right according to its value,1, 4012,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," It works by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked",1.5, 4013,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4014,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is one of the most efficient sorting algorithms. It works by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked",1, 4015,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,pivot element is created and used for each trial,1, 4016,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",1.5, 4017,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"The logic is simple, we start from the leftmost element and keep track of the index of smaller (or equal) elements as i. While traversing, if we find a smaller element, we swap the current element with arr[i]. Otherwise, we ignore the current element.",1, 4018,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it works on the bases of pivot technique as the last or first node is selected as pivot and it divided the data structure into two parts ,1, 4019,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,fastest method of sorting .it takes almost nlog(n) time complexcity.,0.5, 4020,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays.,1, 4021,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort picks an element as pivot, and then it partitions the given array around the picked pivot element. In quick sort, a large array is divided into two arrays in which one holds values that are smaller than the specified value (Pivot), and another array holds the values that are greater than the pivot.",2, 4022,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort works by breaking an array into smaller parts and swapping the smaller ones, depending on a comparison with the 'pivot' element picked randomly.",2, 4023,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is one of the most efficient sorting algorithms. It works by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked.",2, 4024,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort qorks on recusrsion,0.5, 4025,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,a pivot is chosen and two subarrays are formed to be compared to pivot,1, 4026,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. ",1, 4027,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"in quick sort elements selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",1.5, 4028,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4029,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Dividing a linear data structure around a pivot point and storing the two partitions in two different array and repeating the same by recursion till array is sorted,1.5, 4030,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," It works by breaking an array into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked.",1.5, 4031,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. This means that each iteration works by dividing the input into two parts and then sorting those, before combining them back together",1, 4032,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," A vast array is divided into two arrays, one containing values smaller than the provided value, say pivot, on which the partition is based. The other contains values greater than the pivot value.",1.5, 4033,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,this works by parting the data into 2 and again and again,0.5, 4034,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4035,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it ,0, 4036,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4037,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick Sort algorithm follows the divide and conquer approach. Divide and conquer is a technique of breaking down the algorithms into subproblems, then solving the subproblems, and combining the results back together to solve the original problem.",1.5, 4038,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divide-and-conquer technique.,0.5, 4039,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4040,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quicksort is a highly efficient sorting technique that divides a large data array into smaller ones,1, 4041,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,PIVOT ELEMENT IS TAKEN AND ACCORDING TO IT THE VALUES ARE INSERTED ON RIGHTN IF GREATER THAN PIVOT AND OIN LEFT IF LESS THAN PIVOT,1.5, 4042,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"it use partion concept , it divides the array into different forms and the sorts them and then joins them back",1, 4043,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,first it ,0, 4044,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works on divide and conquer approach,1, 4045,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divides a large data array into smaller ones picks an element as pivot and partitions the array,1.5, 4046,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort is a sorting algorithm that uses a divide-and-conquer approach. It selects a pivot, partitions the data, and recursively sorts the subarrays",1.5, 4047,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is one of the most efficient sorting algorithms. It works by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked.",1.5, 4048,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divide and conquer,1, 4049,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,IT USE PARTITION CONCEPT,0.5, 4050,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,on the basis of partition principle,0.5, 4051,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort partitions the array then recursively,0.5, 4052,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort partition the array and then recursively,0.5, 4053,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",1, 4054,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Main differences: Selection sort scans the unsorted part to find the minimum element, while insertion sort scans the sorted part to find the correct position to place the element. Selection sort requires fewer swaps than insertion sort, but more comparisons.",0, 4055,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort divides the input stream and then implements sorting,0.5, 4056,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4057,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it divides large data rray into smaller ones and take the pivot on which the partition is based,1, 4058,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick Sort works by selecting a pivot element, partitioning the array into two subarrays, and recursively sorting those subarrays.",1.5, 4059,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,by creating pertion and put small in left and greater element in right,1, 4060,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4061,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,first we make a pivot and ,0, 4062,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. ",1.5, 4063,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort divides large data into smaller ones,0.5, 4064,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. For this reason, it is sometimes called partition-exchange sort.[4] The sub-arrays are then sorted recursively. This can be done in-place, requiring small additional amounts of memory to perform the sorting.",2, 4065,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort selects a pivot, partitions the array into elements less and greater than the pivot, recursively sorts the sub-arrays, and combines them to sort the entire array. It has an average time complexity of O(n log n).",1.5, 4066,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works using a pivot element,0.5, 4067,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked.",1.5, 4068,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in this partition is done around an element .elemnts in the partition are arranged by dividing into smaller partition then joining the whole.,1.5, 4069,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it works by selecting a pivot element from the array and partitioning the elements into two subarrays ,1.5, 4070,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,on the basis of partition principle,1, 4071,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,placing every elemnt at its right position,0, 4072,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,a pivot is chose and two sub arrays are formed which are compared to the pivot.,0, 4073,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it sorts the data in nlofn complexity,0.5, 4074,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,a pivot element is decided and then elements are inserted in left if lesser than pivot and in right if greater than pivot.,1, 4075,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it makes partition and starts searching,0.5, 4076,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"t works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively. Quicksort is one of the most efficient sorting algorithms24. It makes n log n comparisons in average case for sorting of an array of n elements4",2, 4077,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"in quick sort, we find the pivot element and divide the data into two sub arrays,one which is less than the pivot and other which is greater than the pivot.",2, 4078,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4079,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works by selecting a pivot element and partitioning the other elements into two sub arrays, then recursively sorting those sub arrays.",1, 4080,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in o(nlogn) we take the pivot lets says last el;ement and compare it with every node and partion the array into two halves according to it,1, 4081,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it works ,0, 4082,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4083,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"t works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot",2, 4084,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort divides the array into sub parts along the pivot and sorts them (Divide And Conquer)),1.5, 4085,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4086,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works by using a helper function called partition which selects a pivot and then makes sub arrays for elements smaller and larger then recursively sorts it,1, 4087,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4088,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4089,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it select pivot element place the smaller of it on left and left right ,0.5, 4090,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"QuickSort is a divide-and-conquer algorithm that sorts an array by selecting a pivot element and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. ",1.5, 4091,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divudes in median and end,0, 4092,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4093,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we make a partition around an element and compare the rest of the array with that element,0.5, 4094,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick dort wporks by selctiing a pivot index and arranging elemnet left and right,0.5, 4095,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,this sort is done by partition in whiuch we take a pivot and sort its value less than and greater than separately,0.5, 4096,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quicksort the given array of elements are first split into 3 parts with ,0, 4097,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4098,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick selects a pivot and sorts data acc to that,0, 4099,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort sorts the given elements in proper ascending order.,0, 4100,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,on a pivot dividing array into sub arrays,0.5, 4101,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"it works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",1, 4102,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4103,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4104,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. For this reason, it is sometimes called partition-exchange sort.",2, 4105,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4106,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,With time comlexity of nlogn,0, 4107,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it select a pivot element and divides the array into 2 subarrays according to the element pivoted,0, 4108,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm12345. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively. Quicksort is one of the most efficient sorting algorithms24. It makes n log n comparisons in average case for sorting of an array of n elements",2, 4109,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,sort eith o(logn),0.5, 4110,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,using divide and conquer approach,0.5, 4111,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4112,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"we take an elemnt as pivot, the elements lesser than pivot are placed on its left, and greater elements at right; then trhey are individually sorted and merged at the end;",1, 4113,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"take an element as pivot, elements less than pivot will be stored in left of the pivot and larger ones to the right of pivot ",1, 4114,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4115,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,by using the pivot it divides the array int two from start to mid and another mid+1 to end,1, 4116,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,the array is divided wrt pivot and sorting ,0.5, 4117,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4118,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort choses a pivot element, and and compares it with element. If it is greater than pivot, move to right subarray, otherwise left subarray. Then keeps sorting ",1, 4119,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it is the fastest sort that traverses,1, 4120,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,partiotn of array,1, 4121,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4122,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It consists of partition of the array and a pivot element is used for comparing the elements,1.5, 4123,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick Sort works by selecting a ""pivot"" element, partitioning the other elements into two sub-arrays (those less than the pivot and those greater), and then recursively sorting these sub-arrays. It is a divide-and-conquer sorting algorithm.",2, 4124,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4125,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. ",2, 4126,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"in quick sort (based on duivivde and conquer) , a partition is made based on a pivotElement. Then this pivot Element is placed at its correct position by determing number of small elements . Then thriough a recursive call the two arrays from index =0 to index=pivotIndex-1 and index=pivotIndex to end.",2, 4127,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4128,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,partiition element,1, 4129,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,by dividing pivot elemnt,1, 4130,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4131,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,QuickSort is a sorting algorithm based on the Divide and Conquer algorithm that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array.,2, 4132,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort work work on the bases of divide and conqure method,1, 4133,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4134,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,QuickSort picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array.,2, 4135,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It works by breaking an array into smaller ones and swapping the smaller ones ,2, 4136,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"t works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot",2, 4137,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",2, 4138,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4139,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,0,0, 4140,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivo",2, 4141,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4142,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4143,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in it we first select the pivot element in array or linked list then place it in its correct sorting position in array and then swap the elements of its right and left side according to their increasing value ,2, 4144,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick Sort is a divide-and-conquer algorithm like the Merge Sort. But unlike Merge sort, this algorithm does not use any extra array for sorting(though it uses an auxiliary stack space). Quick sort is slightly better than Merge sort. This algorithm is basically a repetition of two simple steps that are the following: Pick a pivot and place it in its correct place in the sorted array. Shift smaller elements(i.e. Smaller than the pivot) on the left of the pivot and larger ones to the right.",2, 4145,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,QuickSort is a sorting algorithm based on the Divide and Conquer algorithm that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array.,2, 4146,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4147,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4148,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"it works by selecting a pivot element and comparing the data with the pivot ], and hence sorting it",2, 4149,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4150,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,VIA DIVIDE AND CONQUER ALGORITHM,2, 4151,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,by taking pivot element an and arranging rest of the elements according to it ,2, 4152,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,ONE ELEMENT IS CHOSEN RANDOMLY AND ACCORDING TO THAT ELEMENT OTHER ELEMENTS ARE PLACED TO ITS RIGHT AND LEFT AFTER COMPARISON,2, 4153,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 4154,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot",2, 4155,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divide and conquer(using pivot and making leftpivot),1.5, 4156,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in this a pivot element is choosen and left and right are seprated then sorted,2, 4157,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,ebWorking of Quicksort Algorithm. 1. Select the Pivot Element. There are different variations of quicksor,2, 4158,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"pivot , again calling array by diving by pivot",2, 4159,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works on the principle of divide and conquor and also usese time complexiy of o(nlog(n)),1, 4160,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,using pivot ,2, 4161,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,, 4162,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a divide-and-conquer algorithm. It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot.",2, 4163,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort did it by partioning,1, 4164,How does quick sort work?,Quick sort uses the divide and conquer approach. It divides the list into smaller 'partitions' using a 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divide an d concour,1, 4165,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","searcghing for an element in the tree (inorder, postorder and preorder)",2, 4166,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is the process of visiting and processing all the nodes in a tree data structure, ensuring that every node is visited exactly once, following a specific order or pattern.",1.5, 4167,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","inorder,preorder, postorder and levelorder",0.5, 4168,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is the process of visiting every node in a tree data structure in a specific order. Common traversal methods include in-order, pre-order, and post-order traversals.",1, 4169,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",we visit and store every nodes to the tree,1.5, 4170,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",a process in computer science where each node in a tree data structure is visited exactly once.,0.5, 4171,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal means visiting every node of a tree one by one,1, 4172,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal refers to visiting all the nodes in the tree. There are multiple ways in which this can be done.,0.5, 4173,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it is reaching to the given node by travelling from the root node,2, 4174,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is the way of going to every node of the tree.,1, 4175,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Traversing a tree means visiting every node in the tree. You might, for instance, want to add all the values in the tree or find the largest one. For all these operations, you will need to visit each node of the tree.",1.5, 4176,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree Traversal is a way to visit every node in the tree in a particular fashion.,0.5, 4177,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","preorder, postorder and inorder",1, 4178,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal refers to process moving through elements of a tree that is implemented using any data structure,0.5, 4179,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",in which every node of tree is traverse is called tree traversal,2, 4180,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Accesing each element of a tree is called traversal. Generally for two dimensional trees (graphs, binary trees etc) there are two types: - 1)Depth First Search, 2) Breadth First search",1.5, 4181,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is the process of visiting and processing all the nodes in a tree data structure, following a specific order or pattern. Common traversal methods include in-order, pre-order, and post-order, each determining the sequence in which nodes are visited. Tree traversal is fundamental for various tree-based algorithms and data processing tasks.",1, 4182,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",It is a process of visiting each node of a tree data structure,2, 4183,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing the tree or ninary tree through recuriosn or iterrative,0.5, 4184,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","the traversal which is used to traverse the elements or nodes of a tree,preorder,postorder,inorder etc.",1, 4185,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Traversing through the nodes of a tree is known as tree traversal.,1.5, 4186,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal, also known as tree search, is a process of visiting each node of a tree data structure. During tree traversal, you visit each node of a tree exactly once and perform an operation on the nodes like checking the node data (search) or updating the node",0.5, 4187,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is a process of visiting each node of a tree data structure.,2, 4188,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Traversal Is Just to travel each node. In tree's we have differ type of travesal that means diffier type of technique to rich each node, Basically Traversal results all node in differ differ way",0.5, 4189,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","it means going through each element of a tree. there are many traversals like levelorder,preorder,inorder,postorder",2, 4190,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4191,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4192,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",travelling nodes of a tree printing their values or for any other use there are many types like pre order post order inorder zig zag vertical etc.,0.5, 4193,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is travelling each element in tree until the leaf node is reached,1.5, 4194,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal refers to visiting all the nodes of a tree data structure in a specific order.,2, 4195,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is when we traverse in a tress through the root towards its left child and right child till we meet leaf nodes,0.5, 4196,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",is a process in which we travel each and every node in a tree exactly once,1, 4197,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing every element of the the tree either by dfs or bfs,1.5, 4198,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal refers to visiting the nodes of a tree in a step by step manner. there are various traversals such as lvl order, inorder, preorder, postorder etc.",0.5, 4199,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is going to each and every element of a tree to perform various operations like searching, insertion, deletion, etc, until every node has been reached once.",2, 4200,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is displaying the nodes of tree in the form of array. there are three types of traversals preorder(dlr),inorder(ldr),postorder(lrd)",0.5, 4201,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Iterating over each element of the tree, is known as tree traversal. Tree traversal can be level order, preorder, postorder, inorder, etc.",2, 4202,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","The process of traversing through each node of the tree in a given order, ie, inorder, preorder, postorder, levelorder etc. is called tree traversal.",1, 4203,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",displaying the elements of the tree in a particular order,1.5, 4204,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",TREE TRAVERSAL IS A WAY OF VISITING EACH AND EVERY NODE PRESNT IN THE TREE ,0.5, 4205,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,2, 4206,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,1, 4207,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal means to move in tree through root node into left and right,1.5, 4208,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree transversal means transvring on each node of tree as per the input, it can be preorder, postorder,levelorder,inorder",0.5, 4209,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is meant by a technique in which we get to acces or pass through each and every node of the tree in a particular fixed order or patten. eg - preorder traversal , inorder , postorder , level-order , zig-zag. etc",2, 4210,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversals are algorithms to print the values of nodes present in a tree in different manners by traversing through the tree.,1.5, 4211,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","In tree traversal we go through all the nodes in a tree in some particular order, like preorder, inorder, postorder etc.",1, 4212,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is a fundamental concept in computer science and data structures that involves visiting and processing all the nodes (or elements) of a tree data structure in a systematic order. Trees are hierarchical data structures composed of nodes connected by edges, with one node being designated as the root.",2, 4213,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",process of going through each node in the tree atleast once.,0.5, 4214,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is the process of systematically visiting each node in a tree data structure, following a defined order, to perform operations or access the data stored in the nodes.",1, 4215,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing each node present in tree,0.5, 4216,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Visiting the nodes of the tree atleast once.,2, 4217,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",printing the elemtns in tree or moving to the elements ,1, 4218,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",When we visit each node of a tree data structure it's called tree traversal,1.5, 4219,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversal in a tree having child nodes such that we can print all the elements of the tree. type of traversals are inorder , preorder, postorder and levelorder.",2, 4220,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal means getting to each node ,1, 4221,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is the act of going to each element of the tree following a partiular pattern. some types of traverals are inorder, preorder, postorder etc.",1, 4222,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traverse all node in a way,1, 4223,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",in tree traversal first we fillthe root then according to the traversal method we travel through the tree,1, 4224,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","in tree traversal a root node is there which has childs, which are linked with other elements",1, 4225,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","a tree traversal is a method which can be used to define a tree in a single linear form. there are 4 types of tree traversals. preorder, postorder,inorder,level order.",1, 4226,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to the process of visiting (accessing) each node in a tree data structure, systematically. Common traversal methods include in-order, pre-order, and post-order traversals.",1, 4227,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal means arranging the nodes of the tree in the particular given order, such as inorder traversal, pre order traversal or post order traversal.",2, 4228,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4229,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is a fundamental operation in computer science and is used to visit and process all the nodes or elements of a tree data structure.,2, 4230,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to the process of visiting and examining each node in a tree data structure, typically to access or manipulate the data within the tree. There are different methods for tree traversal, including in-order, pre-order, and post-order traversal, which determine the order in which nodes are visited.",2, 4231,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",going throught each and everysingle node ,2, 4232,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal refers to travelling to all the nodes of the tree,1, 4233,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is a method of going to every node of the tree or every lchild and rchild of the root.,1, 4234,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",ITRATING A TREE IN A LINER ORDER LIKE PREORDER TRAVERSAL POSTORDER AND INORDER TRAVERSAL,1, 4235,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","The way in which we can traverse a tree that the order according to which we traverse that is LDR, DLR or LRD",1, 4236,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to the process of visiting (or traversing) all the nodes in a tree data structure in a systematic way. It involves examining each node in the tree exactly once, following a specific order, to perform some operation or gather information about the nodes.",1, 4237,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is a way of moving around each node of the tree ,1, 4238,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing through a tree means visiting each of its children.,1, 4239,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","The traversal trace is a list of each visited node. No one sequentialisation according to pre-, in- or post-order describes the underlying tree uniquely",1, 4240,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing every node of a tree one by one and moving to its child,1, 4241,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it is a way in which we can access the data of the tree in includes inorder presessor and postorder successor,1, 4242,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal", tree traversal is a form of graph traversal and the process of visiting element in a tree . Such traversals are classified by the order in which the nodes are visited,1, 4243,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal (also known as tree search and walking the tree) is a form of graph traversal and refers to the process of visiting (e.g. retrieving, updating, or deleting) each node in a tree data structure, exactly once. ",1, 4244,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","it is reaching out to each node of a tree following a certain pattern such as inorder , postorder , levelorder , preorder",1, 4245,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing through tree right and left childs,1, 4246,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","visiting every node of a tree atleast once. types are:- preorder, inorder , postorder , levelorder",1, 4247,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversing through all nodes of a tree in either pre order, post order or in-order or level-order",1, 4248,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing through every node in tree ,1, 4249,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",to go through each node once,1, 4250,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is print first node to leaf node one by one traverse,1, 4251,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing a tree in order to check a element exists in the given tree or not.,1, 4252,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is traversering from top to bottom or length wise in a tree,1, 4253,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it is the way in which we can access the data of the tree it includes inorder preorder and postorder,1, 4254,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","it is a method of traversing the tree ie, the way of going through each and every element of a tree",1, 4255,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversal in tree where we can move to each nodes,1, 4256,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing a node or root ina ttree,1, 4257,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",moving through a tree data structure inorder preorder postorder or levelorder,1, 4258,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing all the nodes in a tree in a particular order is called tree traversal,1, 4259,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,1, 4260,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing the nodes to get the values inserted at that place.,1, 4261,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",going through every node in a tree.,1, 4262,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is the process of visiting and inspecting all the nodes of a tree data structure in a systematic way, which can be done in various orders like in-order, pre-order, and post-order, to perform specific operations on the nodes or to extract data from the tree.",2, 4263,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Traversing each node of tree for printing. It is level order, inorder, preorder, postorder.",2, 4264,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",We travel the tree starting from root node and we go node to node till we get out desired node.,1, 4265,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Traversal is a process to visit all the nodes of a tree and may print their values too. Because, all nodes are connected via edges (links)",1.5, 4266,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","it is the process of moving to every element of the tree through different process such as preorder, postorder,inorder,morris traversal etc",1, 4267,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4268,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","In Tree trevarsal, The tree is traversed using algorithm like inorder, preorder, postorder",1.5, 4269,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4270,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to the process of visiting (accessing) each node in a tree data structure, systematically. Common traversal methods include in-order, pre-order, and post-order traversals.",1, 4271,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each node of the tree,1, 4272,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is simply moving along the nodes of the tree in various patterns. Eg: Preorder, Post order , Levelorder , Inorder.",1.5, 4273,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing every element or node of tree is called tree traversal.,1, 4274,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is a way to visit and process all nodes in a tree structure. Common methods include inorder, preorder, and postorder traversals for binary trees.",1.5, 4275,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to the process of visiting and accessing all the nodes (elements) of a tree data structure in a systematic order. Trees are hierarchical structures composed of nodes, where each node may have child nodes. Traversal is a fundamental operation for analyzing, searching, or processing data stored in trees. There are two common methods for tree traversal: 1. **Depth-First Traversal**: - In-depth-first traversal, you start at the root node and explore as far as possible along each branch before backtracking. - Three common depth-first traversal methods are: - **In-Order**: Visit the left subtree, then the root node, and finally the right subtree. In binary search trees, this results in nodes being visited in ascending order. - **Pre-Order**: Visit the root node, then the left subtree, and finally the right subtree. - **Post-Order**: Visit the left subtree, then the right subtree, and finally the root node. - Depth-first traversal is typically implemented using recursion. 2. **Breadth-First Traversal**: - In breadth-first traversal, you start at the root node and visit all the nodes at the current level before moving on to the next level. - It uses a queue data structure to keep track of nodes at each level, ensuring that nodes are visited in order from left to right at each level. Tree traversal is used for a wide range of applications, including searching for specific nodes, generating sorted lists of tree elements, and performing various tree-based algorithms like finding the height of a tree or checking if a tree is balanced. The choice of traversal method depends on the specific requirements of the task.",2, 4276,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each node of a tree is known as tree traversal,1, 4277,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal means printing the data of each node in a particular pattern.,1, 4278,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is the process of traversing the tree usually it done using recursion,1, 4279,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4280,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",In tree traversal we go through left and right childs seperately bu recursively calling them and when both childs are null we return null,1.5, 4281,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal are method used to traverse through a given tree which helps in further performing operation on the given data such as insertion ,1, 4282,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","refers to the process of visiting each node in a tree data structure, exactly once.",1, 4283,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Pre,Post,IN Order and level order traversal",1.5, 4284,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visting each node in a tree,1, 4285,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Quick sort selects a pivot, partitions the array into elements smaller and larger than the pivot, then recursively sorts the sub-arrays.",0, 4286,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to the process of visiting all the nodes in a tree data structure in a specific order, such as in-order, pre-order, or post-order.",1.5, 4287,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is the process in which we visit each and every node at least once.,1, 4288,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4289,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",accessing each element of the tree in a certain manner.,1, 4290,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it means ggoing through each and every node in the tree t give u the output of the tree,1.5, 4291,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is to traverse a tree according to the traversal process and match the data accordingly,1, 4292,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Travelling through various nodes of the trees with the help of pointers.types: inorder,postorder,level order, preorder.",1.5, 4293,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",TREE TRAVERSAL ARE OF 4 TYPES PRE POST IN LEVEL ORDER AND IN TRAVERSAL THE WAY TO THESE WAY WE CAN PRINT ALL NODES OF A TREE,2, 4294,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",TREE TRAVERSAL MEANS GOING FROM ROOT NODE TO LEAF NODE,1, 4295,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","the method of accesing each element of a tree is called tree traversal example -:preorrder,postorder,inorder,levelorder",1.5, 4296,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal refers to the process of visiting each node in a tree data structure exactly once ,1.5, 4297,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each node of the tree,1, 4298,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is a type of ordering followed to visit every node in a tree. It is of several types like preorder, postorder, level order, inorder and many more such as morris traversal and vertical traversal.",1.5, 4299,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",ALL NODES VISITED ONCE,1, 4300,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing means to gather input of the tree in an efficient manner;,1.5, 4301,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is a process of visiting each node of a tree data structure.,1, 4302,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is a process of visiting each node of a tree data structure.,1, 4303,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each node in a tree can be done in various ways including preorder postorder inorder and levelorder,1.5, 4304,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","it means going to each and every node by a path .eg: inorder,postorder,preorder,levelorder",1, 4305,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",A Tree Data Structure can be traversed in following ways: Depth First Search or DFS Inorder Traversal Preorder Traversal Postorder Traversal Level Order Traversal or Breadth First Search or BFS Boundary Traversal Diagonal Traversal,2, 4306,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is a fundamental operation when working with tree-like data structures such as binary trees, binary search trees, and various forms of graphs",0.5, 4307,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",accessing each element of the tree is tree traversal,1, 4308,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","this means traversing the elements of the tree in the following manner: post order, pre order or level order.",1, 4309,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","given root, how can we access the elements of the tree",0.5, 4310,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Traversal of a tree is searching and printing the elements present in the tree.,0.5, 4311,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",reaching each node of a tree exactly once.,1, 4312,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree Traversals are of two types:-1)Breadth first search=Level order traversal.2)dDepth first search=>Preorder,Inorder,PostOrder traversals.",2, 4313,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","inorder,preorder,postorder are tre traversal",1.5, 4314,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is a form of graph traversal and refers to the process of visiting each node in a tree data structure,exactly one.",1, 4315,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is displaying tree node data in sequential manner according to inorder/levelorder/preorder/postorder,1.5, 4316,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is done using post,pre, in order.",1, 4317,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",we can traverse through each node in tree and get properties of it,0.5, 4318,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","preorder,postorder,inorder,level order",1, 4319,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is a form of graph traversal and refers to the process of visiting each node in a tree data structure, exactly once. Such traversals are classified by the order in which the nodes are visited. The following algorithms are described for a binary tree, but they may be generalized to other trees as well.",1.5, 4320,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to the process of visiting (or traversing) all the nodes in a tree data structure in a systematic way. It involves examining each node in the tree exactly once, following a specific order, to perform some operation or gather information about the nodes.",1.5, 4321,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal means a meathod or algorithm to visit each element of tree through pointer.,1, 4322,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal means visiting every node of the tree and performing various operations.,0.5, 4323,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing across a tree ,0, 4324,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is to traverse through all the nodes of the of the tree.,1, 4325,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree travesal is a method to traverse through a tree.preorder NLR,Postorder LRN,Inorder LNR",1.5, 4326,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is the approach by which we use pointers to go to every child node and perform different operations and there are 4 types of tree traversals , level order,postorder,preorder,inorder",2, 4327,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to traversing through the tree by visiting each and every node depth wise. For ex- Inorder, preorder and post order",2, 4328,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",ONE ACCESS THE ELMENT OF A TREE ONE BY ONE ,1, 4329,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",This is the process in which we visit each node of the tree,1, 4330,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",going through data of the tree is called tree traversal,1, 4331,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",A tree traversal is in which we maintain hierarchy and we traverse childs and parent.,1, 4332,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4333,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","ree traversal is a form of graph traversal and refers to the process of visiting each node in a tree data structure, exactly once.",1, 4334,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","post order, in order, pre order",1, 4335,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is when we are able to travel across different nodes to perform certain operations in a tree,1, 4336,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal also known as tree search.It is a process of visiting each node of a tree data structure,1, 4337,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","This technique follows the 'root left right' policy. It means that, first root node is visited after that the left subtree is traversed recursively, and finally, right subtree is recursively traversed. As the root node is traversed before (or pre) the left and right subtree, it is called preorder traversal.",1.5, 4338,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal"," tree traversal is a form of graph traversal and refers to the process of visiting each node in a tree data structure, exactly once. Such traversals are classified by the order in which the nodes are visit",1.5, 4339,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",printing all the data in a tree in a particular order is called tree traversal,1, 4340,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is the systematic process of visiting and inspecting the nodes in a tree structure.,1, 4341,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is a form of graph traversal and refers to the process of deleting each node in a tree,0, 4342,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Visiting each node of the tree exactly once,1, 4343,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","moving from one node to another node in a tree.it has 3 types: Preorder, post order, in order",1.5, 4344,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",To visit every element of a tree atleast once,1, 4345,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing nodes in a tree,0, 4346,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",the tree traversal is to go to each and every node in a tree,1, 4347,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","it can be travelled in three ways preorder,postorder,inorder",1, 4348,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal involves visiting all nodes in a tree data structure.,1, 4349,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","moving from root to left, right",0, 4350,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","print the values of each node using different techniques that is inorder, preorder, postorder.",1, 4351,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","To traverse through all the nodes of the tree and subtrees.there are many types of tree traversal: preorder,inorder,levelorder,postorder",1.5, 4352,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Traversing of tree is called tree traversal eg. inorder , preorder , postorder , level order , vertical order etc.",1, 4353,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",we traverse from root to thleaf nose untill root==NULL.,1, 4354,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal"," refers to the process of visiting each node in a tree data structure, exactly once.",1, 4355,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is the process of visiting each node in a tree data structure. Common methods include in-order, pre-order, and post-order traversals.",1.5, 4356,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal means traversing or visiting each node of a tree.,1, 4357,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",TREE TRAVERSAL IS THE TECHNIQUE TO GET THE OUTPUT OF ROOT AND CHILD NODES OF A PARTICULAR TREE,1, 4358,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","in which we go to each element one by one like inorder,postorder,preorder",1.5, 4359,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal, also known as tree search, is a process of visiting each node of a tree data structure. During tree traversal, you visit each node of a tree exactly once and perform an operation on the nodes like checking the node data (search) or updating the node.",1, 4360,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","in this we traverse whole tree for operation like searching, printing the elements, etc",0.5, 4361,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",It is printing out the values stored in a tree structure either in levelfirst or breadth first manner,0.5, 4362,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","In tree traversal we visit each node of the tree. Example- level order, preorder,inorder,postorder",2, 4363,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is a way to access elements in a tree data structure. There are multiples ways to access the elements in a tree which are preorder, inorder, postorder, and level order",2, 4364,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal refers to when we go to every node of a given tree. there are different types of traversals like inorder preorder and postorder.,1.5, 4365,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Traversing/ visiting the nodes of the tree. PreOrder, PostOrder, InOrder, LevelOrder",2, 4366,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree transversal is where we go to every node of the tree and prints its data,1.5, 4367,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","efers to the process of visiting each node in a tree data structure, exactly once.",1.5, 4368,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","It involves starting from the node and then accessing each node one by one in whatever sequence the user wish for(inOrder,PostOrder,PreOrder,LevelWise)",2, 4369,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is visiting each node of a tree ,1, 4370,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is a form of graph traversal and visiting each node tree data structure ,1, 4371,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversal used to traverse tree like inorder(lnr),preorder(nlr),postorder(lrn),levelorder,morristraversal",2, 4372,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4373,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting evry node of a tree is known as tree traversal ,0, 4374,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is going through each node of the tree and printing them in various orders such as inorder,preorder,postorder,levelorder",2, 4375,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",From root going to each element of tree is traversal,1, 4376,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is the process of visiting and inspecting all the nodes (or elements) of a tree data structure in a systematic order. In computer science, trees are hierarchical data structures composed of nodes, with one node at the top (the root) and other nodes forming a branching structure beneath it. ",2, 4377,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree Traversal is the method to print the elements inside a tree in a given manner. Eg: Inorder, Preorder, Postorder.",2, 4378,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal m,eans visiting each and every node of the tree",1.5, 4379,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tranversing through each node is know n as tree traversal,1.5, 4380,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversing through each of tree element in a particular manner like preorder, inorder, postorder, level order, etc",2, 4381,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",going on node to node to perform some program,1, 4382,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal refers to the process of going over all the tree elements, the three different types of tree traversals are inorder, preorder and postorder",2, 4383,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Printing each node of a tree either in depth way traversal or level order traversal is called tree traversal.,1.5, 4384,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",accessing the tree elements ,0.5, 4385,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",a tree traversal is aprocess of going through each nodes in a manner from root to leaf,1, 4386,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is a method to traverse through each node of the tree in different ways and perform operations on it.,1.5, 4387,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is the traversal of elements of a tree in a particular fashion.,1.5, 4388,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",going through each node of the tree exactly once,1, 4389,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Visiting all the elements at least once ,1, 4390,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is reaching every node of a tree one by one,1, 4391,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","accessing nodes of the tree is call tree traversal like inorder , preorder, postorder , levelorder.",2, 4392,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting the nodes of trees such that each node is visited only once,1.5, 4393,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal, also known as tree search, is a process of visiting each node of a tree data structure. ",1.5, 4394,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Traversing through each node of the tree one by one by using different traversals.,1.5, 4395,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4396,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is to move to every node in a tree till your reach null. There are 4 types of traversal- Preorder, inorder, postorder, and levelorder",2, 4397,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is the technique through which we move through the tree. inorder traversal, postorder traversal and preorder traversal",2, 4398,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is a technique to visit each node one by one.There are differernt type of traversals like inorder,postorder pre order,level order,etc.",2, 4399,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","level order and preorder,in order,post order are the traversal and traverse node one by one",2, 4400,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to the process of traversing data of the root,left child and right child,one by one. The pointer to the root node first prints the value of the root,then moves to the children and further to the leaf nodes.",2, 4401,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal means visiting all nodes of tree atleast once,1, 4402,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Accessing each node of the tree, from root to left or right child of the tree.",1, 4403,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Traversing through all nodes of tree,1, 4404,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is ways to print or check every node of the tree breadth wise or height wise . ,1.5, 4405,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",goind to each node of the tree by inorder preorder or postorder method is called tree traverssal,1.5, 4406,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is the process of visiting and processing all the nodes in a tree structure in a specific order,1.5, 4407,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal helps in printing the tree types: preorder,inorder,postorder,levelorder",2, 4408,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it is a method to traverse each node in a tree.,1, 4409,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",going down a tree either recursively or iterativley ,1, 4410,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","finding data through the tree is tree travesral like tree->left,tree->right is travesring",1, 4411,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing across each node in a tree,1, 4412,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversing a tree (Binary,AVL,etc)by pre-order methos or post-order method or in-order method or level-wise method are the traversal methods in tree.",2, 4413,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversing through the tree is known as tree traversal, there are generally 4 types of traversals namely preorder, postored, inorder, level order. We go through every element of the tree,.",2, 4414,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is the method of going to a needed node in a tree.,1.5, 4415,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",a process of visiting each node of a tree data structure,2, 4416,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","ree traversal, also known as tree search, is a process of visiting each node of a tree data structure",2, 4417,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","accessing all the nodes(data,lchild,rchild) in a tree is called tree traversal",2, 4418,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","there are 4 tree traversals , inorder,preorder,postorder and levelorder. these traversal are used to search data in a tree by traveling thorugh each node in the tree",2, 4419,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it can be travelled in three ways,2, 4420,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting nodes of a tree ,2, 4421,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to the process of visiting and inspecting all the nodes (or elements) in a tree data structure in a specific order. Trees are hierarchical structures composed of nodes, where each node has zero or more child nodes. Tree traversal allows you to access and process the elements of a tree, making it an essential operation when working with tree-based data structures like binary trees, binary search trees, and general trees.",2, 4422,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",a process of visiting each node of a tree data structure,2, 4423,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","PREORDER , INORDER , POSTORDER .. TRAVERSAL OF NODES ONE BY ONE",2, 4424,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",This technique follows the 'root left right' policy,1.5, 4425,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it is method to print the element of tree ,1.5, 4426,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","going through all the nodes of a tree. inorder, preorder, postorder, levelorder.",2, 4427,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0.5, 4428,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","inorder , preorder,postored ,levelorder all these traversal tell he data in data structurei tree in different format",1.5, 4429,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",CHECK EACH AND EVERY DATA OR WE SAY GO TO EACH AND EVVERY DATA,1.5, 4430,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is the process that involves visiting each node once ,0.5, 4431,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","TREE TRAVERSAL IS USEWD TO PRINT THE TREE IN DIFFRENT ORDER SUCH PREORDER , POSTORDER AND INORDER ",2, 4432,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is a process in which in which we go through every node of a tree . some types of tree traversal are inorder , postorder , preorder , levelorder",2, 4433,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",when we go through all elements in a tree,2, 4434,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversing through each node of a tree. There are commonly 4 types of traverse used i.e. inorder,preorder,postorder,level order ",2, 4435,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",we access every node data present in the tree by going left or right of the root node of the tree.,2, 4436,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting the node once,0.5, 4437,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree is traversed in 3 forms- inorder,preorder,postorder",2, 4438,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","When we tranverse through each nodes of a tree then its called tree traversal. There are three types of orders where traverse like Inorde,r postorder and preorder.",2, 4439,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each and every node of the tree,2, 4440,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversal or accessing and outputting tree structures along separate directions and values are called traversals of tree eg in order traversal where we traverse from left root and right,2, 4441,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal can be defined as sequential going through each node of the tree one by one and printing if requires.,2, 4442,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it is a technique in which values of tree can be accessed,2, 4443,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",accessing tree one by one as one is linked with the other,2, 4444,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to traversing the tree data starting from root to the child. It is of many types for eg INORDER , PREORDER,POSTORDER.",2, 4445,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is a form of graph traversal and refers to the process of visiting each node in a tree data structure, exactly once.",2, 4446,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",a tree traversal in which a tree is built from the data to use it in a particular manner,2, 4447,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is the process of visiting to different nodes. eg. inorder, preorder, postorder",2, 4448,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0.5, 4449,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0.5, 4450,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversing a tree to fetch its elements. it is of many types: post order traversal, preorder traversal, level order traversal",2, 4451,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0.5, 4452,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal refers to the visiting of each node in the tree in a specific sequence.,2, 4453,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","nodes are traversed one at a time. three ways: preorder, postorder, inorder. left subtree, right subtree and root is traversed based on type of traversal.",2, 4454,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing or finding output or printing the given tree .,0.5, 4455,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Traversing along the branches if a tree is known as tree traversal.,2, 4456,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0.5, 4457,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",accessing the tree by different ways,1, 4458,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is the process of processing and reading each element in a data structure in a,2, 4459,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Reaching at the different levels of a tree ,0.5, 4460,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to the process of visiting (or traversing) all the nodes in a tree data structure in a systematic way. It involves examining each node in the tree exactly once, following a specific order, to perform some operation or gather information about the nodes.",2, 4461,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing each node exactly once ,2, 4462,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversals can be in different ways like preorder inorder postorder levelorder ,2, 4463,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",in tree traversal we count no of leaf nodes ,0.5, 4464,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Visiting the nodes of a tree is tree traversal.,1, 4465,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is technique through which we can go to each node one by one . Traversal is of 4 types inorder preorder postorder levelorder,1.5, 4466,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing is going through each node in the tree,1, 4467,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",iterating over each row of tree is known as tree traversal,1, 4468,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversaling each node of tree one one till leaf nodes,1.5, 4469,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","the accessing of all elements in a tree data struct is called a tree traversal, there are many types of traversals. preorder traversal. inorder traversal, postorder traversal, etc.",1.5, 4470,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree transveral is two types breadth first search and depth breadth search,1.5, 4471,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","process of visiting each node in a tree data structure, exactly once.",1, 4472,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal means traversing each node of tree,1.5, 4473,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",we can do traversal by converting a tree into array.,1.5, 4474,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is visiting each tree node one by one ,1, 4475,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4476,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Traversing through elements in a tree in preorder(root->left subtree->rightsubtree), inorder(left subtree->root->rightsubtree) or postorder(left subtree->rightsubtree->root) manner.",1, 4477,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal refers to the process of visiting each node of a tree data structure. ,1.5, 4478,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing a tree is called tre traversal it can be inOrder PRE POST or levelOrder.,1.5, 4479,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",means we traverse from the root till the leafs,1.5, 4480,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","it is the way to represent a tree or read its data its is of types inorder,preorder,postorder,levelorder",1, 4481,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is for printing the data stored in trees.example preorder,inoorder,postorder",1.5, 4482,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",pre order post order level order inorder to traverse all tree nodes,1.5, 4483,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is displaying the data of parent node and then the left child and right child node,1, 4484,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversal of a tree is going through all the nodes of the tree in a manner . we can traverse a tree by inorder, preoder , post order and level order",1, 4485,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each nodes of the trees can be done in different format,1.5, 4486,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",we go to each element of the tree using suitable traversal.,1, 4487,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal means visiting every node of tree using left and right pointers,1.5, 4488,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",a traversal is something with which we can go through all the parent nodes and child nodes and easily access their values,1, 4489,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",here we visit every node exactly once in a particular order inorder preorder postorder,1, 4490,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is the process of visiting and exploring all the nodes (elements) of a tree data structure in a systematic and well-defined order. Trees are hierarchical data structures with a root node at the top and child nodes branching out below it. Tree traversal is commonly used to access, search, or manipulate the elements within the tree.",2, 4491,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal means how many ways we can print a tree like inoder ,postorder, preorder",1.5, 4492,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",It is the printing of the elements in a tree in various forms,1, 4493,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing each node in tree exactly once ,1.5, 4494,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each and every node of a tree,1.5, 4495,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is when we pass through each node of a tree .,1.5, 4496,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","going to all nodes of trees one by one, depth first traversal or breadth first traversal",1.5, 4497,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Treee Traversal refers to the process or algo in which we traverse through each and every element of the tree.,1, 4498,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",moving along the nodes of a tree and printing them one by one,1, 4499,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","travelling from each node in a tree, from root node to leaf node with no children",1.5, 4500,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Process of visiting each node in a tree,1.5, 4501,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversal is visiting each child node of a tree in a given order(can be preorder, postorder, inorder etc)",1.5, 4502,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","the elements present in the tree are traversed in many orders inorder, preorder, postorder and levelorder. it meand accessing alll the elements present int he tree and displaying them.",1, 4503,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is a form of graph traversal and refers to the process of visiting each node in a tree data structure, exactly once.",1.5, 4504,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",TRAVERSING THE ELEMENTS OF TREE FROM TOP TO BOTTOM IS CALLED TREE TRAVERSAL.,1, 4505,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal techniques are used to traverse the nodes of the tree. there are many traversal techniques in different orders such as inorder,postorder,preorder,level order",1.5, 4506,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",PROCESS OF VISITING EACH NODE.,1.5, 4507,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Traversal in a tree means going through every element present in the tree,1.5, 4508,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",in tree traversal the pointer visits every node of the tree .,1, 4509,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal means to visit each and every node of of tree which we have inserted.,1, 4510,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","insertion of data in to the tree called traversal in tree there are 4 types of traversals which are inorder,preorder,postorder and level order",1.5, 4511,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","in tree traversal the pointer points to its left or right pointers to traverse to other node,.",1.5, 4512,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Traversing every node of tree is tree traversal(inorder, preorder, postorder, levelorder),",1, 4513,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting the required nodes of the tree,1, 4514,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is the process of seeing the elements of a tree. Inorder, Preorder and Postorder are some types.",2, 4515,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4516,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversing each node of a tree one by one through various traversals like preorder , inoreder etc.",1.5, 4517,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversal is the process to iterate over every element in a tree or any other data structure in tree we use preorder,postorder or inorder traversal",2, 4518,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Visiting all nodes of a tree atleast one time is called tree traversal. example: level order, inorder, preorder, postorder etc.",2, 4519,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing each node of the array,0.5, 4520,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","a tree traversal is the process of searching a tree data structure one node at a time and performing options checking the node data or updating the node, deleting the node. it also has 3 type of traversal i.e inorder, preorder and postorder.",2, 4521,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Traversing every nodes from root to leaf for every path.,2, 4522,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",To travel across a tree through every element of it accessing it,1, 4523,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","there are four type of traversal.preoder,postorder,inorderand levelorder",1, 4524,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","raversing a tree means visiting every node in the tree. You might, for instance, want to add all the values in the tree or find the largest one. For all these operations, you will need to visit each node of the tree.",1.5, 4525,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",printing all nodes data in a sequence.,1.5, 4526,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4527,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",accessing all value of tree using recursion or stack,1.5, 4528,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal"," Tree traversal refers to the process of visiting and inspecting each node in a tree data structure exactly once. In computer science and data structures, trees are hierarchical structures composed of nodes, where each node can have zero or more child nodes. Tree traversal is a fundamental operation used to access or manipulate the elements stored in a tree.",1.5, 4529,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Going to each node of the tree to access its data and traverse further using child pointers of the node,2, 4530,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",to convert a tree into an array,0.5, 4531,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",in this we visit every node of a tree in data structures,1.5, 4532,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing a tree till leaf node is reached,0.5, 4533,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is a process of visiting each node of a tree data structure. During tree traversal, you visit each node of a tree exactly once and perform an operation on the nodes like checking the node data or updating the node.",2, 4534,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","printing the elemnts of tree in preorder,postorder,inorder",0.5, 4535,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",In a tree traversal the pointer visits every node of the element.,0.5, 4536,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it is a process of visiting the nodes of a tree.,0.5, 4537,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it is the process of accessing the nodes of a tree in order to print the data or access it,2, 4538,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","IN THIS THIS WAY WE PRINT OUR TREE. MANY METHOD ARE INORDER,PREORDER ,POSTORDER,LEVEL ORDER TRAVERSAL",0.5, 4539,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is visiting each node and printing its data there may be many ways of traversal like inorder post and pre order etc,1.5, 4540,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","to visit every node in the tree. eg. preoder, postorder, inorde",0.5, 4541,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","to print root and its child and elements of the tree eg. inorder,postorder, level order",2, 4542,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing a tree is reaching every single node and performing operations on it,1.5, 4543,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree travasel for printimg data stored in tree in inordered preordered postordered etc way,2, 4544,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree transversal is going through each element of the tree once,1.5, 4545,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal means running through the whole tree and printing the data in required form,1.5, 4546,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Traversing a tree means visiting every node in the tree. ,1.5, 4547,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it is to visit every node in binary tree.,1.5, 4548,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting the nodes of trees.,2, 4549,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",is the processes of accessing the nodes of a tree in order to print the data or access it,1.5, 4550,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4551,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","In computer science, tree traversal is a form of graph traversal and refers to the process of visiting each node in a tree data structure, exactly once.",1, 4552,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",getting data,1, 4553,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",when we traverse a tree either by level order of depth order is tree traversal,0.5, 4554,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting every node of a tree only once and traversing it.,1.5, 4555,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","accessing all the nodes of the tree (pre,post,in,level)",1, 4556,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is accessing the data of tree by preorder,postorder,inorder .",1.5, 4557,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversal used to tranverse tree using method such as inorder,preorder,postorder",0.5, 4558,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversing the tree by nodes as per the given requirments, traversal is of many kinds like levelorder, inorder, postorder , boundary etc",2, 4559,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",starting from root node to the end of the node,1.5, 4560,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal are the method through which we visit every node of a tre namely postorder , preorder,inorder",2, 4561,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal involves searching for a data using left and right pointers ,2, 4562,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4563,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each node of the tree once is called tree traversal,1.5, 4564,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing through each node of the tree using recursion,1, 4565,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Traversing the entire tree accessing each and evry element recursively,1.5, 4566,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4567,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4568,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to traverse them, trees can be traversed in different ways. ",1, 4569,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",going through the all nodes ,2, 4570,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",accessing each and every node of a tree,1, 4571,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",placing elements in order /level ,1.5, 4572,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",to reach or traverse each node of tree ,0.5, 4573,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4574,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal in which we go through every element which is ther e,1, 4575,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",method of going to required node in tree,2, 4576,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tracrsing the tree lile pre order post order level order and in order ,1.5, 4577,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing from the root till the leaf nodes to print the data in the nodes created to form a tree,1.5, 4578,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",in this we go to each elemet one by one using conecpts of inorder preorder and postorder,0.5, 4579,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","its the movement like how we want the output, there are 4 traversals , 1)Preorder 2)Postorder 3) Level order 4) Inorder",2, 4580,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4581,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversing the elements of a tree using Pre order, in order, post order and level order traversal",1, 4582,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","displaying the elements in orders/ sorted form (level,post,pre,in)",1.5, 4583,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",going every node of a tree,1.5, 4584,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","since it is non linear data structure we cannot traverse it using arrays,linkedlist, so we have mainly 4 traversal inorder,levelorder,preoder,postoder ",1, 4585,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","to traverse and reach all the data elements of tree is called tree traversal. it can be inorder, preorder,postorder,levelorder.",1.5, 4586,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",to visit every node is called tree traversal.,1, 4587,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is going through each data in a specific order which is inserted,0.5, 4588,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","refers to the proces of visiting each node in a tree data structure, exactly once",1.5, 4589,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",PLACING OF ELEMENTS IN ORDER OR LEVEL,1.5, 4590,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting every node of a tree in a order,2, 4591,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",going to each elements in a tree through any order traversal form,1.5, 4592,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4593,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",the process of visiting each node in a tree data structure,1, 4594,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","in tree traversal we trave in the pre,in,pos with help of breadth fiirst, level",1.5, 4595,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing different nodes of the tree is known as traversa;,1.5, 4596,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",accesing data of tree by level order preorder postorder inorder,1.5, 4597,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",we traverse the tree by visiting each node of tree,1, 4598,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to the process of visiting and accessing each node in a tree data structure. Trees are hierarchical structures composed of nodes, where each node has a value and may have child nodes. Tree traversal allows you to systematically explore and process these nodes.",2, 4599,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal refers to the process of visiting each node in a tree data structure exactly once. It involves accessing or processing nodes in a specific order, either for the purpose of searching, inserting, deleting, or simply traversing the entire tree. There are three main types of tree traversal algorithms: Depth-First Traversal: In this approach, the nodes are explored from the root to the deepest leaf node before backtracking. There are three ways to perform depth-first traversal: Preorder Traversal: Visiting the current node first, then recursively visiting the left subtree, and finally the right subtree. Inorder Traversal: Recursively visiting the left subtree, then the current node, and finally the right subtree. This traversal returns the nodes in ascending order for binary search trees. Postorder Traversal: Recursively visiting the left subtree, then the right subtree, and finally the current node. Breadth-First Traversal: In this approach, nodes at each level of the tree are traversed before moving to the next level. It uses a queue to maintain the order of visiting nodes. This traversal visits all nodes in level order, starting from the root.",1.5, 4600,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",going to each node of a tree until the leaf node is reached ,2, 4601,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is the process of visiting all the nodes of a tree data structure in a specific order. Common tree traversal methods include in-order, pre-order, and post-order traversals.",2, 4602,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",when we access all the data elements of various nodes of a tree,2, 4603,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree Traversal means to analyze every node of the tree until it reaches the leaf node.,1.5, 4604,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing each node of tree one boy one,1.5, 4605,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it is a process of accessing all nodes of a tree,2, 4606,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal refers to the process of visiting each node in a tree data structure, exactly once.",1.5, 4607,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",ot traverese all nodes of a tree,2, 4608,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",in this one we devide our data structure into two parts and then see that our desired data is smaller or bigger than the selected node(middle one) and repeat it again,1.5, 4609,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal"," tree traversal is a form of graph traversal and refers to the process of visiting each node in a tree data structure, exactly once.",2, 4610,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",the ways of printing the nodes of binary tree,1.5, 4611,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",s a process of visiting each node of a tree data structur,2, 4612,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting ebery element of the tree atleast once is called traversal,1.5, 4613,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Visiting each node of tree at least once is called tree traversal,1.5, 4614,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is storing or printing of data in a order,0.5, 4615,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is a process of visiting each node of a tree data structure.,1, 4616,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",the process of traversing a tree is called a tree traversal.it can be done by recursion or iteration.,1.5, 4617,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","There are many ways to traverse trees- Inorder, Preorder, Postorder, Levelhead",1, 4618,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal, also known as tree search, is a process of visiting each node of a tree data structure. During tree traversal, you visit each node of a tree exactly once and perform an operation on the nodes like checking the node data (search) or updating the node.",1.5, 4619,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",the traversal in which we travel to each element in particular format,1, 4620,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",where each node of tree is visited,1, 4621,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",going to each and every node of a tree ,1, 4622,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",printing all the data in a tree in particular order is called tree traversal ,1, 4623,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","-Three types of tree traversal :- LRN, LNR, ",0, 4624,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",A root node having atleast two children,0, 4625,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversal in tree mean travelling htroug nodeand their child,1, 4626,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","his technique follows the 'root left right' policy. It means that, first root node is visited after that the left subtree is traversed recursively, and finally, right subtree is recursively traversed.",1, 4627,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is a form of graph traversal and refers to the process of visiting each node in a tree data structure, exactly once.",1, 4628,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","there are different types of tree traversal pre order ,post order level order iso that we can traverse fron left right of that node",1.5, 4629,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4630,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is a technique of hovering through entire tree nodes one by one in any order e.g.-inorder, postorder, preorder",2, 4631,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4632,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is a way of going on every node element of a tree.,1, 4633,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",process of visiting and accessing all the nodes in a tree,1, 4634,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",to print the tree in certian ord er like preorder post order ,1, 4635,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal, also known as tree search, is a process of visiting each node of a tree data structure.",1, 4636,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4637,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each node of a tree,1, 4638,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each node,1, 4639,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversal in tree means traversing all the all elements in tree there are mainly preorder,postorder,inorder,level order traversals",2, 4640,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4641,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal"," Tree traversal refers to visiting all nodes of a tree data structure. Common methods include in-order, pre-order, and post-order traversal.",2, 4642,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is a form of graph traversal and refers to the process of visiting each node in a tree data structure, exactly once.",1, 4643,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",process of visiting and accessing all the nodes in tree,1, 4644,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is to read all data stored in a tree ,1, 4645,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each node of a tree one by one one the basis of left or right child,1, 4646,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",data is printed in tree,0, 4647,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it means going through each node one by one,1, 4648,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it is a process of visiting each node of a tree data structure. ,1, 4649,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal, also known as tree search, is a process of visiting each node of a tree data structure. During tree traversal, you visit each node of a tree exactly once and perform an operation on the nodes like checking the node data (search) or updating the node.",1, 4650,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal is the process of visiting each node of a tree througha a pre selected algorithm,it can be used for searching deletion etc.",1, 4651,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4652,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",a tree traversal is to go to roght and left part of root until it is null,1, 4653,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is the process of visiting all nodes in a tree data structure in a systematic order, typically for searching or processing purposes.",1.5, 4654,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",we can traverse through each node one by one,1, 4655,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing through the trees,0.5, 4656,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",technique to traverse a tree like preorde postorder and inorder,1.5, 4657,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",when we traverse a linear data structure form.,0, 4658,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4659,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each node of the tree through different methods,1, 4660,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is visiting each node of the tree once.,1, 4661,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Inorder, Preoder, Post",1, 4662,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",PRINTING TREES,0, 4663,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal means traversing elementsof a treee which can be donr breadthwise(level order) or height wise (pre,in,post order))",2, 4664,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is a process of visiting each node in a tree.,2, 4665,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",it is visiting each node of a tree one by one from left or right leaf node .,2, 4666,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",the function used to go to each node of tree is called as traversal,2, 4667,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4668,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",trying to access a node of the tree ,1, 4669,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing a non linear data structure.i.e. in multi direction.,0.5, 4670,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing every node ,1, 4671,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Unlike linear data structures (Array, Linked List, Queues, Stacks, etc) which have only one logical way to traverse them, trees can be traversed in different ways. : inorder , preorder , post order",2, 4672,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal refers to taking root and going to its left and right to access each element in the tree,2, 4673,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tRAVERSING EVERY SINGLE NODE OF THE TREE.,2, 4674,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",The process of visiting and inspecting each node in a tree data structure.,2, 4675,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",printing the value of root or traversing the eaCH node in tree ,1, 4676,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting every node in a tree,2, 4677,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Traversing a tree to get all the elemnets stored in tree. we can do it by four ways: preorder, postorder, inorder, levelorder. ",2, 4678,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","ree traversal, also known as tree search, is a process of visiting each node of a tree data structure. During tree traversal, you visit each node of a tree exactly once and perform an operation on the nodes like checking the node data (search) or updating the node.",2, 4679,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Traversing thorugh each node of a tree is termed as tree traversal,2, 4680,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal in which each node is traversed of a tree,2, 4681,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","to gain access and move along all elements of a tree they are of 4 types mainly level order , inorder,preorder, postorder",2, 4682,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversing the tree. three types preorder(node, left, right), inorder(left, node, right), postoder(left,right, node)",2, 4683,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is iteration of the tree .,0.5, 4684,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",this is method to reach on the nodes,1, 4685,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal is the process of visiting each node of a tree data structure exactly once. ,2, 4686,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","it means going to all the nodes of the trees in an orderly fashion (preorder,inorder,postorder)",2, 4687,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",travelling tree at each nodes through differnt order traversals,2, 4688,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","tree traversal are of three types inorder preorder postorder in which we access the tree data one by one in any order (left,root,right),(root,left,right),(left,right,root)",2, 4689,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal means going through each elemnt of tree once,2, 4690,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing on left and right node of tree ,1.5, 4691,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal"," Four Different Tree Traversal Algorithm Types (with Animations) | Integrated The process of going over each node in a tree data structure is called tree traversal, sometimes referred to as tree search. Tree traversal involves going exactly once to each node in a tree and performing an action on it, such as updating or verifying its data (search).",2, 4692,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing through each node in tree,2, 4693,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",its a process of visiting each node in tree data structure ,2, 4694,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Tree traversal can be done by insertion.,0, 4695,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4696,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",travelling through the complete tree node by node,2, 4697,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Accessing and reaching each node of the tree ,1, 4698,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each node in tree,2, 4699,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal means to execute left and right of tree and then print each node,1.5, 4700,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing left right of a node,1.5, 4701,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting left and right node,1, 4702,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal means accessing each and every node's value/data one by one,2, 4703,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","his technique follows the 'root left right' policy. It means that, first root node is visited after that the left subtree is traversed recursively, and finally, right subtree is recursively traversed. As the root node is traversed before (or pre) the left and right subtree, it is called preorder traversal. ",2, 4704,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing each and every node of the tree is tree traversal.,2, 4705,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is visiting each node in a given tree,2, 4706,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",preorder inorder postorder,2, 4707,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tavesrsing or accessing each element of a tree,1, 4708,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",accessing each node of tree data structure ,1, 4709,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",TREE TRAVERSAL IN THE PHENOMEN OF TRAVERSING THE COMPLETE ELEMENTS OF TREE AND CHECKING FOR CONDITIONS ,0.5, 4710,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",retrieving the data from tree,0, 4711,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",accessing elements in a tree and moving to next element ,0.5, 4712,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4713,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",accessing each element of tree,0, 4714,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",means visiting every node in the tree inorder preorder postorder,2, 4715,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",reaching each elemetn,2, 4716,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",going to each and every node of tree is called tree travewrsal,2, 4717,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Traversing the nodes in a tree ,2, 4718,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal is a process of visiting and exploring all the nodes in a tree data structure, typically in a systematic order, to perform various operations or extract information from the tree. Common traversal methods include in-order, pre-order, post-order, and level-order.",2, 4719,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",Visiting every node of tree,2, 4720,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","“In computer science, tree traversal (also known as tree search) is a form of graph traversal and refers to the process of visiting (checking and/or updating) each node in a tree data structure, exactly once.",2, 4721,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversing each node of tree by preorder, postorder ,inorder order other traversing pattern ",2, 4722,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",a tree traversal includes a hierarchal structure of grandparents thier children and further their children,2, 4723,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","types preorder,post and level ,in",2, 4724,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",method to print elements in tree,2, 4725,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversal of tree is to moving one to one of elements of tree,2, 4726,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","in tree traversal, first root node is visited after that the left subtree is traversed recursively, and finally, right subtree is recursively traversed. As the root node is traversed before (or pre) the left and right subtree, it is called preorder traversal",2, 4727,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","ree traversal refers to the process of visiting and inspecting all the nodes (elements) in a tree data structure in a systematic order. Tree traversal is essential for various tasks, such as searching for a specific node, processing the nodes in a specific order, and performing various operations on the elements in the tree. There are different strategies for traversing trees, and the choice of traversal method depends on the specific requirements of the problem at hand. The most common tree traversal methods include:",2, 4728,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4729,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing the tree from root node to every node,2, 4730,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",form of graph traversal and visits each node in tree,2, 4731,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal", is a process of visiting each node of a tree data structure,2, 4732,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal"," tree traversal is a form of graph traversal and refers to the process of visiting each node in a tree data structure, exactly once. Such traversals are classified by the order in which the nodes are visited.",2, 4733,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",reaching every node of a tree.,2, 4734,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal", a process of visiting each node of a tree data structure.,2, 4735,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal", a process of visiting each node of a tree data structure,2, 4736,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting/accessing all the nodes int the tree starting from the root node towards the leaf node,2, 4737,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",its a process where we travel to all nodes of a tree one by one ,2, 4738,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","traversal of tree node in preorder , in , post order , level order in any pattern ",2, 4739,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",MOVING THROUGH ALL THE NODES IN A TREE USING VAROIUS TRAVERSAL TECHNIQUES,2, 4740,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","The term 'tree traversal' means traversing or visiting each node of a tree. There is a single way to traverse the linear data structure such as linked list, queue, and stack.",2, 4741,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing each node of a tree one by one and performing required operations on it,2, 4742,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",navigation through a tree,2, 4743,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",tree traversal is a process of reaching each node in a tree.,2, 4744,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4745,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","TRAVERSING THROUGH EACH NODE OF TREE VIA DIFFERENT METHODS AND ORDER (INORDER, POSTORDER, PREORDER, ETC)",2, 4746,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",traversing the nodes of the tree that is printing the values stored in those nodes of the tree until it reached the leaf node,2, 4747,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","TREE TRAVERSAL IS GOING ON EACH NODE OF TREE ONE BY ONE , MOSTLY IN A DEFINED SEQUENCE. LEVEL ORDER ,INORDER ,POSTORDER ,PREORDER",2, 4748,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4749,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal", is a process of visiting each node of a tree data structure,2, 4750,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",visiting each node,2, 4751,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4752,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",TRAVELLI9NG EACH NODE OFF TREE,2, 4753,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",each node traverse ,2, 4754,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",travelling each and every node of the tree is known as tree traversing ,2, 4755,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",vising every nodde in systematic way,2, 4756,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",,0, 4757,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal","Tree traversal, also known as tree search, is a process of visiting each node of a tree data structure. During tree traversal, you visit each node of a tree exactly once and perform an operation on the nodes like checking the node data (search) or updating the node.1",2, 4758,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",print the tree nodes in order.,2, 4759,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because all nodes are connected via edges (links), we always start from the root (head) node. There are three ways which we use to traverse a tree − • In-order Traversal • Pre-order Traversal • Post-order Traversal",travel around each and every node,2, 4760,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"where balance factor of every node is -1, 0, 1",1, 4761,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree is a self-balancing binary search tree where the height of the left and right subtrees of any node differs by at most one. This balancing property ensures that the tree remains relatively balanced, which helps maintain efficient search, insert, and delete operations.",1.5, 4762,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing tree,0.5, 4763,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree is a self-balancing binary search tree where the height of the left and right subtrees of any node differs by at most one. It ensures efficient insertion, deletion, and search operations.",2, 4764,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is balanced binary search tree in which we calculate the balance factor at every insertion(-1,0,1).",1.5, 4765,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree is a self-balancing binary search tree.In an AVL tree, the heights of the two child subtrees of any node differ by at most one. If at any time they differ by more than one, rebalancing is done to restore this property",0.5, 4766,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced binary search tree where we find balancing factor at every point of insertion,2, 4767,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree is a tree that has 2 properties--> It is a bst i.e values smaller than root value will be on the left and greater that root value will be on the right. --> It is balanced. That means the diff in left and right height at each node is either 1,0 or -1.",0.5, 4768,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is a selft balancing binary search tree,2, 4769,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a self balancing BST in which each node has a balancing factor of either 1,0 or-1.",1, 4770,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node cannot be more than one.,1.5, 4771,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a height balanced binary search tree,1, 4772,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced tree and difference between level of left subtree and rightsubtree is atmost 1.,0.5, 4773,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 4774,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a balanced bst tree,1.5, 4775,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"A self balancing BST that only allows a balance Factor (height of left tree - height of right tree) in the range [-1, 1]. Used to maintain O(logN) time complexity.",0.5, 4776,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree is a self-balancing binary search tree where the height of the left and right subtrees of any node differs by at most one. This balancing property ensures that the tree remains approximately balanced, allowing for efficient operations like insertions, deletions, and searches with a logarithmic time complexity.",2, 4777,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),VL tree is a height-balanced binary tree where a balance factor balances each node,0.5, 4778,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),in which height of left and right branch do not differ more than one,1, 4779,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a binary search tree in which element smaller than root is on left and greater than root is inserted in right,we also have balanced factor like the diffrence of left height to right is either 0,-1,1",1.5, 4780,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a self-balancing binary search tree.,1, 4781,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a height-balanced binary tree where a balance factor balances each node. A balancing factor is a difference between the height of the left subtree and the right subtree. For a node to be balanced, it should be -1, 0, or 1.",2, 4782,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a height-balanced binary tree where a balance factor balances each node,0.5, 4783,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is special type of BST tree that follow some extra rules to decrease the height of BST tree that offer a better run time and time complexity. It have rotarion methods and balance variable for each node that varies between -1 to 1.,1, 4784,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Its is a balanced binary search tree. such that the balance factor is smaller than or equal to 1. it is better than bst as it is balanced so the operation can occur in O(log n) time,1.5, 4785,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 4786,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 4787,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"Self balancing Binary Search tree which is balanced using extra attribute balance factor (left tree height - right tree height) = -1,0,1 during insertion RL LR LL RR rotations are performed and it is faster for searching than Binary Search Tree as it has max height of log n.",1, 4788,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a self balancing tree which balances the number of nodes to the left and right,1.5, 4789,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL Tree is a self-balancing binary search tree where the heights of the two child subtrees of every node differ by at most one, It ensures that the tree remains balanced.",0.5, 4790,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a self balancing binary search tree that helps searching possible in logn time using rotations,2, 4791,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is balanced binary search tree in which every node must be balanced,0.5, 4792,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl is a self balancing binary search tree,1, 4793,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"an AVL tree is a balanced binary search tree having maximum height = logn. it works similiary to BST but also keeps track of the height difference of it's children subtrees and checks if that difference (balance factor) is greater than 1 or less than -1, in that case it balances itself via rotations.",1.5, 4794,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree is a self balanced tree, in which every node has a balance factor as -1,0 or 1, and not greater, which helps in keeping the height of the tree as log n.",0.5, 4795,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"Avl tree is also know as balanced binary search tree. in it is a simple binary search tree in which every node has a balancing factor which should be equal to -1,1,0.",2, 4796,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL Tree is a balanced binary Search Tree. After each insertion, the tree is checked for imbalances. The tree rebalances itself in case of an imbalance. Thus it maintains a height = log(n), and efficiently performs search and insert operations",0.5, 4797,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree is a self balancing binary search tree where the balancing factor is always maintained (l-r is in between {-1,0,1}) through the rotations like LL,RR,LR,RL.",2, 4798,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a balanced binary tree,1, 4799,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL TREE(ANDELSON VELENSKY LANDIS) IS A SPECIAL TYPE OF SELF BALANCING BINARY SEARCH TREE WHERE BALANCIN FACTOR CAN BE -1,1,0.",1.5, 4800,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0.5, 4801,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,2, 4802,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a balanced binary tree where the height difference of each node should be 1,0,-1",1.5, 4803,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL is a balanced Binary tree,1, 4804,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a balanced binary search tree in which balance factor(height of left tree - height of right tree) is either -1 , 0 ,1.",0.5, 4805,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is self balancing binary search tree,2, 4806,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree is a self balancing Binary Search Tree. The key point of an AVL tree is that the difference between the heights of left child of a node and right child of a node is never more than 1.,1, 4807,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree is a self-balancing binary search tree in which the heights of the left and right subtrees of any node differ by at most 1, ensuring logarithmic time complexity for common operations",1.5, 4808,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"its a self balanced BST. it balances the tree such that each node has a balance factor of 0,1,or -1.",0.5, 4809,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees of every node differ by at most one, ensuring logarithmic time complexity for common operations.",2, 4810,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a balanced binary search tree with minimum height,0.5, 4811,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"It is a self balanced Binary search tree where balance factor of every node is 0,-1,1",1, 4812,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,2, 4813,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a self balancing BST, it uses balance factor (bf=leftHeight-rightHeigh)to find if the tree is unbalanced.",1.5, 4814,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a type of balancing tree where difference between the heights of left and right subtree can be atmost 1.,1, 4815,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a self balancing binary search tree in which difference of height of left subtree and right subtree is not greater than 1 for every node ,1, 4816,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a height balanced binary search tree. it keeps track of hight by balance factor.,1, 4817,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is binary search tree which is height balanced,1, 4818,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a type of bst in which branches at each level of tree is balanced means it have balancing factor either 1 or 0,1, 4819,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is also known as self balancing tree, the difference of height from left and right can only be 1,0 or -1",1, 4820,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"an avl tree is a balanced binary search tree in which the difference between every node's left subtree height and right subtree height lies in the range [-1,0,1].",1, 4821,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL Tree is a self-balancing binary search tree where the heights of the two child subtrees of every node differ by at most one.,1, 4822,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is type of balanced binary search tree where we balance binary search trees using a factor; this factor is determined by the calculating the difference of number of nodes on that particular nodes right or left sides.,1, 4823,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl is tree is a balanced binary search tree where each leaft node has a sibling,1, 4824,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree)," It is designed to maintain its balance, ensuring that the height difference (balance factor) between the left and right subtrees of any node is at most 1.",1, 4825,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Balanced Binary search tree is a AVL tree.,1, 4826,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it is a bst in which the difference of height of left and right of a node lies between [-1 , 0 , 1]",1, 4827,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL is a height balanced binary seacrh tree,1, 4828,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a balanced binary search tree. here every node can have the balaced value as either -1,0,1.",1, 4829,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AN AVL TREE IS A SELF BALANCING TREE IT HAS A BALANCE FACTOR WHICH IS MAINTAINED AT EACH NODE,1, 4830,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL Tree is a balanced binary search tree in which the difference of height of left side and right side for every node is of the order log n,1, 4831,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"In an AVL tree, for every node, the heights of the left and right subtrees can differ by at most one. If at any time during an operation (such as insertion or deletion), the height difference between the left and right subtrees exceeds one, the tree undergoes rotations to restore the balance.",1, 4832,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a self balancing tree which is also a binary search tree but along with that it has an attribute called balance factor.,1, 4833,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a self balancing binary search tree. Each node has a balance factor which needs to be 0,1,-1 in order for it to balanced.",1, 4834,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a balanced binary search tree.,1, 4835,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"avl tree is a self balancing binary search tree, it balances the tree at insertion/deletion of every node ",1, 4836,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),in avl tree also one element is cinsider as root and smaller vales comes on left and larger values comes on right but avl tree should be balanced.,1, 4837,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"an AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differentiate at most one",1, 4838,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is the height balancing tree,1, 4839,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it is a type of balanced tree where height of left tree and right tree are same and either 0 or -1,1",1, 4840,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing tree,1, 4841,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),the height difference of the tree from every node node is 0 or 1,1, 4842,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing binary search trees,1, 4843,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced binary search tree ,1, 4844,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing tree,1, 4845,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is binary search tree it is balance tree where ,1, 4846,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"It is Balanced BST with a balance factor i.e. left child- right child for every node, a tree is an avl tree only if avl tree has -1,0,1 as values",1, 4847,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL is a balanced bst,1, 4848,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 4849,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"It is a special type of BST which is balanced after every insertion or deletion in the tree and the height difference between left side of tree and right side of tree should be either 0,-1 or 1.",2, 4850,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a tree where where we have ,0, 4851,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a tree whose height difference at every node is less than 2 ,1, 4852,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a height balanced binary tree,1, 4853,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an avl tree is a self balancing tree. the difference in height of left and right subtree of each node cannot be more than 1,1, 4854,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancingc tree,1, 4855,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is a balanced binary tree in which the absolute difference in the height of left subtree and right subtree is less than 1.,1.5, 4856,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it is self balancing tree, which at every insertion compares height and balances itself.",2, 4857,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree is a self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one, ensuring that the tree remains balanced and its operations (insertion, deletion, and search) have a time complexity of O(log n).",2, 4858,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Self balancing binary search tree.,2, 4859,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is a balanced Search Tree.,0.5, 4860,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node cannot be more than one.,2, 4861,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a advanced tree which is more efficient than any normal tree , the reason being its balanaced height which is why it is also called as self balancing tree, it uses the elemensts like balance factor, height and processes like rotations which helps in inserting an element and ater insertion adjusting such that thge tree gets minimal height ",2, 4862,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 4863,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A self balancing binary tree,1.5, 4864,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 4865,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL Tree is a self-balancing binary search tree where the heights of the two child subtrees of every node differ by at most one.,2, 4866,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced binary search tree where the left and right subtrees differ in height by atmost 1,1.5, 4867,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL is a self balancing Binary Search Tree which follows left and right rotation to maintain balance.,1.5, 4868,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing binary search tree.,1, 4869,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree is a self-balancing binary search tree with height balance constraints with efficient search, insert, and delete operations.",1.5, 4870,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree, named after its inventors Adelson-Velsky and Landis, is a self-balancing binary search tree data structure. It is designed to maintain balance in the tree to ensure efficient insertion, deletion, and searching operations. In an AVL tree: 1. **Binary Search Tree Property**: It is a binary search tree, which means that for each node: - All nodes in the left subtree have values less than the node's value. - All nodes in the right subtree have values greater than the node's value. 2. **Balancing Factor**: Each node in an AVL tree has a ""balance factor"" associated with it. The balance factor is the difference between the height of the left subtree and the height of the right subtree for that node. This factor can be -1, 0, or 1 to maintain balance. 3. **Balancing Operations**: When an insertion or deletion operation is performed, the balance factor of the affected nodes is updated. If the balance factor becomes -2 or 2, indicating an imbalance, the tree undergoes one or more rotations to restore balance. The rotations include single and double rotations (left and right rotations). The key benefit of AVL trees is that they ensure that the tree remains balanced, which guarantees that the height of the tree is logarithmic in relation to the number of elements. As a result, AVL trees provide efficient O(log n) time complexity for insertion, deletion, and searching operations, even in the worst-case scenario. While AVL trees offer strong balance guarantees, the overhead of maintaining balance can make them less efficient than simpler binary search trees for some specific use cases. However, they are widely used in scenarios where a self-balancing tree is required to guarantee consistent performance across various operations.",2, 4871,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an avl tree is a balanced binary tree with balance factor balancing all the nodes,1, 4872,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a balanced BST in which the balance factor is 1 or -1,1, 4873,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is a type of tree in which height of the tree is balanced ,1, 4874,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a self balancing tree which balance itself when a new value is inserted,1.5, 4875,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"Self balancing BST 4 types of shifting takes place RR,LR,RL,LL",0.5, 4876,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a self balancing binary struture tree that uses tree traversal to sort the elements inside the tree to achieve the difference between the left subtree and right sub tree as 1,2, 4877,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree defined as a self-balancing Binary Search Tree where the difference between heights of left and right subtrees for any node cannot be more than one.,2, 4878,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Height Balanced bst are avl,1, 4879,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Avl tree is a balanced binary search tree ,1, 4880,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing binary search tree,1.5, 4881,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL Tree is a self-balancing binary search tree where the height of the left and right subtrees of any node differs by at most one.,1.5, 4882,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced binary tree which have balancing factor -1 0 1.,1.5, 4883,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"A balanced tree in which for every node, the difference in the height of its left subtree and right subtree is either -1,0,1",1.5, 4884,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"It is a self balancing binary tree, it performs rotations to keep the tree balanced.",1.5, 4885,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it sia self balancing tree ,1, 4886,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is and tree which followes the rule that bigger element goes to right side and smaller element goes to left side and the we check its degree and degree remains between -1 to 1.,2, 4887,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Advance form of Bst which resets its height as required and the max height difference being 1.,2, 4888,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL IS PART OF BST IN WHICH THE MAXM DIFFRENCE OF HEIGHT OF LEFT SUB TREE AND RIGHT SUB TREE IS 1 ,2, 4889,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),IN AVL TREE THERE IS BALANCING THAT TAKES PLACE ,1, 4890,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an avl tree is an advance form of bst because it also has the condition of miimum height which is achived by various rotations,1.5, 4891,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree defined as a self balancing search tree where the difference between heights of left and right subtree for any node cannot be more than one,1.5, 4892,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced binary search tree where left element is shorter than root and right element is big than root,0.5, 4893,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree is a self balancing binary search tree. At any given instance the difference in heights of left and right subtree of any given subtree is not more than one. if upon insertion a case as such arises it is handled by rotations which keep the tree balanced.,1.5, 4894,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),BALANCED BST,1, 4895,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a improved bst in dsa which helps us to traverse tree in a efficient way of only log(n) where n=height of tree.,0.5, 4896,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A height-balanced binary tree where a balance factor balances each node.,0.5, 4897,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced BST,0.5, 4898,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a self balancing bst whose complexities for various operations is maintained at log(n) ,1, 4899,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a type of balanced binary tree,1, 4900,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node cannot be more than one.,1.5, 4901,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL trees are used in situations where you require efficient search, insertion, and deletion operations, and you want to ensure a balanced structure to prevent worst-case performance",1, 4902,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a self balanced binary search tree is a avl tree,1, 4903,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a self balancing binary search tree where height of the left subtree and right subtree cannot be more than 1,2, 4904,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balanced tree where every node has a balance factor of atmost 1,2, 4905,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a type of bst tree, which balances itself in order to maintain a balance factor of each node 0,1 or -1.",1.5, 4906,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a balanced BST. height of the left and right subtrees differ by atmost 1.,2, 4907,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is balanced BST where each node must have balance factor either 1,0,-1.Balance Fcator=height of leftsubtree-height of rightsubtree",2, 4908,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing binary search tree,1, 4909,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL is a tree such it rotates it's branches to balance itself.,1, 4910,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Balanced Binary Search Tree is called an AVL tree and does all balanced and search operations,1, 4911,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"avl tree is a self balanced tree with factor ranging from -1,0,1 and has height of log n.",2, 4912,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"avl tree is self balanced tree , it is balced by self while inserting and deleting",1, 4913,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),these are self balancing trees which balances itself using various rotations,1, 4914,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree.,1, 4915,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is balanced binary search tree,1, 4916,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 4917,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"Avl tree is a BST where each node has a balance factor of 0,1,-1",2, 4918,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an AVL tree is a self-balancing binary search tree ,1, 4919,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"an avl tree is a balanced search tree with balanced factor of all nodes in [-1,0,1].",2, 4920,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a self-balncing tree in which balancing factor is either 1,0,-1. Balancing factor-height->leftsubtree-height->rightsubtree",2, 4921,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an avl tree is a height balanced binary search tree,1, 4922,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL Tree is a self balancing binary search tree.,1, 4923,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL TREE IS TREE WHICH BALANCES ITSELF BY MAINTAING THE RIGHT AND LIFT NODE AND NOT GETTING IT MORE THAN 2 OR -2,1, 4924,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is the self balancing binary search tree where the difference between the left height and right height is atmost one.,1.5, 4925,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a self balanced binery search tree.,1, 4926,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A AVL tree is a balanced binary search tree where the difference between left and right child is at most 1.,1, 4927,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 4928,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),n AVL tree defined as a self-balancing Binary Search Tree,1, 4929,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an avl tree is a balanced bst,1, 4930,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A type of binary tree which help retrieve data in and do rotations.,0.5, 4931,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL Tree is a self-balancing binary search tree that can perform certain operations in logarithmic time,1, 4932,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node cannot be more than one.,1.5, 4933,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 4934,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 4935,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced binary search tree.,1, 4936,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is self balancing binary search tree,1, 4937,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is Balanced Binary Search Tree,1, 4938,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an avl tree is a type of bst that can balance itslef.,1, 4939,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"A tree where the height of left sub tree and right subtree id always -1,0,1",1, 4940,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balancing binary search tree,1, 4941,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a type of height balanced binary search tree in which every node can atmost have one more number of child in either side if compared to the other side,1, 4942,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing tree ,1, 4943,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL Tree is a self-balancing binary search tree.,1, 4944,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing bst,1, 4945,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a self balancing binary search tree.,1, 4946,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Self balancing Binary Search Tree,1, 4947,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Avl tree is a balanced binary search tree whose height of each node is mod(height(left tree) - height(right tree)) <= 1 Here we use rotation(4 types) to fullfill the requirement,1.5, 4948,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced binary search tree,0.5, 4949,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a height-balanced binary tree where a balance factor balances each node,1, 4950,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL Tree is a self-balancing binary search tree where the heights of the two child subtrees of every node differ by at most one.,1.5, 4951,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is BST along with a balance factor(which is height of left subtree-right subtree) and balance factor can only be 1,0,-1",1.5, 4952,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL TREE IS A TYPE OF TREE WHICH HAS THE SAME PROPERTY AS A BST BUT A BALANCED FACTOR IS MAINTAINED ALWAYS WHEN A NODE IS INSERTED OR DELETED SO THAT IT BECOMES A SELF BALANCED TREE,1.5, 4953,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing bst,1, 4954,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an avl tree is another form of binary search tree but here we also consider balance factor that i the height difference betweeen left tree node and right tree node that should not be greater than 1 if it is than we perform some rotation to solve it ,1.5, 4955,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced binary search tree,0.5, 4956,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL trees are self balancing binary trees which can be used to store nodes,1, 4957,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL is a self balancing BST tree , we perform rotations to keep it balanced .",1, 4958,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a tree data structure in which the elements with lower value than the root are stored in the left and values greater than root are stored in the right. Also, each node has a balance factor of -1, 0, or 1. Balance factor is the difference between the height of a nodes left child and the nodes right child",2, 4959,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced binary search three where the height for every node must not be more than 1,2, 4960,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A balaned BST is called AVL tree in which balance factor and height of each node is maintained and suitable rotations are performed for the same,2, 4961,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced binary search tree,1, 4962,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL IS A TYPE OF BST in which smallest number is present at leaf node,1.5, 4963,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is a balanced binary search tree in which each subtree is also a balanced binary search tree itself,1.5, 4964,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a type of binary search tree which is balanced as height difference between the left subtree and right subtreee should not be more than 1 ,1.5, 4965,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 4966,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"is is balanced tree it maintance balance by rotation ll,lr,rr,rl it is almost like complete tree",2, 4967,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a self balanced binary searh tree,1.5, 4968,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"avl tree is a type of binary tree in which the balanced factor at each node is either 1,0,-1",0, 4969,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced binary tree in which height of each node is maintained,1.5, 4970,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A self balancing BST which uses rotations,1.5, 4971,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree, named after its inventors Adelson-Velsky and Landis, is a self-balancing binary search tree. In an AVL tree, the height of the left and right subtrees of any node (or the balance factor) differs by at most one. This balance property ensures that the tree remains relatively balanced and maintains efficient search, insertion, and deletion operations. AVL trees are a type of balanced binary search tree.",2, 4972,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL Tree is a type of Binary Search Tree, in which the elements are inserted according to increasing inorder and the height of the tree is minimised by rotating the nodes.",2, 4973,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a type of tree in which the height difference of the left tree and the right tree of the root cannot be more that 1,1, 4974,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A self balanced binary search tree.,1, 4975,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is bst with balance factor between -1 and 1,1.5, 4976,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),absolute of left height -right height <=1 for each node,1.5, 4977,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"an AVL tree is a self balancing tree where the balance factor, i.e, the difference of the height of the left subtree and the height of the right subtree is <= 1",2, 4978,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL is a self balancing Binary search tree. Whenever you insert or delete , it balances itself.",1.5, 4979,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is type of balanced tree in which we use rotations to balance the tree,1.5, 4980,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"avl tree is a balanced binary search tree in which we do rotations if the balance factors are equal to 2,-2 by specific rotations ",2, 4981,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it is a self balancing tree with each node having balance factor either -1, 0, 1",1.5, 4982,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a balanced binary tree.,1, 4983,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balanced bst,1, 4984,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing binary search tree which has a balance factor which can be either 0 1 or -1 only . ,1.5, 4985,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it is a self balancing BST where balance factor can be 0 , 1, -1",1.5, 4986,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a height balance tree,1, 4987,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balanced binary search tree where the balance factor of each node can only be 0 1or -1,1.5, 4988,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node cannot be more than one.,2, 4989,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An avl tree is a balanced binary search tree.,1, 4990,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 4991,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is an unbalanced tree which made balanced with th help of rotations like LL, RR, LR and RL.",2, 4992,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it is a BST in which the difference of height of right side and left side cannot be other than -2,-1,0,1,2",1.5, 4993,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a balanced tree having balance factor either -1,0,1.",1.5, 4994,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL is balanced binary tee .,1, 4995,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced binary search tree.(A balanced binary search tree has at most 2 children),2, 4996,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing binary search tree,1, 4997,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A balanced BST is known as an AVL tree in which the abs(height of left tree - height of right tree) <=1,1.5, 4998,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Self height balancing Tree,1, 4999,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Avl tree is a self balancing binary search tree it balances the tree on it own on insertion,1.5, 5000,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced BST where each node has its balance factor either 0 or 1,1.5, 5001,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree is a self-balancing binary search tree.,1, 5002,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a balanced tree in which left elements are smaller than root node and in right there are bigger elements than root node,1.5, 5003,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is balanced binary search tree whose insertion include valid rotation.,1.5, 5004,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"a highly balanced binary search tree where every node has balance factor either 1,0 or -1",1.5, 5005,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An avl Tree is balanced Binary search tree with heght upto O(logn),1, 5006,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced binary search tree,1, 5007,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"balanced BST tree with balancing factor(leftheight-rightheight) 0,1,-1 is called an AVL tree",1.5, 5008,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a type of tree which ensures the searching of an element in O(LogN) fashion. It balances height of the tree according to the balance factor. ,1.5, 5009,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree is a self balancing Binary Search Tree,2, 5010,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing tree,2, 5011,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree balanced bainary tree,2, 5012,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a type of advace bst in which the nodes gets automatically adjusted in such a way that the number of levels on either side of the root are equal or they have difference of 1 in them and it is also applicable for sub trees,2, 5013,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"avl tree is a balanced BST , it has a balance factor which balances itslef if the factor goes below -1 or above 1.",2, 5014,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0.5, 5015,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a binary search tree that is height balanced,2, 5016,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),type of BST in which every node is balanced,2, 5017,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"when all the nodes in the bst have balanced height that is 0, -1, 1",2, 5018,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),BALANCED BST BINARY SEARCH TREE AND BALANCE FACTOR <=1,2, 5019,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced binary search tree whose insertion include correct rotation,2, 5020,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is balanced BST,2, 5021,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"balanced tree where the difference of the left subtree and right subtree is either 0,1,-1",2, 5022,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0.5, 5023,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced bst where balance factor lies between --1 to 1,2, 5024,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL TREE IS TYPE OFTREE IN WHICH KEY ARE IN SORTED WAY AND BALNCE FCTOR IS 1,0,-1",2, 5025,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a balanced tree that do rotations based on height of subtree. they take less time for searching,2, 5026,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL TREE IS A BST WHICH CONSIST OF SMALLER ELEMNET IN LEFT AND LARGER ELEMENT IN RIGHT WITH RESPECTIVE TO ROOT NODE .,2, 5027,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"an avl tree is a updated version of binary search tree where every element has balance factor (1,-1,0) which makes it balanced tree. ",2, 5028,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing bst,2, 5029,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a type of binary search tree which is having a extra feature i.e. it is balanced at each node that is the balace factor in avl tree around each node is -1 or 0 or 1. ,2, 5030,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree is a balanced binary tree where absolute value of balancing factor is either 0 or 1 ,2, 5031,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Balanced Binary Search Tree,2, 5032,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"all the nodes have balance factor -1,0 or 1 only",2, 5033,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An avl tree that is kept on the name of its german scientists is a self balancing tree that balance its leaf nodes on by checking the balance factor. if the balance factor is greater than 1 then it balances it by performing rotations like left rotaion, right rotation. ",2, 5034,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a balanced search tree and we can perform different rotations on avl tree,2, 5035,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl trees are self balancing balanced tree structures which use rotations in order to balance theeselves,2, 5036,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced binary tree in which left elements are less than its right elements. We use rotation when tree is not balanced to get AVL tree.,2, 5037,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a self height balancing binary tree,2, 5038,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balances binary search tree(BST),2, 5039,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is ,2, 5040,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left,2, 5041,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a balanced by binary search tree ,2, 5042,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a balanced binary search tree. the,2, 5043,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is balanced tree.,0.5, 5044,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is balanced tree where every tree has a heap,0.5, 5045,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a a form of BST and moreover it is an autobalancing tree. in it the nodes should have value: -1,0,1 to find the value left-right ",2, 5046,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing binary search tree ,2, 5047,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a self balancing binary search tree. It maintains its height of logn after each insertion.,2, 5048,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a tree which has maximum balance factor 1. difference between no. of child nodes in left and right subtree is not more than 1.,2, 5049,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balanced heighted tree.,0.5, 5050,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is a Self balanced balanced search tree.,2, 5051,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a type of binary search tree in which there is a balancing factor. Balancing factor is the difference of number of child in its left and number of childs to its right. the balancing factor should be either -1,0 or 1.",2, 5052,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balanced binary search tree,2, 5053,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a self balancing BST. The difference in heights of it child(left and right) is at most 1.,2, 5054,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A self balancing binary tree ,0.5, 5055,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"In an AVL tree, for every node, the heights of the left and right subtrees can differ by at most one. If at any time during an operation (such as insertion or deletion), the height difference between the left and right subtrees exceeds one, the tree undergoes rotations to restore the balance.",2, 5056,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing ,2, 5057,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Height balanced and follows the properties of BST ,2, 5058,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An avl tree is a balanced BINARY SEARCH TREE WHERE THE DEGREE OF EVERY LEAF NODE IS EITHER -1 , 0 or 1 ",2, 5059,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"It is a self-balancing tree which on every insertion checks for the balance of the tree and if disturbed, performs rotations to balance it.",2, 5060,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is the type of BINARY SEARCH TREE where balance factor should be 0,-1,1",1, 5061,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Self Balancing Bst Tree,1.5, 5062,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is the balanced binary search tree.,1.5, 5063,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a bst tree which is always balance itself by rotations during insertion and deletion,1.5, 5064,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing binary search tree.,1.5, 5065,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is the tree in which elements are arranged in sorting manner means on left side the elements value is decreasng and vice versa on right side,1.5, 5066,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"its a self balancing binary search tree, using the height of the nodes to make the tree balanced",1, 5067,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree has a property of self balancing by rotating in according to the balance factor,1, 5068,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced binary tree in which a balanced factor is calculated which is height of left subtree minus the height of right subtree.,1.5, 5069,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),IT is a self balancing tree ,1.5, 5070,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl is balanced binary search tree where it balances out itself after doing required rotations,1.5, 5071,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL is a balanced binary search tree where at each node difference of height of right subtree and height of left subtree is either -1, 0, 1.",1.5, 5072,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced binary tree,1, 5073,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Self balancing tree are AVL tree which balances it self with rotations.,1.5, 5074,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"avl tree is a balancing tree using the height of the nodes and performing 4 rotations r,l,rl,lr",1, 5075,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it ia a balanced binary search tree,1.5, 5076,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced search tree where balancing factor is checked after every inserion and if not baalanced then suitable rotation is done,1.5, 5077,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing bst,1.5, 5078,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing binary search tree,1.5, 5079,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a BST but in AVL tree the balance factor should always be maintained,1, 5080,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"its a binary search tree in which balancing factor of every node is either 1,0 or -1",1.5, 5081,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing binary search tree,1.5, 5082,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an avl tree is an self height balancing binary search tree in which difference of height of left and right subtree cant be greater than zero,1, 5083,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a self balancing tree which balances the index of each and every node,1, 5084,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing binary tree with balcing factor of atmost 1,1, 5085,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"It is designed to maintain a balanced structure to ensure that the tree remains relatively shallow, which helps in achieving efficient search, insert, and delete operations. In an AVL tree, the height of the left and right subtrees of any node (the balance factor) can differ by at most 1.",1, 5086,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 5087,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is a self balancing binary search tree,1.5, 5088,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self Balanced Binary search tree,1.5, 5089,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a balanced binary search tree in which every node is balanced. balance factor can't exceed 2 in a balanced binary search tree . hence it is called an avl tree.,1.5, 5090,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree is a balanced tree where each node has a child , left child is less than node and right child is greater than node.",2, 5091,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Self Balancing Binary Search Tree,1.5, 5092,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is also known as self balanced binary search tree.In this the balancing factor of each element or node is either -1,1 or 0.",1, 5093,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),tree which follow characteristics if bst and also have balance factor from 1 to minus.,1.5, 5094,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a self balancing tree,1, 5095,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Self balancing BST,1.5, 5096,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"avl tree is a balanced binary search tree with a balancing factor(height of left subtree-height of right subtree) of -1, 0, 1 .",1.5, 5097,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a ds in which the heiht of the tree is kept minimum as it can be and it is balanced,1, 5098,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right should be -1,0,1",1, 5099,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AN AVL TREE IS A TYPE OF BINARY SERACH TREE IN WHICH (NO OF LEFT CHILD - NO OF RIGHT CHILD<2),1.5, 5100,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"an AVL tree is a self balancing Binary search tree in which if the balancing factor, i.e., the height of the left subtree minus the height of the right subtree is more than 1 or -1 then the tree is unbalanced and rotations are performed ",1.5, 5101,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),IT IS A SELF BALANCING TREE.,1.5, 5102,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a tree with the lowest time complexity possible in a bst,1, 5103,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing tree in which balance factor is used to balance the height of the nodes in tree.,1.5, 5104,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL is a self balancing binary tree which is perfectly height balanced and requires only 0(logn) time in searching.,1.5, 5105,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a self balancing tree which can have height only {0,1,-1}",1, 5106,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"an avl tree is a self balancing binary search tree,",1, 5107,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL is height balanced Binary Search Tree,1.5, 5108,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"avl tree is a bst tree in which no of diff between no of left node AND RIGHT NODES OF EVERY ELEMNT is in range of -1,0,1 ",0.5, 5109,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an AVL tree is a self-balancing binary tree in which height of two child subtrees differ by atmost 1.,2, 5110,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 5111,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a self balancing tree . it has height component for each node , if height >=abs(1) then , that 's correct avl tree",2, 5112,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),its a height balanced tree following the properties of BST i.e left child is greater than right child ,2, 5113,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"A balanced binary search tree, where for all nodes the balance factor in between -1,0 and 1.",1, 5114,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"the diff bw left nd right ht of every node is balanced ie either -1,0,+1",2, 5115,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL Tree can be defined as height balanced binary search tree in which each node is associated with a balance factor which is calculated by subtracting the height of its right sub-tree from that of its left sub-tree.,2, 5116,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A self balancing binary search tree.,2, 5117,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is a self-balancing Binary Search Tree where the height difference of right and left subtrees. And balancing factor of any node any node cannot exceed one.,1, 5118,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 5119,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"The AVL tree is named after its inventors, Georgy Adelson-Velsky and Evgenii Landis, who published it in their 1962 paper “An algorithm for the organization of information”.",2, 5120,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing binary search tree.,1, 5121,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 5122,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),IT IS SORTED AND Balanced bst,1.5, 5123,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree, named after its inventors Adelson-Velsky and Landis, is a self-balancing binary search tree. It is designed to maintain its balance by ensuring that the height of its two child subtrees (the left and right subtrees of any node) differ by at most one. This balance property helps to keep the tree height logarithmic, ensuring efficient operations such as insertion, deletion, and searching.",0.5, 5124,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a self balancing binary search tree that maintains a balance factor for each node whose absolute value is always less than 1 to avoid skewness,2, 5125,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl treee is a binary tree in which the height of both the left and right sides are equal or having a height difference of not more than mod{1},0.5, 5126,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a BST which is balanced,0.5, 5127,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a bst which balances itself at every unbalanced insertion ,0.5, 5128,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing binary search tree which mains balance strictly.,0.5, 5129,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),tree in which height is maintained to balance the tree,0.5, 5130,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree is a Self Balancing Binary Search Tree in which the nodes are balanced ,2, 5131,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is a type of binary search tree in which difference between height of left subtree and right subtree cant be more than one.,0.5, 5132,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a type of balanced binary search tree,0.5, 5133,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),IT IS HEIGHT BALANCE TREE AND AT ANY NODE ITS LEFT TREE HEIGHT - RIGHT TREE HIGHT SHOULD BE LESS THAN AND EQUALABS(1),0.5, 5134,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an avl tree is a balanced binary tree,0.5, 5135,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Self height balancing Binary Search Tree is called AVL tree.,0.5, 5136,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is an self balancing binary search tree,2, 5137,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Balanced Binary tree in which every vertex has diff of left and right subtree > 1,2, 5138,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it is bianry searc tree with balancing property using 1,0,-1",1.5, 5139,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a type binary tree which is balanced in nature,1.5, 5140,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL is a balanced binary search tree.,1.5, 5141,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing binary search tree ,2, 5142,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is bst with a property not having height more than 1,2, 5143,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced BST.,1.5, 5144,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a tree of balanced binary search tree,2, 5145,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A binary tree in which the height difference of both the children for any particular node is not greater than mod 1,0.5, 5146,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node ...,1.5, 5147,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing bst,0.5, 5148,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing binary search tree is AVL tree,1.5, 5149,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree), AVL tree is a height-balanced binary tree where a balance factor balances each node,0.5, 5150,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a balanced tree where each node has height either 0 or 1.,1, 5151,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is strictly height balanced tree .Larger element is right and smaller element is left side and the height of left - height of right is always less than and equal to 1 at every node,1.5, 5152,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing binary search tree in which the level must exceed -1 to 1,1, 5153,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a self balancing BST ,2, 5154,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Avl tree is a self balancing bst tree in which we insert element and ,1, 5155,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a self balanced binary search tree which balances on insertion and deletion and whose balance factor of node is <=1 or -1,1.5, 5156,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a self adjusting tree that involves the rotions for reducing time complexity of insertion to O(N),2, 5157,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing binary search tree,2, 5158,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL Tree is the self balancing binary search tree.,1.5, 5159,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a balanced binary search tree ,1, 5160,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a tree in which every node is balanced with a balancing factor of -1 0 1,1.5, 5161,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a binary search tree that balances itself as to maintain the least height possible,1, 5162,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"an avl tree is a balanced binary search tree which means the balance factor of each node is of 1,0,-1 . the bf=left height-reight height.",0.5, 5163,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node cannot be more than one.,0.5, 5164,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 5165,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"self balancing tree which uses rotation when balance factor is other than -1,0,1",2, 5166,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree), in how they select and place elements in a sorted sequence.,1.5, 5167,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a balanced BST in which balancing is done using roations,2, 5168,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 5169,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is tree where the left value of child is smaller than the root and the right value is grater than the root,1, 5170,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a self balanced tree is called an avl tree,2, 5171,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree), self-balancing binary search tree,2, 5172,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a balanced binary search tree,2, 5173,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a self balancing tree,2, 5174,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Its nest level of a binary search tree where it balances itself according to the height of the tree.,1, 5175,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"every node should heifht difference 0,1,-1.",1, 5176,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A tree where the difference in height of left subtree and right subtree is not greater than or less than |1|,2, 5177,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it is a self balancing BST in which the balancing factor must be 0,1,-1 and node cannot be more than 1.",1, 5178,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing BST,1.5, 5179,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is Self balancing binary search tree.,0.5, 5180,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a self balancing tree which with the help of rotations balance itself when a new element is inserted and if the tree becomes unbalanced.,1.5, 5181,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an avl tree is a balanced tree which consist the max value at the most right side of tree and smallest at the most left side of tree.if the data if smaller than node goes to left side and if bigger then goes at the right.,0.5, 5182,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a self balancing tree,1.5, 5183,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balanced binary search tree ,0.5, 5184,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"Self-balancing binary search tree , WHERE DIFFERNCE BW LEFT AND RIGHT NODE SHOULD NOT BE MORE THAN 1 OR-1",1.5, 5185,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"avl tree in which height of each element is 0,-1,1 and left node is less than root and right is greater than root",1, 5186,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balanced BST,1.5, 5187,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl is a binary tree which has 0 1 -1,1, 5188,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a self-balancing Binary Search Tree with parameter as height,1.5, 5189,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"in avl rotaion we use sevveral type of rotation like ll,rr,lr,rl,and balnce the tree",1, 5190,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a type of binary search tree with added property of maintaining balanced factor(-1,0,1)",1.5, 5191,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing binary tree,1.5, 5192,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 5193,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree is a self-balancing binary search tree.,2, 5194,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a height-balanced binary tree where a balance factor balances each node.,1.5, 5195,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is type of bst where the net count of nodes on left-nopdes on right is stored ,2, 5196,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL Tree (Adelso is a self-balancing binary search tree in which the heights of the two child subtrees of any node differ by at most one. This ensures that the tree remains balanced, resulting in efficient search, insertion, and deletion operations. It's a type of balanced binary search tree.",2, 5197,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing binary search tree,2, 5198,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is the self balancing tree which balances itself when the particular condition got failed. the condition is that the absolute difference between the height of the left and right tree should not be greater than 1.,1.5, 5199,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is also knows na self balancing tree having height [-1 to 1,1.5, 5200,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"is a self-balancing binary search tree that maintains its balance by ensuring that the height difference between the left and right subtrees (known as the ""balance factor"") of any node is limited to no more than 1. In other words, an AVL tree is a balanced binary search tree in which the heights of the left and right subtrees of any node differ by at most one.",1, 5201,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a balanced BST. Basically it is a Binary Search tree with balanced height which is 0,1,-1.",1.5, 5202,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree), An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node ..,2, 5203,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"the tree in which every single node has the difference of its leftsubtree height and right subtreeheight between -1 and 1(-1,0,1)",1.5, 5204,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced binary search tree is called AVL tree,1, 5205,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a height balanced binary search tree,2, 5206,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree), AVL tree is a height-balanced binary tree where a balance factor balances each node.,1.5, 5207,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a balanced binary search tree ,2, 5208,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a balanced binary search tree,1.5, 5209,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 5210,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A self balancing Binary Search Tree where the difference between heights of left and right subtrees is known as balancing factor. ,1, 5211,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a special type of tree which balances itself.,1, 5212,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL Tree is a self balancing tree, in which each node has it's own balancing factor.",0.5, 5213,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"Tree traversal, also known as tree search, is a process of visiting each node of a tree data structure. During tree traversal, you visit each node of a tree exactly once and perform an operation on the nodes like checking the node data (search) or updating the node.",0, 5214,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"a tree in which balance factor is {-1,0,1}",1, 5215,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a balanced binary search tree with balance factor is 0,0.5, 5216,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL Tree can be defined as height balanced binary search tree in which each node is associated with a balance factor which is calculated by subtracting the height of its right sub-tree from that of its left sub-tree.,1, 5217,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),in avl there is a particular restrictiuon ,0, 5218,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL is an auto balancing binary tree. Its can automatic balance a tree such that each node can have +1,0,-1 values",2, 5219,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Balenced Binary Search tree-Balanced using balance factot,0.5, 5220,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVLTree is a self-balancing binary search tree that can perform certain operations in logarithmic time. It exhibits height-balancing property by associating each node of the tree with a balance factor and making sure that it stays between -1 and 1 by performing certain tree rotations.,2, 5221,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node cannot be more than one.,2, 5222,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a balanced binary search tree,1, 5223,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree), avl tree is a balanced tree which have balance factor between -1 to 1,2, 5224,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a height-balanced binary tree where a balance factor balances each node.,1.5, 5225,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL trees are those trees which which a tree is balanced with respect to the opposite branch of the root i.e. the difference of the hieght of each subtree should be either 0 or 1.,1.5, 5226,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is balanced binary search tree and it is balanced factor between -1 and 1,2, 5227,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node cannot be more than one.,2, 5228,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing tree which uses balance factor and rotation mechanism,1, 5229,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),alv tree is a binary search tree in balancing factor of a root node cannot be more than 1,2, 5230,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a height-balanced binary tree where a balance factor balances each node.,1, 5231,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),IT IS A HEIGHT BALANCED TREE WHERE BALANCE FACT6OR BALANCES EACH NODE,1, 5232,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),in which each node is balanced(a node is balanced when the absolute difference if its left subtree height and height of the right subtree is not greater than 1),2, 5233,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balance binary tree,0.5, 5234,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balanced binary search tree and and guarentee insertion deletion in log base 2(n) complecity which is better than normal bst,1, 5235,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL Tree can be defined as height balanced binary search tree in which each node is associated with a balance factor.,1, 5236,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),n AVL Tree is a self-balancing binary search tree in which the heights of the two child subtrees of every node differ by at most one.,1.5, 5237,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL Tree can be defined as height balanced binary search tree in which each node is associated with a balance factor.,1, 5238,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing tree using balance factor,1, 5239,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a height-balanced binary tree where a balance factor balances each nod,1, 5240,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a type of bst but elements are insetered on the basis of height of each node by doing sort of rotations to maintain balance of whole tree,1, 5241,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree are self balancing binary tree ,1, 5242,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is self balancing tree which adjust its hight after insertion of each node,1, 5243,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a height-balanced binary tree where a balance factor balances each node,1, 5244,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a height-balanced binary tree where a balance factor balances each node. A balancing factor is a difference between the height of the left subtree and the right subtree. For a node to be balanced, it should be -1, 0, or 1",2, 5245,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is balanced binary search tree,1, 5246,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree), AVL tree is a height-balanced binary tree where a balance factor balances each node. A balancing factor is a difference between the height of the left subtree and the right subtree. ,1, 5247,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing bst,1, 5248,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing binary tree,1, 5249,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it is a tree konwn as self balancing tree which have hight of -1,0,1",1, 5250,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing tree,1, 5251,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"a special type of binary search tree in which heigh of every element is 1,-1or 0",1, 5252,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"in which we maintain a balanced tree where height can only be 0,1,-1",1, 5253,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 5254,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"In computer science, an AVL tree (named after inventors Adelson-Velsky and Landis) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Lookup, insertion, and deletion all take O(log n) time in both the average and worst cases, where � n is the number of nodes in the tree prior to the operation. Insertions and deletions may require the tree to be rebalanced by one or more tree rotations.",2, 5255,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL TREE is a balanced Binary Search Tree, balance factor = length of(left sub tree - right sub tree) must be either -1,0 or 1 for each node.",2, 5256,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"Balanced Binary search tree where balance factor at each node is -1,0 or 1",1, 5257,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree), a self-balancing Binary Search Tree (BST) where the difference between heights of left ,1, 5258,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an AVL tree is self balancing binary search tree,1, 5259,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is self balancing binary search tree ,1, 5260,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Type of tree which has balanced sides and data is inserted following the height of each node.,2, 5261,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balance binary search tree,1, 5262,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"Avl tree is a bst in which all the nodes should have a balancing factor in the set{0,1,-1}",2, 5263,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a balanced binary search tree,1, 5264,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing tree,1, 5265,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is a balanced binary search tree ,1, 5266,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced bst,1, 5267,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),An Avl tree is a tree with balanced height at every node,2, 5268,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Avl tree is a self balancing bst that checks for the balance factor of every node and the adjusts the height accordingly.r ,1.5, 5269,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),A self-balancing binary search tree where the heights of the two child subtrees of any node differ by at most one.,2, 5270,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is balanced bst,1, 5271,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is balanced search tree,1, 5272,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it is a type of tree where trees balance themselves and so the absolute difference between the left and right subtree if betwen (-1,1).",2, 5273,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl is a typr of balanced binary search tree,1, 5274,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Self Balancing Binary Search Tree,1, 5275,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),in which each node is assigned a number based on its height,1.5, 5276,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a self balancing binary search tree,1, 5277,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL is balanced binary search tree where we check for (balance factor=height of left subtree-height of right subtree) as well while insertion, if bf is in { -1, 0, 1} set then it is balanced",2, 5278,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing tree,1, 5279,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a minimum length binary tree,1, 5280,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Self-balancing binary search tree,1, 5281,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it is a self balancing tree,in this all the nodes lie in the range of the balancing factor",1.5, 5282,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing bst,1, 5283,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an avl tree is a self balancing binary search tree,1, 5284,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancingh tree ,1, 5285,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"balacing an tree in 0,1,-1 way means height should be balanced so it will take less time",1, 5286,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it is a type of Binary search tree which is based on balancing factor if not balanced like For a node to be balanced, it should be -1, 0, or 1 then it balaned by rotation",2, 5287,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),tree in which height should be balanced at each node,1, 5288,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing tree,1, 5289,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is a kind of structure made from different nodes in form of tree.,1, 5290,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a self balancing bst,0.5, 5291,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a balanced binary search tree. each node should be balanced. every elemenmt smaller than the node's data is sored in its left subtree and greater one in its right,2, 5292,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing binary search tree,1, 5293,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is self balanced binary search tree,0.5, 5294,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl tree is a binary search tree in which data less than root is stored on left part of root and data greater than root is stored on right part of root,2, 5295,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing binary search tree,1, 5296,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing bst,0.5, 5297,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),avl is self balancing tree where the difference of left height and right height is no more than one,1, 5298,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Self-balancing binary search tree,1, 5299,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL is self balancing binary search tree.,1, 5300,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing binary search tree where every node has balance factor less than equal to 1,1, 5301,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Height balanced BST,1.5, 5302,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it a aform of balanced bst where each node has balance factor as -1, 0 1;",2, 5303,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"it is a balanced bst where each node has balanced factor 0,-1,1. balanced factor= left height-right height of subtree.",2, 5304,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL TREE IS A TYPE OF BALANCED TREE ,1, 5305,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree), self balancing tree,0.5, 5306,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced bst with balancing factor 0 -1 1,2, 5307,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),balanced BST is AVL tree,1, 5308,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"BST, balance factor",1, 5309,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is a self balancing binary search tree,1.5, 5310,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing bst,1.5, 5311,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),height balanced binary search tree,1.5, 5312,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),What is the AVL tree? AVL tree is a height-balanced binary tree where a balance factor balances each node,1.5, 5313,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL Tree (Adelson-Velsky and Landis Tree) is a self-balancing binary search tree where the height difference between the left and right subtrees of any node (called the balance factor) is at most 1. This balance property ensures efficient operations like insertion, deletion, and search with a time complexity of O(log n).",2, 5314,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a type of binary tree in which the element is sorted in a way that it has no more that |1| power on it i.e. elements on right are not 1 more that elements on left of a node,2, 5315,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a height-balanced binary tree where a balance factor balances each node. A balancing factor is a difference between the height of the left subtree and the right subtree. For a node to be balanced, it should be -1, 0, or 1.",2, 5316,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a self balancing binary search tree. places elements evenly ,2, 5317,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),an avl tree is a simple tree in which the balance factor needs to be not more than 1 and not less than -1 and this balance factor is calculated by subtracting the height og left subtree and the height of right sub tree,2, 5318,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),BALANCED TREE,2, 5319,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a tree which maintians blance factor to evey node,2, 5320,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a tree in which height of left side of BST and height of BST of right tree is less than or equal to 1,1.5, 5321,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL Tree is a self-balancing binary search tree that can perform certain operations in logarithmic time,2, 5322,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"An AVL tree, named after its inventors Adelson-Velsky and Landis, is a self-balancing binary search tree (BST) data structure. It is designed to maintain balance in the tree by ensuring that the height of the left and right subtrees of any node (called the balance factor) differs by at most one. This balance factor is used to determine when and how the tree needs rebalancing after insertion or deletion operations.",2, 5323,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing bst,1, 5324,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),tree based on rotation of nodes where difference between left and right is always maintained to less than equal to 1,1.5, 5325,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"tree based on rotation of nodes where difference between left and right is from -1,0,1",1.5, 5326,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a height-balanced binary tree where a balance factor balances each node.,1.5, 5327,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property.",1.5, 5328,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),It is balance search tree.,0.5, 5329,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 5330,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),a self-balancing Binary Search Tree (BST) where the difference between heights of left,1.5, 5331,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"self balancing tree with a balancing factor range(-1,0,1)",1.5, 5332,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 5333,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing tree which use its height facotr ,1.5, 5334,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),SELF BALANCING BINARY SEARCH TREE.IT ENSURES THAT A BST GROWS EQUALLY IN ALL DIRECTION AND PREVENT SQUEUENESS IN TREE,1.5, 5335,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it has more than two childrens . An AVL tree defined as a self-balancing Binary Search Tree (BST) where the difference between heights of left and right subtrees for any node cannot be more than one.,1.5, 5336,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"special case of BST where a balance factor is maintained(BF=0 OR 1 OR -1), IF NO THEN REQUIRED ROTATIONS ARE PERFORMED.",1.5, 5337,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"A balancing tree, a kind of BST",1.5, 5338,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),Avl tree is a type of balanced Binary Search tree,1.5, 5339,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 5340,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"A HEIGHT BALANCED TREE WHOSE BALANCING FACTOR LIES IN RANGE {-1, 0, 1} A BST CAN BE BALANCED VIA LL, RR, LR ,RL ROTATIONS MAKING IT AVL",2, 5341,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AVL tree is a self balancing tree which maintains it balnace factor in a range of -1,0 or +1 by rotating the nodes as per LL, RR, LR or RL rotation cases",2, 5342,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),IT IS COMPLETE BST WITH EACH NODE HAVING ALL SMALLER TO IT ELEMENTS ON ITS LEFT AND ALL GREATER TO IT ELEMENTS T ITS RIGHT,2, 5343,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),,0, 5344,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree), a height-balanced binary tree where a balance factor balances each node.,1, 5345,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing tree(using balancing factor method ands rotation),1, 5346,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"AvL is a balanced binary search tree where the a balance factor is defined which can be only -2, -1,0,1,2 given as BF=( lchild-rchild)",1.5, 5347,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),SRTRICTLY HEIGHT BALANCE BST,1.5, 5348,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),self balancing bst,1.5, 5349,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),AVL tree is a self balancing binary serach tree which worst time complexity is also o(log(n)).,1.5, 5350,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),vising eachg node in systematic way,1.5, 5351,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),"It is BST in which the difference between the left subtree and right subtree should be (-1,0,1).",1.5, 5352,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),What is an AVL Tree?,1.5, 5353,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),it is balanced tree,1.5, 5354,What is an AVL Tree?,AVL trees are height balancing binary search trees. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-subtree) − height(right-subtree),strictly balanced binary search tree,1.5, 5355,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5356,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure that satisfies the heap property. In a max-heap, for any given node, the value of the node is greater than or equal to the values of its children. In a min-heap, the value of the node is less than or equal to the values of its children.",1, 5357,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a heap is a priority queue which holds properties that the root element has higher value compare to child nodes,1.5, 5358,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure that satisfies the heap property, which means that the parent nodes have a specific order with respect to their children. It is commonly used for implementing priority queues.",2, 5359,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a tree in which every nodes are in specific order.,0.5, 5360,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure in which all the nodes of the tree are in a specific order.,1.5, 5361,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a tree in all the nodes are in specific order,2, 5362,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap data strucutre, also know as priority_queue is a data structure that allows us to fetch stored info in a specific order i.e, ascending or descending.",0.5, 5363,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap tree is a special type of tree in which wither every parent is either greater then their children which means root will be maximum or root will be min and every parent node is less than their children,1, 5364,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5365,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a special type of binary tree data structure that maintains a partial order among its elements,1, 5366,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a storage type data structure which stores data in either a min_heapify or max_heapify heiarchhy,0.5, 5367,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5368,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5369,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","their are two types of heap(max heap,min heap) max heap in which parent node has greated values then other node.min heap has lowest value than other node",1.5, 5370,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a non-linear data structure that can be used to maintain priority queues etc as it maintains an order in the tree (minimum or maximum). The root is always minimum or maximum, and every subtree is itself a heap.",0.5, 5371,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-like data structure with elements organized to quickly find the highest or lowest priority element. It's commonly used for implementing priority queues and sorting algorithms like heapsort.,2, 5372,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure in which all the nodes of the tree are in a specific order.,0.5, 5373,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5374,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5375,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a type of complete binary tree.,0.5, 5376,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a tree-based data structure in which all the nodes of the tree are in a specific order. For example, if is the parent node of , then the value of follows a specific order with respect to the value of and the same order will be followed across the tree.",2, 5377,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", a tree-based data structure in which all the nodes of the tree are in a specific order.,1, 5378,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", Heap is a special Tree-based data structure in which the tree is a complete binary tree. In heap we insert data from left to right.,1.5, 5379,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a special tree-based data structure in which the tree is a complete binary tree. And the root value is less or more than the children depending upon type of heap ie max-heap or min heap.,0.5, 5380,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5381,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5382,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","It is a special type of tree , it has two types Max heap- parent node must be greater than left child node and must be greater than equal to right child node and Min Heap -parent node must be smaller than left child node and must be smaller than equal to right child node ",1, 5383,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,1.5, 5384,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a specialized tree-based data structure that satisfies the heap property. It is commonly used to implement priority queues. Heaps can be classified as max-heaps (the parent is greater than or equal to its children) or min-heaps (the parent is less than or equal to its children).,0.5, 5385,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a priority queue,2, 5386,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",is a tree type data structure which satisfy the heap properties,0.5, 5387,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap are of two type max and min and are based on tree data structure,1, 5388,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","heap data structure can be seen as a collection of non linear data structure segments such as k-ary trees, they resemble what we may call a ""forest"" in the competitive programming world.",2, 5389,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5390,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a complete binary tree in which all the leaf nodes should be on same level,0.5, 5391,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Priority elements are maintained on top of the tree(Priority elements can be minimum or maximum or any other). Thus allows efficient access of priority elements,1, 5392,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","heap is a special data structure in which all the nodes are in specific order, in min heap root is smaller than the children and in max heap root is greater than the children.",1.5, 5393,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",its a binary tree,2, 5394,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",HEAP IS THE SECONDARY MEMORY AVAILABLE FOR THE DATA,0.5, 5395,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5396,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5397,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a type of tree data structure which based on complete binary tree,2, 5398,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure in which all the nodes of the tree are in a specific order,1, 5399,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5400,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure in which all the nodes of the tree are in a order such that the value of nodes decreases top to down.It can be implemented by a 1D array.,0.5, 5401,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a binary tree in which either all the children of a node have values less than the node, or all the children of a node have values greater than the node.",2, 5402,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure in which the parent nodes satisfy a specific ordering property, often used for efficient priority queue operations.",1.5, 5403,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","in heap, the tree is a complete binary tree.",0.5, 5404,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure, commonly implemented as a binary heap, used to efficiently maintain the maximum (or minimum) element in the collection and perform operations like insertion and extraction efficiently.",2, 5405,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a tree-based data structure that satisfies the heap property, used for efficient priority queue operations. It can be a max-heap (parent nodes have greater values) or a min-heap (parent nodes have smaller values).",1, 5406,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1.5, 5407,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", tree-based data structure in which all the nodes of the tree are in a specific order,2, 5408,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a special tree-based data structure where the tree is a complete binary tree. It is a type of tree that satisfies the heap property. Heaps are useful when you need to remove the item with the highest (or lowest) value.,2, 5409,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a data structure which sorts the whole data structure automatically.,2, 5410,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,2, 5411,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a heap is a special data structure in which the tree is a complete binary tree and nodes are in a specific order.,2, 5412,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure that satisfies the heap property. It is a complete binary tree, meaning that all levels of the tree are filled except possibly the last one, which is filled from left to right",2, 5413,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is type of data structure ,2, 5414,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap can store multiple values at the same level,2, 5415,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5416,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a specialized binary tree-based data structure that satisfies the heap property. It can be a min-heap (where the parent is smaller than its children) or a max-heap (where the parent is larger than its children).,1.5, 5417,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a tree based data structure where the nodes are in a specific order.,1.5, 5418,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,2, 5419,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a type of ds where memory is stacked on each other sequentially,2, 5420,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure that satisfies the heap property, which ensures that the parent node's value is either greater than or less than its children's values, depending on whether it's a max-heap or a min-heap, respectively. Heaps are commonly used for priority queues and efficient sorting algorithms like heap sort.",2, 5421,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5422,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a priority queue implemented using binary tree data structure,2, 5423,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","a heap is a kind of binary search tree. here the data is organised in either max to min format or viceversa on thr base of levels. there are 2 kinds of heap tree, max and min depending on there node and the leaf value.",2, 5424,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",HEAP DATA STRUCTURE IS A PRIORITY QUEUE WHERE WE CAN FIND THE MINIMUM AND THE MAXIMUM ELEMENT,1, 5425,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a data structure that stores data in one place and gives priority to certain data,1, 5426,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure that satisfies the heap property. It is an essential data structure used in algorithms for efficient priority queue operations, such as extracting the element with the highest (or lowest) priority.",1, 5427,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is the reallocated memory that is alloted,1, 5428,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a special type of binary tree which satisfies heap properties.,1, 5429,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",The heap is a nearly-complete binary tree where the parent node could either be minimum or maximum. The heap with minimum root node is called min-heap and the root node with maximum root node is called max-heap.,2, 5430,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a data structure that stores elements in a tree is such that the root element is either the maximum/minimum element of the tree,2, 5431,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5432,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",node can have atmost two children,2, 5433,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a complete binary tree, and the binary tree is a tree in which the node can have utmost two children.",1, 5434,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a priority queue in which we can find minimum and maximum element,1, 5435,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",tree in which all bottom element(childrens) are small or large,1, 5436,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5437,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",linear data structure used to store data by priority,1, 5438,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5439,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap data structure is a type of binary tree which have heap algorithm,1, 5440,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap data structre is max heap and muin heap where everey tree rootnode max or rootnode minmum to their child nodes,1, 5441,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5442,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5443,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5444,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5445,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5446,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5447,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5448,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a special tree-based data structure in which the tree is a complete binary tree. It is used to represent a priority queue.,1, 5449,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",every cfhild of the root is either smaller or greater,1, 5450,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",HAVEN'TSTUDIED YET.,0, 5451,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a data structure in which data in is stored in no particular order,1, 5452,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a tree-based data structure that maintains a specific order between parent and child nodes, often used for priority queue operations.",1, 5453,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,1, 5454,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",?,0, 5455,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5456,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", A Heap is a special Tree-based data structure in which the tree is a complete binary tree. there are different type of heap such as min heap and max heap .,2, 5457,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5458,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is either a min or max heap. Used to get max or minimum in O(1),1, 5459,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5460,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a specialized binary tree-based data structure that satisfies the heap property. It can be a min-heap (where the parent is smaller than its children) or a max-heap (where the parent is larger than its children).,2, 5461,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","heap is a data structure that follows a heap property , majorly of two types maxheap tree and minheap tree",2, 5462,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","In computer science, a heap is a specialized tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is a parent node of C, then the key (the value) of P is greater than or equal to the key of C. In a min heap, the key of P is less than or equal to the key of C.[1] The node at the ""top"" of the heap (with no parents) is called the root node.",2, 5463,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is the ,0, 5464,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a binary tree structure used for efficient priority queue operations, with the highest or lowest priority element at the root.",1.5, 5465,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure that satisfies the heap property. Heaps are often used to implement priority queues and provide efficient access to the element with the highest (or lowest) priority. There are two common types of heaps: 1. **Max Heap**: - In a max heap, for any given node, the value of that node is greater than or equal to the values of its children. This means that the largest element is at the root. - Max heaps are used to efficiently find and remove the maximum element, making them suitable for priority queues. 2. **Min Heap**: - In a min heap, for any given node, the value of that node is less than or equal to the values of its children. This means that the smallest element is at the root. - Min heaps are used to efficiently find and remove the minimum element, also for priority queue implementations. Common operations on a heap include: - Insertion: Adding a new element to the heap while maintaining the heap property. - Deletion: Removing the maximum (in a max heap) or minimum (in a min heap) element from the heap. - Peek: Viewing the maximum or minimum element without removing it. - Heapify: Converting an array into a heap data structure. - Heap Sort: Sorting an array using a heap. Heaps are often implemented as binary trees, where each level of the tree is fully filled except possibly for the last level, which is filled from left to right. The binary heap structure allows for efficient operations, with insertions and deletions taking O(log n) time complexity, and finding the maximum or minimum element in O(1) time complexity. Heaps are useful in various algorithms and data structures where maintaining priorities or ordering elements based on a certain criteria is crucial.",2, 5466,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","heap is of two types max heap, min heap. a max heap has the elements in the order that the parent node is greater than the child node . the min heap has elements in order that the parent node is less than the child node element. it has various operations like insertion,deletion,sorting,heapify,priority queue.",2, 5467,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a memory in the computer system which is used to assign memory dynamically.,0, 5468,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a specialized tree-based data structure that satisfies the heap property:,0, 5469,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5470,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5471,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5472,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5473,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a type of data structure which is stored in an array but visualised in tree, it is of two types max heap and min heap",2, 5474,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1.5, 5475,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a specialized tree-based data structure where each node is greater than or equal to its children (Max-Heap) or less than or equal to its children (Min-Heap).,2, 5476,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure that satisfies the heap property, used primarily for priority queues.",1.5, 5477,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5478,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5479,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a priority queue.,0.5, 5480,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",large data in data strauctutres is known as heap data structure,0, 5481,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is an datastructures,0, 5482,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",unused memory,0, 5483,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5484,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",NODES OF TREE ARE IN SPECIFIC ORDER IS HEAPS,0, 5485,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a type of memory outside of main which is allocated through malloc during run time,0, 5486,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5487,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","heap is a data structure that follows a heap property,two types are maxheap and minheap",1.5, 5488,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap has a tree like data structure with a complete binary tree which stores values and pops them based on it type meaning that a heap is either a maxheap or a minheap based on the ordering of elements,2, 5489,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",memory is stored dynamically in a form of tree,0, 5490,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a data structure in which we can store data in a very sufficient manner by providing them a unique key,0.5, 5491,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", A tree-based data structure in which all the nodes of the tree are in a specific order.,1, 5492,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", a tree-based data structure in which all the nodes of the tree are in a specific order.,1, 5493,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5494,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a memory used while dynamic memory allocation,0, 5495,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1.5, 5496,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","Heaps are used in a variety of applications where efficient retrieval of extreme values (maximum or minimum) is required, such as scheduling tasks in operating systems, graph algorithms (e.g., Dijkstra's algorithm), and certain types of priority queues.",2, 5497,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a heap is a form of queue,1, 5498,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a tree based data structure. It is a complete tree,1, 5499,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5500,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", Heap is a special Tree-based data structure in which the tree is a complete binary tree. Heap Data Structure Operations of Heap Data Structure: Heapify: a process of creating a heap from an array.,1, 5501,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5502,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is similar to stack used for function execution and it is a storage memory for any function..,0.5, 5503,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap invlolves hashing in iit,0.5, 5504,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a specialized tree-based data structure that satisfies the heap property,0, 5505,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",its just like tree but maximum element coming to the top,1, 5506,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",used to store data.,0.5, 5507,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",dynamically allocated memory,0, 5508,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a complete binary tree,0.5, 5509,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a useful data structure when it is necessary to repeatedly remove the object with the highest (or lowest) priority, or when insertions need to be interspersed with removals of the root node. ",1, 5510,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure that satisfies the heap property. It is an essential data structure used in algorithms for efficient priority queue operations, such as extracting the element with the highest (or lowest) priority.",1, 5511,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5512,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a type of complete binary tree.,0.5, 5513,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",special tree based data structure,0.5, 5514,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",type of a complete binary tree.,0.5, 5515,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a heap is a data structure which store element in such a way that parent element is always greater than child elements.it can be used to sort an array in O(n) time complexity,1.5, 5516,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5517,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is that tree which is a complete binary tree.,0.5, 5518,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5519,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",It is the special tree based structure where the tree is a complete binary tree.,1, 5520,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a special tree which is a complete binery tree,1, 5521,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a type of complete binary tree , the nodes are arranged in specific order.",0.5, 5522,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5523,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5524,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",unused memory,0, 5525,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a method for efficient storage of data by using unique key id.,0, 5526,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", a heap is a specialized tree-based data structure that satisfies the heap property,0.5, 5527,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5528,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5529,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a type of complete binary tree. it can be of two types max and min. in max heap all parent nodes are grater than both their child nodes and in min heap the parent nodes are smaller than thier child nodes.,2, 5530,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a tree-based data structure that maintains the heap property, which is used for efficient priority queue operations.",0.5, 5531,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a heap is a special tree based data structure in which the tree is a complete binary tree,1, 5532,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a special Tree Based Data Structure.,0.5, 5533,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is the data structure where all the dynamic data structures are created.,0.5, 5534,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree,1, 5535,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is special type of tree which is completed binary tree,1, 5536,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",head is a priority queue in which the max element element if at the top and decreasing accordingly as we go deep,0, 5537,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5538,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a specialized tree-based data structure with the heap property.,0.5, 5539,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",data structure where element get sorted auto,0, 5540,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5541,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5542,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","heap is complete binary tree which means except the last level all the levels should be complete filled, also Heap follows heap order property i,e max heap order property and min heap order property. In max heap , left and right node of a root should be less than root node value , this should be true for all the nodes and vice versa for min heap",2, 5543,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a priority queue sorted with respect to a variable.,0, 5544,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure in which all the nodes of the tree are in a specific order.,1, 5545,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap in data structure is a specialized binary tree that satisfies the heap property. It is often used to implement priority queues.,0.5, 5546,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heaps are dynamically allocated memory spaces,0.5, 5547,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",HEAP IS DATA STRUCTURE OF A TREE IN WHICH THE TREE IS A COMPLETE BINARY TREE,1, 5548,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a special type of binary tree data structure that maintains a partial order among its elements.,1, 5549,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a a type of tree data structure but int whcih tree is in complete form it has leaf nodes,0.5, 5550,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a dynamic memory in the memory,0.5, 5551,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is used for priority queue in which the topmost node or root has most important data,1, 5552,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",we store pairs in it,0, 5553,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a tree data structure,0.5, 5554,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a heap is a complete binary tree.,1, 5555,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a heap is a type of tree in data structures ,1, 5556,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a heap is a complete binary tree.,1, 5557,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",structure in which the tree is a complete binary tree.,1, 5558,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5559,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a complete binary tree ,0.5, 5560,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5561,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is nonlineare data structure which has certain property like maxheap and min heap and is complete tree,1.5, 5562,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5563,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a complete binary tree. ,1, 5564,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5565,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5566,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a specialized tree-based data structure that satisfies the heap property. The heap property is a condition that determines the arrangement of elements within the heap. ,1.5, 5567,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a type of structure in which the elements are placed in order of priority, just like a tree.",1, 5568,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", a heap is a tree based data structure in which all the nodes are placed in a specific order,1.5, 5569,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5570,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",memory,0, 5571,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5572,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",type of a data structure in which the binary tree is a complete binary tree,1.5, 5573,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is bst in which either Maximum value is at top or minimum,1.5, 5574,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5575,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5576,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A HEAP is a data structure in which the tree is a complete binary tree.,1.5, 5577,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5578,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","binary tree which follows 2 heap properties ie complete binary tree and heap propery(min,max)",1.5, 5579,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",structure in which a tree is a complete binary tree,1.5, 5580,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",complete binary tree,1, 5581,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a data structure in which the tree is a complete binary tree.,1.5, 5582,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",tree based data structure where ,1, 5583,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1.5, 5584,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap data structure is a complete binary tree.,1, 5585,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5586,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5587,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is the where the memory is allocated,1, 5588,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5589,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is non linear data structure.,1, 5590,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5591,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a tree like data structure either there is a max heap or min heap.Max heap sparent value is greater than child and min parent value is less than child,1.5, 5592,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5593,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5594,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is memory space where variables of main are stored,1, 5595,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a special tree-based data structure where the tree is a complete binary tree. It is a type of tree that satisfies the heap property,1.5, 5596,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure that ensures efficient retrieval of the highest or lowest priority element.,1.5, 5597,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5598,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1.5, 5599,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5600,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a storage ,0.5, 5601,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",non linear data structure,1, 5602,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",data structure in which tree is complete binary tree,1, 5603,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a type of data structure which is implemented as a complete binary tree and follows heap property (max and min),1.5, 5604,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A type of data structure which is a complete binary tree. It has types such as max heap,min heap, etc.",2, 5605,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a tree-based data structure in which all the nodes of the tree are in a specific order,2, 5606,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure in which all the nodes of the tree are in a specific order,2, 5607,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5608,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5609,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5610,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a tree is a complete binary tree,2, 5611,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure that satisfies the heap property. Heaps are commonly used to efficiently implement priority queues and are essential in various algorithms and data structures. There are two main types of heaps: the binary heap and the binomial heap, with binary heaps being more commonly used.",2, 5612,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a collection of things thrown one on another,0.5, 5613,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree,2, 5614,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5615,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5616,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is tree data structure where max element is the root of tree,2, 5617,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a tree-based data structure in which all the nodes of the tree are in a specific orde,0.5, 5618,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5619,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap data structure which a heap,0.5, 5620,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5621,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",HEAP IS INSIDE CPU TO STORE DATA ,0.5, 5622,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","heap in a kind of temporary memory in data structures which can be invoked if between the code if we reuire some temporary memory which can be deleted automatically . it helps us in managing storage and makes code storage effecient,",2, 5623,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5624,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5625,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5626,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5627,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is non linear data structure,0.5, 5628,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a data structure where the elements are interconnected or interlinked witrh each other and forms a heap. ,2, 5629,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a heap is a special tree in which tree is complete binary tree,2, 5630,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5631,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a special Tree-based data structure in which the tree is a complete binary tree.,2, 5632,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5633,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5634,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a tree-based data structure in which all the nodes of the tree are in a specific order,2, 5635,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,2, 5636,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5637,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5638,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5639,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5640,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it stores data more easily tan array,2, 5641,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5642,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5643,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5644,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",collection of data in a heap form .,2, 5645,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure in which all the nodes of the tree are in a specific order.,2, 5646,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5647,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap data structre in which tree is complete binary tree,2, 5648,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a binary tree in which each node has a smaller key than its children. This property is called the heap property.,2, 5649,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5650,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure that satisfies the heap property. It is an essential data structure used in algorithms for efficient priority queue operations, such as extracting the element with the highest (or lowest) priority.",2, 5651,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5652,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a non linear data structure ,0.5, 5653,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap data structure is a heirachical representation of data ,2, 5654,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5655,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is unorganized data set,1, 5656,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5657,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a complete data structure which give height of a node,1.5, 5658,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",PRIORITY QUEUE,1, 5659,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5660,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",itis just similar to stack for executing.,1, 5661,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree structure in which the tree is a complete binary tree.,1, 5662,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a complete binary tree. A max-heap is a complete binary tree in which the value in each internal node is greater than or equal to the values in the children of that node. A min-heap is defined similarly.,1.5, 5663,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5664,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",special tree data structure in which the tree is a complete binary tree.,1, 5665,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is used to perform priority queue operations such as extracting the elements with highest and lowest priority,1.5, 5666,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap tree is a binary tree with the property of heap that is the root is maximum or minimum,1, 5667,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5668,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Having greatest or smallest at top and vice versa at bottom,1, 5669,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5670,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a complete binary tree,1, 5671,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5672,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5673,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",structure in form of complete binary tree,1, 5674,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","What is a heap in data structures? Heaps/Priority Queues Tutorials & Notes | Data A heap is a tree-based data structure in which all the nodes of the tree are in a specific order. For example, if is the parent node of , then the value of follows a specific order with respect to the value of and the same order will be followed across the tree",1, 5675,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5676,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a array data structures which can be visualised in the form of tree,1, 5677,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is sort of binary tree in which parent is always minimum or maximum than two of its two children depending upon the type of heap,1.5, 5678,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", a heap is a tree which consists of a complete binary tree types of heap are max heap and min heap,1.5, 5679,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","heap is a tree data which follows heap properties max heap(root is the largest ),min heap(root is smallest)",1.5, 5680,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5681,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5682,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5683,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5684,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5685,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is tree created from an array,1, 5686,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5687,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5688,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",basically data is stored in the heap part of or memory.,1.5, 5689,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","a type of complete binary tree, which either has all its children lesser or greater than it",1.5, 5690,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A data structure in which the tree is a complete binary tree ,1, 5691,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a treebased data structure where the tree is a binary tree,1.5, 5692,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5693,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1.5, 5694,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",HEAP IS A CONCEPT USED IN DATA STRUCTURE TO MAKE PROGRAMMING MORE EASY AND EFFICIENT.,1, 5695,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",memory allocated dynamically is in the heap ,1.5, 5696,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",WHEN TREE IS A COMPLETE BINARY TREE IT IS A HEAP.,1, 5697,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5698,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",in which ,1.5, 5699,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a complete binary tree, and the binary tree is a tree in which the node can have utmost two children. ",1, 5700,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is the dynamically allocated memory,1, 5701,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure in which all the nodes of the tree are in a specific order,1.5, 5702,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Complete Binary Tree,1.5, 5703,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5704,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap data structure is a complete binary tree that satisfies the heap property. The heap property is that for every node in the heap, the key of the parent node is either greater than or equal to (in a max heap) or less than or equal to (in a min-heap) the keys of its children.",2, 5705,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5706,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a kind of complete binary tree in which node adds from left child,2, 5707,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",its a non linear data structure ,1, 5708,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","heap is a complete binary structure, where first left nodes are inserted before right. ex max heap(parent more than children) and min heap(parent less than children)",1, 5709,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5710,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,2, 5711,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A complete binary tree having a node value either greater or smaller than its left and right subtree.,1.5, 5712,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",It is a special Tree data structure in which the tree is a complete binary tree.,2, 5713,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5714,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5715,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",sequence of elements in a sorted order.,1, 5716,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5717,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5718,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure that satisfies the heap property. A heap can be represented as either a binary tree (usually in the form of an array) or as a binary search tree, but it is not a typical binary search tree used for searching. ",1, 5719,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5720,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a data structure in which the tree is a complete binary tree and ,1, 5721,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is tree with all nodes in a specific order,2, 5722,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",priority queue,1, 5723,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is the complete binary tree.in it maximum is at the top and elements lesser are below,1, 5724,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5725,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a tree based structure in which ,1, 5726,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5727,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",great for implementation,2, 5728,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",IT IS BALANCE BINARY TREE ,1, 5729,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a data structure that comprises of a complete binary treee,1, 5730,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a data structure implemented using trees. Two types : min heap : the root node is always smaller than the values in the subtrees. max heap : the root node is always greater than the values in the subtrees.,2, 5731,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a data structure which can be max heap and min heap max heap has a property that parent node is max and vice versa for min heap,1, 5732,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap stores a key value pair for any other data structure,1, 5733,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5734,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a type to tree created from an array,1.5, 5735,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is data structure where we store values according to reference an din collection.,1.5, 5736,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5737,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a type of priority queuee in which it is two type max and min heap . In max heap all the child has value less than parent and min heap all the child has value graeter than parent,1.5, 5738,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5739,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",great for implementation,1, 5740,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",data structure in which tree is a complete binary tree,1.5, 5741,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure in which all the nodes of the tree are in a specific order,1.5, 5742,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5743,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",dfgs,0.5, 5744,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure in which all the nodes of the tree are in a specific order,1, 5745,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",data unordered stored as heap,1.5, 5746,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children."," a heap is a specialized tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is a parent node of C, then the key (the value) of P is greater than or equal to the key of C. In a min heap, the key of P is less than or equal to the key of C.[1] The node at the ""top"" of the heap (with no parents) is called the root node.",1, 5747,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a non linear data structure ,2, 5748,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a colllection of values,1.5, 5749,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","a heap is a specialized tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is a parent node of C",1.5, 5750,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is bst in which every child node is less or greater than its parent node and this follows in subtrees as well and for every node,1, 5751,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5752,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0.5, 5753,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap in data structure is the collection of previous maximum or minimum values.,1, 5754,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is array rerpresentation of tree where maxnode is above all nodes and follows similar fashion in all nodes,1.5, 5755,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",its a ds that is used for dynamic allocation of elements,1, 5756,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5757,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5758,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5759,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5760,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5761,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a type of complete binary tree .elemts are insertion one by one ,1, 5762,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",its a priority queue,1, 5763,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5764,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",tree created from an array,1, 5765,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a complete binary tree in which the parent is either bigger or smaller than both of its child nodes,1, 5766,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","a heap is a specialized tree-based data structure that satisfies the heap property: In a max heap, for any given node C",1, 5767,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a form of a tree that hav max or min element at parent of very node,2, 5768,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5769,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a tree-based data structure in which all the nodes of the tree are in a specific order.,1, 5770,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5771,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5772,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is an example of complete binary tree where elements are inserted one by one,1.5, 5773,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5774,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a complete binary tree, and the binary tree is a tree in which the node can have utmost two children. Before knowing more about the heap data structure, we should know about the complete binary tree.",1.5, 5775,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5776,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",tree which is special and complete binary tree,1.5, 5777,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a special based tree in which it is a complete binary tree,1.5, 5778,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",special tree data based structure in which the tree is complete binary tree,1, 5779,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", special type of binary tree data structure that maintains a partial order among its elements.,1, 5780,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5781,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5782,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5783,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",data structure that satisfies the heap property,1, 5784,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5785,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5786,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a data structure and ,1, 5787,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,1.5, 5788,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure that satisfies the heap property. In a heap, for every node, the value of the node is either greater than or equal to (max-heap) or less than or equal to (min-heap) the values of its children nodes.",1, 5789,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a tree-based data structure in which all the nodes of the tree are in a specific order.,1.5, 5790,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5791,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap in data structure is a specialized tree-based data structure that satisfies the heap property. In a min-heap, for example, the parent node has a smaller value than its child nodes, and in a max-heap, the parent node has a larger value than its child nodes. Heaps are often used to implement priority queues.",1, 5792,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a tree based data structure in which nodes are arranged in a particular order,1.5, 5793,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a binary structure which automatically sort the elements when inserted.,1, 5794,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",dynamic memory allocation in tree,1, 5795,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a special tree that satisfies heap properties,1.5, 5796,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",collection of things thrown on one another,1, 5797,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1.5, 5798,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5799,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure in which all the nodes of the tree are in a specific order,1, 5800,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a binary tree having max or min value in 1st node and like a bst,1.5, 5801,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a tree-based data structure in which all the nodes of the tree are in a specific order.,0.5, 5802,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",pecial Tree-based data structure in which the tree is a complete binary tree.,1.5, 5803,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",The heap is one maximally efficient implementation of an abstract data type called a priority queue,1.5, 5804,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5805,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5806,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5807,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap data structure is where all the elements inserted gets sorted itself like a set.,0, 5808,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","Tree traversal, also known as tree search, is a process of visiting each node of a tree data structure. During tree traversal, you visit each node of a tree exactly once and perform an operation on the nodes like checking the node data (search) or updating the node.",0, 5809,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap stores data in maximum at top or minimum at top and this is true for arr sub trees in main tree,1, 5810,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",type of complete binary tree,0.5, 5811,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5812,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is type opf complete binary tree ,1, 5813,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5814,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Max and min binary tree whose root node is either max of itself and it's children and vice cersa,1, 5815,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5816,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5817,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a tree-based data structure in which all the nodes of the tree are in a specific order.,1, 5818,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",not in syllabus,0, 5819,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is an ordered list of elements,0, 5820,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",hear is baically an advanced for,0, 5821,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a complete binary tree,0.5, 5822,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5823,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",data structure with following heap property,0, 5824,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5825,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure in which all the nodes of the tree are in a specific order,1, 5826,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A COLLECTION OF THINGS THROWN ONE ON ANOTHER ,0, 5827,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5828,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5829,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap,0, 5830,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5831,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is same binary tree with some condition s like min heeap and,1, 5832,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5833,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",data structure followuing heap propertyyu,0, 5834,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5835,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5836,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is used for ,0, 5837,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5838,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a tree-based data structure in which all the nodes of the tree are in a specific order. ,0.5, 5839,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", a collection of things thrown one on another : pile. 2. : a great number or large quantity : lot. heap,0.5, 5840,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is data structure where the data is in the for of max numbers layed on top or min numbers layid on top,1, 5841,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5842,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5843,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",in which topmost root have most important data,0, 5844,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",demonically allocated memory ,0, 5845,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5846,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5847,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap in data structure means complete binary tree,0.5, 5848,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5849,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5850,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure that efficiently retrieves the maximum or minimum element. It's used for tasks like implementing priority queues and sorting algorithms.,1, 5851,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",linear data structure,0, 5852,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5853,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5854,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5855,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a heap is a storing space which stores data in a random order.,0, 5856,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",special type of complete binary tree,1.5, 5857,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a type of complete binary tree,1, 5858,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a data stucture in which the tree is complete binary tree,1.5, 5859,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5860,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is a memory stack,0, 5861,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a special type of binary tree data structure that maintains a partial order among its elements.,2, 5862,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a type of graph,0, 5863,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",It maintains a partial order among elements.,0.5, 5864,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a binary tree used for efficient priority queue operations,1, 5865,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",it is tree like structure used for efficient sorting ,1.5, 5866,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5867,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5868,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a tree-based data structure in which all the nodes of the tree are in a specific order. For example, if is the parent node of , then the value of follows a specific order with respect to the value of and the same order will be followed across the tree.",2, 5869,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5870,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5871,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5872,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5873,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5874,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",has mini and max ,1, 5875,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree,1.5, 5876,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",in this the root's left and right child are either greater than root'data for less that root's data,2, 5877,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5878,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a specia; kind of data structure,0, 5879,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",complet binary btree which use min heap or max heap prpoperty,1, 5880,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5881,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a type of tree-based data structure where each node in the tree is arranged in a certain order. If is, for instance, the parent node of, then the values of and will follow the same order across the tree with regard to each other.",2, 5882,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5883,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5884,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Used to simplfy data structure.,0, 5885,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5886,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5887,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5888,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5889,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A Heap is a special Tree-based data structure in which the tree is a complete binary tree.,1, 5890,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5891,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5892,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a complete binary tree,1, 5893,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5894,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",special type of binary tree which is complete binary tree,1, 5895,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is the dynamic memory storage,1, 5896,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Max heap min heap,1, 5897,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",i9t is a form of complete binary tree where the node is the largest element of all the elemnts. this holds true for all the sub trees as well,1.5, 5898,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",root node of the tree is the largest which is applicable to right and left subtree as well,1, 5899,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",HEAP IS TYPE OF DATA STRUCTURE WHICH ASSIGNS DATA DYNAMICALLY USING NEW INT LIKE COMMANDS,1, 5900,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",dynamic memory allocation,0.5, 5901,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",root node is max in max heap and min in min heap,1, 5902,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",non linear DS,0.5, 5903,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",array visualled as tree,1, 5904,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is used where a root is either greater or smaller thn all other nodes of the tree,1, 5905,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",complete binary tree,1, 5906,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",in which memory is assigned dynamically using dynamic memory allocation,1.5, 5907,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",data structure in which tree is a speacial binary tree.,1.5, 5908,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specialized tree-based data structure that satisfies the heap property, which can be a min-heap or a max-heap. In a min-heap, the parent nodes have values less than or equal to their children, and in a max-heap, parent nodes have values greater than or equal to their children. Heaps are commonly used for priority queues and efficient sorting algorithms like Heap Sort.",1.5, 5909,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5910,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a tree-based data structure in which all the nodes of the tree are in a specific order. ,1.5, 5911,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a complete Binary tree following min or max property.,1.5, 5912,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5913,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",stored in heap,1.5, 5914,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Max-Heap: In a Max-Heap the key present at the root node must be greatest among the keys present at all of it’s children. The same property must be recursively true for all sub-trees in that Binary Tree. Min-Heap: In a Min-Heap the key present at the root node must be minimum among the keys present at all of it’s children. The same property must be recursively true for all sub-trees in that Binary Tree.,1.5, 5915,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5916,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",Heap is a special type of binary tree data structure that maintains a partial order among its elements.,1.5, 5917,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.","A heap is a specific tree-based data structure that satisfies the heap property. A heap is often implemented as a binary tree, but it doesn't have to be limited to binary trees. Heaps are commonly used to implement priority queues and are fundamental in various algorithms and data structures. There are two main types of heaps: the max-heap and the min-heap.",1.5, 5918,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a tree that stores,1.5, 5919,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",where tree is a complete binary tree,1.5, 5920,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",where tree is complete binary tree,1.5, 5921,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", heap is a tree-based data structure in which all the nodes of the tree are in a specific order. ,1.5, 5922,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a heap is a specialized tree-based data structure that satisfies the heap property,1.5, 5923,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5924,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5925,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.", data structure in which the tree is a complete binary tree.,1.5, 5926,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5927,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A heap is a complete binary tree in which ,1.5, 5928,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",data structure with following heap sort ,1.5, 5929,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",IT IS A COMPLETE BINARY TREE FOLLOWING MINM OR MAXM PROPERTY,1.5, 5930,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",heap is a special type of binary tree data structure that maintains a partial order among its elements.,1.5, 5931,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5932,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5933,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5934,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5935,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",A HEAP IS A DS WHERE EITHER THE ROOT ELEMENT IS GREATER THAN BOTH LEFT AND RIGHT SUBTREE (MAXHEAP) OR LESS THAN THEM (MINHEAP),1.5, 5936,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",where a node can point to multiple children,1.5, 5937,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5938,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5939,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",a collection of things thrown one on another,1.5, 5940,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",dynamic memory storage,1.5, 5941,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5942,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5943,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5944,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5945,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",linear data structure,1.5, 5946,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5947,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",,0, 5948,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",arrange in lkeve;l order,1.5, 5949,What is a heap in data structure?,"A heap is a special balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. A min-heap has parent nodes with a key value less than its children, and a max-heap has parent nodes with a value greater than its children.",dynamic memory storage,1.5, 5950,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself,1, 5951,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function that calls itself in order to solve a problem. It typically involves breaking down a complex problem into smaller, similar subproblems.",0.5, 5952,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function the call itself,2, 5953,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function that calls itself during its execution, either directly or indirectly, to solve a problem by breaking it down into smaller instances of the same problem.",1.5, 5954,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function which calls itself.,0.5, 5955,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.", a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms.,2, 5956,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function where the the initial variable is called multiple times to get the final calculated output ,0.5, 5957,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function that calls itself inside it.,1.5, 5958,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself,1, 5959,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself is a recursive function.,1.5, 5960,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A Recursive function can be defined as a routine that calls itself directly or indirectly.,2, 5961,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a function which calls itself inside the function.,0.5, 5962,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",which calls itself until base condition runs.,2, 5963,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function has intructions that often lead to repeating the function itself with either the same or different arguments,1.5, 5964,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function calling itself,0.5, 5965,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function that calls itself.,2, 5966,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function that calls itself during its execution, either directly or indirectly. It's a common technique in programming to solve complex problems by breaking them down into smaller, similar subproblems.",1, 5967,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",It is a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms.,0.5, 5968,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",calll itself,1.5, 5969,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function which calls itself until the base condition ,2, 5970,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself upon execution is known as a recursive function.,1, 5971,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function that is capable of calling itself,1.5, 5972,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.", a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms.,0.5, 5973,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is function that calls itself during run time.,2, 5974,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it is a block of code ie function in which it calls itself to repeat he same steps until the base condition is hit.,0.5, 5975,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the functions that call itself aain anfd again are known as recursive function,1, 5976,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,2, 5977,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself using recursive relation and having a base case is a valid recursive function.,1.5, 5978,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function that calls itself is call recursive function,1, 5979,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function that calls itself to solve a problem by dividing it into smaller subproblems. It often involves a base case to stop the recursion and one or more recursive cases that simplify the problem.,0.5, 5980,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function that calls itself again and again till terminating condition is met,1, 5981,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which uses its previous value to find its next term and to make a sequence of terms is recursive function,1.5, 5982,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function calling itself again and agin till the base case is reached,0.5, 5983,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself in it's body/source code is a recursive functon. They need to have some kind of base case otherwise we might end up in an infinite call loop.,2, 5984,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself is called a recursive function. It has a base condition which is used to come out of the recursion. ,1.5, 5985,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function that calls it self with different parameters in the function itself,0.5, 5986,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function calling itself.,2, 5987,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A function calling itself is a recursive function, we use a base case to terminate the recursive stack else it'll go infinitely.",0.5, 5988,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself inside it,2, 5989,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",RECURSIVE FUNCTION IS A SPECIAL TYPE OF FUNCTION WHICH HAVE A TENDENCY TO CALL ITSELF ,1.5, 5990,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself,0.5, 5991,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself ,1, 5992,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself is a recursive function,2, 5993,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which call itself into that function,1, 5994,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which is calls itself again and again until the termination condition is reached is know as recursive function.,0.5, 5995,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which invokes itself in its code block so that the function runs multiple times until it hits the base condition.,2, 5996,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function which calls itself.,1.5, 5997,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function that calls itself in its own definition, allowing it to solve problems by breaking them down into smaller, similar subproblems.",0.5, 5998,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself,1, 5999,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function that calls itself to solve a problem by breaking it down into smaller, similar subproblems, typically used in divide-and-conquer algorithms.",2, 6000,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which call itself,0.5, 6001,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself until base condition is reached,1.5, 6002,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",which calls itself for doing the task,1, 6003,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself again and again itself it's called a recursive function. It applies a check to stop the recursive call when the required condition is achieved.,2, 6004,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls again and again until the base case arrives.,2, 6005,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a function which calls itself,2, 6006,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself.,2, 6007,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function call itself,2, 6008,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a kind of function which calls itself untill its base condition matches to current condition ,2, 6009,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is the function which called again in itself,2, 6010,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a function that calls itself in itself to work on various problems. It also works on the principle of stack.,2, 6011,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function that calls itself directly or indirectly in order to solve a problem. Recursion is a common mathematical and programming concept. ,2, 6012,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is the one which calls its previous function till its condition is satisfied.,2, 6013,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a type of function which calls itself,2, 6014,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function in computer programming that calls itself in order to solve a problem.,2, 6015,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function that calls itself to solve a problem by breaking it down into smaller, similar subproblems.",2, 6016,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",which calls itself again and again until a condition in satisfied,2, 6017,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is the one that calls itself and can be broken down intto smaller functions,2, 6018,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive fuunction is such function where we do not need to type the same code again and again. we ctreate a function for our code and then we call the function again and again wherever necessary.,2, 6019,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A FUNCTION WHICH CALL ITSELF IS CALLED A RECURCIVE FUNCTION,2, 6020,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function that calls itself within the function,2, 6021,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function that calls itself in order to solve a problem. In programming, recursion is a powerful technique that allows a function to break down a complex problem into smaller, more manageable subproblems.",1, 6022,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function calls itself until base condition is reached.,1, 6023,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is one which calls itself,1, 6024,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive Function is a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms,1, 6025,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function that calls itself and terminates at a base case,1, 6026,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6027,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive Function Is A Function Which Can Call Itself Inside The Function,11, 6028,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Function that calls itself simultaneously,1, 6029,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself until the base condition is met,1, 6030,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",that calls it self in stack they all are processed as per their call order,1, 6031,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when a function is called within the function,1, 6032,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself ,1, 6033,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls itself directly or indirectly ,1, 6034,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function which calls itself,1, 6035,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when function call itself then it recursicv3e function and alsio with base case,1, 6036,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself withitn itself ,1, 6037,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recur,1, 6038,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls itself,1, 6039,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function where it is called again inside the same function in order to check its subpart in that function is called recursive function,1, 6040,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when function call itself,1, 6041,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which is called repeatdly in itself to get desired outputs,1, 6042,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself in its body until the return condition is executed is caled recursive function,1, 6043,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself,1, 6044,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which keeps calling itself,1, 6045,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself ,1, 6046,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","a function which calls itself, and which has a base case.",1, 6047,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration."," A recursive function is a function that calls itself to solve a problem by breaking it down into smaller, similar subproblems until a base case is reached, allowing it to solve complex problems.",1, 6048,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself,1, 6049,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function where we define a base case and the function calls itself repeatedly till the termination condition is reached.,2, 6050,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself.,1.5, 6051,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A type of function is which calls itself based upon various constraint we provide,1, 6052,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6053,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function that calls itself,1, 6054,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6055,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function that calls itself directly or indirectly in order to solve a problem.,1.5, 6056,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it breaks the problem into smaller instances and solves them separately,1.5, 6057,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function that calls itself from within itself. It is used for improving time complexity and perform difficult operations with ease.,2, 6058,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function that keeps calling itself.,1, 6059,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function that calls itself ,1, 6060,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function in computer programming that calls itself in order to solve a problem. Recursive functions are often used to solve problems that can be broken down into smaller, similar subproblems. They follow a common structure: 1. **Base Case**: A recursive function has one or more base cases, which are the simplest scenarios where the function returns a result directly without making a recursive call. Base cases are essential to prevent infinite recursion. 2. **Recursive Case**: In the recursive case, the function divides the problem into smaller, often identical subproblems. It calls itself with these smaller subproblems and combines their results to solve the original problem. The recursive process continues until the base case is reached, at which point the function starts ""unwinding"" by returning results from the recursive calls and eventually producing the final result. A classic example of a recursive function is the computation of the factorial of a number. Here's a simple Python example: ```python def factorial(n): if n == 0: return 1 # Base case else: return n * factorial(n - 1) # Recursive case ``` In this function, the base case is when `n` is 0, and the function returns 1. In the recursive case, it calls itself with `n-1` and multiplies the result by `n`. This process continues until `n` reaches 0, and then the results are combined to calculate the factorial. Recursive functions are elegant and can simplify problem-solving by breaking complex problems into smaller, more manageable parts. However, it's important to design them carefully to ensure they reach the base case and avoid infinite recursion.",2, 6061,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself directly or indirectly.,1, 6062,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when a function is called inside a function.,1, 6063,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function which calls itself ,1, 6064,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","recursiv function is function acts like loop , that is , it call itself multiple times entered by user",1, 6065,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Funcion calling itself again and again until the base consition,1.5, 6066,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is the the reptitive calling of a fuction until the given condition is true,2, 6067,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself continously is called a recursive function.It has a base case and a recursive case.,2, 6068,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function that calls itself again and again,1, 6069,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function in we make a base case and then we can make a recusrsive call for the another one,1.5, 6070,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function calling itself,1, 6071,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function that calls itself to solve a smaller instance of the problem.,1, 6072,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive function is a type of function which calls itself.,1, 6073,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6074,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function that calls itself,1, 6075,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls it self i=s a recursive functin ,1, 6076,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is an function wich occur again and again till condition not completed.,1.5, 6077,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself again and again.,1, 6078,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",RECURSIVE FUNCTION IS METHOD IN WHICH FUNCTION CALLS IT SELF UNTIL THE BASE CASE IS SATISFIED,2, 6079,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A FUNCTION THAT CALLS ITSELF UNTIL THE BASE CASE HITS,1.5, 6080,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the calling of a function inside the same functon is called recursive function,1, 6081,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.", a particular function that calls itself repeatedly until a certain condition is met,2, 6082,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it break the program into smaller instances and a function is called itself in his function,1.5, 6083,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is one which calls itself. It has a base case to break out and return the output.,2, 6084,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",FUNCTION CALL ITSELF,1, 6085,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself again & again until a condition is met.,1.5, 6086,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.", A function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms.,2, 6087,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive functions are used to call themselves multiple times to ,1, 6088,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself ,1, 6089,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when function himself again and again,1, 6090,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function that calls itself123. It is essentially a loop with a function, and is used to solve certain problems",1, 6091,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","Recursive functions are powerful and elegant for solving problems that exhibit a recursive structure, but they should be used with care to ensure that the base case is correctly defined and that the recursion eventually terminates. ",2, 6092,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself is av recursive function,1, 6093,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself inside is body so as to perform the operation again and again until the desired condition comes true,1.5, 6094,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls itself,1, 6095,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Function that repeatedly calls itself is recursive function,1, 6096,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself in the function definition.,1, 6097,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",When a function call itself.It is a recursive function.We can implement many function of binaryttree using recursive function as we can solve the problem for root node and then simply call it for root->left then root->right.,2, 6098,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself is recursive function,1, 6099,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive function is used to call the same value as many times as we want.,1, 6100,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Function that repeats itself by calling inside the function itself,1, 6101,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls itslf again and again.,1, 6102,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",rescursive function is those function which use recursion to solve any problem and using recursion stack space,1, 6103,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it is that function which calls itself untill base condition is reached,1, 6104,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration."," a function which references itself. General recursive function, a computable partial function from natural numbers to natural numbers. Primitive recursive function, a function which can be computed with loops of bounded length",1.5, 6105,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a self calling function within itself ,1, 6106,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calss itself over & over untill terminated to perform sometask.,1.5, 6107,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself is a recursive function.,1, 6108,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",to call a function within a function is called recursive function,1, 6109,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is when we call the a function while while in the the same itself.,1, 6110,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function whiich calls itself is called recusive function,1, 6111,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is when the function gets called on its own,1, 6112,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which can call itself directly or indirectly is called a recursive function.,1, 6113,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A FUNCTION THAT CALLS ITSELF ONLY,1, 6114,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",This type of function repeats itself and solves the problem in parts,1, 6115,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function that calls itself within itself ,1, 6116,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function which calls itself until the base case is reached.,1.5, 6117,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6118,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.", a recursive function is a function that solves a problem by solving smaller instances of the same problem.,1, 6119,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself again and again,1, 6120,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which call itself again and again in a defined set.,1, 6121,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive Function is a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms.,1.5, 6122,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A Recursive function can be defined as a routine that calls itself directly or indirectly.,1, 6123,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive a function when function call itself.,1, 6124,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive functions are those which call themselves in the fucntion definiton,1, 6125,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function which call itself,1, 6126,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself is called a recursive function,1, 6127,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Function that calls itself is a recursive function.,1, 6128,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself.,1, 6129,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function that can call itself ,1, 6130,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function calls itself and it stops only when base condition is satisfied,1, 6131,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself in its execution,1, 6132,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function calls itself,1, 6133,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function where the function calls itself.,1, 6134,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",self calling function until base condition,1.5, 6135,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which call itself in the code.,1, 6136,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function inside which the same function is called.,1, 6137,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when function calls the another function itself is called recursive function. Here in insertion i have used recursion,1, 6138,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it calls itself until base condition hits.,1, 6139,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Is a function which calls itself until the base condition becomes false,1, 6140,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function that calls itself to solve a smaller instance of the problem until it reaches a base case.,1.5, 6141,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is function that calls itself,1, 6142,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A RECURSIVE FUNCTION IS A FUNCTION WHICH HELPS THE USER BY CALLING ITSELF WHILE THE USER SOLVES FOR A SINGLE CASE AS WELL AS ALSO WRITES BASE CASE FOR THE PARTICULAR SOLUTION.,1.5, 6143,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function in which the function is called in the function itself,1, 6144,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself to solve problem,1, 6145,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function in which it repeat itself until base condition,1.5, 6146,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself is called recursive function,1, 6147,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function calling itself.,1, 6148,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","a recursive function is a function which calls itself, until an exit condition is reached",1.5, 6149,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself repeatedly.,2, 6150,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself within the function body until the condition for base case is met,2, 6151,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls itself again and again,2, 6152,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is define as it repeat again and again when call,2, 6153,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself till it hits a base condition.,2, 6154,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function that calls itself again and again,2, 6155,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive is a function when function call itself,2, 6156,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",having function under function,2, 6157,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that repeatedly calls itself,2, 6158,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a type of function in which a function calls itself directly or in directly ,2, 6159,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls itself again and again until terminating condition occurs,2, 6160,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself and must have a terminating condition at some point,2, 6161,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function in computer programming that calls itself as a subroutine to solve a problem. Recursion is a powerful and elegant programming technique that allows a function to break down a complex problem into smaller, more manageable subproblems. ",2, 6162,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function which has a terminating condition and it calls itself recursively.,2, 6163,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a type of function which calls itself inside its block,2, 6164,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function calling itself.,2, 6165,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself again and again to perform,2, 6166,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself,2, 6167,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself in it's function body,2, 6168,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself.,2, 6169,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls itself,2, 6170,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it is a function in which we give 1 test case and the recursion executes the other cases by calling itself,2, 6171,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself until a base case is met is called a recursive function.,2, 6172,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a self calling function is called a recursive function.,2, 6173,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls itself,2, 6174,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function call inside the same function ,2, 6175,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself unitl a base ,2, 6176,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",calling the same function multiple time in the same function is called recursive function,2, 6177,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself to perform a specific tasktill a given base condition is reached,2, 6178,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself directly or indirectly,2, 6179,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a function which terminates when reaches a base case and calls itself numerous inside the same function before the base case is reached.,2, 6180,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6181,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive function is a function that calls itself in the function.,2, 6182,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function that calls itself within the function,2, 6183,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A function which calls itself repeatedly till the base condition is met,is called a recursive function.",2, 6184,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",calling it self.,2, 6185,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function calling itself in the same function is called a recursive function.,2, 6186,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that call itself,2, 6187,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function which has a base case to stop the control flow, else it calls itself till the base case is reached. A function which calls itself is known as a recursive function.",2, 6188,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function that calls itself again and again until it reaches a terminating condition,2, 6189,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function which calls itself,2, 6190,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a function thta calls itself again and again,2, 6191,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function that calls itself to solve a smaller instance of the same problem, typically with a base case to terminate the recursion.",2, 6192,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A Recursive function can be defined as a routine that calls itself directly or indirectly.,2, 6193,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function in which function calls itself.,2, 6194,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that call itself,2, 6195,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A unction which calls itself again an again until base condition meeets is recursive function,2, 6196,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when the function is called within itself,2, 6197,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function that calls itself is called the recursive function,2, 6198,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself ,2, 6199,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function that calls itself in its lines of code and has a base condition to end the given recursion,2, 6200,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a fuction where it calls itself until it reaches the base condition .,2, 6201,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function are those which call itself.,2, 6202,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recrusive function is a function which calls itself again and again until the desired result is obtain,2, 6203,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a fuction where it calls itself until it reaches the base condition .,2, 6204,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function calls itself,1, 6205,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",that calls itself a base case is rquired,2, 6206,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself,2, 6207,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself,2, 6208,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",WHICH CALLS ITSELF AGAIN AND AGAIN UNTIL SPECIFIED CONDITION IS MET.,2, 6209,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself inside its own function,2, 6210,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function calling itself in a function,2, 6211,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which call itself multiple times until a base condition is satisfied.,2, 6212,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function which call itself,1, 6213,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",calling the same function inside the function repeatedly with a base case to stop,2, 6214,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",RECURSIVE FUNCTION HELP TO REPEAT A CALL AGAIN AND AGIN,2, 6215,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function uses self looping code to execute redundant operations. it the self calling of the function inside the function,1, 6216,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",RECURSIVE FUNCTION IS FUNCTION WHICH CALL ITSELF AGAIUN AND AGAIN UNTIL AND GIVEN CONDITION IS ATTAINED.,2, 6217,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it is a type of function which calls itself .,2, 6218,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when a function calls itself,1, 6219,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself repeatedly ..,1, 6220,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself repeatedly until its base condition is reached,2, 6221,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",in which the same function is called again and again until termination condition meets,2, 6222,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",funcion that calls itself till condition is reached,2, 6223,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is something that calls itself again and again until the condition stands false. ,2, 6224,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself is called a recursive function,2, 6225,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which recursively calls itself to perform the same function until it reaches the null value or the leaf node ,1, 6226,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a special type of function in which the loop continues to execute until the base condition is fulfilled. Common example is of finding factorial.,2, 6227,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it is a fucntion that keeps calling itself till the base condition is reached,2, 6228,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",calling function repeatedly to form the same type of task,1, 6229,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself is called recursive function.,2, 6230,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.", a recursive function is a function that solves a problem by solving smaller instances of the same problem.,2, 6231,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a a recursive function is a functiom it call itself repat until the condition did not full fill,1, 6232,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","a recursive function is a function one in which the same function is again called. basically, the same function calls itself again inside itself, repeating the steps to be performed.",2, 6233,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function that calls itself.,2, 6234,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0.5, 6235,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",that calls itself until the function ends,2, 6236,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",in it the function call itself inside the function,1, 6237,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive function is a function which calls itself.,1, 6238,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself.,1, 6239,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function that calls itself within itself.,2, 6240,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",These are the functions which are called by itself over and over again.,2, 6241,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is function which calls itself directly or indirectly.,1, 6242,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",that call itself over and over,2, 6243,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself during its execution either directly or indirectly;,2, 6244,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function that calls itself ,1, 6245,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function that calls itself in order to solve a problem. In programming, recursion is a powerful technique that allows a function to break down a complex problem into smaller, more manageable subproblems.",2, 6246,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a ,1, 6247,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive function is a function which we call again and again,2, 6248,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function calls itself again and again until the task is done there are various types of recursive functions like tail recursion etc...,2, 6249,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A function that calls itself is clled a recursive function. It has two parts, one is the base case (to avoid infinite recursion) and second is the recursive call.",2, 6250,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive function is the function which can be called again and again to perform the same function and we do not need to write the entire code again,2, 6251,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is one which calls itself,1, 6252,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",if a function calls itself are recursive function,1, 6253,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that call itself,1.5, 6254,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself in the body of that function is called a recurssive function. it has a base case condition which helps in the termination of a recurssive function,2, 6255,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it is a function which is calling itself.,1.5, 6256,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","its a function which calls itself,untill a condition is applied else till infinity.",2, 6257,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function which calls itself,1.5, 6258,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it is a function which calls itself.,2, 6259,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function which calls itself.,1.5, 6260,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",in a function where we call the same function inside the functio ,2, 6261,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function where the function is called inside the function itself.,1, 6262,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls upon itself till the exit case is not satisfied,1.5, 6263,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function calling it self again and again is called recursive function.,2, 6264,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself repeatedly until conditions are met,2, 6265,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it is a function in which we have to solve one base case and the rest cases are solved using recursive function made by us,1.5, 6266,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a function which calls itself and works until the base case becomes true,1, 6267,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself to return value(or not),1, 6268,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a funtion in which the function calls itself,2, 6269,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","a recursive function is when we call the function in the same code , it backtracks and keeps the code similar and avoids using multiple functions",1, 6270,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",that calls itself,2, 6271,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it is a funcyion which call its selves.,1, 6272,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function in which function is calling itself back ,1.5, 6273,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself inside it.,2, 6274,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself,1.5, 6275,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function in computer programming that calls itself to solve a problem or perform a task. Recursive functions are defined in terms of themselves, which means they break down a complex problem into simpler, similar sub-problems. These sub-problems are solved recursively, with each recursive call working on a smaller or more simplified version of the original problem.",1, 6276,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",we can call function again and again,1, 6277,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function that calls itself,1, 6278,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself ,1, 6279,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which can call itself again and again in main function is a recursive function. ,1, 6280,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function that onto itself.,1.5, 6281,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",which calls itself,2, 6282,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function which is being called itself where ever included or called in a code.,2, 6283,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","in this a function cales itself again and again ,",2, 6284,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself until the base case is met,1.5, 6285,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A method of making function call itself,1, 6286,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a function which calls itself in its definition. it has a base condition which is used to specify when to stop,1.5, 6287,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function that calls itself again and again until a condition is satisfies and the loop breaks,2, 6288,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when a function calls itself.,2, 6289,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A FUNCTION WHICH CALLS ITSELF IS CALLED RECURSIVE,2, 6290,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a function which calls itself inside the function,1.5, 6291,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",PROBLEMS THAT SOLVES PROBLEM BY SOLVING IT'S INSTANCES.,1, 6292,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function that can call itself is known as a recursive function,1.5, 6293,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when the function calls itself again and again.,1.5, 6294,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive function is a type of function in which a function calls itself and compute the required result.,1.5, 6295,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself inside rhe function,2, 6296,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a function which calls itself.,2, 6297,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Calling itself function,1, 6298,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",call function inside the funtion,1, 6299,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recusrive function is one that calls itself again and again as long as the base or terminating condition is not met.,2, 6300,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6301,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is afunction when function call itself,2, 6302,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive func is a func which calls itself,2, 6303,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which call itself and has a base condition to stop it is called recursive function.,1.5, 6304,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that is called again nd again to itself,1, 6305,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function that solves a problem by solving smaller instances of the same problem,2, 6306,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself.,1.5, 6307,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive function is the technique of making a function call itself,2, 6308,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6309,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6310,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function calling itself in its own function.,1, 6311,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6312,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",which calls itself again and again and have a baoundry condition for returning back,1.5, 6313,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function that calls itself to solve a problem.,2, 6314,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself during execution,0.5, 6315,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it is a function that calls itself,2, 6316,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function that repeats it self throughout the code,2, 6317,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself,1, 6318,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself repetitively,1, 6319,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function which calls itself aagin and again to solve the query,1, 6320,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",When the function calls itself again and again,1.5, 6321,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6322,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself inside of it,1, 6323,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",IT IS A TYPE OF FUNCTION WHICH CALL IT SELF AND END AT A PARTICULAR CONDITION,1.5, 6324,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",which calls itself within itself that is we justneed to perform one case rest will be handled by itself.,1, 6325,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which call itself inside the function and terminates on a base case.,1.5, 6326,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function calls itself,1, 6327,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function calling itself untill base case is reached,2, 6328,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",through fuction we call another fucntion without using loops but to run it multiple time,1, 6329,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself again and again within itself is called recursive,1, 6330,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",It iterates throught the whole function again again until base condition is reached,1.5, 6331,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls itself again and again,1.5, 6332,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a funct that call itself,1, 6333,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself.,1.5, 6334,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself inside of it,1.5, 6335,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which class itself in its body,1.5, 6336,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive Function is a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms.,2, 6337,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recall same function within self,1.5, 6338,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when a function call itself with a base condition in the time complexity of O(log(n)) that function is recursive function,1, 6339,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms ,1, 6340,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when a function calls itself in its body ,1.5, 6341,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which call itself,1, 6342,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",having function inside another function,1.5, 6343,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",self callin function,1, 6344,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function which contiunues till the loop end and executes the answer,2, 6345,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when a function is called within itself,1, 6346,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself inside its own definition,1.5, 6347,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function that is called in a function,1, 6348,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls itself over and over again is called recursive function.,2, 6349,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function calling itself,1.5, 6350,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself,1, 6351,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself until a base condition is reached.,1.5, 6352,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself until a given condition is satisfied.,1, 6353,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which call itself,1, 6354,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",which calls itself in aloop untill end condition ececute,2, 6355,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself again and agian until the condition is true,1, 6356,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A Recursive function can be defined as a routine that calls itself directly or indirectly.,2, 6357,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",which calls itself,1, 6358,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6359,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function which calls itself again and again,1, 6360,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself is a rec ursive func,2, 6361,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Function that calls it self ,1, 6362,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",that calls itself again and again,1, 6363,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a func that call itself ,2, 6364,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",rrecursive function calls itself again and again till a case.,1, 6365,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",calls itself.,2, 6366,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself in its body,1.5, 6367,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself during compiling time.,1.5, 6368,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function calls itself,1, 6369,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function calls within a function itself is recursive fuction.,1, 6370,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when we call a function inside itself ,1, 6371,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is when we call the function inside the function to work and implement the code.,1.5, 6372,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when function calls itself it is known as recursive function,1, 6373,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself within its block of code,1, 6374,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.", a recursive function is a function that solves a problem by solving smaller instances of the same problem BY CALLING ITSELF DIRECTLY OR INDIRECTLY,1.5, 6375,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that call on to itself,1, 6376,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",which calls itself many times to solve a problem,1.5, 6377,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6378,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",that calls itself recursively,1, 6379,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",in recursive we call a function in itself,1, 6380,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which call itself inside itself,1, 6381,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it calls again and again to perform the same task ,1, 6382,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6383,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6384,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.", a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms.,1, 6385,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a fuctio0n thnat calls itself on its own,1, 6386,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function that calls itself during its execution. Recursive functions are often used for tasks that can be broken down into smaller, similar subtasks.",1.5, 6387,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself ,1, 6388,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive Functions is when the functions call itself in the function till and base conditions gets hit.,1.5, 6389,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",self calling function,1.5, 6390,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",SELF CALLING FUNCTION IS RECURSION,1, 6391,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself is known as a recursive function,1.5, 6392,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","In other words, a recursive function is a function that solves a problem by solving smaller instances of the same problem.",1, 6393,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function which calls itself until a particular condition is satisfied,1, 6394,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when a function calls itself i.e function calling function,1.5, 6395,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function that calls itself upto its base condition of ending,1, 6396,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive Function is a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms.,1, 6397,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself during its running ,1.5, 6398,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which repeatedly calls itself and is terminated at an termination condition is true,1, 6399,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function call itself.,1, 6400,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6401,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself directly or indirectly.,1, 6402,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a self calling function, where the functions calls itself inside it until it reaches a null values and returns itself inside the function too.",2, 6403,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","Tree traversal, also known as tree search, is a process of visiting each node of a tree data structure. During tree traversal, you visit each node of a tree exactly once and perform an operation on the nodes like checking the node data (search) or updating the node.",0, 6404,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when a function calls itself with different parameters ,1.5, 6405,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself ,1, 6406,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","In other words, a recursive function is a function that solves a problem by solving smaller instances of the same problem. This technique is commonly used in programming to solve problems that can be broken down into simpler, similar subproblems.",2, 6407,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function which call themselves ,1, 6408,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive function are those function which call themself.,1, 6409,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",functon that calls itself,1, 6410,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function in code that refers to itself for execution. Recursive functions can be simple or elaborate. They allow for more efficient code writing, for instance, in the listing or compiling of sets of numbers, strings or other variables through a single reiterated process",1.5, 6411,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls a function itself,1, 6412,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls itself in a function,1, 6413,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursively going back into the fuction,1, 6414,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it repeats its own previous term to calculate subsequent terms,1, 6415,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function called within a function acting as a loop and terminating until the condition is false,1.5, 6416,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",We have to make the function for one element and for other it will compile itself,0.5, 6417,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration."," A recursive function is a function that solves a problem by solving smaller instances of the same problem. This technique is commonly used in programming to solve problems that can be broken down into simpler, similar subproblems.",1.5, 6418,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which call it again and again ,1, 6419,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","outputs;in it ,we repeatedly call the function and p[rimnt certian p",1, 6420,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive Function is a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms.,1, 6421,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",FUNCTION THAT REPEATS AND USES ITS OWN PREVIOUS TERM TO CALCULATE THE SUBSEQUENT TERM,1, 6422,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself in its body,1, 6423,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function call itself,1, 6424,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it is a function in side which it call itself.,1, 6425,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6426,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",fuction call itself,1, 6427,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function that solves a problem by solving smaller instances of the same problem.,1.5, 6428,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it calls itself,1, 6429,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",calling function in same function,0.5, 6430,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function that call itself aagin and again until base case meets,1.5, 6431,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which call itself is called recurrsive,1, 6432,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recusive function are function which call itself many time untill base condition is hit,2, 6433,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when function calls itself.,1, 6434,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive Function is a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms.,1, 6435,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself is recursive,1, 6436,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself again and again,1, 6437,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6438,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration."," A recursive function is a function that calls itself to solve a problem by breaking it down into smaller, similar subproblems until a base case is reached",2, 6439,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",post self calling function ,1, 6440,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself int he function,1, 6441,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it is a type of function which call it self,1, 6442,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",that calls the same function multiple times in a code,1, 6443,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6444,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6445,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself again and again till the function is not ended.,1, 6446,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself to solve a problem,1, 6447,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6448,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself again and again,1, 6449,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",When a function calls itself until a specific condition is met,2, 6450,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function calls itself inside its own function which ends up into a loop and calls itself again n agaun.,1, 6451,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls itself.,1, 6452,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a function which is called inside itself.,1, 6453,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it is a function that recalls itself until it hits a dead end.,1, 6454,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it calls itself,1, 6455,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself repeatedly until the base condition is met,2, 6456,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function calling itself,1, 6457,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","when a function calls itself,it is called recursive function.",1, 6458,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Function that calls itself again and again.,1, 6459,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A function that calls itself during its execution to solve a problem in smaller, similar subproblems.",1, 6460,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",calling again ad agauin the saME FUNCTION untils hit base condition,2, 6461,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function calling itself,1, 6462,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","function which calls itself a lot of times till the operation we are asked to de is complete, here we are required to put a base case, which stops the recursive function.",2, 6463,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function calling itself,1, 6464,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function with calls itself,1, 6465,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",where function is called in itself,1, 6466,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself until a terminating condition,2, 6467,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function which calls itself again again until stop condition is true,2, 6468,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",funtion that calls itself,1, 6469,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",it can call self function by itself,1, 6470,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A Recursive function can be defined as a routine that calls itself directly or indirectly.,1, 6471,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which is called again and again . we also have to specify the base case in this.,2, 6472,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",funtion cALLING ITSELF AGAIN AND AGAIN,1, 6473,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is the one in which it calls itself until the base condition is achieved itself ,2, 6474,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",functuon calling itse;lf,1, 6475,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function in which work is done in small parts and call the gfunction which do the work,1, 6476,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is one that generates a succession of terms by repeating or using its own prior term to calculate subsequent terms.,1.5, 6477,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which calls itself,1, 6478,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself whether directly or indirectly ,1, 6479,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",To call a function again and agian.To make it a loop.,1, 6480,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function calling itself,1, 6481,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",calling a function itself in its own function,1, 6482,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself in each iterative call,1, 6483,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is function which call itself again and again untill base cond,2, 6484,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself is a recursive function,1, 6485,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",cal itself,1, 6486,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function calling itself,1, 6487,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function calls itself inside it own block ,1, 6488,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",that calls itself reppeatedly,1, 6489,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is self calling function which calls itself.,1, 6490,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that repeatedly calls itself until a base condition is reached,2, 6491,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6492,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself again and again until a base condition is met,2, 6493,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function that calls itself repeatedly unless its base condition is met.,1, 6494,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",RECURSIVE FUNCTION IS A FUNCTION WHICH CALLS ITSELF AGAIN,1, 6495,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",self calling function,1, 6496,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself until the base condition is satisfied,2, 6497,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function inside a function is recursive function,1, 6498,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",calls itself again,1, 6499,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function keeps calling itself,2, 6500,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",which calls another fn,2, 6501,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",when a function calls itself its recurvive call and this function is recursive,2, 6502,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A function which calls itself again,2, 6503,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A FUNCTION WHO CALLS ITSELF,2, 6504,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A recursive function is a function in which the function calls itself inside the function,2, 6505,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive Function is a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms.,2, 6506,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursively perform some operation until a base condition is reached,2, 6507,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function inside a function which calls itself ,2, 6508,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function calls itself ,2, 6509,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",fnction which call itself,2, 6510,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function that calls itself is called recursive function,2, 6511,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A Recursive function can be defined as a routine that calls itself directly or indirectly.,2, 6512,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.","A recursive function is a function that calls itself, either directly or indirectly, in order to solve a problem. Recursive functions are often used to solve problems that can be broken down into smaller, similar subproblems. Each recursive call to the function works on a smaller or simpler instance of the original problem, and this process continues until a base case is reached, at which point the function returns a result without making further recursive calls. Recursive functions are a common and powerful technique in computer programming and mathematic",2, 6513,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself ,2, 6514,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself ,2, 6515,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function that calls itself,2, 6516,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.", is a function that repeats or uses its own previous term to calculate subsequent forms a sequence of terms.,2, 6517,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.", function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms.,2, 6518,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",the function which used to call itself.,2, 6519,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6520,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a function that solves a problem by solving smaller instances of the same problem,2, 6521,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function calling itself to perform operation,2, 6522,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is used to repeat the code written inside it again and again till the condition fails.,2, 6523,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function which call again and again untill base condition satisfy ,2, 6524,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A FUNCTION WHICH CALL ITSELF REPEATEDLY IT A BASE CONDITION IS REACHED,2, 6525,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function that calls itself,2, 6526,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a functionm that calls itself again and again untill base condition is reached,2, 6527,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Function calls itself,2, 6528,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",recursive function is a function which calls itself,2, 6529,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6530,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",WHICH HAS A BASE CONDITION TO HALT IT AND A CONDITION WHICH CALLS IT AGAIN AND AGAIN. MORE EFFECTIVE TO USE,2, 6531,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a recursive function is a function that keeps calling itself until a condition is reached which is provided by user,2, 6532,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",IT IS A FUNCTION THAT CALLS TO ITSELF,2, 6533,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6534,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that repeats or uses its own previous term to calculate subsequent terms and thus forms a sequence of terms.,2, 6535,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function that calls itself and solves a larger problem by solving smaller subproblems,2, 6536,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",Recursive functions are those that calls themselves again after the end of that function call.,2, 6537,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",THAT IT SELF UNTILL BASE CONDTION RAECHGES,2, 6538,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",function that calls itself,2, 6539,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a function which calls itself in its own body is called a recursive fucntion,2, 6540,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",a fucntion whih calls itself,2, 6541,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",A Recursive function can be defined as a routine that calls itself directly or indirectly.,2, 6542,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",,0, 6543,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",calling func again and again,2, 6544,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties: base criteria where the function stops calling itself and progressive approach where the function tries to meet the base criteria in each iteration.",calls itself,1, 6545,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"advanced binary search, where a formula is used to search",0.5, 6546,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is a searching algorithm that estimates the position of a target value in a sorted array. It uses the value of the target and the range of values in the array to make an educated guess about the likely position of the target element.,1.5, 6547,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,we use the gap between element assuming it to be constant and apply the searching technique,2, 6548,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an improved search algorithm, especially useful for uniformly distributed data, that estimates the probable position of a target element by using a mathematical formula and adapts its search accordingly.",1, 6549,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in interpolation search we find a element by using a formula which is very close to our key element.,0.5, 6550,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys.,2, 6551,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,we find a position with the help of a formula andf that position is very close to the key,1, 6552,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Inserpolation search is used we values are sorted and are also uniform. It has a best case complexity of O(1) while avg is Log(LogN),1.5, 6553,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is a searching technique used to find an element in a sorted array, which is often more efficient than linear search, especially when the data set is uniformly distributed. It makes a prediction about the location of the target element by estimating its position based on the values of the elements at the ends of the search range.",0.5, 6554,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,2, 6555,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",1.5, 6556,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6557,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,2, 6558,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6559,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is only used when data is uniform and sorted . it search element in time complexity of o(1) or o(log(logn)),2, 6560,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Data sets which are sorted and have roughly equivalent difference between successive elements, can be searched using interpolation technique. It is an extension of binary search. It determines the mid index and divides the array based on that range.",1, 6561,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is a searching technique used to find a specific element in a sorted array. It calculates a probable position of the target element based on its value and the range of values in the array, narrowing down the search range efficiently. It has an average time complexity of O(log log n) for uniformly distributed data and can be faster than binary search in certain cases.",1.5, 6562,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,It is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys ,0.5, 6563,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in which we have already a sequence data and we use formula for that to find the pivot its kine of arranged data,1, 6564,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,2, 6565,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search technique is an advanced form of binary search. Here if the value to be searched for is closer to the end of the data structure, then the searching will start closer to the end of the data structure.",1.5, 6566,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). ,0.5, 6567,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),2, 6568,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"its a search tecque that works on variable that we have to sercjh in a probng method,",0.5, 6569,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is a special modified version of binary search in which the mid element is found through a formula which is more close to the desired key than simple bs. But we need a regular data for better proformance.,1, 6570,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,1.5, 6571,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,2, 6572,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,using pivot we find the element about it recursively,1.5, 6573,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search technique is used to reduce the searching space by using a formula which gives the index close to the key element to be found,0.5, 6574,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,nterpolation search is an algorithm used for searching a specific element in a sorted array. It makes an intelligent guess about the position of the element based on its value and the range of elements in the array.,1, 6575,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search technique uses a formula to find the element in which the close ness of the element to be found with middle element ,2, 6576,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,is a searching technique in which we find a given element in array by travel through it,1, 6577,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,based on binary search where the data is uniform,0.5, 6578,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search is an optimisation over binary search in which we further reduce the space to be searched depending on the data distribution.,2, 6579,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value., ,0.5, 6580,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,find a particular position andcomapre other variables with it,2, 6581,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an optimization over binary search. If the elements are uniformly distributed in the array. Then instead of doing m = (l + r) / 2. It applies a more optimized method to perform the search, m = (a[hi] - a[mid]) * (hi - lo) / (a[hi] - a[lo])",1, 6582,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values) we use a formula too.,1.5, 6583,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in it we find a particular position then compares that with other elements and sort,0.5, 6584,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,IT IS SPECIAL CASE OR A MORE OPTIMISED FORM OF BINARY SEARCHING,2, 6585,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,1.5, 6586,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,1, 6587,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for value in an array that has been ordered by numerical values assigned ,0.5, 6588,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,2, 6589,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search teachnique is an advanced binary search technique in which we choose a different index in place of the middle element as done in binary search . we choose the element in such a way so that the time complexity reduces.,0.5, 6590,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,It is an algorithm for searching a key in an sorted array.It is a modified binary search to reduce time complexity,1, 6591,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search uses the concept of ratios to find a more accurate middle index, which is then used just like in binary search.",2, 6592,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is a searching technique that estimates the position of a target element in a sorted array by linearly interpolating its probable location based on the values of the first and last elements, resulting in faster search for uniformly distributed data.",1.5, 6593,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"finds the position of the required element through a formula. for this technique to work, data should be sorted and uniformly distributed.",0.5, 6594,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is a search algorithm that estimates the position of a target element in a sorted array by using a formula that takes advantage of the distribution of values within the array, resulting in faster searching than binary search for data with non-uniform distributions.",1, 6595,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.," Interpolation search is a search algorithm used to find an element in a sorted array by estimating its probable position based on the value being searched, which allows for faster convergence to the desired element compared to binary search.",1.5, 6596,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"The Interpolation Search is an improvement over Binary Search for instances, where the values in a sorted array are uniformly distributed. ",2, 6597,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,2, 6598,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search technique is an algorithm which is used to search for data in a sorted/ almost sorted array. It uses the lowest and highest element to do the searching,1, 6599,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it helps to search the kth smallest element by breaking the array .,2, 6600,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search is used with binary search to further predict the location of element more accurately if data is varied with continuous manner,1, 6601,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it uses a probe element and positions of indexes to search an element by arranging element wrt the probe element.,2, 6602,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is help in finding median fast.,1, 6603,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,2, 6604,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in this we divide the elements in two part and keep dividing them and then start sorting them and joining them,1, 6605,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,2, 6606,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a specific value in a sorted array that uses linear interpolation to calculate the probable position of the desired element.,1, 6607,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search technique is searching for a key in an array where the key is has been ordered by numerical values assigned to the keys,2, 6608,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,1, 6609,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is a search technique used to find a specific element within a sorted array or list of elements. It is an improvement over binary search, particularly when the data is uniformly distributed.",2, 6610,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is a search technique that estimates the position of a target element in a sorted array by using the proportion of the difference between the target value and the endpoints to make informed guesses about its location.,1, 6611,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6612,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searching technique used when we have a uniformly distributed data that is sorted,1, 6613,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search technique is like median search but here we use a formula to implement it.,1, 6614,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,IN INTERPOLATION SEARCH WE FIND MEDIAN AND THE SEARCH,2, 6615,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,It is an optimized binary search alogorithm in which we find the element around which we search through a formula,1, 6616,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm used to find a specific target value within a sorted array of values. It's particularly effective for uniformly distributed data.,2, 6617,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in this search it uses a formula and gives us the index of element closest to the required number.,1, 6618,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.," interpolation search is similar to binary search, however instead of finding middle element of array like in binary search, interpolation search uses a formula to find out a position which is closer to the element we are searching for.",2, 6619,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value., an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,1, 6620,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"in this search we define a position, at that position the comparison is made then accordingly the divided part is chosen(left or right)",2, 6621,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,1, 6622,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"it is improved variant of binary search, this search algorithm work on probing position of required value",2, 6623,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. ,1, 6624,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is a searching technique that follows a certain mathematical formula. it is optimised binary seach,2, 6625,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,optimized version of binary search to reduce tc in segmented data,1, 6626,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6627,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searching for a key in an array that has been ordered by numerical values assigned to the keys,1, 6628,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6629,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6630,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,moidify quick sort,0, 6631,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6632,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6633,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6634,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is similar to the binary serach technique but there is only difference in formula and in this technique we check emelents from the nearest possible value of that stored in the array,1, 6635,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,when we have a formula to find the elemnt,1, 6636,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6637,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6638,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search technique is an improve over the binary search technique. it hopes to select a better pivot than just selecting the middle element of the array. ,1, 6639,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6640,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"searching technique ,hasa formula to generate index and compare it to the valueto be searched.",1, 6641,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,selection sort ,0, 6642,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is a searching algorithm that estimates the location of a target element in a sorted array based on the values of the endpoints. It narrows down the search range by making a guess, resulting in faster search times for uniformly distributed data.",1, 6643,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6644,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,It is a modified Quick Sort algo to make the searching even faster.,0, 6645,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys ,1, 6646,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",2, 6647,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6648,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,A randomized searching teaching used on uniformaly sorted array,1.5, 6649,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6650,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a specific value in a sorted array that uses linear interpolation to calculate the probable position of the desired element.,2, 6651,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,randomized searching method used on uniformly sorted array,1.5, 6652,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search technique is a technique that follows median search . It is mainly used to find kth element of a sorted array.,2, 6653,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is useful when data is uniform and gives more weightage to element near target element.,1, 6654,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search estimates the position of a target element in a sorted dataset. It uses an interpolation formula for prediction.,1.5, 6655,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6656,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"while binary search takes you to the middle element, Interpolation search technique is used over binary search because it takes you to the position where the element needs to be found. it is a better version of binary technique.",2, 6657,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is similar to binary search in which we find the mid element and the minimize the search space.,2, 6658,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search uses a special formula to do search and it completes operation in logn time complexity,1, 6659,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6660,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,its binary search ony the fromula for middle element is different,1.5, 6661,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6662,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"The Interpolation Search is an improvement over Binary Search for instances, where the values in a sorted array are uniformly distributed. Interpolation constructs new data points within the range of a discrete set of known data points.",2, 6663,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"it is a type of searching that is done on uniformly distrubuted data set, faster than binary search in some cases",1.5, 6664,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),1.5, 6665,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is a searching algorithm that estimates the position of the target by linearly interpolating between the values at two ends of the search space.,1.5, 6666,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is a searching technique used to find a specific element in a sorted dataset by estimating its position based on the values at the extremes.,1.5, 6667,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys.,1.5, 6668,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6669,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"searching based on the distribution of elements, pattern between elements.",1, 6670,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6671,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6672,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,its a formula based search technique,0.5, 6673,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,IN INTERPOLATION SEARCH ,0, 6674,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6675,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6676,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). ,1, 6677,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,randomised searching method used on uniformly sorted,1, 6678,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is similar to binary search but is applied in uniformly distributed data. It uses a formula to find the middle element so that number of iterations get further reduced,1.5, 6679,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,IT IS WEIGHTED BINARY SEARCH,0, 6680,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6681,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,An algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys.,1, 6682,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algo for searching for a key in an array that has been ordered by numerical values assigned to its keys,1, 6683,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6684,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),2, 6685,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is a searching algorithm for finding a target value in a sorted array1234. It is similar to binary search, but instead of always checking the middle element, it uses a formula to estimate the position of the target value based on the values in the array",2, 6686,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is efficient when the data is uniformly distributed and can often outperform binary search,1, 6687,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,int this we have a formula to take element and compatre the element to be searched if greater the we search in the right and if less then we search int the left and same process if called recursively given array is sorted,2, 6688,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6689,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"when data is uniformly distributed, we can make mid elements come closer",1, 6690,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is the improved technique of the binary search, in which we find the element using a given formula and sort its left and right array.",1, 6691,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"it is similar to binary seach, but we take the mid element such that it is closer to the target, thus reducing time taken to search.",1.5, 6692,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation searh is done by calculating a formula and then compare the values with that value and then search for the value in either left subarray or right subarray as it is sorted always.,1.5, 6693,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is a type of binary search technique,1, 6694,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6695,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,search done by using the the formula (arr[end]*arr[end])*(key-arr[start])/(end-start),0, 6696,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it has one time complexity . taking out median element from ,0, 6697,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,by find median elemnt ,0.5, 6698,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,first we find mid of the array and then key is searched,0.5, 6699,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"In interpolation-sequential search, interpolation is used to find an item near the one being searched for, then linear search is used to find the exact item.",0.5, 6700,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm used to find a specific target value within a sorted array of values. It's particularly effective for uniformly distributed data.,1, 6701,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6702,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6703,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),1, 6704,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6705,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,IT requires a uniform data.it is like searching a word dictionary with uniform words for each letter.,0.5, 6706,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation techniques makes it fast to search an element.,1, 6707,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,pos= lo + (x - arr[lo]*(hi - lo))/(arr[hi] - arr[lo]),0.5, 6708,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6709,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"In this search, we scan the elements using their position i.e key value.",0.5, 6710,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in this search we scan the elements using their position index,0.5, 6711,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"A interpolation search is a type of binary search in which we find the mid element with a formula , the formula gives excess accuracy.",1, 6712,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6713,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value., an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys ,0.5, 6714,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,its a formula based searching techniques,0, 6715,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6716,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys .,1, 6717,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"nterpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",1, 6718,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),1, 6719,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6720,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6721,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key ,0.5, 6722,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",1, 6723,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search uses a formula to calculate a value nearest to the required index.,1, 6724,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is where for a key in an array that has been ordered by values assigned to the keys,1, 6725,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,improved version of binary searching,0.5, 6726,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,the search technique with a specified formula in which the domain of search got narrowed down even more than a binary search. here the index of the required element if estimated using the formula : (((arr[end]-arr[start])/end - start) * (x - arr[start])),1.5, 6727,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,a kind of binary search which uses the formula,0.5, 6728,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search estimates the position of a target value using proportional values.,0.5, 6729,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,optimised binary search,0.5, 6730,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6731,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,we use a formula to guess the position of the needed key.,0.5, 6732,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,there is a formula for it and it search the element in constant time . Here array should be sorted and distributed equally,1, 6733,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it uses formula to find kth smallest element. Optimized binary search ,0.5, 6734,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),1, 6735,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation Search is a search technique used for searching a specific key within a range. It estimates the probable location of the key.,1, 6736,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"The Interpolation Search is an improvement over Binary Search for instances, where the values in a sorted array are uniformly distributed. Interpolation constructs new data points within the range of a discrete set of known data points",1.5, 6737,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",1.5, 6738,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6739,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",1.5, 6740,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,when we search by taking median of the elements,0.5, 6741,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Searching element in an array using its value , it is an improved binary search technique",0.5, 6742,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"we use a formula to get the appropriate position of the elemnt to be searched , prerequisite is that the data structure should be sorted.",1, 6743,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is a technique in which the element's position to be searched is found using a formula best suited for the range and mean averages between each element in the array.,1, 6744,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"interpolation search is most uselful when the elements have almost the same difference, its very similar to binary search",1.5, 6745,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is a type of binary search ,0.5, 6746,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm to search an element. it is same as binary search but it is faster than binary search.,1.5, 6747,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,1.5, 6748,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6749,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",1.5, 6750,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search is a method of searching using key in array,1.5, 6751,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is effective searching it uses mathformulas but array it should be sequential,1.5, 6752,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6753,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,IT is a modified version of binary search in which array is divided into 2 parts by a special formula ,1.5, 6754,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in this we define a formula which returns the index near which that integer can be present,1.5, 6755,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolates the index used to partition the array to be sorted,1.5, 6756,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is a searching algorithm used to find a specific element in a sorted array, much like binary search. However, instead of always examining the middle element of the array, interpolation search estimates the position of the target element based on its value and the values of the elements at the beginning and end of the array. ",1.5, 6757,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search works by comparing the mid element with the key to be searched, then if it is kess than the mid element, we search the left part by same method. otherwise the right part.",1.5, 6758,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6759,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6760,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"we find median here, and then perform searching",1.5, 6761,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6762,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"This search algorithm works on the probing position of the required value, works on for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).",1.5, 6763,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation is a technique in which array is sorted and we apply search close to the elemnt we have to find.,1.5, 6764,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is used for searching a key in a array,1, 6765,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6766,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is to find a key in an array that has been ordered by numerical values assigned to the keys.,1.5, 6767,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search is a better version of binary search in which we find the pivot by using a defined formula so as to better the complexity of the code.,1.5, 6768,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"used when uniform distribution faster than bst, inserted at specific postions",1.5, 6769,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it uses the formula to search the required element .,1, 6770,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value., algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys.,1.5, 6771,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6772,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is an improved variant of binary search tech it uses a formula and divides the array into two half,1.5, 6773,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,1.5, 6774,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),1.5, 6775,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6776,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6777,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in interpolation search technique two end are taken and the search is done between these two end points,1.5, 6778,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6779,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searching the element by divided the array into two parts and its time complexity is log(n).,1.5, 6780,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6781,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6782,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6783,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6784,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search is like binary search but instead of taking middle element we use a seperate formula to get to nearest element in a sorted linear ds,1.5, 6785,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys,1.5, 6786,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is a search algorithm that estimates the position of a target element in a sorted array based on its value, reducing the search space efficiently.",1.5, 6787,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys,1.5, 6788,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,1.5, 6789,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6790,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in interpolation is just like binary search except we chossing the mid we choose by median,1.5, 6791,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6792,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in interpolation search the pivot element is selected according to the searching element .,1.5, 6793,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search is a search which finds the element when there is a uniform distribution among the elements.,1.5, 6794,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6795,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,nterpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),2, 6796,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),2, 6797,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in the the interpolation serch technique the linked list is sorted in ascending order and then the middle element is located and when we want to search an element then first we check if the element is equal to middle element if not the then we see if the element is smaller than middle element if yes then it is searched on the left side of middle element and then again middle element is found for the new sub linked list and the process gets repeated and same process is carried if req element is greater than middle element.,1, 6798,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6799,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,a kind of binary search tree which uses the formula,1, 6800,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6801,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"interpolation search is a search technique used to find the position of a specific element in a sorted array of values. It is an improvement over the binary search algorithm, especially when the data is uniformly distributed, making it particularly useful for large datasets with a relatively even distribution of values.",2, 6802,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value., an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,2, 6803,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",2, 6804,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6805,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search tecnique uses % to to aarange element data in an array and then searches,1, 6806,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,An element search technique which uses partitioning as its feature.,1, 6807,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value., an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),2, 6808,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6809,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,INTERPOLATION SEARCH IS VERY IMPORTANT IN WHICH SEARCHING TAKE PLACE BY INTERPOL,1, 6810,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation searching involve the arrays which have similar difference between the various keys and the searching process is done using a mathematical formula,1, 6811,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"It works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays, according to whether they are less than or greater than the pivot. The sub-arrays are then sorted recursively. ",1, 6812,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6813,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,if the data in sorted almost uniformly the the mid elements can be found near the required element,2, 6814,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is similar to binary search but in this case we find position of a random element instead of middle index.,2, 6815,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,here we use a direct derived formula to calculate and get the index of the desired element,2, 6816,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6817,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,used by dividing array into sunb arrays and then searching,1, 6818,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in an interpolation search technique the elements are sorted first and then check if the element is greater or less than the middle leement of the array. if the element is greater ithen we search pon the first half otherwise the second half. ,1, 6819,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,comparing,0.5, 6820,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,is an algorithm for searching a key in the array that has been ordered by numerical values assigned to the keys. Interpolation search .,1, 6821,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation technique uses advance form of binary search where it sets one elelment in the last and compares all other elements to it and then perform simple comparison to arrange array.,1, 6822,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,using the formula of interpolation we try to find the element which we are looking for ,1, 6823,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6824,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,nterpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),0.5, 6825,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"The Interpolation Search is an improvement over Binary Search for instances, where the values in a sorted array are uniformly distributed.",2, 6826,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6827,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6828,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6829,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6830,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6831,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is application on sorted array,1, 6832,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,In interpolation search we go the element close to our key and perform the function recursively there. We use a mathematical formula to find the position of interpolation search. ,2, 6833,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6834,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in this method we basically find the low and high postions for searching .,1, 6835,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,2, 6836,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is a searching technique. if we have a uniform array in increasing or decreasing order we can apply this technique to get very fast results.,0, 6837,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searching through any data structutre or traversing through it,0.5, 6838,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is a technique which predicts the position of the target element by using the interpolation search formula.,1, 6839,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,In interpolation search we find the key by using a formula ,1, 6840,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm used to find a specific target value within a sorted array of values. It's particularly effective for uniformly distributed data.,2, 6841,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,nterpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys.,0.5, 6842,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,It is a modification of binary search technique,1, 6843,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0.5, 6844,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6845,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,when ordered by numerical value,1, 6846,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6847,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,o(log(logn)) ,1, 6848,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,nterpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,1.5, 6849,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys,1, 6850,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6851,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys,1.5, 6852,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). ,1, 6853,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6854,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searching for key in array that has been ordered by numeric values,1.5, 6855,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it used to search choosing a pivot element closer to the required element in a sorted aaray,1, 6856,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Finding for a element at the nearest possible location which is calculated by a interpolatio n formula,1.5, 6857,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys,1, 6858,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it uses a formula to calculate the most prefered value of element to search it.,1, 6859,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in interpolation search instead of line binary search where we always start in the middle we give weight to the value of the elements to search faster,1, 6860,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6861,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search technique is a non comparing based searching techniue ,1.5, 6862,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6863,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys ,1.5, 6864,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),1.5, 6865,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,we have a formula to reach to the key,1, 6866,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6867,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,when elements are sorted and increase linearly this search calculate the predicted index depend on the range of elements,1, 6868,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search technique is a binary search technique used to search and element it helps to search an element with the help of key of that element and index of that element. ,2, 6869,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,applicable on sorted arrray,1.5, 6870,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,What is interpolation search technique?,1.5, 6871,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6872,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,It is just like the binary search but if the elements are in the evenly manner,1.5, 6873,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6874,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6875,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6876,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in which element is searched according to its distance from starting node,1, 6877,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6878,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in this data is searched by breaking an long array into short array and then poerform seachimg again and again,1.5, 6879,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6880,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6881,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search technique is a sorting technique which works by creating new data points ,1.5, 6882,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6883,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is similar to binary search but it uses an interpolation formula with a tc of log log n.,2, 6884,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is a search technique used to search for elements.,1, 6885,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search is a better version of binary search in which the array is split not at the middle but at a value which is more favorable and is calculated using a formula,1.5, 6886,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,SEARCHING IN AN ARRAY WHICH HAS BEEN ORDERED BY A NUMERICAL VALUE.,1.5, 6887,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search technique is a searching technique that has a formula that find the position of the element we want to search using the inputs,1.5, 6888,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6889,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys.,1.5, 6890,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6891,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,i is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). ,0, 6892,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6893,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6894,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",2, 6895,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6896,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"this is a search applied on sorted data , having uniform data in which searching is performed on the basis of particular formula ",1.5, 6897,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6898,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is similar to binary search and just aims to check if certain element is present or not.,1.5, 6899,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,using interpolation search formula,1, 6900,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys key values,2, 6901,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Find element and then use in loop,1.5, 6902,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is a searching technique for a key in an array that has been ordered by numerical values assigned to the keys (key values). ,1.5, 6903,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6904,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6905,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in this we search on the bASIS OF FORMULA .,2, 6906,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6907,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is similar to binary search only difference is we not find the middle element,1.5, 6908,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an algorithm used to search for a specific target value within a sorted array or list of elements. It is an improvement over binary search when the data being searched has a non-uniform distribution. Interpolation search takes advantage of the distribution of values in the data to make intelligent guesses about the location of the target element. This makes it particularly efficient for data with non-uniform distributions, such as data that follows a linear or exponential pattern.",2, 6909,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"it uses the inyerpolation formula to generate a key and goes to that index to search first, as this reduces search time complexity in case of sorted and uniformly distributed dATA",1.5, 6910,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is a search technique in which the elemnts are searched based on either positve or nehgetive way,2, 6911,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value., an algorithm for searching for a key in an array that has been ordered by numerical values ,1.5, 6912,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6913,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6914,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6915,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,In interpolation search technique we apply the formuale for finding a certain number.,2, 6916,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6917,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6918,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally DISTRIBUTE..",1.5, 6919,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6920,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"when the elements are sorted and increase linearly, this search calculates the predicted index based upon the ranges of elements.",2, 6921,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it decreases the time complexity of linear search by a function ,2, 6922,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Calclating the position of an element using formulae and placing it there,1, 6923,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,non comparing based searching technique,1, 6924,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is an algorithm to search key inn an array that has been ordered by numeric values assigned to the keys,1, 6925,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searches any data using indexes,2, 6926,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in this we search for median in a sorted array,1.5, 6927,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searching based on the distribution of elements pattern between elements.,1, 6928,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searching using the interpoitan formula.,2, 6929,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,2, 6930,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,works on sorted array in which elements should be evenly distributed,1.5, 6931,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,1.5, 6932,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6933,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search technique is a technique in which a define method using formula and find the best possible index of finding element ,1, 6934,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). mid = low + ((x – A[low]) * (high – low) / (A[high] – A[low])),1, 6935,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,radix sort -> buckets,1.5, 6936,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"in interpolition search we use two pointer approach start ,end and middle is choosen by a formula which will give almost median.",1, 6937,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is effective searching as it uses mathimATICAL formulas,1, 6938,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,simillar to binary search just a formula is different we comapre the values with that element and search the req data,1, 6939,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the key.,1.5, 6940,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6941,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,1, 6942,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,, 6943,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,search in which we search the meadian of the array over and over again for some range.,1, 6944,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is quick technique to search an element it is better version binary search,1.5, 6945,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6946,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6947,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in interpolation search we choose a pivot element such as in binary search and use it to find an element in the datastructure.,1, 6948,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",1.5, 6949,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). It was first described by W,1, 6950,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,for searching of key in an array ordered by numerical values,1, 6951,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. ,1, 6952,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6953,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6954,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,s an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys,1, 6955,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6956,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys,1, 6957,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it uses a formula,1, 6958,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,this technique is somwhat like binart search which is based on a formula ,1, 6959,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6960,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6961,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6962,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is an improved variant of BST ,1, 6963,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,faster searching techniquee where searching starts from predicted index,1.5, 6964,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,A algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).we also have probing in it,1, 6965,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,we create a mid element with the formula and then search the element in both the halves.,1.5, 6966,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,we use a formula using which we get the appropriate position of the element,1, 6967,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,this search works on the probing position of the required value ,1.5, 6968,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value., is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,1, 6969,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.," Interpolation Search is an improvement over Binary Search for instances, where the values in a sorted array are uniformly distributed. Interpolation constructs new data points within the range of a discrete set of known data points",1.5, 6970,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,find apivot and search before and after it,1, 6971,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6972,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6973,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value., an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys,1.5, 6974,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in whch we create formula and create index,1, 6975,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6976,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6977,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6978,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6979,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),0.5, 6980,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6981,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is a search technique used to find the position of a specific element in a sorted array. It uses the information about the distribution of elements to make an educated guess about the position of the target element.,1.5, 6982,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,in this technique inst,1.5, 6983,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search technique is very much similar to binary search which divides the array in two parts as per the condition but the data should be inserted in uniform manner.,1, 6984,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searching which have a formula of finding nearest value of the value we want to find,1.5, 6985,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6986,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),1, 6987,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,nterpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,1.5, 6988,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6989,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,1, 6990,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"it is a searching technique used to search with a time complexity of O(log2 n) just like binary search , the only difference is the formula is used in interpolation and whereas start and end pointers are used in binary search algo",1, 6991,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). ,1, 6992,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Linear interpolation takes two data points which we assume as (x1,y1) and (x2,y2) and the formula is : at point(x,y). This algorithm works in a way we search for a word in a dictionary. The interpolation search algorithm improves the binary search algorithm. The formula for finding a value is: K = data-low/high-low.",1.5, 6993,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6994,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,type of binary search.,1, 6995,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6996,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6997,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"In interpolation searching technique we need a fairly sorted array, in which we predict the position of the element using the formula ",1, 6998,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 6999,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,a search which have time complkexity of O(log(logn)),0.5, 7000,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7001,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value., an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,0.5, 7002,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7003,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7004,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,uses a formula to find the index of element required to search,1, 7005,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7006,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",2, 7007,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is technique ordered by numerical values assigned to the keys.,1, 7008,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7009,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7010,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7011,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7012,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",2, 7013,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,when search is used using slope of the equations,0.5, 7014,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7015,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,1, 7016,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,AN ALGORITHM FOR SEARCHING A KEY ,1, 7017,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,prdecting the position of the required element and finding it there,1, 7018,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7019,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is optimised searching technique based on binary search,1, 7020,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7021,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is a searching technique that estimates the position of a target element in a sorted array based on the values of the first and last elements.,1, 7022,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). ,1, 7023,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,when search is used using slope of equations y = mx ,0.5, 7024,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),1, 7025,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,we use a formula to search for an element,0.5, 7026,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searching element in an array using its value,0.5, 7027,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searching element in artay using its value and standard formula,0.5, 7028,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values).,0.5, 7029,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). It was first described by W. W. Peterson in 1957.,1, 7030,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7031,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7032,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7033,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is a searching technique for finding a specific target value within a sorted array by estimating its probable position based on data distribution.,1, 7034,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value., a ,0, 7035,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7036,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is a type of search technique which reduce the time complexity of the searchin using a formula ,0.5, 7037,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,we use a formula for the same and it is better than other searching,0.5, 7038,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7039,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7040,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search estimates the location of a target element in a sorted array using linear interpolation, making it efficient for uniformly distributed data with an average time complexity of O(log log n).",1, 7041,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,improved binary search,1, 7042,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7043,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search is used to search elemnts by dividing elements around an element choosen using formula,0.5, 7044,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,interpolation search is a search technique in a linear data structure ,, 7045,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7046,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search technique is used for searching for a key in an array that has been ordered by numerical values assigned to the keys.,, 7047,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7048,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,its used for searching a key in an array that has been sorted accordding to the numerical values assigned to their keys,, 7049,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7050,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is advanced method of binary search which searches depending on the given data ,, 7051,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,similar to binary search but just uses a formul,, 7052,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,using interpolition search formula,, 7053,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is similar to binary search but we can compute a pivot element by using a formula that reduces the time taken.,, 7054,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,An interpolation search is an algorithm for searching for a target element in a sorted array,, 7055,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7056,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7057,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"it is used to search an element in an equally spaced data , where we have a particular formula that gives as the positoin of the asked data.",, 7058,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7059,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Search using formula,, 7060,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7061,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,uses a mathematical function to guess most probable position of searched element,, 7062,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7063,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7064,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,when elements are sorted in increasing and ,, 7065,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is a searching algorithm that is used to find the position of a target value in a sorted array or list.,, 7066,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7067,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7068,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it fins the median of array and applies formula to find it,, 7069,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7070,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"The Interpolation Search is an improvement over Binary Search for instances, where the values in a sorted array are uniformly distributed.",, 7071,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"An enhanced version of binary search is called interpolation search. This search technique uses the necessary value's probing position as its starting point. To ensure optimal performance of this technique, the data collection must be sorted and dispersed uniformly.",, 7072,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,nterpolation search is for searching for a key in an array that has been ordered by numerical values assigned to the key,, 7073,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7074,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,It means searching step by step.,, 7075,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searching using a formulated interogation,, 7076,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys,, 7077,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7078,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7079,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,nterpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). It was first described by W. W. Peterson in 1957.,, 7080,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7081,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,T.C of log(logn),, 7082,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,algorithm for searching a key value and pair it accordingly,, 7083,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"nterpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed. Binary search has a huge advantage of time complexity over linear search. Linear search has worst-case complexity of Ο(n) whereas binary search has Ο(log n).",, 7084,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Improved type of binary search technique.,, 7085,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is modified binary search algorithm which has a formula to derive a position in whose left and right we search a data recursively,, 7086,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7087,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7088,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7089,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7090,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searching which have a formula for finding the mid and ,, 7091,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,searching using meadian value,, 7092,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7093,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7094,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"nterpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",1.5, 7095,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,a formula gives an idea of elements,1, 7096,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7097,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7098,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is a search algorithm used for finding a specific value within a sorted array. It estimates the likely position of the target value based on the values at the array's boundaries and uses this estimate to narrow down the search range. It can be more efficient than binary search when the data is uniformly distributed.,1.5, 7099,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7100,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). ,1.5, 7101,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7102,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7103,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,uses a formula,1, 7104,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is tecnique to search aelement by using formula,1, 7105,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7106,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,It is search algorithm and works on the probing position of the required value,1, 7107,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"Interpolation search is a search algorithm used to find a specific target value in a sorted array of values. It is an improvement over binary search, especially when the data is uniformly distributed, meaning that the values in the array are relatively evenly spaced. Interpolation search takes advantage of this uniform distribution to estimate the position of the target value more accurately and reduce the number of comparisons required.",1, 7108,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,search using a specific formula of ingterpolation,1, 7109,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7110,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7111,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7112,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys ,1, 7113,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,yes.,0, 7114,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7115,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). ,1.5, 7116,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7117,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7118,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7119,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,OPTIMISED VERSION OF BINARY SEARCH USING A FORMULA,1, 7120,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"The Interpolation Search is an improvement over Binary Search for instances, where the values in a sorted array are uniformly distributed. Interpolation constructs new data points within the range of a discrete set of known data points",1, 7121,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7122,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7123,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7124,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7125,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7126,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,by searching inter polarly,1.5, 7127,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7128,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7129,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,n algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values),1, 7130,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,a modified binary search that uses a specifi9c formula for finding pivot instead of just mid,1.5, 7131,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7132,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,THAT SEACRH IN NSORTED AND EVELENY DISTRIBUTED ARRAY,1, 7133,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7134,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,it is the fastest search tecnique which uses the time complexity of o(log(log(n))),1, 7135,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,better form of binary search,1, 7136,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,"The Interpolation Search is an improvement over Binary Search for instances, where the values in a sorted array are uniformly distributed. ",1, 7137,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,,0, 7138,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,using the formu;la,1, 7139,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value.,modified binary search that uses a formula to pivot,1, 7140,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","prefix= (D+ C *(B+A)), postfix= d(c(b a+)*)+",0.5, 7141,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix Notation: * + a b + c d Postfix Notation: a b + c d + *,1, 7142,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: *+ab+cd and post: ab+cd+*,2, 7143,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix (or Polish) notation: * + a b + c d Postfix (or Reverse Polish) notation: a b + c d + *,1.5, 7144,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix -- *+ab+cd postfix -- ab+cd+*,0.5, 7145,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","Prefix: +ab, +cd, *+ab+cd Postfix: ab+, cd+, ab+cd+*",2, 7146,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",abc*+d+,1, 7147,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix -> *+ab+cd postfix-> ab+*cd+,0.5, 7148,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","Prefix-""* + a b + c d"" Postfix-""a b + c d + *""",1.5, 7149,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,2, 7150,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","The expression A + B * C + D can be rewritten as ((A + (B * C)) + D) to show that the multiplication happens first, followed by the leftmost addition. A + B + C + D can be written as (((A + B) + C) + D) since the addition operations associate from left to right.",1, 7151,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,1.5, 7152,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0.5, 7153,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,2, 7154,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*(+ab)(+cd) prefix.....postfix(ab+)(cd+)*,0.5, 7155,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix: - *(+ab+cd) Postfix: - (ab+cd+)*,2, 7156,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Infix Notation: (a + b) * (c + d) Prefix (or Polish) Notation: * + a b + c d Postfix (or Reverse Polish) Notation: a b + c d + *,1.5, 7157,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",+ + A * B C D A B C * + D +,0.5, 7158,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,1, 7159,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,1.5, 7160,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Postfix: abc+d*+ Prefix: dcb+a*+,2, 7161,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0.5, 7162,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *", *+ A B + C D prefix A B + C D + * postfix,2, 7163,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix ab+ 2 ,1.5, 7164,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",pre - [ *+ab+cd ] post- [ ab+cd+* ],1, 7165,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix : + +A*B C D postfix :A B C * + D * ,0.5, 7166,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,1, 7167,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix:* + A B + C D post fix: A B + C D + *,2, 7168,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,1, 7169,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",n the given infix expression (a + b) * (c + d): Prefix (or Polish) notation: * + a b + c d Postfix (or Reverse Polish) notation: a b + c d + *,0.5, 7170,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+AB+CD PREFIX AB+CD+* POSTFIX,2, 7171,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix-> * + ab + cd postfix-> ab + cd + *,1.5, 7172,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix *+ab+cd postfix ab+cd+*,0.5, 7173,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd & ab+cd+*,2, 7174,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0.5, 7175,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*(+ab)(+cd) prefix (ab+)(cd+)*,1.5, 7176,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix : *+ab+cd Postfix : ab+cd+*,1, 7177,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefixr: *+ab+cd postfix: ab+cd+*,2, 7178,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","*(+ab) (+cd), (ab+)(cd+)*",0.5, 7179,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","When you write an arithmetic expression such as B * C, the form of the expression provides you with information so that you can interpret it correctly. In this case we know that the variable B is being multiplied by the variable C since the multiplication operator * appears between them in the expression. This type of notation is referred to as infix .These changes to the position of the operator with respect to the operands create two new expression formats, prefix and postfix.",1, 7180,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,1.5, 7181,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,2, 7182,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,1, 7183,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix = *+ab+cd Postfix= ab+cd+*,0.5, 7184,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix,2, 7185,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix -> *+ab+cd Postfix -> ab+cd+* ,1.5, 7186,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",PREFIX: * + a b + c d POSTFIX: a b + c d + *,0.5, 7187,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix Notation (also known as Polish Notation): a b + c d Postfix Notation (also known as Reverse Polish Notation): a b + c d + *,1, 7188,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: + + A * B C D postfix: A B C * + D +,2, 7189,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,1, 7190,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",a b + c d a b + c d + *,1.5, 7191,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix= *+ab+cd postfix= ab+cd+*,0.5, 7192,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7193,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix: * + a b + c d And Postfix: a b + c d + *,2, 7194,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: *+()ab+()cd. postfix:()ab+()cd+*.,1.5, 7195,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix:- * + a b + c d postfix:- a b + c d + *,2, 7196,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","prefix:*+ab+cd, postfix: ab+cd+*",2, 7197,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix : *+ab+cd postfis: ab+cd+*,2, 7198,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7199,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7200,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix=*+ab+cd postfix=ab+cd+*,2, 7201,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix Notation: * + a b + c d Postfix Notation: a b + c d + *,2, 7202,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7203,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7204,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix Notation (or Polish Notation): * + a b + c d Postfix Notation: a b + c d + *,2, 7205,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",The prefix notation of the expression (a + b) * (c + d) is: * + a b + c d The postfix notation of the expression (a + b) * (c + d) is: a b + c d + *,2, 7206,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7207,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",* + A B + C D A B + C D + *,2, 7208,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","prefix: +ab*+cd, postfix: ab+*cd+",2, 7209,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",PREFIX =*+AB+CD POSTFIX AB+CD+*,2, 7210,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd and ab+cd+*,2, 7211,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd pre ab+cd+*post,2, 7212,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd ab+cd+*,2, 7213,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix : + + a * b c d postfix : a b c * + d +,2, 7214,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",The prefix notation of the expression (a + b) * (c + d) is: * + a b + c d The postfix notation of the expression (a + b) * (c + d) is: a b + c d + *,2, 7215,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",ab+cd+*,1, 7216,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7217,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix:+ + A * B C D Postfix: A B C * + D +,1.5, 7218,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix: ++A*B C D POSTFIX: A B C *+ D +,1.5, 7219,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","ab+cd+* , *+ab+cd",1, 7220,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7221,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",ab+cd+*,1, 7222,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: *+ab+cd postfix: ab+cd+*,2, 7223,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7224,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7225,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7226,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix- *+ab+cd postfix- ab+*cd+,2, 7227,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7228,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7229,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7230,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7231,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7232,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7233,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",postfix: a b + c d + * .............. prefix: * + a b + c d,2, 7234,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7235,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Havent studied yet.,0, 7236,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7237,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","Prefix Notation: * + a b + c d , Postfix Notation: a b + c d + *",2, 7238,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*ab+cd+ ab+*cd+,1.5, 7239,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",..,0, 7240,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix:* + a b + cd Postfix:ab + cd+ *,2, 7241,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix : *+ab+cd postfix : ab + cd+*,2, 7242,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7243,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",postfix: ab+cd+* prefix: *+dc+ba,1, 7244,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7245,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",(a + b) * (c + d): Prefix Notation: * + a b + c d Postfix Notation: a b + c d + *,2, 7246,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",postfix: ab+cd+* prefix: *+dc+ba,1, 7247,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix notation : ab+cd+* postfix : *+ab*cd,0, 7248,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7249,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix Notation: *+ ab + cd Postfix Notation: ab + cd +*,2, 7250,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7251,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: *+ab+cd postfix: ab+cd+*,2, 7252,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7253,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7254,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7255,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7256,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7257,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",* + A B + C D A B + C D + *,2, 7258,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","*+ab+cd , ab+cd+*",2, 7259,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix= * + A B + C D postfix=A B + C D + *,2, 7260,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix: * + a b + c d Postfix: a b + c d + *,2, 7261,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *"," Prefix notation: * + a b + c d, Postfix notation: a b + c d + *",2, 7262,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix * + A B + C D Postfix A B + C D + *,2, 7263,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7264,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7265,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7266,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7267,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7268,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",PREFIX + POSTFIX *,0, 7269,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7270,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",PREFIX +POSTFIX*,0, 7271,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd,1, 7272,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",postfix: ab+cd+* prefix:*+dc+ba,1, 7273,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix : *+ab+cd postfix :ab+cd+*,2, 7274,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd,1, 7275,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7276,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","Prefix=* + A B + C D , Postfix= A B + C D + * ",2, 7277,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix= * A B + C D postfix= A B + C D + *,2, 7278,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7279,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *", the prefix notation for (a + b) * (c + d) is: d c + b a.the postfix notation for (a + b) * (c + d): a b + c d + *.,2, 7280,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","The expression A + B * C + D can be rewritten as ((A + (B * C)) + D) to show that the multiplication happens first, followed by the leftmost addition. A + B + C + D can be written as (((A + B) + C) + D) since the addition operations associate from left to right.",0, 7281,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","the prefix notation of the expression ""(a + b) * (c + d)"" is ""+ab+cd,"" and the postfix notation is ""ab+cd+.""",1, 7282,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",int prefix we first perform the opration and the do it whle in post fix we first fdo it then perform the operation,0, 7283,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: *+ab+cd postfix: ab+cd+*,2, 7284,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7285,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix:* + A B + C D postfix: A B + C D + *,2, 7286,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7287,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",It is done using sorting.,0, 7288,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",pre fix means first there is a operator and postfix is that where operator is at last,0, 7289,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7290,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd(PRE) and ab+cd+*(POST),2, 7291,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7292,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7293,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: *+ab+cd postfix: ab+cd+*,2, 7294,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",* + a b + c d a b + c d+ *,2, 7295,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd pre ab+cd+* post,2, 7296,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7297,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7298,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","prefix + , postfix *",0, 7299,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7300,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",postfix->ab+cd+* prefix-*+ab+cd,2, 7301,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","(*(+ab)+cd),",1, 7302,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix - *+ab+cd and Postfix - ab+cd+*,2, 7303,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",PREFIX IS + AND POSTFIX IS *,0, 7304,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","*+ab+cd, ab+cd+*",2, 7305,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","*+ab+cd, ab+cd+*",2, 7306,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix - *+ab+cd postfix- ab+cd+*,2, 7307,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7308,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7309,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix + postfix *,0, 7310,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7311,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7312,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","The expression A + B * C + D can be rewritten as ((A + (B * C)) + D) to show that the multiplication happens first, followed by the leftmost addition. A + B + C + D can be written as (((A + B) + C) + D) since the addition operations associate from left to right.",0, 7313,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7314,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7315,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7316,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7317,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix: *(+ab)(+cd) Postfix: (ab+)(cd+)*,2, 7318,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7319,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",+ + A * B C D and A B C * + D +,0, 7320,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",+ab*cd(prefix) ab+*cd+(postfix),2, 7321,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","post : ab+cd+* , pre : +ab*+cd",2, 7322,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7323,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","Prefix notation: * + a b + c d, Postfix notation: a b + c d + *",2, 7324,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: *+ab+cd postfix: ab+cd+*,2, 7325,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7326,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7327,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",PREFIX = AB+CD+* POSTFIX = *+AB+CD,0, 7328,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix *+ab+cd post ab+cd+*,2, 7329,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7330,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix Notation (Polish Notation) of (a + b) * (c + d): * + a b + c d,1, 7331,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7332,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",PRE: *+ab+cd POST:ab+cd+*,2, 7333,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7334,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","prefix=*+ab+cd, postfix=ab+cd+*",2, 7335,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd and ab+cd+*,2, 7336,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","*+ab+cd , ab+cd+*",2, 7337,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7338,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7339,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd ->prefix and ab+cd+* ->postfix,2, 7340,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*(+ ab + cd) and (ab+ cd+ )*,1.5, 7341,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd prefix and ab+cd+* postfix,2, 7342,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *", prefix+ + A * B C D postfixA B C * + D +,1, 7343,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7344,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7345,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7346,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *"," * + ab + c d, ab+cd+*,",2, 7347,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7348,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *", prefix : *+ab+cd postfix: ab+cd+*,2, 7349,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7350,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7351,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","Prefix (Polish) Notation: The expression becomes: ""* + a b + c d"" Postfix (Reverse Polish) Notation: The expression becomes: ""a b + c d + *"" ",2, 7352,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Postfix: ab+cd+* Postfix: *+ab+cd,2, 7353,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7354,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7355,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7356,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7357,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *", * + a b+ cd a b + cd + *,2, 7358,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",a,0, 7359,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7360,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","+ab*cd,ab+cd+*",1.5, 7361,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: *+ab+cd suffix : ab + cd+*,2, 7362,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix:*+ab+cd postfix:ab+cd+*,2, 7363,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",postorder: ab+cd+* preorder: *+ab+cd,2, 7364,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix : * + a b + c d postfix : a b + c d + *,2, 7365,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","prefix: *+ab+cd, postfix: ab+cd+*",2, 7366,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: * + A B + C D postfix: A B + C D + *,2, 7367,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: *+A B +C D postfix: A B C D + *,1.5, 7368,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd ab+cd+*,2, 7369,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7370,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7371,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7372,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7373,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix---*(+ab)(+cd) postfix= (ab+)(cd+)*,1, 7374,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",abcd,0, 7375,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: +ab*cd postfix:ab+cd+*,1.5, 7376,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",(ab+cd)+*,1, 7377,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","Prefix- +ab*+cd, Postfix- ab+cd*+",1.5, 7378,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix - = ,0, 7379,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7380,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix--- *+AB+CD postfix-----AB+CD+*,2, 7381,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd prefix ab+cd+*postfix,2, 7382,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",post=(abcd)++* and pre= +*+(abcd),0.5, 7383,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix is + + A * B C D,0.5, 7384,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7385,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7386,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7387,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","++ a*(bcd) , abc* + d+",0.5, 7388,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+AB+CD infix and AB+CD+* postfix,2, 7389,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",+*ab+cd and ab+*cd+,2, 7390,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix + + A * B C D post fix A B C * + D +,1, 7391,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7392,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7393,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",ab+cd*,2, 7394,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix:,0, 7395,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7396,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7397,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7398,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7399,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7400,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7401,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7402,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","*+ab+cd , ab+cd+*",2, 7403,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",a+b c+d,0, 7404,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",AC AND BD,0, 7405,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7406,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",(ABCD)++* AND +*+(ABCD),2, 7407,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7408,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7409,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",((a + (b * c)) + d),2, 7410,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7411,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7412,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7413,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",the prefix notation is * and postfix +,1, 7414,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",abcd++*,1, 7415,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7416,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7417,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",ab++cd* ,2, 7418,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*ab*+cd ,1, 7419,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix:,0, 7420,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7421,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7422,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7423,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7424,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7425,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7426,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",(ab+cd)+*,2, 7427,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",postfix-> [a+ b * c+ d] prefix->[*+ab+cd],2, 7428,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","+ab*+cd, ab+*cd+",2, 7429,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7430,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7431,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7432,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",ab+cd+*,2, 7433,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: *+ab+cd postfix: ab+cd+*,2, 7434,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7435,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd(pre) ab+cd+*(post),2, 7436,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd,2, 7437,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefx *+ab+cd postfix ab+cd+*,2, 7438,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",abcd,2, 7439,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7440,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7441,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7442,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix- +ab*+cd postfix- ab+cd+*,2, 7443,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *", a b + c d + *,1, 7444,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7445,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7446,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7447,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd and ab+cd+*,2, 7448,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7449,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7450,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",pre: *+ab+cd && post: ab+cd+*,2, 7451,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","prefix: + , postfix: *",1, 7452,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7453,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7454,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7455,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7456,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7457,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7458,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",abc+d*,0.5, 7459,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7460,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7461,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7462,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix = *+ab+cd postfix = ab+cd+*,2, 7463,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",ac +ad+bc+bd,0, 7464,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","prefix:*+AB+CD,POST:AB+CD+*",2, 7465,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",* + a b + c d a b + c d + *,2, 7466,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7467,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",pre :- *+ab+cd postfix :- ab+cd+*,2, 7468,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix =*+ab+cd postfix= ab+cd+*,2, 7469,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7470,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7471,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7472,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7473,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7474,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7475,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7476,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7477,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7478,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *"," * + A B + C D , A B + C D + *",2, 7479,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",(a*c)+(b*c)+(a*d)+(b*d),0.5, 7480,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","ab+*cd+ , *+ab+cd",1.5, 7481,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7482,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7483,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7484,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7485,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7486,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7487,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7488,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7489,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7490,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7491,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix - ,0, 7492,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7493,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",postfix: ((ab)+ (cd) +)* prefix: *(+(ab) +(cd)) ,1.5, 7494,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7495,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","prefix = * + A B + C D , postfix= A B + C D + *",2, 7496,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","*+ab+cd, ab+cd+*",1, 7497,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7498,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7499,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7500,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",ab+cd+*,0, 7501,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7502,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",ab+*cd+ and dc+*ab+,1.5, 7503,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *"," + + d * c b a, a b + c d + *",1, 7504,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",ab+*cd+ and *+ab+cd,1, 7505,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7506,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7507,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7508,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",(ab+)(cd+)*,2, 7509,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7510,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7511,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7512,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",( ),0, 7513,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7514,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",(ab+)(cd+)*,1.5, 7515,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix: *+ab+cd; Postfix: ab+cd+*,2, 7516,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",+*+abcd,1.5, 7517,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,2, 7518,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7519,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7520,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",ab+cd+* and *ab+cd+,2, 7521,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix = +ab*,1.5, 7522,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7523,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7524,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7525,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7526,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7527,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7528,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",dfsg,0, 7529,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7530,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",=,0, 7531,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd and ab+cd+*,1, 7532,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","*+ab+cd,",1.5, 7533,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7534,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *", prefix=+ + A * B C D postfix=A B C * + D +,1, 7535,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","*+ab+cd, ab+cd+*",1.5, 7536,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7537,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",AB+CD+*,1, 7538,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix : *+abcd,1.5, 7539,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7540,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7541,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7542,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7543,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","The expression A + B * C + D can be rewritten as ((A + (B * C)) + D) to show that the multiplication happens first, followed by the leftmost addition. A + B + C + D can be written as (((A + B) + C) + D) since the addition operations associate from left to right.",1, 7544,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7545,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",((a + (b * c)) + d),1, 7546,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",((a+ (b * c)) + d),1.5, 7547,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",+ + A * B C D A B C * + D +,1.5, 7548,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7549,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7550,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7551,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *", + + A * B C D A B C * + D +,1.5, 7552,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",pre: *+ab+cd and post: ab+cd+*,1.5, 7553,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",post->ab+cd+* pre->*+ab+cd,1, 7554,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7555,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7556,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7557,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","++a*bcd , abc*+d+",1.5, 7558,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd ,1.5, 7559,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","in prefix notation, the expression becomes: ""* + a b + c d"",In postfix notation, the expression becomes: ""a b + c d + *""",2, 7560,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7561,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",abcd++,1.5, 7562,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7563,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7564,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",((a+(b*c))+d),1.5, 7565,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7566,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix (+ab)*(+cd) postfix ab(+)cd*(+),1.5, 7567,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7568,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: * + A B + C D || postfix: A B + C D + *,1.5, 7569,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7570,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7571,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: * +ab + cd postfix: ab+ cd+ * ,1.5, 7572,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7573,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7574,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7575,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7576,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",The prefix notation of (a + b) * (c + d) is: * + a b + c d. The postfix notation of (a + b) * (c + d) is: a b + c d + *,1.5, 7577,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7578,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix = *+ab+cd Postfix = ab+cd+*,1.5, 7579,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",a+b prefix c+d is post ,1, 7580,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7581,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *", + +,0, 7582,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7583,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7584,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7585,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7586,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",+ + A * B C D A B C * + D +,1.5, 7587,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",((A + (B * C)) + D),1, 7588,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix : *+ab+cd postfix : ab+cd+*,1.5, 7589,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7590,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7591,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7592,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix : *+ab+cd postfix: ab+cd+*,2, 7593,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","he postfix expression abc+de/*- is equivalent to which of the following infix expression? Hence, correct choice is a-(b+c)*(d/e).",0, 7594,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7595,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7596,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix=* + A B + C D postfix=A B + C D + *,2, 7597,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7598,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix :- ab+()cd+()*,1, 7599,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7600,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7601,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7602,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix *+ab+cd postfix ab+cd+*,2, 7603,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7604,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7605,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",a+(b*C)+D ,0, 7606,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7607,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",The prefix notation of the expression (a + b) * (c + d) is: * + a b + c d The postfix notation of the expression (a + b) * (c + d) is: a b + c d + *,2, 7608,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",postfix is ab + cd ++ * prfic is *+ ab + cd,2, 7609,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7610,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7611,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7612,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7613,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7614,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix=* +ab+cd,1, 7615,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7616,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","Prefix notation of (a + b) * (c + d) is * + a b + c d, and postfix notation is a b + c d + *.",0, 7617,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",PREFIX: *(+ab)(+cd) ; POSTFIX: (ab+)(cd+)*,2, 7618,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",post fix - ab+cd++* pre fix *+ab+cd,0, 7619,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7620,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7621,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix *,0, 7622,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix = *+,0, 7623,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7624,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). It was first described by W. W. Peterson in 1957.,0, 7625,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7626,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7627,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7628,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*ab+cd ab+cd+*,1.5, 7629,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",a+b is preficx c+d is post,0, 7630,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7631,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",ac+ad+bc+bd,0, 7632,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7633,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7634,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7635,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix notation: * + a b + c d Postfix notation: a b + c d + *,2, 7636,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7637,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7638,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7639,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7640,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7641,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix - ,, 7642,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7643,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7644,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7645,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7646,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7647,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7648,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7649,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","prefix- * + a b + c d, post fix-a b + c d + *",, 7650,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7651,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd ab + cd + *,, 7652,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7653,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7654,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Post:- ab+cd++* Pre:- *+ab+cd ,, 7655,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7656,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","* + A B + C D, A B + C D + *",, 7657,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: ,, 7658,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7659,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix + postfix *,, 7660,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",((A + (B * C)) + D),, 7661,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",((A + (B * C)) + D),, 7662,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7663,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",ab+cd,, 7664,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7665,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",AB+CD-* and ABC/-AK/L-* ,, 7666,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix :* + a b + c d postfix: a b + c d + *,, 7667,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*+ab+cd,, 7668,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",+a+c*d,, 7669,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",*,0, 7670,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7671,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *", A B C * + D + (postfix),, 7672,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7673,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7674,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7675,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7676,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7677,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","++ A * BCD , ABC * + D +",, 7678,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7679,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",+ab*cd and ab+*cd+,, 7680,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7681,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7682,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7683,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7684,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7685,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",a+b prefix c+d post,, 7686,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7687,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7688,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7689,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix: *++abcd postfix:ab+cd+*,1, 7690,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",gm,0, 7691,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",a*b+c*d,0, 7692,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7693,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7694,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7695,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","++a*bcd , abc*+d+",0, 7696,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7697,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7698,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7699,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7700,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7701,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","The expression A + B * C + D can be rewritten as ((A + (B * C)) + D) to show that the multiplication happens first, followed by the leftmost addition. A + B + C + D can be written as (((A + B) + C) + D) since the addition operations associate from left to right.",0.5, 7702,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *","Prefix and postfix notations are ways to represent expressions in a form where the operators are placed either before (prefix) or after (postfix) their operands. These notations eliminate the need for parentheses to indicate the order of operations, as they inherently specify the order. The expression (a + b) * (c + d) in prefix and postfix notations ",0.5, 7703,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7704,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7705,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7706,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7707,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",* + ab + cd ab + cd + *,2, 7708,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7709,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",+ + A * B C D A B C * + D +,0, 7710,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",ff,0, 7711,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",postfix-abcd+*+ prefix-+*+abcd,0, 7712,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7713,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",postfix is ab + cd +* prefix is * +ab+cd,2, 7714,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7715,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7716,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7717,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7718,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7719,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7720,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",POSTFIX: ab+cd+* ; prefix: *+ab+cd,2, 7721,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix ac postfix bd,0, 7722,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",pre :* + A B + C D post : ; ,1, 7723,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7724,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *", a-(b+c)*(d/e).,0, 7725,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",prefix:*+ab+cd postfix:ab+*cd+,2, 7726,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",Prefix Notation: * + a b + c d Postfix Notation: a b + c d + *,2, 7727,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7728,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7729,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7730,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7731,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7732,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7733,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7734,What is the prefix and postfix notation of (a + b) * (c + d)?,"Prefix Notation − * + a b + c d Postfix Notation − a b + c d + *",,0, 7735,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort,0.5, 7736,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",The fastest sorting algorithm in the average case is Quicksort. It has an average time complexity of O(n log n) and is widely used due to its efficiency and effectiveness in practice.,1, 7737,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort cause its worst case time complexity is nlogn,2, 7738,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","The fastest sorting algorithm depends on the specific context and data characteristics. In general, algorithms like QuickSort and MergeSort are often considered fast for their average-case performance.",1.5, 7739,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort because its time complexity is least.,0.5, 7740,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,2, 7741,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7742,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Merqe Sort is the fastest algo along with Quick Sort. Both of them on avg take O(NlogN) time. However quicksort takes O(n2) in worst case.,1.5, 7743,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort It has an average-case time complexity of O(n log n,0.5, 7744,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 7745,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is generally the the fastest sorting algorithm because here we sort a small amount of data most of the times.,0.5, 7746,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort ,1, 7747,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",insertion sort,1.5, 7748,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,2, 7749,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort. it has a time complexity of o(logn) and does not use extra space ,0.5, 7750,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",MergeSort is considered the fastest as it uses O(NlogN) time complexity while most searches use O(n^2).,1.5, 7751,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","There isn't a single sorting algorithm that is universally the fastest in all scenarios. The efficiency of a sorting algorithm depends on factors like the input data, data distribution, and size of the dataset. Some sorting algorithms are faster for small datasets (e.g., insertion sort), while others are more efficient for larger datasets (e.g., quicksort or merge sort). The choice of the fastest sorting algorithm depends on the specific use case and data characteristics.",1, 7752,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is usually the fastest sorting algorithm. ,2, 7753,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",count sort ,1, 7754,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort because of nlogn time complexbility,0.5, 7755,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","No sorting algorithm can be claimed to be the fastest, since it depends on the data set which is to be sorted. Overall, quicksort is considered to be the fastest.",2, 7756,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Quick sort is also known as a “partition sort.” This sorting algorithm is faster than the previous algorithms because this algorithm uses the concept of divide and conquer. First, we decide on a pivot element. We then find the correct index for this pivot position and divide the array into two subarrays.",1.5, 7757,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,0.5, 7758,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,1, 7759,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap sort is considered the fastest as it takes minimum time ie O(n log n). there are many other algos which sort in O(n log n) eg- merge sort. ,2, 7760,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is considered fastest sorting algorithm,0.5, 7761,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,2, 7762,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is considered the fastest . as it takes O(logn) time using divide and conquer ,1.5, 7763,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort,0.5, 7764,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","The fastest sorting algorithm depends on the specific requirements and data characteristics. For general-purpose sorting, quicksort and merge sort are often considered among the fastest. However, the choice may vary based on the use case and data distribution.",2, 7765,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Counting sort, Radix sort finds element in linear time complexity",1, 7766,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is the fastest because og its lower time complexity because it use the partition and merge method,0.5, 7767,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",mergesort in O(nlogn) O(nlogn) is the worst case time complexity in that,1.5, 7768,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",normally mergesort and quicksort are used widely since they have nlogn complexity but in special cases we can use some lesser-known techniques such as bucket or counting sort etc.,2, 7769,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Merge sort is considered the fastest as it aways takes Log n time to search for any element.,1.5, 7770,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",bubble sort,0.5, 7771,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Linear Sorting Algos, such as Counting, Bucket, Radix Sort, etc. are considered the fastest. However when there are elements with large range, then Quick Sort/Merge Sort performs best(NlogN)",1, 7772,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Quick sort is considered the fastest for arrays because it works on partitioning and swapping method and takes O(nlogn) time complexity with O(1) space complexity whereas merge sort too takes O(nlogn) but due to added space complexity for arrays quick sort is fastest. For linked lists, merge sort is fastest.",2, 7773,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",bubble search as it has least time and space complexity,1, 7774,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICK SORT IS FASTEST SORTING ALGO AS IT HAS A COMPLEXITY OF O(N*LOGN),0.5, 7775,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort,2, 7776,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort ,0.5, 7777,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is the fastest sorting algorithm because it has time complexity of O(nlogn),1.5, 7778,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort,2, 7779,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Which sorting algorithm is considered the fastest because its time complexity is O(NlogN),1, 7780,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is considered the fastest sorting algorithm as it has a worst case time complexity of O(log n) and constant extra space.,1.5, 7781,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Heap Sort,0.5, 7782,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",cannot say if any criteria is not given,2, 7783,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort algorithm is the fastest,0.5, 7784,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort is often considered one of the fastest general-purpose sorting algorithms because of its average-case time complexity of O(n log n) and good performance on various data distributions.,1, 7785,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","The fastest sorting algorithm in practice is typically quicksort, as it has an average-case time complexity of O(n log n) and is often faster than other algorithms due to its efficient partitioning strategy and low constant factors.",1.5, 7786,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort is fastest sorting algorithm because its average time complexity is O(nlogn),2, 7787,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7788,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is considered the fastest. It is so because the time complexity is O(nlogn) for best case.,2, 7789,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort because the sorting range keeps on decreasing thus the space complexity is not O(n).,1, 7790,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort is the fastest algorithm as it uses concept of divide and conquer,1, 7791,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort i the fastest as it has lowest time complexity,2, 7792,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort and quick sort because their time complexity is less than other sorting algorithm ,2, 7793,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sortdouble ended queue i,1, 7794,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort and bubble sort,1, 7795,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7796,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs."," The efficiency of sorting algorithms depends on the specific use case. QuickSort, MergeSort, and HeapSort are often considered fast and efficient algorithms for general sorting purposes",1, 7797,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort is considered the fastest sorting method.,1, 7798,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",mergesort is the fastest sorting algorithm,1, 7799,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Quicksort Average-Case Time Complexity: O(n log n) Worst-Case Time Complexity: O(n^2) - This occurs when the pivot selection leads to highly unbalanced partitions, but this can be mitigated with randomized pivot selection or other strategies. Which is lowest.",2, 7800,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","The fastest sorting algorithm in the average and best-case scenarios is Quick Sort, thanks to its efficient partitioning strategy and low overhead.",1, 7801,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICK SORT,1, 7802,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort is the fastest sorting algortihm because is does in place sorting and performs t=lesser swaps and comarisons,1, 7803,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort is considered the fastest this is mainly because it breaks down the array and then sorts it which makes it easier and faster.,1, 7804,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICK SORT IS FASTEST O(NLOGN) IT WO0RKS ON THE PARTION OF GIVER ARREY,1, 7805,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort as it has the least time complexity nlogn,1, 7806,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7807,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick and count,1, 7808,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is considered the fastest sorting algorithm,1, 7809,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,1, 7810,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7811,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7812,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort O(n log n),1, 7813,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","The time complexity of Quicksort is O(n log n) in the best case, O(n log n) in the average case, and O(n^2) in the worst case.",1, 7814,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because it has least time complexity ie nlog(n),1, 7815,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7816,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7817,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","merge sort, the worst case time complexity is log n",0, 7818,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7819,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7820,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7821,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort,1, 7822,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7823,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7824,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is the fastest because its time complexity is n log(n).,1, 7825,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7826,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7827,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7828,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",different sorting algo's perform better in different scenarios,0.5, 7829,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort,1, 7830,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort. ologn time,1, 7831,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort,1, 7832,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",There's no universally fastest sorting algorithm; the choice depends on the specific data and requirements. QuickSort and MergeSort are commonly efficient choices for general purposes.,2, 7833,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Count Sort,1, 7834,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort,1.5, 7835,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort because its time complexity is O(NlogN) and space complexity is O(1) which is the minimum of all the sorting algorithms.,1.5, 7836,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort as its time complexity O(nlogn) and space complexity O(1) which is tyhe minimum posssible in sorting ,1.5, 7837,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7838,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QuickSort because of pivot begin fixed and array being made half,1.5, 7839,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7840,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","The efficiency of sorting algorithms depends on the specific use case. QuickSort, MergeSort, and HeapSort are often considered fast and efficient algorithms for general sorting purposes.",2, 7841,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","quicksort as pivot fixed and array being halved, uses break and conquer technique",1, 7842,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort is considered the fastest since it follows divide and conquer principle and is most efficient.,1, 7843,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort is fatest in array and merge sort in linked list.,1, 7844,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quicksort is considered the fastest sorting algorithms due to its average-case time complexity of O(n log n).,1, 7845,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Bubble sort,0, 7846,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort. its time complexity is O(nlogn),1, 7847,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sorting because it has the time complexity of log(n),1, 7848,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort is considered fastest because of log n time complexity,1, 7849,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort,1, 7850,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick ,95, 7851,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort ,1, 7852,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,1, 7853,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Merge Sort although it might take more memory,1, 7854,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.", Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,1, 7855,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","There isn't a one-size-fits-all answer, as the efficiency depends on the specific use case. QuickSort is often considered fast due to its average-case time complexity of O(n log n) and low overhead.",2, 7856,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs."," The fastest sorting algorithm depends on the context. For large datasets, quicksort and merge sort are often considered fast. For small datasets, insertion sort and selection sort may be faster due to their simplicity.",2, 7857,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,1, 7858,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7859,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","quick sort, O(1) is best case",0.5, 7860,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",radix sort,0, 7861,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7862,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort is the fastest as it breaks the data into multiple parts and sorts with minimum traversal,1, 7863,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICK SORT AS ITS NO LOOP INOLVED ,1, 7864,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICKSORT IT HAS BEST TIME COMPLEXITY,1, 7865,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is the fastest as it breaks the data into two parts and the performs the sorting,1, 7866,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,1, 7867,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort as a pivot point is fixed and array is divided into two parts,1, 7868,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quicksort is considered as the fastest algorithm as it is a stable sorting algo and has average time complexity of O(NLOGN),1, 7869,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",bucket sort,0, 7870,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","quick sort, worst case: nlogn, best case: log(n);",1, 7871,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.", Quick Sort is the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,1, 7872,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","it is the fastest sorting, because the time complexity mostly is O(N * logN)",1, 7873,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort is considered to be the fastest,1, 7874,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,1, 7875,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quicksort is generally considered the “fastest” sorting algorithm because it has the best performance in the average case for most inputs,1, 7876,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","the choice of the fastest sorting algorithm depends on factors such as the size of the data, the nature of the data (e.g., already partially sorted or with duplicate values), stability requirements, and the trade-offs between average-case and worst-case performance.",2, 7877,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1, 7878,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because its time complexity is logn,1, 7879,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","mergesort, because of best average time case O(logN) complexity",1, 7880,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","merge sort is considered the fastest, due to separting and sorting the arrays in two parts.",1, 7881,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7882,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Merge Sort,1, 7883,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is considered as the fasted,1, 7884,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sorting.,1, 7885,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is fastest as it divides the array creating O(nlogn),1, 7886,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1, 7887,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7888,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort if fastest beacuse it takes O(nlogn) time,1, 7889,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,1, 7890,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort. it is fastest as Quick sort is a sorting algorithm that works by selecting a pivot element from the array and partitioning the other elements into two sub-arrays according to whether they are less than or greater than the pivot. The sub-arrays are then recursively sorted. This process is repeated until the entire array is sorted. Quick sort is known for its efficiency and is widely used in practice.,1, 7891,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7892,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Heap Sort,0, 7893,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is generally the fastest because of itys efficient time complexity,1, 7894,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap sort,0, 7895,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap sort.it operates in O(n) time,0, 7896,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",radix sort ,0, 7897,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",No sorting algorithm can be acclaimed to be fastest because there's no clear criteria given on which we could conclude.,0.5, 7898,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7899,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because it takes the least amount of time to run,1, 7900,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort beacuse of the presence of pivot,1, 7901,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Counting sort is the fastes with O(n) time complexity.,0, 7902,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7903,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7904,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort as it breaks,1, 7905,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort,1, 7906,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort:Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time.,1, 7907,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICK SORT,1, 7908,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7909,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap sort,0, 7910,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7911,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7912,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Heap sort,0, 7913,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",binary sort. takes shortes time,0, 7914,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort as it has minimum comparisons,1, 7915,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",radix sort,0, 7916,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is considered to be the fastest. because it can deal with any data set irrespective of the entries and the average time complexity is O(nlogn) without using any auxilary space,1, 7917,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",binary search because of its time complexity logN,0, 7918,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quicksort is often considered the fastest sorting algorithm on average due to its efficient partitioning.,1, 7919,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1, 7920,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7921,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort . ,1, 7922,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","merge sort and quick sort because its time complexity is o(n logn) , in rest algorithms mostly time compexity is n square",1, 7923,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7924,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","In practice, Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).",1, 7925,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",The fastest sorting algorithm depends on the specific use case. Quick Sort is often considered one of the fastest for general sorting due to its average time complexity of O(n log n).,1, 7926,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort or merge sort,1, 7927,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICK SORT IS THE FASTEST ALGO AS IT HAS O(NLOGN) TIME COMPLEXITY,1, 7928,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","quicksort,Olog(n)",1, 7929,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is considered as the fastest as it doest not uses extra space and has time complexity o(logn),1, 7930,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7931,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort and mergesort but it depends on the data ,1, 7932,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort. Time complexity of quick sort is leasr O(logN),1, 7933,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort because it has a time complexity of logn,1, 7934,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because its usual time complexity for an unsorted array is minimum,1.5, 7935,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort,1, 7936,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because its time complexity for an unsorted array is minimum,1.5, 7937,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7938,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quickSort,1, 7939,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quicksort is considered fastest even though its not stable,1.5, 7940,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7941,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort time complexity o(nlogn) as it take pivot and and place elemnts ,1.5, 7942,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,0, 7943,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is the fastest searching algorithm as it has time complexity of ,1, 7944,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7945,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","quicksort, its in the name",1, 7946,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7947,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is the fastest as the time complexity is n*log(n).,1, 7948,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because of time complexity of nlogn,1, 7949,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Merge sort is considered the fastest,0, 7950,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7951,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort as it follows partition technique,1, 7952,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7953,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Merge Sort because O(logn),0, 7954,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7955,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",radix sort as it has time complexity o(log n),0, 7956,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort because it has 0(logn) time complexity and 0(1) space complexity,1, 7957,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is considered the fastest because in ordinary cases this sorting has least time complexity.,1, 7958,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Quick sort and merge sort, (QUick sort is better) are general purporse fastest sorting algos O(nlogn)",0.5, 7959,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quicksort ,1, 7960,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort beacuse it has nlogn time comlexity,1, 7961,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,0, 7962,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","heap sort,",0, 7963,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort,1, 7964,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort because it has a time complexity of O(nlogn),1, 7965,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7966,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort.,1, 7967,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7968,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7969,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",radix sort,0, 7970,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Radix sort is considered as the fastest sorting algorithm.,0, 7971,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort,1, 7972,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort and Merge sort are considered as the fastest soring algos as they require only O(log n) time.,0.5, 7973,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7974,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because its quick,1, 7975,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is considered as fastest as it has best time complexity of O(logn),1, 7976,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort is considerd as the fastest time complexityof O(n log n).,1, 7977,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICK SORT because the time complexity is O(log(n)),1, 7978,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N),1, 7979,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7980,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","quick sort,in the name",1, 7981,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7982,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 7983,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Quicksort, since it performs sorting in an O(NLogN) fashion",1, 7984,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort. It has time complexity logn,2, 7985,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is usually the fastest sorting algorithm,2, 7986,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because it has less time complexity,2, 7987,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 7988,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort,2, 7989,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",binary search because of its time complexity,0, 7990,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 7991,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7992,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because its worst case and best case is o(nlogn),2, 7993,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICK SORT O(N LOG N ) TC BEST CASE,2, 7994,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7995,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 7996,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 7997,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 7998,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 7999,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",YES,0, 8000,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,0, 8001,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICK SORT BECAUSE ITS COMPLETES IN O(N).,2, 8002,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",bubblesort,0, 8003,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",mearge sort because it sorts in O(log n) time complexity,2, 8004,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort and merge sort,2, 8005,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Mergesort as it takes the average and worst case complexity of Nlog(N),2, 8006,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Interpolation due to time complexicity,1, 8007,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort becaue of time complexity of Olog(n),2, 8008,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort algorithm ,2, 8009,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort as it has the least time complexity compared to others,2, 8010,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICK SORT IS THE FASTEST,2, 8011,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort,2, 8012,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",counting sort is the fastest as it uses another array to store frequency at their index and fills the value in the sorted array,0, 8013,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","merge sort,takes O(log n) time",1, 8014,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort . it is of n(log n) complexity,2, 8015,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,2, 8016,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick short ,2, 8017,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8018,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",because compilation time is the least in it,0, 8019,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8020,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8021,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8022,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Merge sort can be considered the fastest in the worst case scenario as it divides the original array into two sub-arrays and merge both the sub arrays which takes lesser time.,2, 8023,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort. it has t.c. of O(log n),2, 8024,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8025,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort,2, 8026,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort is the fastest. As it has time complexity of O(logn),1, 8027,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort as it uses the priority function,1, 8028,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Quick sort, because it has a time complexity of O(n logn).",2, 8029,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quicksort ,2, 8030,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8031,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort it works in o(nlogn) time,2, 8032,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",It all depends on how much big the data base is. Some algo may work better on smaller and some on bigger database. ,1, 8033,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8034,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort ,2, 8035,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8036,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8037,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because itrs time complexity is O(nlogn) which is the fastest,2, 8038,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort because it has n log n time complexity ,2, 8039,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","quicksort, because it take big o(nlogn) time complexity which is the fastest among other sorting techniquires",2, 8040,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1, 8041,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8042,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1, 8043,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Count Sort but we have some problem in this sort so we mainly use merge sort.,0, 8044,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort is considered to be fastest,1, 8045,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8046,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Search sort, O(logn)",0, 8047,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because it has time complicity O(logn),2, 8048,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort,2, 8049,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8050,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort,2, 8051,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1, 8052,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort time complxity is good,1, 8053,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8054,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8055,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort,2, 8056,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","heap sort beacuse in this we traverse only k elements of the array,not full array",0, 8057,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","quick sort becaue the time compl . always remain nlogn whether in average , worst or average better than the merge sort",2, 8058,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is the fastest way ,2, 8059,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICKSORT,2, 8060,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort: Quick sort is often considered one of the fastest general-purpose sorting algorithms. It has an average-case time complexity of O(n*log(n)) and can be very efficient ,2, 8061,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8062,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Heap Sort because of O(n),0, 8063,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort it works in o(nlogn) time .,2, 8064,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8065,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort,2, 8066,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because of its divide and conquer technique and less time complexity,2, 8067,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort algorithm is coinsidered as the fastest technique for sorting.,2, 8068,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort bcoz it time complexity is very less,2, 8069,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort,2, 8070,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort,2, 8071,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is considered the fastest sorting algorithm because its time complexity is O(N);,2, 8072,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quck sort is considered the fasted as the pivot point chosen makes it very faster and easier and reduces complexity.,2, 8073,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.", Quick Sort is the fastest sorting algorithm. Its time complexity is in O(N × log N).,2, 8074,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",SELECTION SORT BECAUSE IT IS THE MOST EFFICIENT.,0, 8075,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",radix sort is considered the fastest. ,0, 8076,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8077,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quicksort is condiered the fastest with the lowest time complexity possible,2, 8078,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",bucket sort,0, 8079,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort is considered as fastest as its time complexity is 0(n*logn) and does not use extra space as in merge sort.,2, 8080,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Quick sort considered as the fastest because quick sort has an average time complexity of O(n log n), which is faster than most other sorting algorithms.",2, 8081,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",bucket sort because it has lowest complexity,0, 8082,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8083,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort.time complexity is the least,1.5, 8084,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","QuickSort is a pretty general purpose sorting algorithm if what we are going to sort is not huge. If we are planning to sort huge amounts of data, then we need something with intermediate memory such as MergeSort.",2, 8085,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort ,1, 8086,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8087,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",it actually depends on the database its size ,1, 8088,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is considered fastest as it has best time complexity among other searches.,2, 8089,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8090,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.", Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,2, 8091,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Merge sort,1, 8092,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort time complexity of order O(N × log N).,1.5, 8093,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8094,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8095,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1, 8096,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8097,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8098,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is often considered one of the fastest sorting algorithms in practice. It has an average and best-case time complexity of O(n log n) and is often faster than other algorithms when implemented well. ,0.5, 8099,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort. O(logn) time complexity,1.5, 8100,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",count sort,1.5, 8101,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8102,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","quicksort, because of its time complexity is n logn",1, 8103,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort is the fastest as it works on divide and conqure algo and takes n log n time,1.5, 8104,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",mergesort as the time complexity is logN,1.5, 8105,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Bucket Sort. ,1.5, 8106,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8107,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 8108,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICK SORT BECAUSE TC IS NLOGN,1.5, 8109,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1.5, 8110,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","QUICK SORT. because the time complexity always remains O(nlogn) whether in average, worst, best case, better than the merge sort.",1, 8111,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",o log n merge sort or count sort if space not a problem,1.5, 8112,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",count sort... not the data structure is traversed but its key value tree is,1.5, 8113,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1, 8114,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort because its time is N log N,1.5, 8115,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort,1, 8116,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.", ,0, 8117,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8118,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","quick sort ,O(log n)",1, 8119,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 8120,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",counting sort,1.5, 8121,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","In practice, Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).",1, 8122,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8123,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1, 8124,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","In practice, Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).",1, 8125,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 8126,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is fastest,1, 8127,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8128,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",selection,1, 8129,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1, 8130,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort or quicksort as it works on partioning so time reduces nlogn ,1.5, 8131,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort,1, 8132,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1.5, 8133,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort.,1, 8134,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8135,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort ,1, 8136,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8137,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1, 8138,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8139,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,1.5, 8140,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is the fastest ,1, 8141,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because it divides it self in two halfs,1.5, 8142,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","merge sort , time complexity = O(nlogn)",1, 8143,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8144,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because its time is ologn ,1, 8145,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort as time complexity is log n,1.5, 8146,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 8147,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap sort,1.5, 8148,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort as it has complexity of o(logn),1.5, 8149,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8150,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8151,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8152,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort as it divides it into 2 halves,1.5, 8153,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",mergesort is considered fastest cause its complexity is O(nlogn),1.5, 8154,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Quicksort ,it has the best time complexity",1.5, 8155,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8156,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort as its time complexity is the least,1, 8157,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because its time complexity is o(n log n),1.5, 8158,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort.. Its performance is measured most of the time in O(N × log N).,1, 8159,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because IT DIVIDES ITSELF INTO 2 HALVES,1.5, 8160,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8161,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap sort,1.5, 8162,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8163,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICKSORT,1, 8164,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",qick sorting,1.5, 8165,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8166,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort less time complaxity o(n log n),1, 8167,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8168,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8169,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.", Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N),1.5, 8170,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8171,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",The fastest sorting algorithm depends on the specific use case and data. Some of the commonly considered fast sorting algorithms is heap sort.,1.5, 8172,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap sort,1.5, 8173,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Merge Sort is considered as fastest out of all algo because it divides the array into two parts which make it into so many small arrays so as to make it easier to sort.,1, 8174,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","quick sort, best time complexity",1.5, 8175,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",COUNT SORT,1.5, 8176,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","In practice, Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).",1, 8177,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Merge sort,1, 8178,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8179,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","In practice, Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).",1.5, 8180,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",binary search as it reduces the input to half in each trial,1, 8181,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.", Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,1.5, 8182,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1, 8183,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Bucket sort,1.5, 8184,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8185,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8186,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8187,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Mergesort algorithm is considered the fastest sorting algorithm based on the divide and conquer algo, it divides the array into two parts until single elements are left. Then the elements are compared and sorted. Time Complexity of this algo is O(log n) ",2, 8188,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","In practice, Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).",2, 8189,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,0, 8190,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap sort,0, 8191,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","In practice, Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).",2, 8192,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8193,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort,2, 8194,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Heap -sorts in nlogn time complexity,0, 8195,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8196,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","The time complexity of Quicksort is O(n log n) in the best case, O(n log n) in the average case, and O(n^2) in the worst case. But because it has the best performance in the average case for most inputs, Quicksort is generally considered the “fastest” sorting algorithm",2, 8197,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",bucket sort,0, 8198,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8199,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8200,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8201,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",insertion sort,0, 8202,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8203,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heapsort and mergesort,0, 8204,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8205,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8206,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8207,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,0, 8208,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8209,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,0, 8210,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort its time complexity is O(N* log N),1.5, 8211,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8212,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort because of it's minimum time complexity.,1.5, 8213,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap and merge,0, 8214,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,0, 8215,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,0, 8216,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort and mergesort,0, 8217,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick and merge sort,0, 8218,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8219,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys (key values). It was first described by W. W. Peterson in 1957.,0, 8220,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort because of o(logn),1.5, 8221,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8222,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8223,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","erge Sort is not necessarily the fastest sorting algorithm, but it's efficient due to its stable O(n*log(n)) time complexity and ability to handle large datasets.",0, 8224,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","quick short , best time complexity",1.5, 8225,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8226,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8227,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,0, 8228,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8229,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1.5, 8230,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Quick sort, it has an average time complexity of O(n log n), time complexity is in log for both worst and best case ",2, 8231,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",count sort because it works in o(n),0, 8232,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8233,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8234,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort,2, 8235,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,0, 8236,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",counting sorting algorithm is considered fastest because of O(n) time complexity.,0, 8237,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap sort,0, 8238,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8239,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap,0, 8240,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8241,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8242,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8243,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Merge sort is considered to be the fastest as it computes in O nlog(n) time,0, 8244,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Quick sort, low constant factors",2, 8245,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap sort,0, 8246,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort ,2, 8247,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge and quick sort,2, 8248,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8249,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Merge Sort,Head Sort",0, 8250,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8251,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,0, 8252,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8253,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8254,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",binary time o(log n),0, 8255,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quicksort,2, 8256,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8257,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8258,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8259,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,0, 8260,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort as it handle large data and take less memory,2, 8261,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","Quick Sort. Most of the time, its performance is expressed in O(nlog n) with base 2",2, 8262,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","quicksort, because it used for large data and bETTER TIME COMPLEXITY",2, 8263,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is fastest ,2, 8264,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",It is an easy way used for sorting than others.It is also the fastest as it is quite simple to arrrange nodes in ascending order.,0, 8265,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap sort,0, 8266,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8267,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8268,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge,0, 8269,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","In practice, Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).",2, 8270,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort,2, 8271,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Merge sort,0, 8272,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,2, 8273,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8274,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Radix,0, 8275,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","radix sort , bucket sort",0, 8276,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort,2, 8277,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",radix sort,0, 8278,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","radix sort, ",0, 8279,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICK SORT,2, 8280,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quicksort,2, 8281,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",radix sort,0, 8282,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",insertion sort or merge sort,0, 8283,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick sort,2, 8284,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is the fastest because ,1, 8285,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heapsort,1, 8286,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort is the fastest ,1, 8287,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Merge Sort,1, 8288,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8289,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort ,1, 8290,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","In practice, Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N)",1, 8291,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap sort nlogn and no extra space,1, 8292,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",INSERTION SORT,1, 8293,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap,1, 8294,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8295,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort as time complexity is log n,1, 8296,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QuickSort,1, 8297,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.","The fastest sorting algorithm depends on the specific requirements and characteristics of the data to be sorted. No single sorting algorithm is universally the fastest for all scenarios. The choice of a sorting algorithm should be based on factors such as the size of the data, the distribution of data values, the available memory, and the stability of the algorithm. Here are some commonly used sorting algorithms and their typical performance characteristics: Quicksort: Quicksort is often considered one of the fastest general-purpose sorting algorithms. It has an average-case time complexity of O(n log n), where n is the number of elements to be sorted. Quicksort is efficient when the data is randomly distributed, and it typically outperforms other algorithms like bubble sort and insertion sort. However, its worst-case time complexity is O(n^2), which can occur with certain input distributions. To mitigate this, various optimizations and randomized versions of quicksort have been developed.",1, 8298,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heap sort ,1, 8299,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quicksort (time complexity is the least),1, 8300,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort as its time complexity is least,1, 8301,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.", Quick Sort,1, 8302,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 8303,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort.,1, 8304,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 8305,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort,1, 8306,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 8307,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort ,1, 8308,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",heapsort and mergesort ,1, 8309,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",HEAP SORT,1, 8310,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 8311,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8312,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8313,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort ,1, 8314,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Insertion,1, 8315,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",QUICKSORT,1, 8316,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort because of less time complexity,1, 8317,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",MERGE SORT ; AVG TIME COMPLEXITY IS MINIMUM,1, 8318,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8319,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8320,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",count sort/radix sort/bucket sort in O(n),1, 8321,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8322,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,0, 8323,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",merge sort,1, 8324,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",count sort is the fastest algorithm for small dataset but for lasrge datasets we always prefer quick sort,1, 8325,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",count sort it follows ,1, 8326,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",quick sort,1, 8327,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",Quick Sort is usually the fastest sorting algorithm. Its performance is measured most of the time in O(N × log N).,1, 8328,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",,1, 8329,Which sorting algorithm is considered the fastest? Why?,"A single sorting algorithm can’t be considered best, as each algorithm is designed for a particular data structure and data set. However, the QuickSort algorithm is generally considered the fastest because it has the best performance for most inputs.",count sort,1, 8330,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",node having 0-2 childs,1.5, 8331,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a hierarchical data structure in which each node has at most two children, referred to as the left child and the right child. It is used for efficient storage and retrieval of data, particularly in applications like search algorithms and hierarchical structures.",0.5, 8332,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree is a linked list like data structure but it has 2 nodes ,2, 8333,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a hierarchical data structure consisting of nodes, where each node has at most two children: a left child and a right child.",0.5, 8334,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree in which every node has to address fields.,1, 8335,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","Binary Tree is defined as a tree data structure where each node has at most 2 children. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.",1.5, 8336,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree-type non-linear data structure with a maximum of two children can be inserted for each parent.,2, 8337,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a non linear data structure in which every value is stored in a node and is connected to at max to other similar nodes.,1, 8338,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which has maximum two children,0.5, 8339,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A tree where each node has either single child , double child or no child.",2, 8340,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a data structure in which a record is linked to two successor records, usually referred to as the left branch when greater and the right when less than the previous record.",1.5, 8341,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a binary tree is a tree in which every node has either 0 , 1 or maximum 2 nodes ",0.5, 8342,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",having left/right nodes and have 1 val;,1, 8343,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,2, 8344,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree which have only two childs(left and right),1, 8345,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree with at most 2 and atleast 0 children. Every subtree of the root tree is also a binary tree. ,0.5, 8346,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a tree data structure in which each node has at most two children, typically referred to as the left child and the right child. It is a fundamental data structure used in computer science and is the basis for various tree-based algorithms and data structures.",1.5, 8347,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. ,0.5, 8348,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",right left data and point to itself by two nodes,2, 8349,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a data structure just like linked list in which we have root and children it storest data just like in tree form,1, 8350,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",It is a type of tree which can at maximum have two child nodes,0.5, 8351,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. Every node in a binary tree has a left and right reference along with the data element. The node at the top of the hierarchy of a tree is called the root node. The nodes that hold other sub-nodes are the parent nodes.,2, 8352,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A Binary tree is represented by a pointer to the topmost node (commonly known as the “root”) of the tree,1.5, 8353,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is tree in data strucher that each node have two pointers to child data ,1, 8354,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree whos node has two child pointers.,2, 8355,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree that allows maximum two nodes per child is a binary tree,0.5, 8356,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,1.5, 8357,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A non linear data structure having parent node consisting of data pointer to two other same nodes(left child and right child),2, 8358,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is data structure with two child at each node that is left and right child,1, 8359,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a hierarchical data structure where each node has at most two children, typically referred to as the left and right child. It is commonly used for representing hierarchical structures like file systems and expressions.",0.5, 8360,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a tree with number of children are 2,2, 8361,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",is a non linear tree type data structure in which each parent has two child,0.5, 8362,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a non linear data structure with at most 2 children considered as left and right child,2, 8363,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a non-linear hierarchical data structure in which ever node has at max. 2 children.,1, 8364,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is one where every node of the tree has either 0, 1 or maximum 2 elements as it's children",1.5, 8365,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a knary tree of order of 2 meaning a root can have maximum 2 child which are left and right child,0.5, 8366,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree with maximum of two children per node is called a binary tree.,1, 8367,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree with two or less children for each node is binary tree.,2, 8368,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree with maximum two child,1, 8369,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A BINARY TREE IS A TYPE OF TREE WHERE EACH NODE CAN HAVE A MAXIMUM OF TWO CHILD NODES ,1.5, 8370,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a data structure with one root node and two children,0.5, 8371,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,2, 8372,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree where parent node should have atmost two childrens,0.5, 8373,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",where each node has 2 child node left and right,2, 8374,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is special kind of tree in which every node has 0 or 1 or 2 child nodes.,1.5, 8375,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is kind of tree with a maximum of two children for each parent. Every node in a binary tree has a left and right child along with a key.,0.5, 8376,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a hierarchical data structure in which a node has maximum of two children, usually called the left child and the right child.",1, 8377,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a hierarchical data structure composed of nodes, where each node has at most two children: a left child and a right child.",2, 8378,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a tree data structure in which the parent node has two child nodes.,1.5, 8379,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a tree data structure in which each node has at most two child nodes, typically referred to as the left child and the right child.",0.5, 8380,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a non linear data structure which have two direction to move in left or right,2, 8381,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a special tree data structure with maximum two childs,2, 8382,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","type of a data strucutre in which each node have 0,1,2 leafs",2, 8383,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree with two branches is called a Binary Tree,2, 8384,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree which contains only two childs.,2, 8385,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree which has at most 2 children,2, 8386,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a data structure where every node can have 0-2 children.,2, 8387,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child",2, 8388,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a type of data structure which have two child nodes (left and right ) it is a non linear data structure ,2, 8389,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","binary tree is a tree in which numbers are inserted in the order which they are inserted, it doesn't have anything to do with the number being smaller or greater",2, 8390,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a tree with degree 2 ,2, 8391,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child.",2, 8392,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binay tree is type of non linear data structure. It has two childred per parent/root node.,2, 8393,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it stores data in the form of tree structure which includes root node and its chils nodes,2, 8394,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a hierarchical data structure in computer science that is composed of nodes, where each node has at most two children, referred to as the left child and the right child. The top node in a binary tree is known as the root, and nodes that have no children are called leaf nodes.",2, 8395,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a hierarchical data structure in which each node has at most two children, typically referred to as the left child and the right child.",2, 8396,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",TYPE OF DATA STRUCTURE IN WHICH DATA IS STORED IN TREE FORMAT,2, 8397,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A non linear data structure having a node that points to exactly two nodes or NULLS,2, 8398,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a kind of tree where the parent only has 0 -2 children. ,2, 8399,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A TREE WITH TWO NODES OR LESS,2, 8400,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","In which each node has either 0,1,2 children",2, 8401,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",non linaer ds with max 2 child nodes,2, 8402,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree has two childs left and right,2, 8403,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a tree data structure in which each parent has at most 2 children and not more than that.,2, 8404,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","its has either 0 , 1 or 2 child ",2, 8405,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree in which every node at most have 2 children,2, 8406,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a tree in which one element is consider as root and smaller values from that root comes on left and larger values comes on right.,2, 8407,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","binary tree is the data structure which each node has two children, left child and the right child",2, 8408,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child.",2, 8409,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree which can have only 2 child ,2, 8410,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","everry node can have 0 , 1 , or 2 childs",2, 8411,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree with atleat 0 and atmost 2 childern,2, 8412,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",data structure where every node is pointing to a left and right node or a null pointer if they are not there,2, 8413,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree having at most two children ,2, 8414,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8415,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is tree where node can be insert delete search ,2, 8416,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A type of Data Structure in which a node can have atmost 2 children and at least 0 chilf,2, 8417,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8418,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree having at 2 children,2, 8419,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a type of Data Structure where data are stiored in form of leafs and it structure is just like a tree where at the top is the node followed by its left node and right node and so on.,2, 8420,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a data structure where nodes are connected and atmost 2 children can have,2, 8421,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which stores values in form of binary,2, 8422,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which has two or less than two child nodes for each node is called a binary tree,2, 8423,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", a binary tree is a tree in which each node has at most 2 child nodes,2, 8424,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree with two roots,2, 8425,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree whose node has two childeren,2, 8426,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","it is a special DS, which like LL, has nodes but special thing is it has 2 nodes and hence every node can store data, and address if 2 further nodes.",2, 8427,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. It's a fundamental data structure used in computer science for various applications, including search algorithms, data storage, and hierarchical representation.",2, 8428,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree having two nodes,2, 8429,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8430,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree in which ever node can have maximum of 2 childs.,2, 8431,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","The tree having 0 ,1 or 2 children ",2, 8432,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8433,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree which has atmost 2 childrens,2, 8434,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8435,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child",2, 8436,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree where a node can have atmost 2 children,2, 8437,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a tree that has one key value in its node and pointers to its only two students.,1.5, 8438,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree having 2 nodes each is clalled a binary tree.,1.5, 8439,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a hierarchical data structure in which each node has at most two children, usually referred to as the left child and the right child. ",2, 8440,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Is knary tree of order 2 with max of two childs,1, 8441,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree data structure containing atmost two nodes namely left and right nodes.,1.5, 8442,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is not a linear data structure in which a node has maximum of two child nodes.,1.5, 8443,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","binary tree is a type of data structure in which there is root,left child and right child. It is a type of non linear data structure",1, 8444,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",its a tree which can only have two child and two grandchild ,1, 8445,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Two child nodes,1, 8446,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree structure of data sorted in a way its easier to find an elements,195, 8447,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","Binary Tree is defined as a tree data structure where each node has at most 2 children. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.",1.5, 8448,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree where there are left and right nodes,1.5, 8449,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a tree where a root is present and there is onl;y max possible two child for a root node,2, 8450,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a hierarchical data structure where each node has at most two children, referred to as the left child and the right child.",2, 8451,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", A binary tree is a hierarchical data structure in which each node has at most two children.,2, 8452,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A Binary tree is represented by a pointer to the topmost node (which known as the “root”) of the tree.,1.5, 8453,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8454,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a ds which has 2 child nodes and a parent node, root node only has childs",1.5, 8455,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree for which a node can only have 2 child is binary tree,1.5, 8456,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is an tree which follows the rule that smaller element goes to left and bigger goes to right of an node.,2, 8457,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary Tree is a data structure which consists of parent node also called root and children nodes also called leaf.they are connected with the help of pointers.,2, 8458,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",BINARY TREE IS A DATA STRUCTURE IN WHICH THERE IS 2 CHILD OF A NODE OR WILL HAVE NO CHILD ,2, 8459,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",BINARY TREE IS A HIRERACAL DATA STURUCTURE ,2, 8460,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which can have two children is called a binary tree,1, 8461,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. Every node in a binary tree has a left and right reference along with the data element. The node at the top of the hierarchy of a tree is called the root node. The nodes that hold other sub-nodes are the parent nodes,2, 8462,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree where a node can have almost 2 childrens,1, 8463,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a data structure in which every node has at most two children,1, 8464,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",right is big left is small,1, 8465,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a ds in which data is added in a parent and child manner,1, 8466,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", A Binary tree is represented by a pointer to the root of the tree.,1, 8467,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary Tree is represented by pointers to the root Node of the tree structure,1, 8468,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a non-linear data structure with nodes having children nodes,1.5, 8469,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","Tree in which there are nodes which represent child,siblings,ancestors and has a maximum of 2 childs.",2, 8470,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","Binary Tree is defined as a tree data structure where each node has at most 2 children. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.",2, 8471,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","Binary trees are fundamental in computer science and are used in various algorithms, data structures, and applications. ",1.5, 8472,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", a tree in which each node can have maximum two childs is binary tree,1.5, 8473,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a dynamic data structure,0, 8474,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree which has atmost 2 child,1, 8475,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a type of data structure in which a single node is connected to two nodes that is left node and right node.,1.5, 8476,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a tree where each root can have atmost 2 children, and every subtree is also a binary tree.",2, 8477,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", A tree having atmost 2 children for every root node is called a binary tree.It is a Non linear data structure.,2, 8478,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree in which all roots have 2 child nodes are called binary tree,2, 8479,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",This is a kind of code which is used to ,0, 8480,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary Tree is a MultiLinked List as it contains many pointers in it,0.5, 8481,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it consists of two children from the root,0.5, 8482,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree with two child node,0.5, 8483,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","it is a collection nodes with data,left child and right child",1, 8484,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which has at most 2 child is known as binary tree,1, 8485,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",non linear data structure with max 2 child nodes,1, 8486,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a type of multi linked list that has not more than two child is called binary tree.,1, 8487,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a k-ary tree where k is equal to 2 where a node can have a maximum of two children.,1, 8488,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a data structure consisting of a tree node called as root and also consist of left sub tree and right sub tree.,1.5, 8489,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is one in whcih every node can have max two sub tress or can expand in two directions only.,1.5, 8490,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which has atmost 2 children,1, 8491,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is made up of nodes that can have a maximum of two children as left and right child.,1, 8492,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is that tree in which nodes can have at max of 2 children.,1, 8493,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A TREE IN WHICH PARENT NODE HAS EXACTLY TWO CHILD NODE.,1, 8494,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","in this tree, each parent node can have atmost 2 children",1, 8495,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",the data structure which has two child which furthur divides into two children.,1, 8496,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree in which every node has atmost 2 children.,1, 8497,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8498,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A Binary tree is represented by a pointer to the topmost node (commonly known as the “root”) of the tree,1, 8499,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binaryy tree is a tree in which the data is stored in a simple manner and the data can be manipulated after thr insertion and it can also perform deletion,1, 8500,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a tree with maximum two possible nodes,1, 8501,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary Tree is a knary tree of order of 2 meaning a root can have maximum 2 child which left and right,1, 8502,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a type of tree data structure in which each node can have at most two child nodes, known as the left child and the right child",1.5, 8503,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8504,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a type of tree that has only 2 children for every parent node,1, 8505,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a data structure which contain only two child and each chilkd on the left is smaller than the root anf ,1, 8506,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree represented by a pointer to the top most node known as root,1, 8507,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","Data structure in which a node has a data, a left child and a right child",1, 8508,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a tree that has nodes containing 0,1 or 2 children",1, 8509,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A Binary tree is represented by a pointer to the topmost node of the tree,0.5, 8510,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a non-linear data structure,0.5, 8511,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a type of multi-linked list where every node has either 0 or 1 or 2 decendents ,1, 8512,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is arranged in the form of the tree structure ,1, 8513,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary Tree is a tree data structure where each node has at most two children.,1, 8514,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",who have two child left and right,1, 8515,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a structure in which each node has its value and pointers to left and right nodes of its same data type.,1, 8516,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a data structure which each node has left and right pointers along with data which makes it look like a tree structure.,1, 8517,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Tree where each node has less than or equal to 2 child.,1, 8518,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",node have two childs or one or zero,0.5, 8519,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent.,1, 8520,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A Binary Tree is a hierarchical data structure where each node has at most two children.,1, 8521,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a non linear data structure consisting of nodes which have a data and child nodes,1, 8522,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",BINARY TREE IS THE TREE WHICH CAN ONLY HAVE 2 OR LESS THAN 2 NODES ,1, 8523,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",every root has two children left and right,0.5, 8524,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. Every node in a binary tree has a left and right reference along with the data element. The node at the top of the hierarchy of a tree is called the root node. The nodes that hold other sub-nodes are the parent nodes,2, 8525,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree which at most 2 child,1, 8526,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a tree in which each node has at most two children nodes,1, 8527,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary Tree is a tree which have atmost 2 children.,1, 8528,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a tree data structure which has two childs,1, 8529,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree where a node will have at max two child nodes,1.5, 8530,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a data structure which has two child nodes ,1.5, 8531,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree where a node will have at max two child,1.5, 8532,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",epresented by a pointer to the topmost node of the tree,1.5, 8533,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree where each node can have atmost of 2 children.,1.5, 8534,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a non linear data structure ,1, 8535,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8536,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a non liner data structure which hase two children are 1 children but left node ase no childrens ,1, 8537,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8538,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a type of non linear data structure in which ever parent node has maximum 2 childs . ,1.5, 8539,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a data storing technique in which a node is defined by two pointers left and right,1.5, 8540,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree has nodes which have some data and pointers to its children. Its a non linear Data Structure.,1.5, 8541,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a data structure in which a record is linked to two successor records, usually referred to as the left branch when greater and the right when less than the previous record.",1.5, 8542,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary Tree is a type of multi linked list in which each node has only two children.,1.5, 8543,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a data structure to store elements,1, 8544,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A node having two child nodes,1, 8545,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","binary tree is s data structure, where each node has 2 children ",1.5, 8546,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",for each node there can be atmost 2 children,1.5, 8547,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree data structure where each node has children > 0 and less than equal to 2,1.5, 8548,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a non-linear data structure .,1.5, 8549,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is type of tree in which there is left and right node,1.5, 8550,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree in which a node has atmost2 childern,1.5, 8551,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A sorted tree in which the left subtree has elements smaller than the root node value and right subtree has elements greater than the root value,1.5, 8552,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a dat structure in which the data is stored in parent-child fashion where every node can have maximum 2 child nodes.,1.5, 8553,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",non linear ds which has 2 or less than 2 child nodes,1.5, 8554,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a tree which has at least 0 or 2 children ,1.5, 8555,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", a tree which has less than or equal to 2 child nodes,1.5, 8556,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a non linear data structure in which data is stored in the form nodes,1.5, 8557,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",data structure where we have a root node and each node can have maximum 2 nodes,1.5, 8558,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","Binary Tree is defined as a tree data structure where each node has at most 2 children. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.",1.5, 8559,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a data structure which stores data in forms of nodes and each node can have only two children.,1.5, 8560,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8561,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a data structure that can only have 2 children nodes.,1.5, 8562,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is the tree in which every node has only two child,1.5, 8563,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree which has only 0 or 1 or 2 children is called a BINARY TREE.,1.5, 8564,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",It is a non linear data structure .,1.5, 8565,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree where the left child is smaller than the root and the right child is greater than the root,1.5, 8566,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a tree with 0,1 or 2 children",1.5, 8567,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a type of doubly linked list data structure which has root nodes and its child nodes as left child and right child.,1.5, 8568,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a data structure in which memory of individual nodes must not be continous and having a root node which points to two nodes left and right,1.5, 8569,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree(non linear ds) having two nodes left and right ,1.5, 8570,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which has maximum 2 childs is called a binary tree,1.5, 8571,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a hierarchical data structure composed of nodes, where each node has at most two children, typically referred to as the left and right child.",1.5, 8572,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is tree where a root node is present and all other nodes are present in left and right side of it,1.5, 8573,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a recursive tree which has atmost two children. ,1.5, 8574,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a non linear data structure having no or atmost 2 nodes,1.5, 8575,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree having only two child is binary tree,1.5, 8576,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a tree in which each node can have atmost two roots,1.5, 8577,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree with nodes having 0-2 children,1.5, 8578,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a type of tree datastructure which has less than or equal to 2 children (and greater than zero),1.5, 8579,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a data structure in which every node has two children nodes and so on.,2, 8580,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent.,2, 8581,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree in which each node has two child node,2, 8582,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a tree in which all nodes can have maximum of 2 nodes,2, 8583,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a ,0, 8584,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",its arranged in the form of the tree structure,1, 8585,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree having two child,2, 8586,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tr,0, 8587,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a linear data structure,0, 8588,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a data structure in which a record is linked to two successor records, usually referred to as the left branch when greater and the right when less than the previous record.",2, 8589,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8590,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a tree in which every parent have maximum two child,2, 8591,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree which has atmost two nodes for each parent node.,2, 8592,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",data structure which has two children,2, 8593,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a data structure which consists of node which have the data and the address of the connected left and right nodes,2, 8594,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A TREE IN WHICH A ROOT ELEMENT CONSIST OF LEFT NODE AND RIGHT NODE,2, 8595,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8596,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",BINARY TREE IS a tree which consist of node at the top and its childen below in left and right side of the node consisting of many leaf nodes .,2, 8597,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which has only two children,2, 8598,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is which every node has 2 or less elements linked to it,1, 8599,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree consisting of nodes in a tree structure,2, 8600,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A data structure in which every node has some data and 2 pointers and that left and right pointer stores the adderess of other nodes ,2, 8601,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",root having 0 to 2 childs,2, 8602,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a non linear data structure that is used to store data in different nodes,2, 8603,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a tree where the maximum number of child each node can have is 2. ,2, 8604,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree with only two child nodes is called a binary tree,2, 8605,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree IS THE TREE DATA STRUCTURE WHICH CAN BE USED TO LINK VALUES IN AN EFFICTION IT IS THE BASIC TREE DATA STRUCTURE,2, 8606,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a special type of tree in which each node has exactly two children nodes.,2, 8607,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a data structure having at max 2 childs which further can have max 2 childs,2, 8608,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree with atmost 2 child nodes.,2, 8609,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a ds which have one root and each root can have atmost two child and it goes on .,2, 8610,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A Binary tree is represented by a pointer to the topmost node commonly known as the “root” of the tree.,2, 8611,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it ia tree which has a root node and its chiuldren left and right and at the end at leaf node,2, 8612,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree in which the node can have atmost 2 children.,2, 8613,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a non linear data structure where root has two sub root,0, 8614,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which can atmost have two branches is a binary tree,2, 8615,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8616,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a tree with 0,1or 2 children",2, 8617,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","Binary tree is a tree in which each node has at most 2 children, i.e. 0,1 or 2 ",2, 8618,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree in which each node has a maximum of two child nodes. left AND RIGHT,2, 8619,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree having 2 childrens at max.,2, 8620,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. Every node in a binary tree has a left and right reference along with the data element. ,2, 8621,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a type of tree with maximum of 2 child nodes and one key per node.,2, 8622,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree having order 2,2, 8623,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a data structure in which a parent node has at most two child nodes.,2, 8624,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a tree in which every node has exactly two child,2, 8625,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",nonlinear data structure with max 2 child nodes,2, 8626,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a data structure in which each elements have two children left and right side,2, 8627,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",In which we can insert elements in a non linear fashion,2, 8628,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","in a binary tree data is arranged in manner of root node , and leaf nodes then it's branches just like the real life tree having one root then branched and then it's many other branches ",2, 8629,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",atree having atmost two children.,2, 8630,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","binary tree is the type of tree where each node can have 0,1,2 children node only",2, 8631,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",which tree have two nodes only ,1.5, 8632,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",the tree which have atleast two node or leaves are binary tree,1.5, 8633,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree having max 2 child nodes,2, 8634,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","it is a tree data structure which has atmost 2 children nodes. for eg: a parent node can have 'n' number of children in a normal tree data structure. but in a binary tree, the root node can have atmost 2 child nodes",1.5, 8635,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree having all most 2 children,2, 8636,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree non-linear data structure with a maximum of two children for each parent. ,1.5, 8637,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree have two or less child nodes,2, 8638,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree in which a single node cannot have more than two childrens.,1.5, 8639,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a type of data structure in which a tree node can have a max of 2 childs,1.5, 8640,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary is data structrure where each node has two child nodem,2, 8641,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Tree where each node has at maximum 2 children.,2, 8642,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",IT is a tree in which each node has a leaf node and is connected to the root node,1.5, 8643,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Having 2 childs,2, 8644,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree means a nodfe can have at max 2 child nodes,2, 8645,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",in whict each node has 2 childs or less than two,2, 8646,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree which have two children left and right,1.5, 8647,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",having max of two child,1.5, 8648,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a tree data structure in which each node has at most two children,2, 8649,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is when every tree can have atmax two children i.e left and right and a root of the tree at the top,1.5, 8650,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree in which every node can have atmost two children,1, 8651,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8652,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a k ary tree with node count = 2 each node having two pointer left and right,1.5, 8653,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree having two child nodes,1.5, 8654,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree with atmost 2 children,1.5, 8655,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",What is the Binary Tree,0, 8656,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",having 2 child,1, 8657,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",It is a type of tree which have only two child nodes,1, 8658,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a data structure which each elements have two children left child &right child,1, 8659,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree in which root node has left child and right child. left child is less than root and right child is greater than root.,1.5, 8660,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree where left child is smaller than the parent and right child is greater then the parent.,2, 8661,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree in which every node has atmost 2 children,1.5, 8662,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a type of tree which have only 2 child connnected to it.,1.5, 8663,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",which have maximum tw childrens,1, 8664,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a type of data structure which has both left and right children,1.5, 8665,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8666,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a data structure where key is stored as left or right children of parent root,1.5, 8667,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","binary tree is a data structure where elements are not linearly stored, rathet they are atored in a way which is optimised",1, 8668,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a non linear ds. A Binary tree is represented by a pointer to the topmost node (commonly known as the “root”) of the tree,1.5, 8669,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A BINARY TREE HAS AT MOST 2 CHILDREN,1.5, 8670,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a non linear data structure in which each data values has some children values or NULL values as children,2, 8671,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",REPRESENTED BY A TOPMOST NODE.,2, 8672,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Its a tree type structure that allows us to insert children of a specificnode,2, 8673,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",the tree in which parent has exactly two children,1.5, 8674,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a data structure ,1.5, 8675,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", A binary tree is a non linear data structure in which data have some leaf values called children,1.5, 8676,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a tree that has max two child which are pointed by two pointers.,1.5, 8677,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8678,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",data structure in whch elements are represented wth left and right child,1.5, 8679,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a data structure that has left and right child nodes and a root node.,2, 8680,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",double ended queue,2, 8681,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree having atmost 2 children,2, 8682,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",its a non linear data structure ,1, 8683,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized."," it is an advanced data structure which store the data in nodes and have two pointer, left and right.",1, 8684,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree having left nd right child,1, 8685,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A Binary tree is represented by a pointer to the topmost node (commonly known as the “root”) of the tree. If the tree is empty, then the value of the root is NULL.",1, 8686,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree having two children (left and right),1, 8687,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A tree in which each parent node can have either 0,1 or 2 children.",1, 8688,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary Tree is defined as a tree data structure where each node has at most 2 children. Since each element in a binary tree can have only 2 child.,0, 8689,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,1.5, 8690,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",node having 2 children.,1, 8691,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8692,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,1.5, 8693,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a hierarchical data structure in which each node has at most two children, which are referred to as the left child and the right child.",0.5, 8694,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a data strcuure with data variable as well as maximum 2 child pointers(left and right) that point to another node of the same kind(tree),1.5, 8695,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a tree in which no node has more than two children ,0.5, 8696,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a tree data structure in which each node has at most two children,0.5, 8697,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a structure of data which links through children ,1.5, 8698,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree of order 2,1.5, 8699,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","tree which have 0,1,2 node , children only",1.5, 8700,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree in which the parent has exactly 2 children.,1.5, 8701,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a non linear data structure,0.5, 8702,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",heirachary based data structure in which nodes points to their child via pointers,1.5, 8703,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",IT IS TYPE OF TREE WHICH CAN HAVE MAX 2 CHILD ,1.5, 8704,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",one node pointing to 2,1.5, 8705,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A k-ary tree with k = 2, a node has at max 2 childs.",0.5, 8706,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",which have only 2 childs,1.5, 8707,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Tree having zero or 2 children,1, 8708,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree which have two children and a parent,1.5, 8709,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A tree where parent node has 2 child and, value of left child is smaller and right child is greater than the value of the parent.",1.5, 8710,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",IT is a tree with two child nodes.,1, 8711,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is non-linear data structure ,1.5, 8712,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a ds whihc has 2 child node and parent node,1.5, 8713,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a ttree with either 0,1 or 2 child at most.",1, 8714,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",heirachary based data structure in which node points to their child,1.5, 8715,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a tree having 0,1 or 2 children for any particular node",1.5, 8716,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. ,1, 8717,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,1, 8718,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","binary tree is a linear data structure having two children, parent, leaf node",1.5, 8719,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,1, 8720,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","when each node has children in range [0,2].",1.5, 8721,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a linked list with every node having two pointers left and right,1, 8722,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is non linear and hierarchical way of entering data in a tree structure,1, 8723,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree having at most 2 child,1.5, 8724,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree of order 2,1, 8725,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree in which every node contains maximum 2 child,1.5, 8726,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", a binary tree is a non linear data structure in which the data is stored in the form of node and connected to other nodes using left and right pointers,1, 8727,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree in which a root has 2 or less than 2 children,1.5, 8728,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree which have at most 2 children .,1, 8729,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",each node having maximum number of two children ,1.5, 8730,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8731,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8732,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a data structure which a node has two childs left and right,1, 8733,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is linked list with every node two ,1.5, 8734,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","Binary Tree is defined as a tree data structure where each node has at most 2 children. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.",1, 8735,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree having 2 nodes,1.5, 8736,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,1, 8737,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",the tree in which each node has at max two children ,1, 8738,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,1, 8739,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a tree where the value id 0,1,-1",1.5, 8740,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which has max 2 children;,1, 8741,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Tree with two child,1, 8742,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a tree that has eexactlytwo child node,1.5, 8743,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a non linear data structure which consists of nodes where each node is connected with at most 2 further nodes,1, 8744,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a normal tree with maximum 2 child node where we can enter element according to ourself .,1.5, 8745,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,1, 8746,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a tree where element is right child nodes is greater than th element in the left child nodes,1, 8747,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree where the data is inserted below the root node,1.5, 8748,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is non linear data structure where a data points,1, 8749,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree which has utmost two children and has data with two pointers left and right.,1, 8750,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree where each node has two child.,1.5, 8751,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree with 2 nodes,1, 8752,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a tree having degree of 2,1.5, 8753,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree in which each node has atmost 2 child nodes,1.5, 8754,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8755,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",which has two nodes,1, 8756,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",which has two nodes,1.5, 8757,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,1, 8758,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a tree data structure in which each node has at most two children,",1.5, 8759,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",in bineary tree we push left and right into datta,1, 8760,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree with two child ,1, 8761,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",in which two childes,1.5, 8762,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,1, 8763,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,1, 8764,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", a tree-type non-linear data structure with a maximum of two children for each parent,1.5, 8765,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,1, 8766,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a hierarchical data structure where each node has at most two children, which are referred to as the left child and the right child.",1.5, 8767,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is typr of k-ary tree in which each node has two children,, 8768,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree a type of non linear data structure which consists teh address of two nodes - left and right and further they have nodes.,1, 8769,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a data structure used to store value in form of root and leave,1.5, 8770,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",WHERE EACH PARENNT HAS ONLY 2 CHILD,1, 8771,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent,1.5, 8772,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree with at most two childs for each node,1.5, 8773,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,1, 8774,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", A Binary tree is represented by a pointer to the topmost node (commonly known as the “root”) of the tree,1, 8775,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a data structure having a value and 2 pointers(left and right),1.5, 8776,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree-type non-linear data structure with a maximum of two children for each parent.,1, 8777,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree with max two nodes ,1.5, 8778,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",in which data is inserted using ,1.5, 8779,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",having tow node conected,0, 8780,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",having maximum two nodes.,0.5, 8781,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",the tree which has at maximum two child,0.5, 8782,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a specialized version of trees, where a tree can only has at most 2 childs.",0.5, 8783,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. Every node in a binary tree has a left and right reference along with the data element. The node at the top of the hierarchy of a tree is called the root node.,1, 8784,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which has atmost two child,0, 8785,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree having only 2 sub trees forming from a single node,0.5, 8786,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","Binary Tree is defined as a tree data structure where each node has at most 2 children. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.",1, 8787,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", a type of tree which have only two children,0.5, 8788,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",The tree which has only two nodes are called Binary Tree,0, 8789,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A root node having two children left and right children,0.5, 8790,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8791,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a data structure in which a record is linked to two successor records, usually referred to as the left branch when greater and the right when less than the previous record.",1.5, 8792,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a binary tree is a tree data structure in which each node has at most two children(left child, right child)",0.5, 8793,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is used to store data order wise ,0.5, 8794,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a type of structure used to store and represent deata,0.5, 8795,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a binary tree is a tree having maximum two child nodes.,0.5, 8796,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",It has two childs and that is left child and right child,0.5, 8797,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",either 0 or 1 child ,0, 8798,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree in which node have two child,0.5, 8799,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8800,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8801,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8802,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a non linear data structure,0.5, 8803,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",one node two child,0.5, 8804,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",which has two children,0.5, 8805,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", represented by a pointer to the topmost node known as the root of the tree.,0.5, 8806,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized."," A binary tree is a tree structure in which each node has at most two children, a left child and a right child.",0.5, 8807,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent.,0.5, 8808,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree in which node have 2 childs,0.5, 8809,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", a tree-type non-linear data structure with a maximum of two children for each parent,1, 8810,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a tree in which data of child in inserted in random manner by using left and right property,0.5, 8811,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree in which each node has at ,0, 8812,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is tree in which each node has at ,0, 8813,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which has only two children.,0.5, 8814,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. Every node in a binary tree has a left and right reference along with the data element. The node at the top of the hierarchy of a tree is called the root node. The nodes that hold other sub-nodes are the parent nodes.,1.5, 8815,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8816,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8817,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8818,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree in which there are at most two children,0.5, 8819,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree with two child nodes,0.5, 8820,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree with max two children,0.5, 8821,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a type of tree in which smaller element are put in left and larger are put in right,1, 8822,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree which has two children,0.5, 8823,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8824,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",having maximum 2 children nodes,0.5, 8825,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree has only two child, a left and a right child, and nodes are inserted at whenever a leaf node is found going level wise left to right",2, 8826,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree data structure where each node has atmost two children,1, 8827,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8828,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",node with 2 child,1, 8829,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree in which each node can have at most 2 children,1, 8830,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a type of data structure which stores data in nodes,0.5, 8831,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a tree which contain only two nodes,i.e, left and right node is called a binary tree.",2, 8832,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",It is a tree in which there can be only 2 sub trees of a particular node,1, 8833,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a data structure in which each node has 2 children ,1, 8834,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree having maximum two child,1, 8835,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree which can have 0 or 2 children,1, 8836,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.", chldrenhaving two,0, 8837,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which is not bst,0, 8838,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Each root has 2 children.,1, 8839,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A data structure consisting of nodes, where each node has at most two child nodes",1, 8840,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",max 2 child which can hacve,1, 8841,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",when node has 2 child and 1 key,1, 8842,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree which has atmost two subtree/,2, 8843,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",each parent have 2 child,1, 8844,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A tree with only two Nodes as Maximum ,0, 8845,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree with 2 nodes,0, 8846,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree with each node having at max two children,1, 8847,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8848,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree having two childern,1, 8849,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a link list has 2 nodes,1, 8850,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a data structure in which a record is linked to two successor records, usually referred to as the left branch when greater and the right when less than the previous record.",2, 8851,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",in this there is a root and the root has a left and right child ,2, 8852,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",o(logn),0, 8853,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree in which each node has a maximum of two children,1, 8854,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",withj 2 node or 1,1, 8855,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which has two branches pointing left and right ,1, 8856,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a non-linear data structure that resembles a tree and can have up to two children for every parent. In a binary tree, each node has the data element and a left and right reference.",2, 8857,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a data structure in which there are 2 children ,1, 8858,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a data structure where each node has 0,1 or child nodes",2, 8859,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Structure made from a tree.,0, 8860,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8861,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree in which each node can have a maximum of 2 child nodes,2, 8862,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree in which each node can have a maximum of 2 child,1, 8863,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree having 0 or 2 children,1, 8864,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree in which each node can have atmost 2 nodes,1, 8865,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",let and right node,1, 8866,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8867,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized."," a binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child",2, 8868,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8869,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Non linear data structure ,0.5, 8870,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree with each node having atmost 2 children,1, 8871,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Data structure in which the root node is connected to two different nodes that is left Node and right Node,2, 8872,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which has a maximum of two sub nodes,1, 8873,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree which has maximum two subnodes ,1, 8874,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",BINARY TREE IS A TREE WHICH HAS AT MAX 2 NODES AND ATLEAST 0 NODES,2, 8875,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8876,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",BT is node with atmost 2 children ,1, 8877,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8878,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it has 2 child ,0.5, 8879,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",it is a tree with a node called root which has 2 children called left and right child,2, 8880,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",two childs,2, 8881,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","having 0,1,2 child in any pattern",2, 8882,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Tree which has two childs,2, 8883,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8884,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a non linear data structure in which elemts are arranged inside ,2, 8885,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",Binary tree is a k-ary tree where k=2,2, 8886,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree having two child,2, 8887,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","TREE WHICH CAN HAVE ONLY 0,1,2 CHILDREN",2, 8888,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",typee of data structure,2, 8889,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8890,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree ,0, 8891,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","It is a data structure in which a record is linked to two successor records, usually referred to as the left branch when greater and the right when less than the previous record.",2, 8892,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","A binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. Binary trees are used in a wide range of applications and form the basis for more complex data structures, including binary search trees and binary heaps. Key characteristics of binary trees include: Nodes: Each node in a binary tree contains a value or data and can have zero, one, or two children. The top node is called the root, and nodes with no children are called leaf nodes. Root Node: The topmost node in a binary tree is called the root. It serves as the starting point for traversing or accessing the tree's elements. Parent and Child Nodes: A parent node is a node that has one or more children. Child nodes are nodes that have a parent. A node's children are typically referred to as the left child and the right child. Subtrees: The children of a node, along with their descendants, form subtrees. These subtrees can be treated as separate binary trees within the main binary tree.",2, 8893,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",tree that has 2 childs,2, 8894,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8895,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8896,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree-type non-linear data structure with a maximum of two children for each parent.,1, 8897,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8898,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a data structure which have data in the node and one left and one right child.,2, 8899,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",represented by a pointer to the topmost node (commonly known as the “root”) of the tree. ,2, 8900,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",is represented by a pointer to the topmost node (commonly known as the “root”) of the,2, 8901,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree data structure with parent node having two children node,2, 8902,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A binary tree is a tree with 2 children,2, 8903,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",in which have two child ,2, 8904,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",TREE WHICH CAN HAVE ATMOST 2 CHILD NODE,2, 8905,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a data structure in which a record is linked to two successor records, usually referred to as the left branch when greater and the right when less than the previous record.",2, 8906,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8907,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",2 node trees,2, 8908,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree data structure in which each node has at most two children. ,2, 8909,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",In a binary tree the tree has two childs ,2, 8910,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A DS WHICH HAS A PARENT NODE ANND CHILDREN. EACH PARENT/ROOT HAS TWO CHILDREN,2, 8911,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree where each root has maximum 2 children,2, 8912,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",TREE IN WHICH ALL NODES HAVE MAX OF 2 CHILDREN,2, 8913,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",entering data in organised order,2, 8914,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree where each root has maximum,2, 8915,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree with at max 2 children(left and right),2, 8916,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",It is a tree in which there are max only one left and only one right child of one node,2, 8917,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",A NODE THAT VONS 2 CHILD,2, 8918,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",having max 2 childs,2, 8919,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",binary tree is a tree in which every root node has only two child ,2, 8920,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",a tree with 2 child node,2, 8921,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.","a data structure in which a record is linked to two successor records, usually referred to as the left branch when greater and the right when less than the previous record.",2, 8922,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",What is a binary tree? 5 Types of Binary Tree Explained [With Illustrations ... A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. Every node in a binary tree has a left and right reference along with the data element. ,2, 8923,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",,0, 8924,What is the Binary Tree,"The binary tree is a type of tree in which each parent has at least two offspring. The children are referred to as the left and right youngsters. This tree is more popular than most others. When specific limitations and features are given to a Binary tree, various trees such as AVL tree, BST (Binary Search Tree), RBT tree, and so on are also utilized.",having atmost two child,2, 8925,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,tail points to head node,0.5, 8926,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a type of linked list where the last node points back to the first node, forming a loop. This allows for continuous traversal through the list without a definitive end point.",1.5, 8927,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the head and tail of a linked list and connect to each other,1, 8928,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a linked list in which the last node of the list points back to the first node, creating a closed loop.",2, 8929,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node points to the first node.,0.5, 8930,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end.",1, 8931,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which last note do not point to null but instead it points to the first node again is called circular linked list,2, 8932,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A circular linked list is a linked list in which the tail points to the head instead of being NULL.,1.5, 8933,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,In this last node points to the first node,0.5, 8934,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list where tail points to head of linked list,2, 8935,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle.",1, 8936,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list whose tail points the head and hence all the nodes are connected in a circular way ,0.5, 8937,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which tail is connected to head,1.5, 8938,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,2, 8939,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list is basically when last node of linear linklist makes link with front element of it .,1, 8940,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A linked list where the next pointer of the tail points to the head, forming a circular loop.",0.5, 8941,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a linked list data structure in which the last node points back to the first node, creating a closed loop. This allows for continuous traversal from any node to any other node in the list, and it can be helpful in various applications, such as managing circular buffers or implementing algorithms that require looping through a set of elements.",2, 8942,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list., The circular linked list is a linked list where all nodes are connected to form a circle,1.5, 8943,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which its tail is connected to head,1, 8944,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the linked list in which the last or nth node's next pointer is pointing the starting node or first node,0.5, 8945,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A circular linked list is a type of linked list in which the final element of the linked list is linked/connected back to the first node of the linked list.,2, 8946,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"What is Circular linked list? The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end.",1, 8947,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle.,1.5, 8948,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in circular linked list rare node is alwyas point at first node or node of its linked list.,0.5, 8949,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,list whos last node point at its first node.,2, 8950,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list is a linked list in which the last node is connected with the first node of the list,0.5, 8951,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle",1, 8952,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list whose tail node has a pointer to the head of that linked list instead of null,1.5, 8953,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list is data structure where the root node is not present in the ,2, 8954,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a variation of a linked list where the last node's ""next"" pointer points back to the first node, creating a closed loop. It is useful for applications where continuous cycling through the list is required.",1.5, 8955,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Where the last element points to the head of linked list,0.5, 8956,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,is a link list in which node is linked to formed a circle ,2, 8957,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is a linked list in which head is connected to its tail,1, 8958,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which the tail node (last node) refers to the head node (first node).,0.5, 8959,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A linked list in which the next pointer of the last element points to the beginning of the list itself. That is, we the list loops around the end.",2, 8960,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linklist with no tail as the last node is connected with first node,1.5, 8961,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which the last element's next is pointing to the first,1, 8962,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Linked list where the tail node is pointing to the head instead of NULL.,0.5, 8963,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which the last node is connected to first node,1, 8964,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,CIRCULAR LINKED LIST IS A LINKED LIST IN WHICH TAIL NODE PONTS TO ITS HEAD NODE,2, 8965,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,1.5, 8966,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,whaere the tail points to the head ,0.5, 8967,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in a circular linked list the head node is pointing to tail node instead of pointing to null,2, 8968,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,1, 8969,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which we tail points the head instead of NULL,1.5, 8970,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"It is a type of linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL pointer at the end.",0.5, 8971,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Circular Linked List is a type of linked list in which the last node points back to the beginning of the linked list instead of pointing to NULL.,2, 8972,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a data structure in which the last node of the list points back to the first node, forming a closed loop, allowing for efficient cyclic operations and traversal.",0.5, 8973,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"in circular linked list, the tail node points to the head node instead of NULL",2, 8974,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a linked list in which the tail node points back to the head node, forming a closed loop or circle, allowing for efficient traversal and continuous processing",1, 8975,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a data structure in which the last node points back to the first node, forming a closed loop. This structure can be used for applications like managing circular buffers or simulating a circular queue.",2, 8976,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"In a circular linked list, the last node of the list contains a pointer to the first node of the list. ",2, 8977,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in whgich last node points to head,2, 8978,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a type of linked list in which the last node instead of pointing to null, points to the head of the Linked List",2, 8979,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the first node and last node are connected via next pointer.,2, 8980,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list dosent has any end its tail is connected to head,2, 8981,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which the last element points back to the first element(head),2, 8982,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a variation of a linked list where all the nodes are connected to form a circle 1. In a circular linked list, the first node and the last node are connected to each other, forming a loop. There is no NULL at the end of the list ",2, 8983,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular link list is the type of link list in which its rear pointer point towards the head means it hAVE no end point,2, 8984,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"circular linked list is a linked list which is connected to itself, it doesn't have any end",2, 8985,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list is a data structure in which the last node points to the head of the linked list ,2, 8986,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.," A circular linked list is a linked list where the last node points back to the first node, creating a loop in the list.",2, 8987,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A type of linked list where all nodes are arranged in a way to form a circle.,2, 8988,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a node where last node is connected to root node,2, 8989,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Circular linked list is the type of linked list where last node in the given linked list points towards the head,2, 8990,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a linked list in which the last node points back to the first node, forming a closed loop.",2, 8991,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,IN WHICH THE LAST NODE HAS THE ADDRESS OF THE FIRST NODE,2, 8992,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"a circularly linked is a linked list that has no tail,the tail is connected back to the head",2, 8993,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular lonked list has its head pointing to the next node and the null points to the head.,2, 8994,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,WHERE THE TAIL POINTER ONTS TO THE HEAD,2, 8995,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Linked list in which the last node point to the head node,2, 8996,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,list ke node ke nest head hoga ,2, 8997,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it has one head and tail,2, 8998,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list is a linked list in which the last element (rear )of the linked list points to the first element therefore creating a circular pointer structure. No node points to null,2, 8999,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end",2, 9000,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which tail is connected to head of the linked list,2, 9001,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9002,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,In Which The Last Element Is Connect With First Element In The Linkedlist,2, 9003,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle.",2, 9004,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where there is no node pointing to null. Instead the last node points to head,2, 9005,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,tail pointer points to head ,2, 9006,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when the pointer of last node dose'nt point to null but points to the head of the linked list,2, 9007,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list where the tail points to the head,2, 9008,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list whose tail node points its head,2, 9009,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node is connected to the first node,2, 9010,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when tail node is link with head node then call ,2, 9011,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list in which the last node is having address of the head,2, 9012,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9013,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9014,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list where the last node is connected to the head of the linked list is called the circular linked list.,2, 9015,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when the last node points to first one,2, 9016,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which the first element is cconnected with the last element,2, 9017,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9018,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"in a circular linked list, the last node, i.e. tail points to the head of the list",2, 9019,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list whose tail points at its head,2, 9020,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where there is cycle. tails points to head.,2, 9021,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list whose end links to it's first node.,2, 9022,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.," A circular linked list is a linked list in which the last node points back to the first, forming a closed loop.",2, 9023,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list having its tail node and head node the same.,0.5, 9024,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The last node points the first node.,1.5, 9025,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list which have no start node and no end node.,0, 9026,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The linked list which have its head and tail connected.,2, 9027,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9028,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,LinkList in which the end node point to first node,2, 9029,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9030,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"circular linked list is a linked list where the last node points back to the first node, creating a loop in the list.",2, 9031,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which the tail and head are connected to make a circle,2, 9032,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A circular linked list is a list of which the tail point to the head that is the beginning of the list .,2, 9033,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,its head node is connected to the tail node.,2, 9034,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a linked list in which the tail node points back to the head node, forming a closed loop. ",2, 9035,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,There is no tail head is the only thing available ,1.5, 9036,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list which has no NULL ptr and tthe tail is linked to the head part.,2, 9037,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which the last node again points the first node.,2, 9038,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in circular linked list head pointer and tail pointer both arr connected to each other,2, 9039,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9040,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Last node is connected to first node,1.5, 9041,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list are normal linked list just in which the end pointer is pointing back to the first elemennt,2, 9042,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.," The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end",2, 9043,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,tail connected to head,1, 9044,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Circular linked list is a linked list in which first and last one is also connected ,1.5, 9045,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a linked list where the last node points back to the first node, forming a circle.",2, 9046,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.," A circular linked list is a linked list in which the last node points back to the first node, creating a loop.",2, 9047,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle. ,2, 9048,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9049,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the next pointer of last element points to the head of the linked list,2, 9050,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where there is a connection btw thw last and the first node.,2, 9051,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which last node points to first node location.,1.5, 9052,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list is a linked list in which the tail node points to the head node.,2, 9053,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,IN CIRCULAR LINKED LIST THE LAST NODE IS CONNECTED TO THE FIRST NODE OF THE LINKED LIST,1.5, 9054,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A LINKED LIST INT WHICH THE LAST NODE OPINT TO THE FIRST NODE,1.5, 9055,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which the end pointer points to the head is called circular liked list,2, 9056,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"he circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end",2, 9057,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which tail and head are connected,1.5, 9058,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list is one where the rear of the linked list has its next pointer set to the head forming a cycle,2, 9059,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node is first node,1, 9060,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node has the address of the first node,1, 9061,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle.,1.5, 9062,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"In circular Linked List all nodes are connected to form a circle, the last node points to the first one",2, 9063,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list whose first and last nodes are connected to each other,2, 9064,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when linked list's end node is given the address of first node so that when we traverse in the linked list we can directly go from last to first,2, 9065,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end.",2, 9066,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.," Circular linked lists can be more complex to manipulate and traverse compared to regular linked lists, but their cyclic nature can offer advantages in specific situations where cyclical behavior is required.",2, 9067,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which the last element is connected again to the head is a circular linked l;ist,2, 9068,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where the end pointer points to the node,1.5, 9069,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last element points to head,1, 9070,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"When the tail of linear linked list is connected to the head of the linear linked list, it is known as circular linked list.",2, 9071,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"the tail of the list instead of pointing to null, points to the head of the list.",2, 9072,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the last node next pointer will point towards the head node .It forms a circular linked list.,2, 9073,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"a circular linked list which has its left and right root as sa,me",0, 9074,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9075,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A circular linked list is one where its last pointer is connected to its end pointer forming a cyclic stucture,1.5, 9076,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,its tail points further to the head,1, 9077,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"a linked list which next pointer is never NULL and one of node's next pointer is ponting any of the node of the linkedlist, tail node point head node",1, 9078,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,tail pointer of the list points to head pointer,1, 9079,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a list which is circulary connected means whose last node next is connected list head.,1, 9080,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"list ke node ka next head hoga, there is no tail in cll",1, 9081,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list whose last node points to its head such that a loop is formed,1, 9082,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular LL is a LL where the ending node points to the start of the linked list.,1, 9083,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"he circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL in the end",1, 9084,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where tail and head node are also connected,1, 9085,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list is a linked list in which tail point to head of linked list,1, 9086,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list has no node pointing to NULL the last node instead of pointing to NULL points to the first node of the linked list.,1.5, 9087,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Circular linked list is that list where the last element of the list points to the first element of that list.,1, 9088,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A LINKED LIST THAT END NODE REFER TO ITS FIRST NODE.,1, 9089,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"in this linked list, the current node is linked to the previous as well as the next node and the list is circular. it has no end points. the first node is also linked to the last node, hence creating a circular form.",2, 9090,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the list whos end pointer points to the head of the same linked list,1, 9091,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A circular linked list is a list which has no end and we can access it through a complete loop.,1.5, 9092,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9093,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,l nodes are connected to form a circle,1, 9094,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,all linked list connected to each other in circle formation,1, 9095,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Link list in which the last linkage is linked to the head node,1, 9096,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle,1, 9097,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle.",2, 9098,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,In a circular linked list the address of adjacent node is stored in previous node.,1.5, 9099,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list whose last node points to the first node is called circular linked list,1.5, 9100,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9101,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,nodes are connected to form a circle,1, 9102,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list in which tail->next points to the head.,1, 9103,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a list where the next of the last node points to the first node of the list.,1, 9104,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle,1.5, 9105,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"circular linked list do not have end, it's tail is connected to its head",1, 9106,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the linked list in which despite of having an end pointer pointing to NULL the pointer supposed to be the end point to the start of the linked list,1.5, 9107,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is linked;list where the last node contains the address of the first node ,1, 9108,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Circular linked list is a linked list where the last node points to the first.,1, 9109,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node is connected to head,1, 9110,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in circular linked list last node is connect to the root node.,1, 9111,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which the last node point to first node,1, 9112,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when you traversing the linked list and again reached to the already traversed node ie circular linked list.,2, 9113,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node connected to head of list,1, 9114,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where all nodes are connected to form a circle,1, 9115,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A Binary Tree is a hierarchical data structure where each node has at most two children.,0, 9116,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list is basically a singly linked list with the tail pointer pointer back to the head,1.5, 9117,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A CIRCULAR LIST IS A TYPE OF LIST WHICH HAS A POINTER AT THE LAST NODE POINTING TO IT'S OWN HEAD.,1.5, 9118,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list where the last node is connected to the first,1, 9119,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end.",2, 9120,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node of list pointing to the first node,1, 9121,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list in which the last element points to the first element,1, 9122,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when tail of the linked list is connected to the head of the linked list,1.5, 9123,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is similar to a linked list but the tail pointer links back to the head pointer,1.5, 9124,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list where last node is pointing towards head node connecting them forming a circle.,2, 9125,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which last element inserted points to the first element inserted . ,2, 9126,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list where first node is connected to last node.,2, 9127,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,int which tail point to head,1.5, 9128,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list whose next pointer is attached to its start/Head Node.,2, 9129,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Circular linked list is a data structure made of nodes where the head points to the tail.,2, 9130,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in a circular linked list the address of adjacent node is stored in previous node,2, 9131,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linklist which has no null pointer tail node node is connect head,2, 9132,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9133,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is a type of linked list in which the first and last node are connected thus forming a circle . ,2, 9134,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,link list in which next of the last node is pointing to the first node,2, 9135,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,First / last node are connected in the Linked List ,2, 9136,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. ",2, 9137,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Circular Linked List is a linked list in which the next pointer of the last node is pointing at the head of the list.,2, 9138,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is a linked list in which the head of the list is connected to the tail of the list,2, 9139,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list whose head and tail connected,2, 9140,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"circular linked list is linked listhaving no starting or ending, i.e, start node pointer is linked to end node",2, 9141,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which the last node is pointing to the head of the linked list,2, 9142,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a list where the last pointer points back to the head pointer,2, 9143,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list where Last node points to head node.,2, 9144,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which end node points to first node,2, 9145,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which the tail point to head ,2, 9146,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list in which there is not an end node pointing at NULL but instead the last node points to the first node.,2, 9147,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which the tail element points to its head element.,2, 9148,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the next of tail is connected to head,2, 9149,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"Circular linked list contains the address of 1st element at the last node , traversing the list again and again . ",2, 9150,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list which has the last pointer connect to its head,2, 9151,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,link list in which ,0, 9152,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list where the tail of the linked list is linked to its head,2, 9153,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle.,2, 9154,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"in a circular linked list, the last node of the linkedlist points towards the head node.",2, 9155,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9156,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in circular linked list the last node->next points to the startnode->head.,2, 9157,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which the next of the last node is first node,2, 9158,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list with no end or starting point is called a circular linked list.The starting point of the linked list is joined to the end point.,2, 9159,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,te last node point out the fast node.,2, 9160,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Circular linked list's tail points to the first node's head and not to a null value.,2, 9161,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,head and tail are connected ,2, 9162,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A circular linked list is a type of linked list in which the tail node is connected to the head node instead of pointing to NULL.,2, 9163,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list having no ending and having a tail which is connected to its head,2, 9164,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,cll is a ll end of which points to its head,2, 9165,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,;linked list where the tail or last element points to the first or head element making a circle,2, 9166,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a linked list in which the last node points back to the first node, forming a closed loop.",2, 9167,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list is a list in which there is a head but there is no tail as the last node directly points to the head of the list,2, 9168,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is a linked list which is connected with itself.,2, 9169,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where the end node points to the starting node,2, 9170,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list whose last element is pointing to head is circular linke list,2, 9171,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in circular linked list tail->next is connected to head,2, 9172,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Linked list with start and end at the same node,2, 9173,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"it is the type of linked list in which the tail pointers points to the head, making it circular",2, 9174,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A circular linked list is a type of linked list in which the tail node points to the head node,2, 9175,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle,2, 9176,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"in circularlinked list, tail point th head",2, 9177,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is linked list in which the the last element store the addreess of header node,2, 9178,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list is a kind of linked list where the last nodeis linked to the first node making it a circle .,2, 9179,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,its linked list where the last node contains the address of the first node ,2, 9180,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which no node pointer is pointed to null all nodes are pointed to other nodes,2, 9181,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9182,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it does not have any null ptr and is in a circular form,2, 9183,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"Circular singly linked list: In a circular Singly linked list, the last node of the list contains a pointer to the first node of the list.",2, 9184,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"in this no null pointer is required ,the last node next pointer point to first node of list",2, 9185,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,liked list connected to 2 elselemt in which one is previous,2, 9186,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a list in which the pointer of last data points to the first data in the linked list.,2, 9187,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the list whose end pointer points to the head of the list,2, 9188,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list where there is no NULL pointer everypointer is ponting towards the nexxt data coming back to the first one in cycle,2, 9189,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,NO NULL POINT,2, 9190,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where the tail is connected to the head of the linked list,2, 9191,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list is the list whose tail is connected with its head .,2, 9192,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a type of linked list which has no beginning and no end,2, 9193,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which tail is pointed to its head,2, 9194,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a link list having a loop in it that is it's one node is pointing to it's some previous node forming loop.,2, 9195,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list where the last node points to or stores the adderess of the last node ,2, 9196,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which start and tail node in same,2, 9197,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it's NULL points towards root's head,2, 9198,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A circular linked list is where the last node points to the first node and it forms an unending loop,2, 9199,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which first and last node are connected,2, 9200,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A CIRCULAR LINKED LIST IS WHERE ALL NODES ARE CONNECTED TO EACH OTHER TO FORM A CIRCLE,2, 9201,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Circular linked list is that linked list in which each node is attached to its next node and the last node is already connected to the head node.,2, 9202,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is a form of linked list where the tail of linked list points to the head of the linked list,2, 9203,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,In circular linked list the last node is linked with the first node.,2, 9204,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9205,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list., The circular linked list is a linked list where all nodes are connected to form a circle,2, 9206,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it ia linked list its end is connected to the head of starting node,2, 9207,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list is one in which the last node points to the head node of the linked list instead of pointing to null pointer.,2, 9208,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list where start is connected to first,2, 9209,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list which works in the circular and countinues is called a circular linked list ,2, 9210,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9211,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is a linked list in which head is connected to its tail,2, 9212,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A circular linked list is linked list in which the last node points to head.,2, 9213,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"a linked list in which last node points towards first node, forming a circular pattern",2, 9214,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"in a circular linked list, tail does not poimts to null but to the head.",2, 9215,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The list where the last node is connected to the head of the list.,2, 9216,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a type of linked linked list whose tail pointer points to head.,2, 9217,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list with the last node connected to its first node,2, 9218,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Linked list in which the last node is connected to the first node.,2, 9219,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list in which the end of the list is connected to the head of the list.,2, 9220,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list where last node holds the address of head,2, 9221,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle.,2, 9222,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Circular linked list is the list in which head is connected to last element therefore last element points to first element instead of null,2, 9223,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in a circular linked list the start pointer of the first node is connected to the end pointer of the last node ,2, 9224,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the LL where last node points to the start node.,2, 9225,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list is the list where last node next pointer is not null but it rather points to first node,2, 9226,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where last node links to the head ,1.5, 9227,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list which connect each node circulary are circular linked list,2, 9228,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,which has no end and start that is tail is connected to heaD,1.5, 9229,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.," a linked list where the last node is connected to the main head node, creating a circular structure",1.5, 9230,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in this linked list last element store the address of the first element and vice versa.,2, 9231,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linkedlist whose last node points to the head node,1.5, 9232,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the list in which tail is connected to head,1.5, 9233,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,It is a list in which last node points to the beginning and other to the next node.,2, 9234,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"circular link list is a link list which has the same starting and ending node ,",1.5, 9235,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list where last node holds the address of head,1.5, 9236,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Linked List where node at last(tail) is linked to the head,2, 9237,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list which has the same starting and ending node,1.5, 9238,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,whose tail points to head,1.5, 9239,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list means the head node comes after the tail like a circle,1.5, 9240,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is a linked list whose head is connected to tail of a noemal linked list,1.5, 9241,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where last node tail points to head again,2, 9242,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which last node points to first node,1.5, 9243,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list where all nodes are connected to form a circle,2, 9244,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list is when the last node adress points to the first node address and shows the interconnection of linked list,1.5, 9245,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when last node points to the first,2, 9246,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is never ending linked list in which its tail point to the head of the node in linked list.,1.5, 9247,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list is a linked list in which the last node is pointing to root node,2, 9248,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list where the last node points the first node,1.5, 9249,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.," A circular linked list is a linked list where the last node's ""next"" pointer points back to the first node, forming a loop",2, 9250,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,What is a circular linked list?,2, 9251,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,whose tail points to head,1.5, 9252,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,It is a type of linked list in which the tail pointer points to the head of linked list.,1.5, 9253,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,tail's next is ponting to head,2, 9254,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which we come at the front value of a list just after insertion of the last value.,1.5, 9255,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A circular linked linked list is a linked list where the tail of the list points to the head of the list.,2, 9256,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which tail and head are connected,1.5, 9257,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,It is a type of linked list where tail pointer is connected to its head pointed thus making it a never ending and cicrular in nature.,2, 9258,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,which dont have any ending point its end node is connected ito its frst node,1.5, 9259,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a type of linked list where the head is liked to the tail,1.5, 9260,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9261,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is a data structure where the end node points to the head node of the linked list,1.5, 9262,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it meand that the pointer of the last element of the linked list will point towards the head that is the first node,1.5, 9263,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list without tail is called a CLL.,2, 9264,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A CIRCULAR LINKED LIST IS A KIND OF LINKED LIST IN WHICH THE FIRST NODE IS CONNECTED TO THE LAST NODE WHICH MAKES IT CIRCULAR.,1.5, 9265,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list is one in which the tail points toward the head ,1.5, 9266,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,ALL NODES ARE CONNECTED IN A CIRCLE.,2, 9267,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A circular linked list is a linked list where the tail of the linked list is connected to the head of the linked list.,2, 9268,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in circular linked list the tail of the last node points the head of the first node,1.5, 9269,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle.",2, 9270,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A link list in which the head of the list points to the tail of itself,1.5, 9271,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list is a linked list whose tail points to its own head.,1.5, 9272,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9273,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which first and last element is connected,2, 9274,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A circular linked list is one in which the head node is connected to the last node to make it circular.,2, 9275,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,2, 9276,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which tail and head are connected through a next or prev pointer,2, 9277,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list is a list whose tail node is attached to the head node forming a circular structure ,2, 9278,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list is one in which the tail of linked list points to the head of its linked list making a loop.,1, 9279,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which head nd tail are the same..ie tail points to head,1, 9280,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"he circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end.",1, 9281,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list having only head and where its head and tail are connected,2, 9282,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when head node is connected to thew tail node.....tail->next=head.,1, 9283,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end",2, 9284,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9285,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,LAST NODE CONNECTED TO HEAD NODE.,0.5, 9286,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9287,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node is attached to root one,1.5, 9288,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.," circular linked list is a type of linked list in which the last node of the list points back to the first node, creating a closed loop or circle. In a traditional singly linked list, the last node typically has a null reference, indicating the end of the list.",1, 9289,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the next pointer of thr last element of the list points to the first eleement,1.5, 9290,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is a linked list in which the last node is connected with the first node creating a circle like structure,1, 9291,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,ll connected by 1st node and last node,1.5, 9292,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a list where end node is not null but points to head,1, 9293,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,head is attached to tail,1.5, 9294,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which last element in linked to first elemnt,1.5, 9295,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,In a Circular Linked List the tail pointer points towards the head of the LInked list,1, 9296,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,he circular linked list is a linked list where all nodes are connected to form a circle.,1.5, 9297,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which the end node points to the head node forming a circular structure,1.5, 9298,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,IN THIS TYPE OF LINKED LIST THE TAIL OF LIST IS CONNECTED WITH THE HEAD OF LIST,1, 9299,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node pointing to first,1, 9300,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where the next of tail points to the head node,1, 9301,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,tail is joined with head,1.5, 9302,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Tail of linked list points to its head,1.5, 9303,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node connected to the first node,1.5, 9304,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list which is circularly connected that is the next of the tail is pointing to the head.,1, 9305,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,In this tail of a linked list is attached to head of same linked list,1.5, 9306,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9307,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list is a type of linked list in which there is no tail last node is pointing head,1, 9308,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node is pointing to the first node.,1, 9309,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which the end node points to the head of the ,1.5, 9310,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which the tail of the list points to the head,1.5, 9311,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list., The circular linked list is a linked list where all nodes are connected to form a circle.,1.5, 9312,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9313,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list is list in which the lsaat pointer will point itself and have no null exist,1, 9314,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list., a linked list where all nodes are connected to form a circle,1, 9315,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when the last node is linked to the head of the linked list,1, 9316,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which tail->next=head after terminating in end it starts in front,1.5, 9317,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in this the end node is connected to head node,0, 9318,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9319,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in circular ll there is no tail node the last node points to the head of the linked list.,1.5, 9320,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which last node points back to first node thus forming circular links,1, 9321,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the type of linked list in which there is no terminating node and the last node is is connected to the head of the list using next pointer,1.5, 9322,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which the tail points back to head,1, 9323,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which back pointer is connected to front pointer,1, 9324,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which tail is connected to head again,1.5, 9325,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9326,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list whose tail points its head,1.5, 9327,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which its lat pointer points to first element of the list.,1, 9328,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked in which tall_>next=head after termentating ,1.5, 9329,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list., The circular linked list is a linked list where all nodes are connected to form a circle.,1.5, 9330,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list in which tail points to the head again,1, 9331,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9332,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the LL in which last node of LL is connexted to the first one ,1.5, 9333,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9334,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linke dlist where it has no null value,1, 9335,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which start in linked to end in a linked list,1, 9336,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Linked list where start and end are same ,0, 9337,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,that hav last node connected to first node,1, 9338,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a link list with no end pint i.e its head and tail are at the same point,1, 9339,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Its a linked list where last node is again connected to the first node ( head) so it does not have null in the last node.,0, 9340,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9341,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Its a linked list where the last nodes points to th head node of th Linked List ,1, 9342,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9343,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when the last elements points at first element instead of pointing at nullptr,1.5, 9344,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A cll is where the tail of ll is pointed back to the head of ll,2, 9345,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9346,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.," A circular linked list is a type of linked list where the last node points back to the first node, forming a loop or circle. In other words, the ""next"" pointer of the last node points to the first node, creating a circular structure.",1, 9347,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,It is a linked list in which tail points to head,1.5, 9348,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,is a linked list where all nodes are connected to form a circle.,1, 9349,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9350,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,tail points to the head,1, 9351,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,link list having end has same start and end,1.5, 9352,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list with same head and tail,1.5, 9353,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list where all nodes are connected to form a circle,1.5, 9354,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9355,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where tail node is connected to head ,1.5, 9356,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which nodes in circular manner,0, 9357,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9358,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9359,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. Every node in a binary tree has a left and right reference along with the data element. The node at the top of the hierarchy of a tree is called the root node.,1.5, 9360,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,2, 9361,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a linked list in which the last node points back to the first node, creating a closed loop.",0, 9362,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is a linked list in which there is no beginning or end nodes i.e. all nodes are connected in a circular manner,1.5, 9363,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Circular linked list is a linear data structure in which the last pointer of the list points to the head pointer of the list so as to make the easy access of the head pointer from the last pointer.,1, 9364,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular LL is multidirectional linked list,1.5, 9365,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A LINKED LIOST WHERE HEAD AND TAIL NODES ARE SAME ,1, 9366,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end",0, 9367,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which the last node points the first one.,1.5, 9368,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where last node is connected to first node,1.5, 9369,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9370,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a liinked list in which its last element is pointing to its first element,1.5, 9371,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle. ,2, 9372,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,aa linkd list with end is connected to the root node,1.5, 9373,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in which last node is connected to first node,1.5, 9374,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9375,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9376,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9377,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"In a circular linked list, the end of the list points to the first element of the list, making it circular.",2, 9378,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list., A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. Every node in a binary tree has a left and right reference along with the data element. The node at the top of the hierarchy of a tree is called the root node.,0, 9379,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a list which tail points to head,2, 9380,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,having no start or end of the linked list,1, 9381,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle.,2, 9382,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in circular linked list the end node data value addressing the first node ,1, 9383,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"Linked list in which the last node is pointing to the first node, thus making a circle.",2, 9384,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,In which first and last node are onnected,2, 9385,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9386,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9387,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle.,2, 9388,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when last node is linked to first node ,2, 9389,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,each node in the list isb connected to thye next niode,2, 9390,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list whose last node is pointing the first nodes data .,2, 9391,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,whose last node comes to the first node,2, 9392,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node points to 1st node ,2, 9393,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,list in which tail is connected with head,2, 9394,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9395,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle. ,2, 9396,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,WHERE ALL NODES ALL CONNECTED TO ONE ANOTHER,0, 9397,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9398,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,points to its first node ,0, 9399,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,only one rear pointer,0, 9400,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle,1.5, 9401,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.," A circular linked list is a linked list where the last node points back to the first node, creating a loop.",2, 9402,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle. ,2, 9403,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when tail is connected to head,2, 9404,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where head and tail are connected,2, 9405,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,list which have head and tail pointer same ,2, 9406,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which last element point to itself,0, 9407,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,circular linked list is list in which tail node is connected to head node,1, 9408,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list., a linked list where all nodes are connected to form a circle,2, 9409,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"What is Circular linked list? The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end",2, 9410,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list wjheer first and last node are connected,2, 9411,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9412,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9413,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.," A circular linked list is a data structure in which the last node points back to the first node, forming a closed loop or circle.",2, 9414,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the multidirectional link list ,1, 9415,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,which doesnot has a tail or end,1, 9416,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is a linked list in which head is connected to tail of a linked list,2, 9417,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node points to the first node of linked list,2, 9418,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9419,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,start and end node is linked,1.5, 9420,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.," A circular linked list is a type of linked list where the last node points back to the first node, forming a closed loop. It does not have a traditional ""null"" or ""end"" pointer, which makes it useful for certain applications like implementing a round-robin scheduling algorithm.",2, 9421,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where rear (last node) points to the head,2, 9422,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9423,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where end is connected with start,1.5, 9424,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Linked list in which a node is connected to its previous node and its next node,2, 9425,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a type where the last linked list node refers to the first linked list node,2, 9426,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which the end node points to the head(first) node is called a circular linked list.,2, 9427,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list is one in which the last node points to the first node,2, 9428,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is a data structure in which the the head and tail are joined together i.e . the tail has the reference of the head,2, 9429,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when first node is linked with last node.,2, 9430,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The tail of the linked list is connected to head,2, 9431,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,tail is connected to it head and nbot to null,2, 9432,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,end node connects with the first,1, 9433,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The tail pointer is connected to the head pointer.,2, 9434,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list in which the last node points back to the first node forming a closed loop.,2, 9435,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9436,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when tail is connected to head ,1, 9437,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9438,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end.",2, 9439,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list whose tail node points to the head node making it circular and easily traversable,2, 9440,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,end nlode linked with first node,1, 9441,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list without tail having only head,1, 9442,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9443,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node points to first node,1, 9444,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,singly link list end node links with starting node,0, 9445,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Circular link list does not has tail in it,0, 9446,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,in this the first nopde in connected to the last node,0, 9447,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9448,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list means that the next pointer of the last element points to the first element of the linked list,2, 9449,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,tail conne,0, 9450,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list whgich point to start at end,0, 9451,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,A linked list where each node ios connectred to each other and there is no end pointer null,0, 9452,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,list in which last node points the first node,0, 9453,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list where the tail node points to the head node,1, 9454,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Searching nodes in a circular manner.,0, 9455,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9456,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the tail points to the head pointer of the linked list,1, 9457,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the tail pointer points back to the head,1, 9458,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,list node having address to previous and next,1, 9459,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end",2, 9460,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,head and tail are joined,0, 9461,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node ponts to first node,1, 9462,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,when a element points to one of the owe element,0, 9463,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9464,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it does not has end and head and tail are connected.,1, 9465,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which tail's next pointer is head.,0, 9466,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Linked list in which head node is directly connected to end node ,0, 9467,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked listn in which the next node of last node is the first node of the linked list,1, 9468,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list in which next of last node is the address of first node ,1, 9469,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,CIRCULAR LINKLIST IS A TYPE WHICH CONNECTS FROM END TO FIRST ELEMENT OF LL,1, 9470,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,which doesn't have tail as last node is connected to head,1, 9471,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9472,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9473,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last data points to first,2, 9474,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"there is no null, the last node meets the first node",2, 9475,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,end connected start,2, 9476,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,whose last node's net is not null and connected to its root node,2, 9477,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Linked list in which last node is linked to head node,2, 9478,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9479,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node points to first,2, 9480,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,Circular linked list is a ll where the head and tail are attached,2, 9481,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,tail conmtains address of headand vice versa,2, 9482,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,LIST WHICH TAIL CONNECTS BACK TO HEAD FORMING A CIRCULAR STRUCTURE,2, 9483,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,it is a type of doubly linked list in which last node's next pointer points towards first node ,2, 9484,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,the list which dont have the tail node,2, 9485,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a link list in which next of last node is point toward prev of first sort,2, 9486,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle.,2, 9487,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"A circular linked list is a variation of a linked list data structure in which the last node of the list points back to the first node, creating a loop or circle. In a traditional singly linked list, the last node points to NULL to signify the end of the list. However, in a circular linked list, this ""end"" node points back to the first node, forming a continuous loop.",2, 9488,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list that has value of head in the tail element or can be traversed from any point,2, 9489,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9490,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9491,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,ked list is a linked list where all nodes are connected to form a circle.,2, 9492,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9493,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,which is connected to itself.,2, 9494,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list., a linked list where all nodes are connected to form a circle,2, 9495,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,where its tail node is joing head node,2, 9496,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,tail pointing back to head node,2, 9497,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,its a typle of link list where there is no head and tail specifically and we can traverse the whole list while it never ends as head is connected to tail,2, 9498,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,no null ptr connect to its head node ,2, 9499,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,THERE IS NO END HEAD CONNECTED TO END,2, 9500,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,"here are generally two types of circular linked lists: 1. Circular singly linked list: In a circular Singly linked list, the last node of the list contains a pointer to the first node of the list. We traverse the circular singly linked list until we reach the same node where we started",2, 9501,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9502,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,hed and tail joined,2, 9503,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list where all nodes are connected to form a circle,2, 9504,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9505,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,TAIL POINTING BACK TO HEAD,2, 9506,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a circular linked list is a type of linked list where the last element points to the first element that is the tail points to the head,2, 9507,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,IT IS A LIST IN WHICH THE LAST NODE POINTS BACK TO THE FIRST (START) NODE,2, 9508,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,linked list which is circular,2, 9509,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list where all nodes are connected to form a circle. ,2, 9510,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a special linked list where the tail points to the first node,2, 9511,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,IN circular LL the last node is made to point on the head or foirst node of the LL.Means there are loops in a circular LL.,2, 9512,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9513,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,last node connected to first node,2, 9514,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list which end is pointing to its head,2, 9515,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,a linked list where rear points to head,2, 9516,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,The circular linked list is a linked list where all nodes are connected to form a circle.,2, 9517,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,What is Circular linked list? The circular linked list is a linked list where all nodes are connected to form a circle. I,2, 9518,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,,0, 9519,What is a circular linked list?,A circular linked list is a special type of linked list that supports traversing from the end of the list to the beginning by making the last node point back to the head of the list.,tail is connected to its head,2, 9520,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using stl and without stl,1, 9521,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"There are two common methods to implement a stack in C: 1. **Using Arrays**: In this method, a stack is implemented using a one-dimensional array. Operations like push and pop are performed by manipulating the index of the array. 2. **Using Linked Lists**: In this method, a stack is implemented using a linked list, where each node contains the data and a pointer to the next node. Push and pop operations involve adding or removing nodes from the linked list.",0.5, 9522,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list both can be used,1.5, 9523,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Stacks can be implemented in C using arrays or linked lists. Common stack operations include push (insertion), pop (removal), and peek (accessing the top element).",2, 9524,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Linked list and array.,1.5, 9525,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Using Arrays,Using Linked Lists,Using a Dynamic Array",0.5, 9526,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array,linked list",2, 9527,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Using array, vector, Linked list(insertion at head will be benefitial)",1, 9528,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array and linked lists,0.5, 9529,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,we can implement stack either by array or linked list,2, 9530,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"There are two common methods to implement a stack in C programming123: Using an array Using a singly linked list Push and Pop are the two primary operations of a stack2. Other operations include Peek, isEmpty and isFull. Stacks can be used in expression conversion, such as infix to postfix, infix to prefix, postfix to infix, and prefix to infix",1.5, 9531,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,p,1, 9532,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,2, 9533,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,One can use different methods to implement stack in C. One such way is to form a linked list and ultimately run it as a stack.,0.5, 9534,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using linklist and array ,1.5, 9535,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"static array implementation, dynamic array implementation, linked list implementation",0.5, 9536,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"You can implement a stack in C using two main methods: 1. Array: Use a C array to hold the stack elements and keep track of the top element's index. 2. Linked List: Implement the stack as a linked list, where each node represents an element, and the top of the stack is the head of the list. Both methods have their advantages and trade-offs, depending on the specific requirements of your application.",2, 9537,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push, pop ,isEmpty,isFull,top",1, 9538,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,pop push and top ,1.5, 9539,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list both can be used to impliment stack,0.5, 9540,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"There are two methods to implement stack: 1. Using array, 2. Using linked list",1, 9541,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using an array, linked list.",2, 9542,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push : Adds an element to the top of the stack. pop : Removes the topmost element from the stack. isEmpty : Checks whether the stack is empty. isFull : Checks whether the stack is full. top : Displays the topmost element of the stack.,0.5, 9543,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,1, 9544,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using Linked list (Dynamic) or using array (Static) .,1.5, 9545,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array and using singly linked list,2, 9546,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0.5, 9547,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Using linked list and Array,2, 9548,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,1.5, 9549,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Stacks can be implemented in C using arrays or linked lists. Common stack operations include push (inserting an element), pop (removing the top element), and peek (viewing the top element)",0.5, 9550,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using stl function,2, 9551,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"top(), push(), pop(), isempty(), isfull()",1, 9552,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array and using linked list,1.5, 9553,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,we may implement stacks using a linked list data structure or by the help of an array.,0.5, 9554,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"We can implement stack using arrays, or stack (stl), or linked lists",2, 9555,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"linled list ,arraywise",1, 9556,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"STL, using linked list, using integer array, or using two queues",1.5, 9557,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push, pop, isEmpty, isFull, top() etc",0.5, 9558,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"linked list, array wise",1, 9559,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,USING LINKED LISTS AND ARRAYS ,2, 9560,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,0.5, 9561,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,arrays and linked list ,2, 9562,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,we can implement stack using STL ,1.5, 9563,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,isempty",0.5, 9564,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,1, 9565,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"stack can be implement by many methods like 1D array , Linked list , using queues.But the best of all is linked list. Operations -> push : Adds an element to the top of the stack. pop : Removes the topmost element from the stack. isEmpty : Checks whether the stack is empty. isFull : Checks whether the stack is full. top : Displays the topmost element of the stack.",2, 9566,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Array, Linked List",1, 9567,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"In C, you can implement a stack using arrays or linked lists, and common operations include push (to add an element) and pop (to remove and retrieve the top element).",1.5, 9568,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push : Adds an element to the top. pop : Removes the topmost element. isEmpty : Checks whether the stack is empty. isFull : Checks whether the stack is full. top : Displays the topmost element,0.5, 9569,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,2, 9570,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Using a dynamic array,linked list",0.5, 9571,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Stacks can be represented using structures, pointers, arrays, or linked lists.",1, 9572,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using strcutures,arrays",1, 9573,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Stacks can be implemented using arrays and linked lists in C.,1, 9574,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"by array ,linked list",1, 9575,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array implementation and linked list implementation,1, 9576,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stack can be implemented using array or linked list,1, 9577,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"There are several ways to implement a stack in C, including using arrays, linked lists, and structures",2, 9578,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stack ,1, 9579,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,we can do it by using STL or by array,1, 9580,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,1. use of stl 2.use of recursion 3. arrays,1, 9581,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stacks can be implemented in C using arrays or linked lists,2, 9582,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"We can implement stack through single linked list, double linked list and also through circular linked list.",2, 9583,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9584,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,method stack using arrary and linked lists,1, 9585,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"In C, you can implement a stack using an array or a linked list, and common operations include push (to add an element), pop (to remove the top element), and peek (to view the top element).",2, 9586,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,THERE ARE SEVERAL WAYS SUCH AS USING STL OR LINKED LIST,1, 9587,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,predefined data structure or create a structure called ,1, 9588,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop are the main methods",1, 9589,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,ARAY AND LINKED LIST OR STL,1, 9590,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Linked list, array and STL",1, 9591,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using arrays and linked lists,2, 9592,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9593,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Methods to implement stack : Using array and using linked list.,2, 9594,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,USING array and linked lists ,2, 9595,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,by inbuilt library or by using linked list or arrays,2, 9596,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9597,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Methods Are Array, Linked List, STL",2, 9598,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,A stack can be implemented using either linked list or arrays,2, 9599,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array , linkedllist",1, 9600,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stl and self declared using linked list or array,1, 9601,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array and using linked list,0, 9602,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push, pop and top",1, 9603,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,by array and linked list,0, 9604,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,isfull",0, 9605,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9606,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stack can be implemented using linked list,1, 9607,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9608,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9609,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using stl or direct creating the structure or by class,1, 9610,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9611,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9612,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"stack can be implemented in three ways in c++. using stl, using arrays and using linked lists to perform the operations of push pop front rear",2, 9613,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array, and standard library",2, 9614,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,linked list or array,2, 9615,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array ,linked list",2, 9616,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"by creating a linked list, queue.",2, 9617,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,We can implement a stack in C++ using arrays or linked lists with push and pop operations or dynamically resizing arrays for a flexible stack.,2, 9618,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,By arrays or linked lists.,1, 9619,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,STD and defining,0, 9620,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,linked list method and Array method.,2, 9621,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,by using linkedlist or array,2, 9622,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9623,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Either using array or linklist,2, 9624,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9625,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Stacks can be implemented in C using arrays or linked lists.,2, 9626,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array or linked list,2, 9627,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"stack can be implemented using array and linked list . Also in stl there is stack that has these inbuilt functions isempty() , push() , pop() , top()",2, 9628,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list.,2, 9629,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Array-based implementation and Linked list-based implementation are the methods to implement stack in c.,2, 9630,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Link list, arraywise",2, 9631,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,isEmpty()",0, 9632,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 9633,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,We can use array or linked list implementation also stl can be used,2, 9634,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9635,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9636,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9637,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"some methods are push , pop , isEmpty , top",0, 9638,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array, linked list",2, 9639,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,isempty,top",0, 9640,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"In C, you can implement a stack using an array or linked list. Common methods include push (for insertion), pop (for deletion), and peek (for accessing the top element without removal).",2, 9641,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based," Methods to implement a stack in C include using arrays or linked lists and defining operations like push, pop, isFull, and isEmpty.",2, 9642,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Push() pop() top() isempty() ,0, 9643,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9644,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 9645,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9646,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,we can do this with or without using stl.,1, 9647,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,through class or through STL library(#include ),1.5, 9648,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,METHODS TO IMPLENT STACK USING STRUCT AND VECTORS ,0, 9649,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,ENQUEUE AND DEQUEUE,0, 9650,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,through class and include stack,0, 9651,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push ,pop ,isempty,isfull,top",0, 9652,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array and linked list,2, 9653,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Arrays and linked lists can be used to implement stack,2, 9654,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"linked list, array",2, 9655,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,last in first out,0, 9656,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push , pop , isEmpty , isFull ,top ",0, 9657,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push pop isEmpty isNull,0, 9658,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 9659,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,either using standard libraries or by making functions which does that work,0, 9660,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using an array, or using a singly linked list",2, 9661,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,dynamic stack,0, 9662,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using array ,stl, or vector",1, 9663,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 9664,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array and linked list,2, 9665,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using stl or by creating class,0, 9666,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push, pop, peek",0, 9667,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stackstackname;,0, 9668,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,yo implement stack we can use a hashmap,0, 9669,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Push,pop,isempty,isfull,top.",0, 9670,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using (stack s) create a stack and also you need to upload a library into the system.It must contain push/pop/empty etc operations in it,0, 9671,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using array, linklist",2, 9672,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"we can define a struct and make functionalisities of push ,pop and top of stack",0, 9673,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,by array and by linked list,2, 9674,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,by linked list and by array ,2, 9675,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using arrary and linked lists,2, 9676,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9677,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,#include ,0, 9678,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based, push : Adds an element to the top of the stack. pop : Removes the topmost element from the stack. isEmpty : Checks whether the stack is empty. isFull : Checks whether the stack is full. top : Displays the topmost element of the stack.,0, 9679,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,through class stack and pre defined function of stack,0, 9680,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using linked list,using array;",2, 9681,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"structure of stack,vectors",0, 9682,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,We can implement stack using arrays and linked lists.,2, 9683,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,WE CAN DEFINE IT MANUALL BY DECLARING A STACK ARRAY AND THEN USING TOP OR BY USING STL DIRECTLY,1, 9684,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array, linked list",2, 9685,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array , linked list",2, 9686,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,By array implementation and By linked list implementation.,2, 9687,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9688,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push pop isEMPTY isFULL top ,0, 9689,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,through class or through STL library(#include),0, 9690,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"LIFO,FIFO",0, 9691,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9692,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"In a stack, the insertion and deletion of elements happen only at one endpoint. The behavior of a stack is described as “Last In, First Out” (LIFO). When an element is “pushed” onto the stack, it becomes the first item that will be “popped” out of the stack. In order to reach the oldest entered item, you must pop all the previous items.",0, 9693,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9694,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9695,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9696,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push pop isEMPTY TOP isfull,0, 9697,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Using array or linked list,2, 9698,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array and linked list,2, 9699,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Array, Structure, Pointer, and Linked List",2, 9700,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"we can implement stack using array, linked list and it's own defined STACK library",2, 9701,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"first of all, the stack is declared and the items got pushed in stack and got popped accordingly , the stack is a LIFO type of data structure and the last element entered is the first one to got removed ",0, 9702,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9703,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Methods to implement stack in C: array-based or linked list-based.,2, 9704,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array and ll,2, 9705,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using linked list.,1, 9706,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9707,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,by arrays and linked list,2, 9708,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,use array and list,2, 9709,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Array, Structure, Pointer, and Linked List",2, 9710,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Methods to implement a stack in C include using arrays or linked lists.,2, 9711,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9712,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,ARRAY AND LINKED LIST,2, 9713,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9714,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push, pop ,isempty ,isnull, top",0, 9715,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,linked list,1, 9716,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array or linkedlist,2, 9717,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push(),pop(),size(),top()",0, 9718,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9719,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"pop(), push(), display()",0, 9720,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using STL, using array, linked lists",2, 9721,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push , pop ,display",0, 9722,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,empty,top",0, 9723,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Via array, vector and linked lists.",2, 9724,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Stacks can be represented using structures, pointers, arrays, or linked lists",2, 9725,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9726,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"top(),pop(),push(),isfull(),isempty()",0, 9727,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9728,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"we cann do it by using structures , pointers , arrays stl",2, 9729,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array ,1, 9730,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,use stl stack or implement using array,1, 9731,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9732,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Recursion removal through stack in c,0, 9733,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,by means of array,1, 9734,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9735,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9736,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push, pop, top ,isempty",0, 9737,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push and pop,0, 9738,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stack st;,1, 9739,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push pop top empty,0, 9740,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array and linked list,2, 9741,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,via an array or linked list method,2, 9742,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9743,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array, linked list can be used to implement (push pop top)",2, 9744,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push , pop , isempty , isfull , top etc ",0, 9745,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 9746,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using stack header file or we can use link list to implement stack in c.,2, 9747,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array or linked list,2, 9748,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,top,isnull,isfull",0, 9749,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,We can implement stack by creating a class as well as through STL.,1.5, 9750,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9751,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push, pop, top, empty.",0, 9752,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9753,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9754,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,by STL and BY making functions,1, 9755,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Stack can be implemented using arrays and linked lists.,2, 9756,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"enqueue.dequeue,front rear",0, 9757,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,A stack can be implemented by using an array or a linked list in C.,2, 9758,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using stl and by creating a structure stack and making pop,push,empty,peek functions of it",1.5, 9759,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9760,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,front,isempty etc are the functions",0, 9761,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9762,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9763,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,isempty,isfull.",0, 9764,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9765,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stacks can be implemented in c by using stack header file,1, 9766,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9767,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array,Linked List",2, 9768,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using array, using linked list",2, 9769,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,STL and self made functions,2, 9770,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Array, Structure, Pointer, and Linked List",2, 9771,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 9772,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,STL,2, 9773,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,FIFO,0.5, 9774,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0.5, 9775,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Stack st= new Stack<>();,2, 9776,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0.5, 9777,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0.5, 9778,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Using an array Using a singly linked list,2, 9779,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array and singly linked list,2, 9780,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0.5, 9781,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"linked list, array",2, 9782,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Array, Structure, Pointer, and Linked List",2, 9783,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using ,1, 9784,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,METHOD ,0.5, 9785,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,1, 9786,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,LIFO (LAST IN FIRST OUT),2, 9787,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using stl and without using stl,2, 9788,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,we and do it using array or linked list,2, 9789,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,define header file #include,1, 9790,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,we can implement it either by using arrays or linked lists,2, 9791,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push, pop, front",0.5, 9792,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"iterative,recursive",1.5, 9793,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,we can implement stack using stdlib or use array 's basic functions.,2, 9794,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,recursion,1.5, 9795,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,STACK CAN BE IMPLEMENTED USING C ,2, 9796,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0.5, 9797,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,we can either use a linked list or array to implement stack or use the predefined stl file,0.5, 9798,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,display",2, 9799,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,we can implement stacks using array and linked list,2, 9800,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push : Adds an element to the top of the stack. pop : Removes the topmost element from the stack. isEmpty : Checks whether the stack is empty. isFull : Checks whether the stack is full. top : Displays the topmost element of the stack,2, 9801,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0.5, 9802,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,1, 9803,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0.5, 9804,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"stack.push(), stack.pop(), stack.peek()",1, 9805,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0.5, 9806,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"equeue , dequeue",0.5, 9807,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Stack STL and implementing stack using class (without STL),2, 9808,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0.5, 9809,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0.5, 9810,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"pop(), push(), isEmpty()",2, 9811,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"we can use arrays to implement stack and its functions like push, pop, top, etc.",0.5, 9812,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using linked list ,2, 9813,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Arrays, Linked List, Standard Library.",2, 9814,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Push and pop,0.5, 9815,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 9816,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"define header file #include",2, 9817,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,We can use either array or linked list implementation,1, 9818,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,dynamic arrays etc etc ,1, 9819,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array can be created and inserting and retrieving from end.,1, 9820,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,initialize -1,0, 9821,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9822,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array and linked list,2, 9823,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9824,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9825,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9826,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9827,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 9828,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9829,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9830,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 9831,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array, linked list",2, 9832,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,isempty(),etc",0, 9833,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,recursion,0, 9834,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9835,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using arrayusing singly linked list,2, 9836,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,linked list arrys,2, 9837,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 9838,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push pop isempty isfull,0, 9839,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9840,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using linked list or arrays,2, 9841,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"stl,class and structures.",0, 9842,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,we can use array or linked list,2, 9843,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,we can implements stack with the help of stl or can also make a seperate function foloowing the last in and first out rule,2, 9844,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array,linkedlist",2, 9845,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"In C, we can implement a stack using various methods, including: Array: You can use a fixed-size array to represent a stack. You'll need to keep track of the top of the stack and ensure that you don't exceed the array's bounds. Linked List: You can use a singly linked list where each node contains the stack element and a pointer to the next node. This allows for dynamic resizing of the stack.",0, 9846,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9847,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,By using array and linked list,2, 9848,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using arrays, linked lists",2, 9849,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9850,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9851,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"linkedlist, array",2, 9852,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9853,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,its method id filo,0, 9854,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,last in first out through linked list and arrays,0, 9855,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9856,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push , pop , front, is_empty are methods used in stacks",0, 9857,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9858,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push, pop, peek.",0, 9859,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,STACKS CAN BE IMPLEMENTED USING STD OR WITHOUT IT ALSO.,0, 9860,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array or linked list,2, 9861,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9862,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Using a Node structure or algorithms stack header file,0, 9863,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,linked list and array,2, 9864,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"It can be implemented by using array ,linked list and with stl.",0, 9865,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9866,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push , pop ,front",2, 9867,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9868,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,tower of hanoi,1, 9869,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Linked List and Arrays,2, 9870,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push pop and empty ,0.5, 9871,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push , pop, top",1.5, 9872,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array or linked list,1, 9873,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using queue, array and linked list.",2, 9874,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"pop, push ",2, 9875,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push, pop.empty, top",1, 9876,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Using array and likedlist,1, 9877,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,tower of hanoi,2, 9878,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push : Adds an element to the top of the stack. pop : Removes the topmost element from the stack. isEmpty : Checks whether the stack is empty. isFull : Checks whether the stack is full. top : Displays the topmost element of the stack.,2, 9879,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9880,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,ARRAY,1, 9881,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9882,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,1.5, 9883,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array, link list,",0.5, 9884,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"STL, Linked List",1, 9885,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,recursion iteration #include,1.5, 9886,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9887,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"stl, class",1, 9888,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9889,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,top,empty",1.5, 9890,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,By Linked List and Array,1.5, 9891,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array,linked list,pointers",1, 9892,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using linked list,1.5, 9893,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,USING ARRAY AND LISNKED LIST,1, 9894,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9895,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"we can use arrays, linked list",1.5, 9896,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,1, 9897,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,pop and push,1.5, 9898,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,linked list arrays,1, 9899,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9900,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop",1.5, 9901,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using recurssion,1.5, 9902,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array an dlinked list,1, 9903,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,STL and linked list.,1.5, 9904,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using linked list,1.5, 9905,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"recursion,iteration",1.5, 9906,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push : Adds an element to the top of the stack. pop : Removes the topmost element from the stack. isEmpty : Checks whether the stack is empty. isFull : Checks whether the stack is full. top : Displays the topmost element of the stack.,1.5, 9907,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9908,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using first in first out,1, 9909,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"A stack can be implemented by means of Array, Structure, Pointer, and Linked List. Stack can either be a fixed size one or it may have a sense of dynamic resizing. * you can perform both insertion and deletion operations at both of its ends",1, 9910,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"stack.push(),stack.pop(),stack.peek()",0, 9911,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"arrays ,linked list",1, 9912,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9913,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9914,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using linked list,using queue,using stl commands.",1.5, 9915,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,recursion ,0, 9916,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using arrays , using linked list",1, 9917,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using stl and using linked lists,1.5, 9918,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using recursion.,1.5, 9919,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using linked list,1, 9920,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9921,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9922,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,st;l can be used as well as class can be used to create it,1.5, 9923,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,arrays lined list,1, 9924,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,isempty,isfull,top",1.5, 9925,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"STL, array , linked list",1, 9926,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9927,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using arrays and linked list ,0, 9928,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9929,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based," Array, Structure, Pointer, and Linked Lis",1.5, 9930,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"STL,array",1.5, 9931,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9932,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,1.5, 9933,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9934,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9935,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9936,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,methods to implement stack are ,1.5, 9937,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9938,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using array or linklist,1.5, 9939,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,1.5,0, 9940,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9941,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"initialize,push, pop,top,,isempty",1, 9942,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Stack can be implemented using top,pop,push",1.5, 9943,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push, pop, isEmpty, top",1, 9944,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9945,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9946,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9947,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9948,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,PUSH POP ISEMPTY TOP,1.5, 9949,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9950,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array, linked list",1.5, 9951,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"structure,pointer,",1, 9952,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9953,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9954,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based," Array, Structure, Pointer, and Linked List.",1.5, 9955,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9956,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"here are various methods to implement a stack in C, including using arrays, linked lists, or dynamic arrays. The choice of implementation depends on the specific requirements of the application.",1.5, 9957,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"stack can be implemented by making structure of stack type which contains data field, array top pointer",0, 9958,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Stacks can be implemented using array , linked list.",1.5, 9959,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stackst; after including #include ,1, 9960,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9961,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using or using linked list,1, 9962,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"A stack can be implemented by means of Array, Structure, Pointer, and Linked List.",1.5, 9963,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9964,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9965,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based," using push,pop function",1.5, 9966,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based, a linked list where all nodes are connected to form a circle. In,1, 9967,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using linked list and array,1.5, 9968,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push, pop",1.5, 9969,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9970,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9971,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9972,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Array Implementation , Linked List Implementation using Structure",2, 9973,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Operations Performed on Stacks push : Adds an element to the top of the stack. pop : Removes the topmost element from the stack. isEmpty : Checks whether the stack is empty. isFull : Checks whether the stack is full. top : Displays the topmost element of the stack.,1, 9974,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9975,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,implementation by class using predefined function stack ,0, 9976,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push : Adds an element to the top of the stack. pop : Removes the topmost element from the stack. isEmpty : Checks whether the stack is empty. isFull : Checks whether the stack is full. top : Displays the topmost element of the stack.,0.5, 9977,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9978,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Stack can be implements using Arrays, Linked Lists, since Stack follow First In Last out.",2, 9979,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stl stack push pop,0, 9980,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9981,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9982,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,isEmpty,isFull,top",0, 9983,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9984,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9985,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"pop, push etc.",0, 9986,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9987,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 9988,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,LL and array,2, 9989,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9990,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9991,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9992,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9993,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 9994,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 9995,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,PUSH() POP() ISFULL() ,0, 9996,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Methods to implement a stack in C can include using arrays or linked lists.,2, 9997,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"A stack can be implemented by means of Array, Structure, Pointer, and Linked List.",2, 9998,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,linkedlist and array,2, 9999,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10000,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10001,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 10002,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,2, 10003,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10004,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Operations Performed on Stacks push : Adds an element to the top of the stack. pop : Removes the topmost element from the stack. isEmpty : Checks whether the stack is empty. isFull : Checks whether the stack is full. top : Displays the topmost element of the stack.,0, 10005,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10006,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10007,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10008,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"In C, We can implement a stack using an array and the following methods: push (to add an element), pop (to remove and return the top element), and is Empty (to check if the stack is empty).",0, 10009,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stackst ,0, 10010,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10011,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10012,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push,pop,ismpty,full",0, 10013,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10014,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10015,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"You can implement a stack in C using an array or a linked list. For an array-based stack, you would typically define an array and use an index to keep track of the top element. For a linked list-based stack, you would create a linked list with push (add to the top) and pop (remove from the top) operations.",2, 10016,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using STL, using array, using linked list",2, 10017,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10018,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10019,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"Using Arrays, using linked lists",0, 10020,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10021,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push(),pop(),isEmpty(),isFull(),top()",1, 10022,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,implemented by making a class or using the predefined function stack,2, 10023,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using linked list ands array,1, 10024,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10025,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10026,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10027,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10028,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,We can implement stack by arrays and linked list.,2, 10029,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push peek is_empty is_full,1, 10030,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,linkied lsit or by array,2, 10031,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10032,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10033,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10034,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,STL since classes are not allowed,0, 10035,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10036,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stl and array and linked list,2, 10037,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10038,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push and pop,1, 10039,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push_back function,1, 10040,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"To implement a stack in C, you can use arrays, pointers, structures, or linked lists.",1, 10041,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10042,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10043,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using linked list and using arrays,2, 10044,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10045,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stl,2, 10046,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based," A stack can be implemented by means of Array, Structure, Pointer, and Linked List. Stack can either be a fixed size one or it may have a sense of dynamic resizing. Here, we are going to implement stack using arrays, which makes it a fixed size stack implementation.",2, 10047,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using stl and linked list,2, 10048,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"through arrays , linked list or by the stack STL libraray",2, 10049,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Using queue.,1, 10050,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10051,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10052,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10053,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10054,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using stl and using,1, 10055,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10056,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10057,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10058,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10059,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using linked list, array, self defined library",2, 10060,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array implementation and linked list implementation,1, 10061,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10062,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,ARRAY AND L8INKED LIST,1, 10063,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list ,1, 10064,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,VECTOR,1, 10065,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stackq;,2, 10066,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push() pop (),0, 10067,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array or Linked listr is used to implement stack,1, 10068,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push pop,1, 10069,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array and linked list,1, 10070,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"stl,linked list , array",1, 10071,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,vector ,1, 10072,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10073,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10074,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,usinfg linked list or arrays,1, 10075,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"A stack can be implemented by means of Array, Structure, Pointer, and Linked List. Stack can either be a fixed size one or it may have a sense of dynamic resizing. Here, we are going to implement stack using arrays, which makes it a fixed size stack implementatio",1, 10076,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,recursion,1, 10077,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10078,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,poush pop,1, 10079,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10080,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"STL,array",1, 10081,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10082,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"In C, you can implement a stack using various methods and data structures. Here are a few common methods to implement a stack:",1, 10083,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,last in first out,1, 10084,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10085,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10086,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,using stl and array,1, 10087,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10088,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push(), top(). pop() etc.",1, 10089,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push, pop, isempty, isfull, top, last",1, 10090,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push : Adds an element to the top of the stack. pop : Removes the topmost element from the stack. isEmpty : Checks whether the stack is empty. isFull : Checks whether the stack is full. top ,1, 10091,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10092,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push pop isempty ,1, 10093,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"push , pop empty ",1, 10094,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,ARRAY/ LINKED LIST,1, 10095,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"enqueu, dequeue,empty,peek",1, 10096,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10097,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10098,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based," stack can be implemented by means of Array, Structure, Pointer, and Linked List",1, 10099,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10100,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10101,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,stack and mentioned data type in <> then name of stack,1, 10102,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,PUSH AND POP,1, 10103,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10104,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,push : Adds an element to the top of the stack. pop : Removes the topmost element from the stack. isEmpty : Checks whether the stack is empty. isFull : Checks whether the stack is full. top : Displays the topmost element of the stack.,1, 10105,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,array implementation and linked list implementation,1, 10106,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"There are various methods to implement a stack in C, including using arrays, linked lists, or even the standard C library",1, 10107,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10108,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"array , linked list , stl",1, 10109,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,we can implement stack using arrays and linked list,1, 10110,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,"using array,liked list ,stack",1, 10111,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Push and Pop are the two primary operations of a stack,1, 10112,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,Operations Performed on Stacks push : Adds an element to the top of the stack. pop : Removes the topmost element from the stack. isEmpty : Checks whether the stack is empty. isFull : Checks whether the stack is full. top : Displays the topmost element of the stack,1, 10113,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10114,What are the methods to implement a stack in C?,The methods to implement stacks are: • Array-based • Linked list-based,,0, 10115,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10116,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue, often abbreviated as ""deque,"" is a linear data structure that allows insertion and deletion of elements from both ends, front and rear, providing versatility in managing data. It supports operations like inserting, removing, and peeking at both ends of the queue.",2, 10117,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,1, 10118,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue, or deque, is a data structure that allows elements to be inserted and removed from both ends, front and rear, making it suitable for various operations.",1.5, 10119,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in which we can perform deletion from from both ends.,2, 10120,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"a double-ended queue is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front or back. It is also often called a head-tail linked list, though properly this refers to a specific data structure implementation of a deque",1, 10121,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,we can perform both insertion and deletion from both the ends,0.5, 10122,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"Double ended queue or deque is a data structures that is advanced form of a queue. Apart from insertion at end , deletion from front, it also supports insertion at front and deletion from end.",1.5, 10123,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue, commonly abbreviated as ""deque"" and pronounced as ""deck,"" is a linear data structure that allows insertion and removal of elements from both ends with O(1) time complexity.",2, 10124,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10125,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A deque, short for ""double-ended queue,"" is a linear data structure that facilitates operations like insertion and deletion from both ends. It can be viewed as a broader version of a queue, offering increased flexibility",1, 10126,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,1.5, 10127,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10128,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,2, 10129,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in which elements can be push infront of it and back both,1.5, 10130,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A queue in which insertion and deletion at both ends is allowed, but not from the middle.",0.5, 10131,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue (deque) is a data structure that allows insertion and deletion of elements at both ends, front and back. It provides a flexible way to efficiently add and remove elements from the beginning or end of the queue, making it suitable for various applications.",2, 10132,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,The insertion in a linear queue must happen from the rear end and deletion from the front end. ,0.5, 10133,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,can access both ways ,1, 10134,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,2, 10135,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double ended queue is a special type of queue, in which all the common operation can be done from both ends of the queue.",1, 10136,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"The insertion in a linear queue must happen from the rear end and deletion from the front end. But, in deque, you can perform both insertion and deletion operations at both of its ends. That's why it is called a Double-Ended Queue",1.5, 10137,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,The deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends,0.5, 10138,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,2, 10139,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it is a queue from which we can access both front and back element . it is also known as dequeue,1, 10140,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue is a queue which has null pointer at both of its ends,0.5, 10141,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A queue is a data structure in which whatever comes first will go out first, and it follows the FIFO (First-In-First-Out) policy. Insertion in the queue is done from one end known as the rear end or the tail, whereas the deletion is done from another end known as the front end or the headof the queue",2, 10142,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Double Ended queue is a queue whose both top and bottom values can be accesed and used unlike ordinary queue whose only top data can be accessed(without changing the queue)).,1.5, 10143,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,1, 10144,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue (deque) is a data structure that allows elements to be inserted and removed from both ends, front and rear. It supports operations such as push/pop at both ends.",0.5, 10145,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Double ended queue with enque and dequeu on both ends,1, 10146,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,is a queue in which deletion and insertion is done through every node (all nodes are doubly path connected or linked),2, 10147,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue in which work both ways from front and from back too,0.5, 10148,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"queues which can be traversed from both directions i,e from head or from tail both.",1.5, 10149,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,2, 10150,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in which both acts as a start and end,1.5, 10151,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,At any time we have access to front and back elements of the queue. Thus push and pop operation can be performed on either side,0.5, 10152,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is a queue where you can access elements in both the front and end for insertion and deletion,2, 10153,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in which both start adn finish acts as ends,0.5, 10154,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,THE TYPE OF QUEUE IN WHICH POP AND PUSH FUNCTION CAN BE PERFOMED FROM EITHER SIDE,1, 10155,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,1.5, 10156,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10157,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"in doubly ended queue we can push , pop data from either side from first or from last",2, 10158,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,we can perfrom operation on both end,1, 10159,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,1.5, 10160,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Double ended queue ie dequeue is a linear data structure where we can access the front and back element of the data structure and the methods remain the same as a queue.,0.5, 10161,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double ended queue is a queue on which we can perform enqueue and dequeue on both ends. That is, we can insert and remove nodes from both the ends.",2, 10162,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue, often abbreviated as ""deque,"" is a data structure that allows insertion and deletion of elements at both ends, making it a versatile and efficient structure for various types of data manipulation operations.",1, 10163,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,dequeue and enqueue operations are performed from both ends in a double ended queue.,0.5, 10164,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.," double-ended queue (deque) is a data structure that allows insertion and removal of elements at both ends, providing flexibility for various operations.",2, 10165,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.," A double-ended queue (deque) is a data structure that allows insertion and deletion of elements at both ends, front and rear, providing efficient operations for tasks like implementing a queue or a stack.",1.5, 10166,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Operations like insertion and deletion are performed from both the ends,1, 10167,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10168,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A queue in which insertion (enqueue) and deletion (dequeue) can be performed at both ends it's called a double ended queue,1, 10169,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue which can be implemented on both ways that is elements can be inserted in both directions.,1, 10170,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,elements can be removed and inserted from both ends in double endedd queue,1, 10171,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue or dequeue is a linear data structure where the insertion and deletion operations are performed from both ends.,1, 10172,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A double-ended queue (deque) is a linear data structure that allows insertion and deletion of elements from both ends ,2, 10173,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is that in which we can enter the values from both side ,1, 10174,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue has two ends which are start and end,1, 10175,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a double ended queue is a queue in which we can enqueue from both sides but dequeue only from front,1, 10176,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A double-ended queue (Deque) is a data structure that allows insertion and deletion from both the front and the rear. It combines the properties of a stack and a queue.,2, 10177,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Double ended queue is a linear data structure where insertion and deletion are performed from both the ends.,2, 10178,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10179,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended quenue both side insertion and deletion,1, 10180,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue (deque) is a data structure that allows insertion and removal of elements from both ends, providing efficient operations at both the front and rear.",2, 10181,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10182,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a double ended queue is a queue type structure where insertions can be made from both the ends,1, 10183,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is a kind of queue where every node is pointing to each other. we can traverse the node from either head to tail or tail to head.,1, 10184,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,IN DOUBLE ENDED QUEUE WE CAN INSERT AND DELETE BOTH FROM END AND START,1, 10185,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,In which traversal in possible in both ways,1, 10186,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,both insertion and deletion,2, 10187,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10188,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is one in which queue operations can be performed at both ends.,2, 10189,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"the insertion in a linear queue must happen from the rear end and deletion from the front end. But, in deque, you can perform both insertion and deletion operations at both of its ends. ",2, 10190,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is the type of queue where push and pop can be done from both ends(front and rear),2, 10191,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10192,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it is deque in short adding or removing elements in both ends,2, 10193,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A double end queue is a data structure that allows adding and removing elements from both ends. ,2, 10194,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10195,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,which perform all the actions from both ends of queue,1, 10196,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10197,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,linear data structure where the insertion and deletion operations are performed from both ends,1, 10198,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,front and rear end ,0, 10199,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10200,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10201,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10202,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10203,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10204,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10205,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10206,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in this type of queue u can add or remove values from both ends,1, 10207,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10208,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"in a deqeue, enqueing and dequeing can take place at both ends of the queue",2, 10209,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue allows that all the operation from front and back,2, 10210,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in which insertion and deletion can occur from both ends.,2, 10211,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue which can be accesed from both ends.,2, 10212,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue, often abbreviated as ""deque,"" is a data structure that allows elements to be inserted or removed from both ends, providing efficient access to elements at the front and back.",2, 10213,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A queue in which you can push and pop from both front and rear.,1, 10214,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10215,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A type of queue in which both insertion and deletion can be performed on both the ends.,2, 10216,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A type of queue in whgich both insertion and deletion can be performed at both sides,2, 10217,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10218,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A queue in which you can insert from both front and end.,2, 10219,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10220,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A double-ended queue (Deque) is a data structure that allows insertion and deletion from both the front and the rear. It combines the properties of a stack and a queue.,2, 10221,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue in which insertion and deletion can take place from the ends of a queue,2, 10222,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"It is a special type of queue. The insertion in a linear queue must happen from the rear end and deletion from the front end. But, in deque, you can perform both insertion and deletion operations at both of its ends. That's why it is called a Double-Ended Queue",2, 10223,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue operations can be done on both end and front of queue.,1, 10224,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue, often called a deque, is a data structure that allows insertion and removal of elements from both ends (front and rear) with O(1) time complexity. ",1.5, 10225,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Both end are considered for deletion ,1.5, 10226,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is that in which insertion and deletion can take place from both ends.,2, 10227,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it means it ends on both the sides head as well as the tail,1.5, 10228,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Double ended queue is a type of queue where operation can be performed in starting and ending of the queue,2, 10229,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10230,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,We can move from front to back as well as back to front,1.5, 10231,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queues are the queues in which the end element is linked with another,2, 10232,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,deque or double ended queue is a generalized version of queue data structure that allows insert and delete at both ends.,2, 10233,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertion and deletion on both ends,1.5, 10234,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends,1.5, 10235,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue (deque) is a data structure that allows insertion and deletion of elements from both ends, front and rear.",2, 10236,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,you can perform both insertion and deletion operations at both of its ends,1.5, 10237,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends., Double Ended Queue linear data structure where the insertion and deletion operations are performed from both ends.,1.5, 10238,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10239,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertion and deletion happens from both the ends,1, 10240,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10241,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10242,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it helps insertion and deletion from both ends unlike normal queue which only allows from the front,1, 10243,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,IN DOUBLE ENDED QUEUE INSERTION AND DELETION FROM BOTH SIDES,2, 10244,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,ADD AND REMOVE ELEMENTS FROM BOTH ENDS,2, 10245,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,we can do insertion and deletion from both side,2, 10246,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,perform both insertion and deletion operations at both of its ends.,2, 10247,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue in which insertion and deletion can ,1.5, 10248,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a double ended queue has push and pop operations from both the front and the rear,2, 10249,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,data can be accessed both side,1, 10250,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10251,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,The deque stands for Double Ended Queue. It is a linear data structure where the insertion and deletion operations are performed from both ends.,2, 10252,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,In double ended queue is a linear data structure where insertion and deletion are performed at both ends,2, 10253,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10254,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends., for which elements can be added to or removed from either the front or back.,1, 10255,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Double Ended Queue is a type of queue in which insertion and removal of elements can either be performed from the front or the rear,1, 10256,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"Deques can be implemented using various data structures, such as dynamic arrays or linked lists, depending on the programming language and the specific requirements of the application. ",2, 10257,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10258,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,where you can enqueue and dequeue from both sides,1, 10259,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,when we can access elements from both the sides of the queue,1.5, 10260,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue that is ended on double sides,1.5, 10261,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10262,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in this value can be entered and exited from both the ends.,1, 10263,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is a queue which invloves imsertion easliy in less time complexity,1, 10264,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"double-ended queue is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front or back.",2, 10265,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue where first and last are connected to each other.,0.5, 10266,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10267,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10268,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10269,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.," a double-ended queue is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail). It is also often called a head-tail linked list, though properly this refers to a specific data structure implementation of a deque",2, 10270,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue which can insert and delete both from front as well as back ,2, 10271,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a type of data structure in which insertion and deletion operations are performed on both ends.,2, 10272,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a doubly ended queue is where we can insert and delete from the front as well as back.,2, 10273,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue or Deque is a linear data structure where the insertion and deletion operations are performed from both ends,2, 10274,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,when you can insert and pop from both ends of the queue.,2, 10275,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is one which can push and pop element to rear as wells as front,2, 10276,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a double enede,0, 10277,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Double ended queue refers to that queue in which we can insert and delete from both the ends of the queue.,2, 10278,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10279,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it is the where elements can be inserted and taken out from both the ends.,2, 10280,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is a queue where the elements can be taken out or inserted from both side,2, 10281,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,It is a type of queue in which we can perform push and pop operations from front and rear part of queue.S,2, 10282,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10283,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends., a linear data structure where the insertion and deletion operations are performed from both ends,2, 10284,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it helps insertion and deletion from both ends unlike normal queue which only allows from the front,2, 10285,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10286,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10287,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"Deque or Double Ended Queue is a type of queue in which insertion and removal of elements can either be performed from the front or the rear. Thus, it does not follow FIFO rule (First In First Out).",2, 10288,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10289,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10290,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10291,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a linear d where the insertion and deletion operations are performed from both ends,2, 10292,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Queue in which data can be traversed in any direction,0, 10293,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue in which we can perform operations on both ends.,2, 10294,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,. Deque is a linear data structure where the insertion and deletion operations are performed from both ends,2, 10295,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in double ended queue we can perform push and pop function from both starting and ending of the queue,2, 10296,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10297,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10298,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Double-ended queue (Deque) allows insertion and deletion at both ends.,2, 10299,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"where insertion,deletion happens from end and front",2, 10300,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10301,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,we can push and pop from both sides of the queue,2, 10302,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Double ended queue are queue where data can be inserted through the starting and ending both.,2, 10303,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,where insertion and deletion happen from end and start,2, 10304,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,he deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends. We can say that deque is a generalized version of the queue.,2, 10305,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"Double Ended Queue (Deque) is a data structure that allows insertion and deletion at both ends, front and rear.",2, 10306,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is a linear data structure that facilitates operations like insertion and deletion from both ends,2, 10307,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,DOUBLE ENDED QUEUE HAS PUSH AND POP OPERATIONS AT BOTH ENDS OF THE QUEUE,2, 10308,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10309,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"The insertion in a linear queue must happen from the rear end and deletion from the front end. But, in deque, you can perform both insertion and deletion operations at both of its ends. That's why it is called a Double-Ended Queue",1.5, 10310,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,when queue is ended from side,0, 10311,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A queue in which each element points to the next element and the element before it ,0, 10312,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,In which insertion and deletion can be done form both ends that is from start and end,2, 10313,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"it is similar to queue but you can perform operations on both sides of the queue, like pop_front(), pop_back(), push_back(), etc",2, 10314,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,where we can insert or delete from both the ends of a queue,2, 10315,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A queue in which pop and push operations can take place from both ends,2, 10316,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,where we can insert or delete from both the ends of the queue,2, 10317,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,is a linear data structure where the insertion and deletion operations are performed from both ends.,2, 10318,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10319,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it is a type of queue in which we can insert and deletion from both front and bottom,2, 10320,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10321,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue which can be inserted front and back of queue ,2, 10322,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10323,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it is a type of queue in which we can insert and delete from both front and back .,2, 10324,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10325,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,overwrites starting elements if queue is full and uses a first and a last index,2, 10326,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue, often abbreviated as ""deque"" and pronounced as ""deck,"" is a data structure that allows you to add and remove elements from both ends with O(1) time complexity. It is a versatile data structure that combines the features of both stacks and queues, allowing for efficient insertion and removal of elements from the front and back.",2, 10327,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,doubly ended queue is a type of queue in which we can enter data from both sides.,0, 10328,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10329,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10330,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue which can be accesssed from both ends,1.5, 10331,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10332,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends., Deque is a linear data structure where the insertion and deletion operations are performed from both ends. ,2, 10333,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Dont k nw,0, 10334,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue follows FIFO rule and dequeue does not follow,"0,5", 10335,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,both ends have FIFO,1.5, 10336,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue in which insertion and deletion can occur both at the beginning and end of the queue,2, 10337,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue in which we can insert and delete from both the front and end.,2, 10338,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue which we can enqueue and dequeue both from top and bottom,2, 10339,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue uses 2 pointers to access both previous and next element . ,2, 10340,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue in which insertion and deletion can occur at both ends,2, 10341,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"we can perform both insertion and deletion at both of its ends, it provides more freedom to the developer",2, 10342,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue where we can insert of remove data either from the end or from the front however we want,2, 10343,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,The deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends. We can say that deque is a generalized version of the queue.,2, 10344,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue in which insertion and deletion can be done from both ends,2, 10345,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10346,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10347,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue from which data can be inserted and extracted from both the ends,2, 10348,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10349,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,both,0, 10350,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,both have FIFO method,0.5, 10351,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertion takes place from both ends,1.5, 10352,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,It is a type of queue which has the option to insert and delete elements from both the sides.,2, 10353,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"a queue from whose both ends insertion ,popping can be done",2, 10354,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10355,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.," double-ended queue is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front or back. ",2, 10356,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in double ended queue we can do both side insertion and deletation.,2, 10357,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is queue in which insertion and deletion can take place from both side,2, 10358,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,The deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends. ,2, 10359,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10360,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue which can be access from both the ends c,1.5, 10361,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10362,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"The insertion in a linear queue must happen from the rear end and deletion from the front end. But, in deque, you can perform both insertion and deletion operations at both of its ends. ",2, 10363,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"a queue in which you can enter from both the sides, the front and the back",2, 10364,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A double ended queue allows insertion and deletion from both ends of the queue,2, 10365,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,perform both insertion and deletion operations at both of its ends,2, 10366,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,perform both insertion and deletion operations at both of its ends.,2, 10367,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10368,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double eneded queue is a queue which can be accessed from both side back and front,2, 10369,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10370,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends., Deque is a linear data structure where the insertion and deletion operations are performed from both ends,2, 10371,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10372,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue with two ends is knows as double ended queue,1, 10373,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10374,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it is a linear data structur ehere insertion and deletion can be performed from both ends,2, 10375,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10376,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"push_front, push_back, pop_front,pop_back,empty,size,",2, 10377,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is where elements can be taken out fron front and rear both side ,2, 10378,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10379,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,heap is very usefull,0.5, 10380,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,where queue ends both wasys as in deletion can be done from both sides,1, 10381,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,INSERTION AND DELETION CAN TAKE PLACE FROM BOTH SIDE ,2, 10382,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a type of queue in which we can insert and delete from both side,2, 10383,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,whee we can acess both lst and first elements,1, 10384,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue in which we can insert and delete from both the end of the queue,2, 10385,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,In this queue we can access the elements from front as well as from last,2, 10386,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue in which the first queue end the other queue starts,0.5, 10387,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,LIFO can be performed at both ends,1, 10388,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double eneded queue is where the elements can be popped out from both ends.,2, 10389,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue which is implemented through start and tail pointer,1.5, 10390,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue where WE CAN INSERT FROM FRONT AND BACK,2, 10391,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10392,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10393,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue with same front and end,2, 10394,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,ou can perform both insertion and deletion operations at both of its end.,2, 10395,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,The deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends. ,2, 10396,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue are the queue which has sated from both left and right side at atime,0.5, 10397,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it is one in which the elements can be inserted and deleted from both the sides.,1, 10398,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10399,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is a quees which is double ended,1, 10400,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10401,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10402,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A queue in which enqueue and dequeue operations can happen from both, the front as well as rear. ",2, 10403,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue which has same rear and front. so can be accessed in both ways.,0.5, 10404,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10405,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"The insertion in a linear queue must happen from the rear end and deletion from the front end. But, in deque, you can perform both insertion and deletion operations at both of its ends. That's why it is called a Double-Ended Queue",2, 10406,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10407,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,that is accessable from both ends,2, 10408,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Double ended queue allows insertion and deletion from both front and rear end.,2, 10409,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0.5, 10410,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,both side insertion and deletion,2, 10411,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,removal or addition through front and rear,2, 10412,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,We can traverse in both directions and last element points to first one.,1.5, 10413,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is a type of where we can insert data from both the ends ,2, 10414,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10415,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,deque,, 10416,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10417,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertion and deletion perform fromn both ends,, 10418,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"The insertion in a linear queue must happen from the rear end and deletion from the front end. But, in deque, you can perform both insertion and deletion operations at both of its ends. ",, 10419,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10420,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10421,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10422,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,the queue in which we can insert or delete from both sides,, 10423,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,It is a queue which can be traversed from both directions.,, 10424,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10425,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in double ended queue insertion and deletion can be performed from both ends,, 10426,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,where we can perform operations on 2 ends,, 10427,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Double-ended queue the insertion and deletion can be done from both ends.,, 10428,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,having both next and previous pointers,, 10429,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10430,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10431,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10432,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10433,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,data structure where the deletion and insetion process caN BE executed on both sides,, 10434,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10435,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in which nodes have pointers for left and right,, 10436,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10437,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is a linear data structure in which pop and push operations can be performed on both sides,, 10438,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue which can follow both fifo and lifo,, 10439,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,last element is connected to the first element,, 10440,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue, commonly known as a deque (pronounced ""deck""), is a versatile and linear data structure that allows elements to be inserted and removed from both ends with high efficiency",, 10441,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,which having both next and previous pointer,, 10442,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in which insertion and deletion can be done on both the sides,, 10443,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,removal or addition through front and rear ,, 10444,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10445,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A double ended Queue is a queue where we can store elements from both the ends.,, 10446,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue with both next and prev pointers,, 10447,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a double ended queue is a queue where each stack node is connected to the front or top node.,, 10448,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,which have its ends in both sides ,, 10449,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a double ended queue is a type of queue supporting insertion at both ends,, 10450,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10451,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it is a linear data structure where insertion and deletion are perdormed at both ends.,, 10452,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is the one where the elements inserted in a queue can be inserted and delete as well as accessed from both sides,, 10453,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,The deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends,, 10454,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A DOUBLE ENDED QUEUE IS A QUEUE WHICH HAVE 2 ENDS.,, 10455,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue in which you can dequeue or enqueue from both ends of the queue ,, 10456,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,LINEAR DATA STRUCTURE WHERE INSERTION AN DDELETION IS PERFORMED.,, 10457,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Double ended queue refers to an insertion or deletion in a queue ,, 10458,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in which insertion and deletion can be done from both the ends,, 10459,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10460,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10461,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertion and deletion can be done from end,, 10462,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10463,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,elememts can be added from front and back,1, 10464,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.," deque, short for ""double-ended queue,"" is a linear data structure that facilitates operations like insertion and deletion from both ends. It can be viewed as a broader version of a queue, offering increased flexibility. ",2, 10465,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,two operations can be done ,2, 10466,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"queue in which , by certain operation insertion can be applied from starting when queue is filled from its bottom",2, 10467,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,traversal is possible in both directions ,1, 10468,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it is a queue in which one can push and pop data from both sides of the queue.,1, 10469,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10470,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,The deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends. We can say that deque is a generalized version of the queue.,2, 10471,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A linked list in connected by node has next and prev pointer ,1, 10472,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"it is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front or back .",2, 10473,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,The deque stands for Double Ended Queue. double queue is a linear data structure where the insertion and deletion operations ,1.5, 10474,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10475,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,IN WHICH WE CAN PERFORM OPERATIONS FROM FRONT AND REAR,1, 10476,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10477,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,having rforward and backward movement,1.5, 10478,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue, commonly abbreviated as ""deque,"" is a linear data structure that allows elements to be inserted and removed from both ends. It combines the features of a stack and a queue, enabling efficient operations at both the front and the back of the data structure. A deque can be visualized as a list of elements with two ends, and elements can be added or removed from either end.",1.5, 10479,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue where enequeue and dequeue operations can be performed from both ends,1.5, 10480,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it is a queue that can be traveresed from both the sides,0.5, 10481,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10482,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10483,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10484,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,element deleted from from sides,1.5, 10485,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,In which insertion and deletion can be done from the end.,1, 10486,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it is a type of queue in which deltion and insertion is done from bpoth sides,0.5, 10487,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue in which insertion and deletion form both the ends is possible,1, 10488,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A deque, short for ""double-ended queue,"" is a linear data structure that facilitates operations like insertion and deletion from both ends.",1.5, 10489,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10490,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A deque in which pop and push operations are applicable on both ends.,1.5, 10491,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,both the ends of the queue can be used,1, 10492,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,que traversed form both directions,1.5, 10493,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10494,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue which has two ends that is it can be used from both side,1.5, 10495,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,It is a queue where we can access it from both ends,1.5, 10496,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue which can be chnaged from both front and end part both,1.5, 10497,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10498,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A Double-Ended Queue, often abbreviated as Deque, is a data structure that allows insertion and deletion of elements from both ends.",0, 10499,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue in which insertion and deletion form both,1.5, 10500,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue that can be traversed from both the ends,1.5, 10501,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,perform both insertion and deletion operations at both of its ends,1.5, 10502,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10503,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,doublke,0, 10504,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,you can perform both insertion and deletion operations at both of its ends. ,0, 10505,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue is accessible from both sides of the queue (rear and front),1.5, 10506,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue in which insertion and deletion can be performed both on front and on end,1, 10507,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,you can insert from both side of queue,1, 10508,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10509,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10510,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A queue in which insertion can take place from both end,0, 10511,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,double ended queue or dequee is a data structure that allows insertion and deletion from end and front of the queue,1, 10512,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,where we cn operation from both side,1.5, 10513,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue which can modified form both front and back.,1, 10514,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,having two ends ,1, 10515,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10516,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10517,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10518,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue in which insertion and delection can be performed ,1, 10519,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,The deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends. We can say that deque is a generalized version of the queue.,1.5, 10520,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10521,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10522,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,enque and deque is possible on boht the ends,0, 10523,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10524,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,list which has two ends is c,1, 10525,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertion deletion can be performed on both ends,1.5, 10526,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",1.5, 10527,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,that can push and pop from both ends,1, 10528,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10529,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,perform both insertion and deletion operations at both of its ends.,1.5, 10530,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10531,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue where we can dequeue and enqueue from both sides of Queues,1.5, 10532,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10533,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,enqueue and dequeue operation can be performed from both ends,1, 10534,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"insertion and removal of elements from both ends, i.e., the front and the rear",1, 10535,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,1, 10536,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.," a data structure that allows elements to be added or removed from both ends. In other words, it supports operations at both the front and the back of the queue. This makes it a versatile data structure that combines the features of both stacks and queues.",, 10537,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it is a linear data structure that facilates operations of qeue from both ends,1.5, 10538,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,linear data structure where insertion and deletion is performed from both the ends,0, 10539,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10540,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10541,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10542,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10543,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a linear data structure where the insertion and deletion operations are performed from both ends,1.5, 10544,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,1, 10545,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,1, 10546,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,dequeue,1, 10547,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10548,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10549,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,you can perform both insertion and deletion operations at both of its ends.,1.5, 10550,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertion and deletion can occur from both sides,1.5, 10551,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue (deque) is a data structure that allows insertion and deletion of elements from both ends, making it more versatile than a regular queue.",1, 10552,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a type of queue in which insertion and deletion can be performed from any end,1, 10553,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Double ended queue is which the enqueue operations has been done rom both ends.,1, 10554,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,no,, 10555,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10556,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue with two ends is known as double ended queue,1.5, 10557,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10558,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10559,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,, 10560,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue in which element can be inserted/deleted from both ends ,1.5, 10561,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,you can perform both insertion and deletion operations at both of its ends. That's why it is called a Double-Ended Queue,, 10562,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue with two ends,1.5, 10563,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in which insertion and deletion takes place from both ends,1.5, 10564,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10565,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10566,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10567,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A double ended queue is where the element can be dequeued from both sides.,1.5, 10568,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"The insertion in a linear queue must happen from the rear end and deletion from the front end. But, in deque, you can perform both insertion and deletion operations at both of its ends. That's why it is called a Double-Ended Queue (Deque).",2, 10569,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10570,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertion and deletion from both ends,2, 10571,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"In computer science, a double-ended queue (abbreviated to deque, pronounced deck, like ""cheque""[1]) is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail).[2] It is also often called a head-tail linked list, though properly this refers to a specific data structure implementation of a deque ",2, 10572,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10573,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"Queue which have two pointer, one pointer to point towards previous node, and other pointing towards the next node.",1.5, 10574,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in which insertion and deletion can be done from both end and start,2, 10575,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10576,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10577,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"a double-ended queue is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front or back. It is also often called a head-tail linked list, though properly this refers to a specific data structure implementation of a deque",2, 10578,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10579,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10580,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10581,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10582,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it has 2 ends 1st node 2nd null,0.5, 10583,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue having two pointers a,0.5, 10584,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10585,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10586,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,WHICH CONTAINS THE ADRESS OF PREV AND THE NEXT POINTER,0.5, 10587,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertion and deletion can be done from both ends,2, 10588,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,we can insert from both side of it,2, 10589,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,operation can be perfomed on both ends,2, 10590,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10591,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10592,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,The deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends.,2, 10593,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it have 2 pointers previous and next,1, 10594,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10595,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10596,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in which every element point to next ,0, 10597,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in which every element point to next,0, 10598,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10599,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"The insertion in a linear queue must happen from the rear end and deletion from the front end. But, in deque, you can perform both insertion and deletion operations at both of its ends. That's why it is called a Double-Ended Queue (Deque)",2, 10600,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queueu whrer popping and appendation can be done form both ends,2, 10601,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10602,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10603,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertion and deletion from both the ends,2, 10604,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,we can nque and dque from both the end ,2, 10605,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10606,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"ouble ended queue is a more generalized form of queue data structure which allows insertion and removal of elements from both the ends, i.e , front and back.",2, 10607,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertion and deletion can be performed from both sides,2, 10608,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10609,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10610,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A double-ended queue is a data structure that allows insertion and deletion of elements at both ends (front and rear). It combines the features of both stacks and queues.,2, 10611,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,push and po performed both sides,2, 10612,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10613,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10614,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Doubly ended queue can have push and pop operations from both sides front and rear,2, 10615,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,where data can be added from both sides,1, 10616,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"The insertion in a linear queue must happen from the in deque, you can perform both insertion and deletion operations at both of its ends.It is known as double ended queue.",2, 10617,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a double ended queue is one in which insertion and deletion can take place from both rear and from end,2, 10618,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,pop and opush can be both side,2, 10619,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10620,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10621,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue in which start push and pop and push at back to ,0, 10622,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10623,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Insertion and deletion operations can be done from both the front and rear of the queue.,1, 10624,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,A double-ended queue (deque) is a data structure that supports adding and removing elements,1, 10625,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10626,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertion on both end,1, 10627,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10628,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10629,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"Queue in which insertion,deletion takes place from both sides",2, 10630,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10631,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,elements can both be added and removed from both sides,2, 10632,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10633,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10634,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,it has ,0, 10635,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Deque,0, 10636,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10637,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10638,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue which has two ends,1, 10639,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10640,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10641,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue where iinsertion and deletion canm be done at both ends,1, 10642,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"a double-ended queue is data type that defines a queue, for which elements can be added to or removed from the front or back.linked list",2, 10643,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10644,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,Easy to use.,0, 10645,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10646,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,the queue open at both the ends,1, 10647,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10648,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,element can be inserted from both side,1, 10649,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,The deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends.,2, 10650,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue which can be accessed from both ends,1, 10651,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10652,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10653,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10654,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,which can perform push and pop from frond and back both,1, 10655,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10656,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,The deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends,2, 10657,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,we can add and pop from both sides of queuee,1, 10658,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,add and pop on both sides ,1, 10659,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,IN WHICH OPERATIONS LIKE INSERTION AND DELETION CAN BE PERFORMED FROM BOTH SIDES,1, 10660,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,no,0, 10661,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,where insertion and deletion can occur at both ends of queue,1, 10662,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10663,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,front and last ,1.5, 10664,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,when insertion and deletion can be performed from ends of the queue,1.5, 10665,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10666,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,in which operastion like deletion can be performed from both front and end,2, 10667,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,In which we can add or delete from both ends,1, 10668,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10669,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,nodes have pointers to left and right,1, 10670,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"The insertion in a linear queue must happen from the rear end and deletion from the front end. But, in deque, you can perform both insertion and deletion operations at both of its ends. That's why it is called a Double-Ended Queue",1, 10671,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertionj and deletion both side.,1, 10672,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10673,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10674,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.," A double-ended queue, often abbreviated as deque, is a data structure that allows elements to be inserted or removed from both ends with equal efficiency. In a deque, elements can be added or removed from the front (also known as the ""head"") and the back (also known as the ""tail"") of the queue.",1, 10675,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,insertion deletion can be performed both,1, 10676,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A deque, short for ""double-ended queue,"" is a linear data structure that facilitates operations like insertion and deletion from both ends.",1, 10677,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue, often abbreviated as ""deque"" (pronounced ""deck""), is a data structure that allows elements to be inserted and removed from both ends with high efficiency. A deque can be thought of as a hybrid of a queue and a stack because it supports operations on both ends, which makes it a versatile data structure for various applications.",1, 10678,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,that can insert and delete,1, 10679,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10680,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10681,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10682,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10683,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10684,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,linear data structure where the insertion and deletion operations are performed from both ends.,1, 10685,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10686,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10687,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,its a ,1, 10688,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,each node have previous and next pointer ,1, 10689,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,INSERTION DELETETION FROM BOTH END,1, 10690,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10691,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10692,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10693,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10694,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10695,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,CAN BE ACCESSED FROM BOTH ENDS,1, 10696,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,where we can enqueue and dequeue from both sides,1, 10697,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,INSERTION AND DELETION IS ALLOWED FROM BOTH THE ENDS,1, 10698,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,inserted data from both ends,1, 10699,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,you can perform both insertion and deletion operations at both of its ends. ,1, 10700,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,queue where insertion deletion can be done from both ends,1, 10701,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"A double-ended queue (deque) is a data structure that allows insertion and deletion of elements at both ends, i.e., it supports operations at the front and the rear.",1, 10702,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10703,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10704,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue in which we can pop element from both front and end.,1, 10705,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,a queue where enqueue and dequeue ins applied on both end,1, 10706,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10707,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,"The insertion in a linear queue must happen from the rear end and deletion from the front end. But, in deque, you can perform both insertion and deletion operations at both of its ends.",1, 10708,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,both sides insert is possible,1, 10709,Define double-ended queue,It is a special type of queue that allows insertion and deletion of elements at both ends.,,0, 10710,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,1, 10711,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"1. **Improved Traversal**: Threaded binary trees allow for faster in-order traversals, as they eliminate the need for explicit stack or recursion, resulting in reduced memory overhead. 2. **Efficient Space Utilization**: Threaded binary trees can save memory compared to traditional binary trees because they do not require additional pointers to represent threaded connections.",0.5, 10712,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we could traverse the binary tree with constant space complexity,2, 10713,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Threaded binary trees improve the efficiency of in-order traversal by providing threads (pointers) that connect nodes without left or right children. This eliminates the need for recursion, reducing space and time complexity.",1.5, 10714,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,leaf nodes points to inorder successer or predecceser.,1, 10715,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,1-No need for stacks or recursion 2-Optimal memory usage 3-Faster traversal 4-Easier to implement 5-More flexible,0.5, 10716,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,optimal memory is used and no need of stacks for recursion,2, 10717,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Threaded binary tree allows us to perform traversal is O(N) time and O(1) space. It is the only way to perform traversals in O(1) space. Recursion also requires O(H) stack space.,1.5, 10718,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"A threaded binary tree is a modified binary tree data structure in which each node contains additional information to help traverse the tree efficiently, often without requiring explicit stack-based traversal. ",0.5, 10719,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,2, 10720,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Inorder traversal of a Binary tree can either be done using recursion or with the use of a auxiliary stack. The idea of threaded binary trees is to make inorder traversal faster and do it without stack and without recursion.,0.5, 10721,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,time complexity of threaded binary tree is less and it saves memory ,1.5, 10722,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,inorder traversal is easy and faster,2, 10723,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,increased complexity,1, 10724,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it makes inorder traversal easier,1.5, 10725,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"THreaded binary tree can be used to traverse binary trees (preorder, inorder, postorder) without using recusion or stack.",0.5, 10726,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Advantages of threaded binary trees: 1. Faster in-order traversal. 2. Space-efficient due to reduced memory overhead. 3. Simplified tree operations. 4. Improved performance for specific use cases. 5. Reduced function call overhead during traversal.,2, 10727,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"It eliminates the use of stack as it perform linear traversal, so save memory.",0.5, 10728,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,1, 10729,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,1.5, 10730,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,2, 10731,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",1.5, 10732,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"It eliminates the use of stack as it perform linear traversal, so save memory.",0.5, 10733,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,in threded tree we dont have null pointers soo over travasal move easy and have goodtimecomplexity.,1, 10734,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it utilizes the extra null pointers to point to useful nodes which makes it good for many operations such as inorder traversal.,2, 10735,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"A Threaded Binary Tree is a Binary Tree where all left child pointers are NULL points to its in-order predecessor, and all right child pointers are NULLpoints to its in-order successor",1, 10736,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10737,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"A tree with n nodes have n-1 nulll pointers out of 2n pointers this increases space complexity to reduce this the null pointers of the node can be pointed to inorder successor or predeccessor making inorder traversal also easier (now the node will have two extra attributes bool rthread, bool lthread).",1.5, 10738,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Threaded Binary tree is the iterative approach to do the inorder and preorder traversal where we maintain the thread from the root's left child to the predecessor . where predeccessor is previously null and is linked to root node on reaching it.,2, 10739,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Threaded binary trees offer advantages like reduced memory overhead, improved traversal efficiency (in-order traversal without recursion), and simplified traversal algorithms.",1.5, 10740,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It eliminates recursive calling or use of external data structures,0.5, 10741,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"1) stacks ,queues and recursion can not be used 2) optimal memory use",2, 10742,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,its is efficient in traversal as right pointers,0.5, 10743,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it reduces traversal time greatly as the nodes can directly refer to their parent/ancestors.,2, 10744,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"The advantages of threaded binary trees is that every node has 2 pointers which aren't used in a simple binary tree and hence are wasted space, but in a threaded binary tree, they point to the next element in an inorder traversal, and hence can be easily used to traverse the tree with lesser function calls.",1, 10745,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,1.5, 10746,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Unlike binary trees, threaded binary trees can be traversed iteratively, without recursion or stack. Thus reducing memory usage, and call stack memory optimization",0.5, 10747,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It avoids the nodes pointing to null and decreases the space in compiler and helps us to traverse any node from anywhere in the tree.,2, 10748,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"less time, easy to understand",1, 10749,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",1.5, 10750,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10751,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,2, 10752,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"the advantage is that we don't require recursion technique for insertion , searching",0.5, 10753,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it does not contain Null pointer because it get connect to root element in its right side,2, 10754,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,1.5, 10755,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,In a simple binary tree there are n+1 null pointers which are useless but threaded tree utilizes them to make traversals of trees easier.,0.5, 10756,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Advantage of threaded binary tree is that it reduces the amount of function calls since we don't need to use recursion, we can use iteration. Iteration is more efficient than recursion.",1, 10757,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Advantages of threaded binary trees: Improved Inorder Traversal Efficiency: Threaded binary trees provide a way to traverse the tree in an inorder manner without the need for a separate stack, making inorder traversal more memory-efficient. Efficient Predecessor and Successor Finding: Threaded trees allow for efficient finding of the predecessor and successor of a node, which can be valuable in various applications. Simplified Tree Traversal Algorithms: Threaded trees simplify the implementation of tree traversal algorithms, as they eliminate the need for explicit recursion or maintaining auxiliary data structures like stacks. Space Efficiency: By avoiding the need for separate stack memory during traversal, threaded trees can be more space-efficient, which is essential in embedded or memory-constrained systems. Improved Performance in Real-time Systems: Threaded trees can be advantageous in real-time systems where predictable and efficient traversal is critical. However, it's important to note that threaded binary trees come with additional complexity in terms of maintenance and updates, which can make them less suitable for dynamic data structures where frequent insertions and deletions occur.",1.5, 10758,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it decreases memory wastage and there is no use of stacks or recursion for traversal through threaded bst.,2, 10759,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Advantages of a threaded binary tree include improved traversal efficiency and reduced memory overhead compared to traditional binary trees.,1, 10760,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.," Threaded binary trees provide efficient in-order traversal without the need for recursion or a stack, reducing memory overhead. They also support quick predecessor and successor finding operations in constant time.",2, 10761,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It containes less number of null nodes and inorder traversal becomes easier,1, 10762,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10763,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,1. It reduces the number of null pointers 2.Faster traversal can be done using the threads. 3.No need for stacks and recursions to print the data,1, 10764,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,space is not wasted,1, 10765,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,constant memory is used when threaded binary tree is traversed without using recursion or stack,1, 10766,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,traversal becomes easier and time complexity of certain operations is reduced,1, 10767,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,A threaded binary tree is a variant of a normal binary tree that assists faster tree traversal and doesn’t need a stack or recursion. It reduces memory wastage by placing the null pointers of a leaf node to the in-order successor or in-order predecessor,2, 10768,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,time complexity and space complexity is less and less space is used ,1, 10769,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,in threaded binary we don't have to traverse again and again and through the parent,1, 10770,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,a threaded binary does not involve wastage of space as all the leaf nodes points to the next most right element ,1, 10771,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Threaded binary trees use threading to avoid null pointers, which saves space and simplifies traversal algorithms",2, 10772,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we don't need stacks or recursion and there is optimal memory usage.,2, 10773,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10774,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Inorder travel effciancy,space efficiancy,faster inorder traversal ",1, 10775,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Advantages of threaded binary trees include improved traversal efficiency without using recursion and reduced memory overhead compared to traditional binary trees.,2, 10776,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10777,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It reduced the stack space i.e the traversal can be performed using O(1) space complexity,1, 10778,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,here no node ppoints to null. each node is pointing to either its succesors or predecessors and thus it makes the traversal easier and faster.,1, 10779,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,IT IS A SELF BALANCING TREE AND SEARCHING BECOMES EASY,1, 10780,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Searching is easier,1, 10781,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",2, 10782,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,faster inorder traversal,0, 10783,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,in threaded binary tree the leaf nodes dont point to null instead they point to inorder successor or predecessor based on whether is singular threaded tree or not. It has the advantage that pointers are not wasted and that traversals become more efficient and faster.,2, 10784,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage",2, 10785,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,in this we do not need to go back to the parent node for traversal and the memory which was wasting is used,2, 10786,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10787,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Threaded Binary Tree is a type of binary tree Doesnt Need Stack Or Reccursion It reduce memory wastage,2, 10788,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,A Threaded Binary Tree is one of the variants of a normal Binary Tree that assists faster tree traversal and doesn't need a Stack or Recursion. It reduces memory wastage by placing the null pointers of a leaf node to the in-order successor or in-order predecessor.,2, 10789,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,searching becomes easy,1, 10790,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,reduces the space of Null pointers,1, 10791,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,1, 10792,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,easier to traverse,1, 10793,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10794,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10795,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,every child node point to their right node and left node,1, 10796,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10797,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10798,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10799,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,fast insertion and deletion,1, 10800,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10801,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10802,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10803,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,threaded binary trees are a variant of binary trees that assist faster tree traversal and do not require a stack or recursion. They reduce memory wastage by placing the null pointers of a leaf node to the in-order successor or in-order predecessor,2, 10804,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,reduces the space for null pointer,2, 10805,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,null pointers of leaf points to inorder predecessor or successor. To efficient traversal ,2, 10806,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"main advantage is, traversal with recursion and using stacks and queues take lot of space and time to execute , but threaded binary tree is faser as it is iterative and a root's left and rigth address is stored in variable and is imediatly updated.",2, 10807,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Advantages of threaded binary trees include reduced memory usage and faster in-order traversal, while also simplifying certain operations. However, they are more complex to implement compared to standard binary trees.",2, 10808,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Searching is easy and reduces space,1, 10809,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10810,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it is helpful in faster traversal of nodes and it saves the space of nodes because some nodes have NULL pointers which are of no use ,1.5, 10811,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,In threaded binary tree the inorder and preorder traversals can be perofrmed in O(1) space complexity as some of he nodes have ratger than being NULL gets connected to some other nodfes to directly go to them rather than reccusrively ,0, 10812,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10813,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,To access ancestor quickly.,1, 10814,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10815,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Threaded binary trees use threading to avoid null pointers, which saves space and simplifies traversal algorithms",1.5, 10816,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"no use of stacks and recursion, to access ancestor quickly",1.5, 10817,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Threaded binary tree is a method used to traverse the tree with minimum usage of time and space . It is used to make inorder traversals and other traversals more efficient.,1, 10818,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10819,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Threaded binary trees provide efficient in-order traversal without the need for recursion, reducing memory usage and simplifying tree operations.",1.5, 10820,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Threaded binary trees, also known as threaded trees, are binary tree structures that include additional threads or references between nodes to facilitate various operations efficiently. The advantages of threaded binary trees include: 1. **Inorder Traversal Efficiency**: One of the primary advantages of threaded binary trees is that they enable efficient and non-recursive (iterative) in-order traversal. This is particularly useful for tasks like printing elements in sorted order. 2. **Space Efficiency**: Threaded trees save memory compared to regular binary trees. Instead of using additional data structures like stacks to implement traversal, threaded trees use threads, reducing memory overhead. 3. **Simplified Tree Operations**: With threaded trees, operations such as finding the in-order predecessor and successor of a node become more straightforward, as the threads provide direct links to these nodes. 4. **Simplified Tree Deletion**: Threaded trees make node deletion more efficient. When deleting a node with two children, finding the in-order successor becomes faster because of the threaded link. 5. **Improved Performance**: Threaded trees can improve the performance of in-order traversal and related operations in specific use cases, especially when traversing the tree frequently. 6. **Search Optimization**: Searching for specific nodes within a threaded tree can be more efficient due to the availability of threaded links, which allow you to skip subtrees when the target value is not present. 7. **Threaded Trees for Multithreading**: In multithreaded environments, threaded binary trees can be used to implement data structures that allow for efficient and thread-safe operations. It's important to note that threaded binary trees are not always the best choice for all scenarios. The threading mechanism introduces additional complexity during tree construction and updates, and it may not be beneficial if in-order traversal is not a common operation. Therefore, the decision to use threaded trees should be based on the specific requirements and use cases of the application.",2, 10821,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,1) it does not require use of stack and recursion. 2)it saves memory. 3) its time complexity is O(1).,0.5, 10822,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it makes the level order traversal easier,1, 10823,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,in threaded binary tree more data can be stored in child node without any extra implementation ,0.5, 10824,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10825,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10826,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,threadedbinary tree take less memory allocation than a normal tree as the null values arent stored and easier for traversal,195, 10827,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",1.5, 10828,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,easy tranversal,0, 10829,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",1.5, 10830,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Threaded binary trees save memory compared to regular binary trees and allow for efficient in-order traversals without recursion or a stack.,1, 10831,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,A threaded binary tree is a binary tree in which each null pointer is replaced by a thread (pointer) that points to the in-order successor or predecessor of the node.,1.5, 10832,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,No need for stacks or recursion and optimal memory usage.,1, 10833,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10834,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,fastest traversal and space efficient (morris traversal).,0.5, 10835,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10836,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,theaded binary tree cause lesser rotation,0, 10837,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,traversal can be done using recursion or stack.,0, 10838,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,SEARCHING IS EASY ,0, 10839,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,WE CAN TRAVERSE BACK TOOELEMINATED NEED FOR STACK,2, 10840,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,IT MAKES SEARCHING EASY,0, 10841,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"It eliminates the use of stack as it perform linear traversal, so save memory",1, 10842,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"no use of stacks,recursion ,to access ancestors",1.5, 10843,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,A threaded binary tree is advantageous as by using two more bits it becomes possible to iterate over the tree using a while loop and the space used in the recursive call stack is saved making the traversals faster,1.5, 10844,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,reduces time complexity,0, 10845,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,node are already implemented in the stucture,0, 10846,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"The advantages of threaded binary tree are- It eliminates the use of stack , it perform linear traversal, it saves memory.",1.5, 10847,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"The advantages of Threaded Binary Tree are - it uses less memory, it performs linear traversal, it eliminates the use of stack",1.5, 10848,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10849,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,there is no null value stored in leaf nodes and also it is easy to traverse directly from leaf nodes,1.5, 10850,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"The first advantage of using a Threaded Binary Tree is that the traversal operation is much faster than that of the Non-Threaded Binary Tree, The second advantage of using the Threaded Binary Tree is that we can efficiently determine the predecessor and successor nodes beginning from any node. Another advantage of a Threaded Binary Tree is that one can access any node from another",2, 10851,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.," threaded binary trees come with additional complexities during insertion and deletion operations, as maintaining thread references requires careful handling. These complexities may offset some of the advantages in specific situations. ",2, 10852,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,in threaded binary tree the space is not wasted and the the pointers which were pointing to null are used to point to the inorder successor and the inorder predecessor,2, 10853,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,, 10854,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10855,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,there are not much null pointers left in binary tree.,0, 10856,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,easier inorder traversal,0, 10857,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,All the node not having left or right child is threaded or pointed towards the inorder predecessor and successor respectively.It prevents wastage of left and right pointers.,, 10858,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it does not involve extra space and use less rotation,0.5, 10859,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,No need for stacks or recursion in threaded binary tree.,0, 10860,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,NULL space is not allocated in threaded tree,0, 10861,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,without using recursion elements can be traversed in less time - n operations.,0.5, 10862,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"we need less traversal , so we can save time during traversal , basically we avoid backtracking in long tree",0.5, 10863,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,inorder traversal in threaded binary tree becomes easier to perform,0, 10864,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage. Another advantage of threaded binary tree data structure is that it decreases memory wastage.",0.5, 10865,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we do not need to use to use stack and recursion in case of threaded binary tree AND WE CAN EASILY TRAVERSE THE ROOT ELEMENT JUST AFTER ITS LEFT CHILD USING ITS LOCATION STORED IN ITS LEFT CHILD,0.5, 10866,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,doesnt need stack or recursion also allow the optimal use of memory,0.5, 10867,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,With a threaded Binary Tree traversals and various other operations become easy can take place in less time. ,0.5, 10868,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",0.5, 10869,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,you can know the predecessor and successor of a node in tree.,2, 10870,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,does traversel operation in O(N) time without using recursion or extra space,0.5, 10871,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,in threaded binary tree the data of the previous node is stored and thus it makes navigating to the next node faster.,0.5, 10872,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It enables linear traversal of elements. It gives forward and backward traversal of nodes by in-order fashion. Nodes contain pointers to in-order predecessor and successor.,1.5, 10873,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,ALL THE ELEMENTS ARE THREADED FROM ITS LEFT,0, 10874,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it converts the useless null pointers into useful pointer.,1, 10875,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it converts the useless null pointers into useful pointers by poiting the next adjacent element.,1, 10876,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Threaded binary tree make use of NULL pointers of leaf nodes , we need less time to traverse it.",1, 10877,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10878,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal.",0.5, 10879,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,traversal can be done using recursion or stacks.,0.5, 10880,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Helps in representing nodes and children of binary tree ,0.5, 10881,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10882,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.," Threaded Binary Tree is a Binary Tree where all left child pointers are NULL points to its in-order predecessor, and all right child pointers are NULLpoints to its in-order successor. ",1.5, 10883,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10884,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10885,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10886,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no need for stacks and recursion,0.5, 10887,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Fewer NULL pointers and inorder traversal is easy,0, 10888,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,always connected to the inoerder predecessor or inorder successor,0.5, 10889,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,No need for stacks or recursion,0.5, 10890,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,inorder traversal is fast in threaded binary tree,0.5, 10891,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,in threaded binary tree of length l the number of child node are 2^(l-1) and each one has rchild and lchild pointers in which nothing is stored so we make use of this storage and put the pointer of the right upper node of the current node and can be done with lchild nde also. Threaded binary tree make inorder traversal way to easy as it doesnt require the use of recursion and even stack,1, 10892,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,reduces time complexity ,0.5, 10893,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Threaded binary tree advantages: faster in-order traversal, space efficiency.",0.5, 10894,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,dont take null spacxe,0.5, 10895,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,".traversal can be executed without stack, and is faster than normal binary tree",0.5, 10896,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it helps to trace the path,0.5, 10897,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Here you dont need to traverse the same node again and again. It reduces some time.,0.5, 10898,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,ioperation on binary search tree get optimize,0, 10899,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"It eliminates the use of stack as it perform linear traversal, so save memory",0.5, 10900,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Efficient in-order traversal without recursion. Saves space compared to adding extra pointers for threaded trees.,0.5, 10901,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"A Threaded Binary Tree is a Binary Tree where all left child pointers are NULL points to its in-order predecessor, and all right child pointers are NULL points to its in-order successor",1, 10902,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,TRAVERSALS ARE FASTER AS WELL AS RECURSIVE STACK IS NOT USED AS THREADS ARE MAINTAINED,0.5, 10903,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10904,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,threaded binary tree doest not use extra space and has extra speed to perfrom any operation . each node is connected to its inorder predecessor and inorder successorto search ,1, 10905,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we dont have to tarverse an element repeatedly,0, 10906,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It helps in fast traversal of trees and doesn't use null pointers which saves a lot of space,0.5, 10907,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It helps to traverse trees in inorder way easily,0.5, 10908,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it is faster to access data,0.5, 10909,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,the leaf nodes are connected with a thread to inorder successor and inorder predecessor ,2.5, 10910,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,helps in faster traversal and accessing elements and spaces of pointers of leaf nodes are not wasted by allocating NULL,2, 10911,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,where the leaf nodes are connected witha thread to inorder successor and inorder predecessor,3, 10912,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal.",3.5, 10913,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Improves Searching ,1, 10914,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,threaded binary tree can store values of keys and hence makes searching faster ,3, 10915,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10916,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,serching is easy as it has inorder suc and inordeprdecerand succsreor and has no null pointer and easy to delete when has both child,3, 10917,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10918,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it is more efficient and take less time ,2.5, 10919,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,in threaded binary tree the NULL ,1.5, 10920,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,less memory is wasted on NULLS,1, 10921,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Efficient Inorder Traversal: Threaded binary trees allow for efficient inorder traversals without the need for recursive or stack-based traversal algorithms. This is particularly useful when you need to process elements in sorted order quickly.,3.5, 10922,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Threaded binary tree is used to reduce the height of the tree.,3.5, 10923,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,1, 10924,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Used for faster and non-recursive inorder traversal,1, 10925,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it's used where we want to traverse leaf nodes first.,1.5, 10926,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we can traverse the tree by their predessor and successor,1.5, 10927,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,takes less time to traverse the array,2.5, 10928,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Use the Null Nodes of leaf,0.5, 10929,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no need for stack and optimal use of storage,0.5, 10930,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10931,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it makes traversal easier by reducing time complexty and space comlexity,3, 10932,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it takes less space then normal binary tree.,1, 10933,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,non recursive traversals in n complexity,2, 10934,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no need of stack or recursion ,3, 10935,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it makes traversal easier,1, 10936,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,in the threaded binary tree the leaf node stores the data of it ancestor. This searching more efficient.,3, 10937,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,fewer null pointers as compared to other trees and simpler inorder traversal,3.5, 10938,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.,3, 10939,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"it is a fast , and also does not require any auxiliary space",3, 10940,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10941,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,faster traversal that binary tree,1, 10942,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10943,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Advantage of threaded binary tree is-storage wastage is prevented.,1, 10944,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,use the space effectiently,1, 10945,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10946,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,leaf nodes are not null and store address of other nodes,2.5, 10947,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10948,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,finding inorder traversal is more efficient,0.5, 10949,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10950,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Threaded Binary Tree is better as the traversal operation is much faster than that of the Non-Threaded Binary Tree, as the non-recursive implementation is possible with a Threaded Binary Tree which can execute faster and does not require the infliction of stack management.",4, 10951,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Advantages of threaded binary trees include reduced memory usage and faster in-order traversal without recursion or a stack.,1.5, 10952,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10953,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal.",3, 10954,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10955,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,threaded binary tree last cghild didint point to null but to the root so traversal is easy in threadded binary tree,1.5, 10956,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 10957,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage. ",4, 10958,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"in a normal binary tree there are a lot of NULL pointers, to reduce them to only 2, we use a threaded binary tree",3.5, 10959,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,For nodes with no right and left child we can point to the inorder predecessor and successor to maintain the inorder flow of the tree,2, 10960,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.,2, 10961,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it eliminate the imablanced in tree ,1.5, 10962,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10963,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it is linear,0.5, 10964,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,reduces time complexity,1.5, 10965,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,is used to traverse tree without recursive call stack,2, 10966,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10967,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10968,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"A Threaded Binary Tree is a Binary Tree where all left child pointers are NULL points to its in-order predecessor, and all right child pointers are NULLpoints to its in-order successor.",2, 10969,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,quick predeccsor and succesor access,2, 10970,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,can access tree without using recursion ,1, 10971,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10972,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It eliminates the use of stack as it perform linear traversal space complexity less,2, 10973,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we have the data of the predecessor or successor on the nodes,1.5, 10974,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it helps in searching,1.5, 10975,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,the pointers which are null they are utililised,1, 10976,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Inorder traversal of a Binary tree can either be done using recursion or with the use of a auxiliary stack. The idea of threaded binary trees is to make inorder traversal faster and do it without stack and without recursion.,2, 10977,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10978,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10979,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10980,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10981,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it is easier to traverse ,1.5, 10982,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,tree can traverse backwards..easier traversal,2, 10983,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,the advantages of a threaded binary tree is that it helps massively in traversal. Morris traversal happens using threaded binary tree. ,2, 10984,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it is easier to implement,1, 10985,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,DATA ARE EASILY AND CONVENTIONALLY ACCESSED WITH THREADED RELATION NO STACK OR RECURSION IS NEEDED ,2, 10986,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10987,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,traversal time is reduced as empty childs are ignored there,1.5, 10988,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no recurring while traversal,1.5, 10989,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10990,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",2, 10991,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,the advantages of threaded binary tree data obtain is very easy and each child is linked to another child through a thread,2, 10992,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"threaded binary tree has an advantage that while traversing, when reached at the leaf node we can directly go to the next node (eg. in inorder traversal) instead of back tracking to the previous nodes.",2, 10993,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10994,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10995,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10996,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0.5, 10997,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It saves space for those nodes which have NULL as their left child or right child.,2, 10998,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we do not have to recur back to root node while traversal. also has constant space complexity.,1.5, 10999,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no allocated memory is wasted.,0.5, 11000,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"It eliminates the use of stack as it perform linear traversal, so save memory. For a given node, we can easily find inorder predecessor and successor. So, searching is much more easier. In threaded binary tree there is no NULL pointer present.",2, 11001,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it reduces the time complexity of inorder traversal. the child nodes point to its inorder predecessor or successor,1, 11002,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,that we can access the root node even from the leaf nodes,2, 11003,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Efficient in order traversal without recursion, memory efficient, faster searching ",2, 11004,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,We can reduce the amount of null pointers .,1.5, 11005,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it holds the address of inorder sucessor and predeccesor which reduces triversal time,2, 11006,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"efficient inorder traversal, fast searching and increase efficiency",2, 11007,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It avoids memory wastage such that instead of pointing to null it points to predecessor or successor.,2, 11008,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,threaded binary tree is very time efficient ,2, 11009,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,The traversals can be done esily without recursion or stacks or queues.,1.5, 11010,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,its makes traversal easier as we know the predecessor and successor,1.5, 11011,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,the right child is connected to the parent..helps in traversing,2, 11012,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,reduce memory usage,1.5, 11013,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,The absence of recursive function calls or explicit stack usage makes it faster and reduces the memory overhead,2, 11014,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,the return back traversal from the leaf nodes becomes easier as we have established a link between the top root and the leaf node.,1.5, 11015,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it is helpful in binary search .,1.5, 11016,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11017,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal.",1, 11018,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no need of stack and recursion like other binary trees.,1.5, 11019,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11020,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it holds the address of inorder successor and predeccessor which reduces traversal time.,1.5, 11021,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11022,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"It eliminates the use of stack as it perform linear traversal, so save memory",1, 11023,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Can cumpute inOrder easily, and can tell Inorder sucessor and predecessor.",1, 11024,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we can traverse the whole tree in a linear way,1.5, 11025,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we can do non recursive traversal and searching easily ,1.5, 11026,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11027,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11028,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,optimal memory usage and no need for stacks,1.5, 11029,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11030,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,less time and space for traversal,1.5, 11031,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it helps in traversal of the tree.,2, 11032,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,traversal time and space utilisation is improved due to which stack space is not required,1.5, 11033,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it is a tree which helps to represent inorder and post order traversal easily using one way and two way,1.5, 11034,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Threaded binary trees save memory, provide efficient in-order traversal, and can simplify tree-related operations",1, 11035,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Threaded binary trees, also known as threaded trees, offer several advantages, including: Space Efficiency: Threaded trees can save memory compared to traditional binary trees, as they use thread pointers to represent null or empty child pointers, reducing storage requirements. Efficient Inorder Traversal: In threaded trees, the threaded pointers allow for efficient and space-saving inorder traversal without the need for recursive or stack-based approaches, making them ideal for tasks like in-order traversal in threaded tree-based algorithms. Simplified Tree Navigation: Threaded trees simplify tree navigation and search operations, as they allow for both forward and backward traversal without the need for additional data structures like stacks or recursion.",1, 11036,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,can compute inorder easily,1.5, 11037,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11038,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"efficient inorder traversal, fast searching ,and increase efficiency ",1.5, 11039,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11040,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It is used to reduce the time of inorder traversal.,1.5, 11041,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,inorder traversal becomes simpler,1, 11042,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,the advantage of the threaded boinary tree is thayt thre the traversal becomes easy for lead nodes.,1.5, 11043,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,used to do inorder traversal,1.5, 11044,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"we know the given predecessor and successor of a node, making deletion easier",1, 11045,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11046,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,threaded binary tree makes traversal to successor and predecessot easier and it helps reduce the number of NULL pointers,1.5, 11047,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it helps in knowing the inorder predeccessor AND SUCCESSOR,1, 11048,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal.",1, 11049,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,IT IS MORE EFFICIENT THAT SIMPLE BINARY TREE.,1.5, 11050,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,threaded binary trees use the NUll value of the leaf nodes to point towards the inorder predessor or inorder successor. this way while traversing the tree we do not require the extra stack space ,1, 11051,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,NO NEED OF STACKS AND RECURSSION.,1.5, 11052,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It does not waste space for the NULL in the binary tree as it connect to is successor/predesccor,1.5, 11053,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no need od stacks save s memory ,1.5, 11054,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11055,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,1. Reduces number of nullpointers 2. ,1.5, 11056,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no need for stacks and saves memory,1.5, 11057,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,less storage and faster,1, 11058,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11059,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11060,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,thred binary tree is connected to its inorder predecessor and inorder successor,1.5, 11061,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"its is fast , take o(1) space for implementation",2, 11062,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,threaded binary tree allows to access an ancestor from a child node ,0.5, 11063,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"in threaded binary tree, we can reach to one's nodes predecessor and successor quickly as the leave nodes contain pointer to their successor and predecessor.",2, 11064,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,in this we create threads so that we donot have to traverse the node twice,2, 11065,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal.",2, 11066,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,optimise inorder traversal of a tree,1, 11067,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Optimal memory usage leass searching time,1, 11068,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"1. no any leaf node is null left node precedesor,and right node successor",2, 11069,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11070,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11071,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11072,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,NULL is not there at the end,1.5, 11073,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Efficient In-Order Traversal,1.5, 11074,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it makes inorder traversal faster as null right and left pointers now point to inorder successor and predecessor respectively,1, 11075,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no need of stack or recursion like other binary trees,1.5, 11076,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11077,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,1.5, 11078,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,1.5, 11079,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,easy to traverse,0.5, 11080,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,No need for stacks and saves memory,1.5, 11081,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"A Threaded Binary Tree is a Binary Tree where all left child pointers are NULL points to its in-order predecessor, and all right child pointers are NULLpoints to its in-order successor. ",1, 11082,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,traversals can be done without recursions,1, 11083,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,IN THIS TYEP OF TREE THE POINTER OF LEAF NODE ARE NOT WASTED THEY POINTED TO THEIR INORDER SUCCESSOR AND PREDESECESSOR,1.5, 11084,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,1, 11085,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Traversal time, space optimization is improved, due to which stack space is not required.",1.5, 11086,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,uses the wasted nodes,1, 11087,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no need for recursion or stack,0, 11088,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,1, 11089,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It is used to reduce the time of inorder transversal,1.5, 11090,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,It helps to find the parent node and in deletion odf data also,1, 11091,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,to traversae tree with O(1) space time complexity,1.5, 11092,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"it save memory , no ,leaf node is null",1, 11093,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,fasted inorder traversal and efficient searching and space efficient.,1.5, 11094,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,traversal can be done without recursion,1, 11095,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,there is no need of stack or recursion like other binary trees,1.5, 11096,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.,1, 11097,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,use of null pointers to store threADAS,1, 11098,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,threaded binary trees does not waste the space of null pointer and use to point successors of it self,1, 11099,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion., No need for stacks or recursion: it decreases memory wastage,1.5, 11100,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,=,1, 11101,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no need to store while traversing,1.5, 11102,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11103,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,1, 11104,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,in threded binary tree we are able to ,1, 11105,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it reduces time of traversal as it can now be done without stack or recursion,1.5, 11106,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it helps in reducing the space complexity by using left or right null pointers to traverse the tree. ,1.5, 11107,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11108,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,to traverse the tree with o(1) space complexity .,1, 11109,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,less number of null nodes,1.5, 11110,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,, 11111,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,better time complexity as we can return back to root and continue the traversal faster,1, 11112,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,faster traversal as a leaf node directly point to next inorder successor and predecessor.,1.5, 11113,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no need tostore while traverseling,1, 11114,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"it eliiminates the use of stack as it perform linear traversal, so save memory.",1.5, 11115,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,makes inorder traversal faster,1, 11116,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11117,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11118,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11119,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,to reduce inorder transversal time,1, 11120,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,leaf nodes point to inorder successor predecessor,1, 11121,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,, 11122,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,to print inorder traversal,1, 11123,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,to reduce traversal time,1.5, 11124,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"It eliminates the use of stack as it perform linear traversal, so save memory.",1.5, 11125,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11126,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11127,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11128,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,space complexity is O(1) for traversing,1, 11129,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,extra meomory space can be optimised,1.5, 11130,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,easily traversed,1, 11131,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it is easier to implement and less time complexity,1, 11132,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Memory will not be wasted as null pointers will be represented by threads,1.5, 11133,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,No need for stacks or recursion,1, 11134,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11135,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11136,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11137,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11138,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Optimal memory usage,1.5, 11139,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11140,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we can directly traversal via threads of leaf of nodes,1, 11141,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,used to ,1.5, 11142,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11143,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11144,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"It eliminates the use of stack as it perform linear traversal, so save memory.",1.5, 11145,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,, 11146,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Advantages of threaded binary trees include faster in-order traversal and the ability to convert a binary tree into a threaded one, which can save memory and simplify tree manipulation operations.",1.5, 11147,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it increases the speed of traversal,, 11148,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Advantage of it is that we can access the root node from the leaf node very easily so as to minimize the traversals.,1, 11149,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,fast and easy,1.5, 11150,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,, 11151,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it is threaded,1.5, 11152,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",1, 11153,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11154,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11155,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"we can avoid recursion, hence time complexity will be less",1.5, 11156,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11157,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,faster inorder traversa;l,1.5, 11158,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11159,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11160,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11161,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11162,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Advantages of threaded binary tree is that the child node also contains information about the parent node. ,1, 11163,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Let's discuss some advantages of a Threaded Binary tree. No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",1, 11164,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it takes less space,0.5, 11165,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,enables us to linearly traverse no space wastage,1, 11166,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",1, 11167,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"It eliminates the use of stack as it perform linear traversal, so save memory",0.5, 11168,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11169,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,reduces time required to traverse from child to parent node using predecessor and successor,2, 11170,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11171,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"A Threaded Binary Tree is a Binary Tree where all left child pointers are NULL points to its in-order predecessor, and all right child pointers are NULLpoints to its in-order successor.",2, 11172,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"It eliminates the use of stack as it perform linear traversal, so save memory. For a given node, we can easily find inorder predecessor and successor. So, searching is much more easier. In threaded binary tree there is no NULL pointer present.",2, 11173,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11174,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11175,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,threaded binanry tree helps us save memory as it doesn't points on null values in place of null it points their successor or predecessor instead.,2, 11176,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11177,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,time complexity is very less,0, 11178,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,save time for inorder traversal,1, 11179,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,easily implemented ,0, 11180,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11181,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11182,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11183,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,one time go to a node,0, 11184,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,space is less consumed,0.5, 11185,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"It eliminates the use of stack as it perform linear traversal, so save memory.",0.5, 11186,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11187,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion, Optimal memory usage",0.5, 11188,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,save time for inorder traversal,1, 11189,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11190,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11191,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it help in fast traversal,0.5, 11192,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it help in fast travesal,0.5, 11193,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11194,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",1, 11195,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,o)logn) seraching time,0.5, 11196,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11197,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11198,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no stacks or recursions,0, 11199,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,fast and easy,0, 11200,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11201,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,help in understanding preorder and post order,0.5, 11202,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,space complexity is O(1) for traversing,0, 11203,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11204,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11205,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Threaded binary trees offer advantages such as efficient in-order traversal without the need for recursive function calls, reduced memory overhead (compared to recursive traversal stacks), and faster searching when used in certain scenarios.",1.5, 11206,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,traversal becomes easier as inorder successors are connected,0.5, 11207,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11208,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,leaf node are connected to successor or predesessor,0.5, 11209,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Threaded binary tree connects the leaf nodes to nodes using inorder traverslal,1, 11210,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11211,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion., Threaded binary trees do not require a stack or recursion for their traversal. Another advantage of threaded binary tree data structure is that it decreases memory wastage.,2, 11212,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it dosen't waste much space and can be traversed linearly,2, 11213,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11214,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11215,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it makes inorder traversal easy with space complexity-o(1),1, 11216,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,preorder easy ho jatra hain,1, 11217,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11218,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Threaded binary tree helps in quicker implementaion of inorder traversal.,1, 11219,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"Threaded binary trees offer faster in-order traversal, reduced memory usage, and simplified navigation with direct links to predecessor and successor nodes.",2, 11220,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,inorder traversal in o(n) and no space in constant space,1, 11221,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,less pointers,1, 11222,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11223,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11224,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Easy Traversals,0, 11225,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11226,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,its leaf nodes are looped,1, 11227,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11228,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we can get elements in ascending order if we use inorder traversal,1, 11229,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it has ,0, 11230,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"A Threaded Binary Tree is a Binary Tree where all left child pointers are NULL points to its in-order predecessor, and all right child pointers are NULLpoints to its in-order successor.",2, 11231,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,is has both elemnt before uit and after it,1, 11232,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11233,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it does not have any null tree nodes,1, 11234,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11235,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11236,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,leaf node connected root less time travetrsal,1, 11237,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,here node points level wise and there is benefit in the time complexity of operations in threaded binary tree,, 11238,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11239,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Easy to use.,0, 11240,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11241,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it is easier to trraverse in a tree as the forward and backward both are linked to the other nodes according to the inorder,2, 11242,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11243,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11244,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",2, 11245,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11246,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11247,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11248,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11249,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it makes inorder traversal faster.,1, 11250,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it saves space consumed by Null pointers of leaf node and it helps in faster traversal,2, 11251,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,Space Complexity is O(1) no need to take extra space/memory,1, 11252,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we dont need to re traverse previous nodes; less time comlexity,2, 11253,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,traversal is easy and takes less time ,1, 11254,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,IT REDUCES NULLS IN A TREE,1, 11255,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no need of stack and recursion ,2, 11256,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,in order to return to prev node using inorder successor and reduce time,2, 11257,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11258,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"no need to store all nodes, accessed easily",2, 11259,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it allows reverse traversal and time complexity less,2, 11260,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11261,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,it reduces nulls in a tree,2, 11262,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11263,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11264,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,less time and space for traversal,2, 11265,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.," It eliminates the use of stack as it perform linear traversal, so save memory. For a given node, we can easily find inorder predecessor and successor. So, searching is much more easier. In threaded binary tree there is no NULL pointer present.",2, 11266,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,traversal in O(n),0, 11267,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,HELPS IN INORDER TRAVERSAL,0, 11268,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,faster inorder traversal and without recursion,0, 11269,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion., A threaded binary tree is a binary tree in which every node has either one or two threads. A thread is a link to the inorder successor or predecessor of a node,2, 11270,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11271,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,The idea of threaded binary trees is to make inorder traversal faster and do it without stack and without recursion,0, 11272,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"A threaded binary tree is a binary tree data structure in which every node is augmented with additional pointers called threads. These threads help establish logical links to other nodes, making it easier to navigate the tree efficiently. Threaded binary trees offer several advantages over traditional binary trees:",3, 11273,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11274,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11275,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11276,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"eliminates the use of stack as it perform linear traversal, so save memory.",3, 11277,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11278,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,threaded binary tree use all null pointers efficiently.,1, 11279,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,is defined easily as because of the thread so the left node and right node,2, 11280,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11281,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,recurssive call is not needed for traversal,1, 11282,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no stack or recurrsion required ,1, 11283,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,save time for inorder treaversal ,1, 11284,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,LINEAR INORDER TRAVERSAL POSSSIBLE,1, 11285,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,no wastage of memory,1, 11286,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11287,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11288,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"It eliminates the use of stack as it perform linear traversal, so save memory.",1.5, 11289,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11290,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,THE NULL POINTERS CAN BE USED TO POINT TO THE INORDER SUCCESSOR OR PREDECESSOR THUS EFFICIENT US EOF MEMORY. FASTER TRAVERSAL,3, 11291,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we can access elements through thread so instead of pointing to NULL the leaf nodes point to the predecessor or successor,2, 11292,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11293,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,attached to the parent,1.5, 11294,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",3, 11295,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,leaf points to inoprder successor and predecessor,3, 11296,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,The null pointers are made to point to some data node so that memory is not wasted.,3, 11297,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"IT DOES NOT GO BACK FROM WHERE NODE IUT CA,ME",2, 11298,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,save time in traversal as empty nodes connect to its inorder succesor,2, 11299,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,we can travel iteratively to print the tree in inorder way.,2.5, 11300,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,traversal is easy since inorder successor is directly pointed,2, 11301,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,fast inserytion,1.5, 11302,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,"No need for stacks or recursion: Unlike binary trees, threaded binary trees do not require a stack or recursion for their traversal. Optimal memory usage: Another advantage of threaded binary tree data structure is that it decreases memory wastage.",2, 11303,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,,0, 11304,Write the advantages of a threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back. But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes. This helps us to traverse further or backward in the in order traversal fashion.,roots nodes are connected to its inorder successor,1.5, 11305,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to verify/test the efficiency of an algorithm as there are multiple ways/algorithms to solve the same problem/issue.,2.5, 11306,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis to determine the complexity of an algorithm. some algorithm takes complexity of O(n) while some are of the order of O(logn) and some are of exponential time complexity so to determine time complexity and analysis time we need to analyze algorithm,2.5, 11307,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis so we can analysis time complexity of different algorithms and compare them with each other and use the algorithm whos complexity is less than others,2.5, 11308,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis for finding the best function to perform a particular task. This is done by finding an algorithm that takes the least time complexity as well as least auxiliary space(space Complexity). Though many algorithm work equally efficiently for smaller datasets, but the best algorithm is found when it runs the most efficiently for very large amount of data. ",2.5, 11309,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We require algorithm analysis so that we can analyze the efficiency of any particular algorithm. There are many ways to solve any given problem, but we want to consider the best possible algorithm that is time efficient and memory efficient.",2.5, 11310,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","Algorithm analysis is used to find the time complexity and space complexity of a particular algorithm. \nWe analyze all the cases of algorithm like best, worst and average cases.",2.5, 11311,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",,0, 11312,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We do algorithm analysis to check the time and space complexity of the algorithm and to reduce the time and space complexity of the algorithm so that the algorithm can be implemented in less time and more efficiently.,2.5, 11313,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis because there are many complex operations which when done with normal methods will take forever to complete and very large space. Algorithm analysis is needed to save time and space for such complex operations. ,2.5, 11314,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis to understand the program efficiently and compute the code by solving the program step by step,2.5, 11315,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis to study the problem and to give a best or perfect solution of it by using least time complexity and space complexity so that the problem can be solved efficiently and correctly .,2.5, 11316,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is needed to get the better understanding of the algorithms or to get the use and optimized solution for any problem that can reduce the time and space complexity.,2.5, 11317,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We use algorithm analysis for analyzing different problems and programs to run . And to identify new various method and solutions.,2.5, 11318,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis in order to judge the space and time complexity of an algorithm to function. The lesser the amount of time and space taken the better and more efficient the algorithm is in solving complex problems.,2.5, 11319,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",algorithm analysis is done to know the time and space complexity for a program so that a task can be done most efficiently.,2.5, 11320,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To analise the efficiency of algorithm.\n- To compute Space and Time complexity.\n- Check whether algorithm solve actual problem or not.,2.5, 11321,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis helps us approximately calculate the time and space complexity of our algorithm.\nSince running algorithms at a large scale includes high costs...\nso algorithm analysis helps us to optimize the algorithm to lower the actual running costs.,2.5, 11322,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis because on industrial or big scale we always require a code whose time and space complexity are minimum. Hence, algorithm analysis helps us in calculating the space and time complexity.",2.5, 11323,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","1. In order to analysis the time complexity the efficient time algorithm will take to complete ,space complexity (created due to creation of arrays ,variables) of the algorithm.\n2. To detect which is the best suited algorithm which covers all the worst cases, edges cases of the algorithms.\n3.is also helps to eliminate Time limit Exceeded of the algorithm.\n4. symptotic and asymptotic analysis can be made. ",2.5, 11324,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis to understand the code deeply and to know how the code actually functions.\nAlso algorithm analysis helps us to find the time complexity of the algorithm and thus without actually having to implement the code on the compiler, we can get the approximate time in which the algorithm will produce the output.\nAlgorithm analysis also helps us to find the space complexity and helps us to realize which algorithm best suits the question.",2.5, 11325,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to improve the efficiency of the program by reducing time and space complexities and also to find out ant problems and deficiencies in the program. Algorithm analysis helps us in overcoming all the underlying factors and understand the program better.,2.5, 11326,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm Analysis is related to improving the efficiency of a program by reducing the time complexities as well as the space complexities . Also algorithm analysis is used to find out any problems or deficiencies in the program.,2.5, 11327,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","Algorithm Analysis is needed to know the complexities ,the optimisation ,the approach,CPU processing and the way the program can be solved in different techniques using different methods.\n",2.5, 11328,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis because there are multiple solutions to a problem and we need to identify the best solution according to given resources (like time and space available).\n,2.5, 11329,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",For better solution and to know the Time complexity of algorithm .,2.5, 11330,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To find the time and space taken by an algorithm so that we can find the most optimal solution for real-life problems.,2.5, 11331,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To find optimal solutions to problems in the least time and space so that a program runs efficiently. ,2.5, 11332,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To find an optimal solution to a given problem and analyze the time and space complexity which further gives us an idea which algorithm is better for a particular problem.,2.5, 11333,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to analyze the algorithm to find that is the algorithm optimal and efficient for the given condition. As we know that different algorithm is suitable for different problem and analysis of the algorithm tell us the time complexity space complexity for better analysis.,2.5, 11334,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis to find a better solution to solve a problem in terms of time complexity and space complexity: to solve a problem faster and by using minimum memory space possible.,2.5, 11335,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis to break the problem into smaller subparts and to minimize the complexity of time and space .it gives the optimal solution in the specified condition.,2.5, 11336,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis to solve given problem in minimum time and with less space requirement. we always try to solve problem in efficient way so that our output should be fast. for this we have to look after a given problem in many ways. suppose we solve any problem in n^2 then we try to solve the same problem in lesser time. for that we need different algorithm.,2.5, 11337,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","we need to do algorithm analysis to check whether a algorithm is effective or not for a given problem and to know that algorithm is a time efficient, and to know how much space a given algorithm is going to take .",2.5, 11338,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We do algorithm analysis to find the process that give us the solution is the best time complexity and space complexity .The lower the time and space complexity the better the solution will be this is the reason to do algorithm analysis.,2.5, 11339,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need to do Algorithm analysis \n1. to identify in which time complexity we can solve the problem. Basically we solve the program with that algorithm which takes less time or whose time complexity is less than all the other approaches or method by which that problem can be solved. \n2. To classify or standardize some problems that this problem can be specifically can be done by this method .\nFor ex; a. whenever there is a sparse matrix we apply Kruskal's Algorithm\n b. to find shortest path with multiple source we apply Ford Fulkerson Algorithm\n c. to find shortest path with single source we apply Dijkstra's Algorithm , etc. \n ",2.5, 11340,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis helps us to analyze the program's complexity. Using which we can optimize the program for less time and space complexity. Which will make the program run faster than before or use less space than before.,2.5, 11341,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis so that we can know which how algorithm can be optimized further and we can know its time and space complexity.,2.5, 11342,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to make the processes easier and to make these processes to work in a proper way. It also defines the Time and Space complexity of a program which shows that how much time and space the program can take . So according to it we decide that what kind of algorithm should be used in it.,2.5, 11343,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",The need to do algorithm analysis is to decrease the time complexity for solving a particular problem. Algorithm analysis decreases time and space complexity of a program which heals the system to complete the program efficiently.,2.5, 11344,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To solve the problem correctly and accurately by taking the less time and space. For choosing the best possible algorithm for solving the problem.,2.5, 11345,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to analyze algorithms to check the time and space taken by it to solve the problem and to improve it.,2.5, 11346,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to find out the appropriate and most efficient method to solve a problem with respect to time and space consumed.,2.5, 11347,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","Algorithm helps us to solve the problems more efficiently and quickly. It helps us cover all the use cases of the problem and eventually coming up with the best of best of solution. It saves our time, resources, and energy and also helps us achieve efficiency.",2.5, 11348,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm Analysis is necessary to understand the working of an algorithm and learn about its time and space complexity. To identify which algorithm gives an optimal solution in less time. To differentiate between two algorithms used to find out the same thing and find which one of them is more efficient. ,2.5, 11349,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","For the efficiency of doing a task according to different characteristics, we need to do algorithm analysis.",2.5, 11350,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis to check that the algorithm which we are defining or structuring for a particular problem is not using excessive space to perform a simple task or not taking excessive time to work. Through analyzing various algorithm, we can find the best solution to the problem. ",2.5, 11351,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis in order to compare the different algorithms used to solve a particular problem based on their time complexity and spce complexity.,2.5, 11352,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis so as to make the program more optimum in respect of time and space complexity. ,2.5, 11353,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis in order to understand the time complexity of our codes in order to make our applications run faster, and be more optamised",2.5, 11354,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis because to find out the time complexity and space complexity of the particular algorithm. Also to find out that the algorithm gives correct solution.,2.5, 11355,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is required so that we can check whether the algorithm we designed is efficient one or not. It is required to keep a track of time complexity as well as space complexity so that the algorithm is designed within the time frame and space given by the user along with desired inputs and outputs.\nEx: If the user has asked to solve the problem in time O(log n) then we need to check for the loops and other things to see whether it is in that time or not. This can only be done if we analysis our designed or used algorithm.,2.5, 11356,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Need for algorithm analysis is used to check if algorithm is efficient or not. Algorithm should be time and space effecient.,2.5, 11357,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.", To discover its characteristics in order to evaluate its suitability for various applications or compare it with other algorithms for the same application.,2.5, 11358,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis for understanding how each algorithm differs with respect to space and time as we have to calculate each algorithms time complexity and space complexity and compare them accordingly by calculating the average time complexity and worst case .,2.5, 11359,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis so that we can save time and memory by developing a faster and efficient code that does the operation in least time and uses less resources.,2.5, 11360,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to compare different algorithms and decide which one is more optimal and useful than the other.,2.5, 11361,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","for a particular problem statement we can get various approaches to reach the solution but to get the optimized and perfectly elastic solution we analysis,",2.5, 11362,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis to get the optimal solution. We make sure that the algorithm we use gives complete solution and also keeping in mind the time and space complexity. ,2.5, 11363,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis to choose the optimal method according to our needs. Whether we need less time, less space, we can get an understanding of all the parameters using algorithm analysis",2.5, 11364,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",1)to find time complexity\n2)to find space complexity,2.5, 11365,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",to find most efficient algorithm that uses least resources and takes less time ,2.5, 11366,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis to get the efficient code so that it takes minimum time, space and easy to understand with the most efficient use to us",2.5, 11367,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",When we large of data and we want to perform the operation then we need to analysis and understand which type of algorithms will work that set of data and perform our operation faster.\n,2.5, 11368,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis to obtain optimal space and time complexity.,2.5, 11369,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis to find out that how much time a algorithm is going to take to get processed completely whether in its best, average or worst case and compare between different algorithms to find out which one is best .",2.5, 11370,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is very important in case we have insufficient and lacking algorithms. We need to analyze the algorithms to come up with optimal solutions and check for use of any such lacking algorithm.,2.5, 11371,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need to do algorithm analysis for finding the algorithm i.e efficient, save time and space complexity ",2.5, 11372,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",\nPredict the behavior of an algorithm without implementing it on a specific.\nIt is not possible the prdict the behaviour of the algorithm.\nTo solve a complex problems with the help of the algorithm .,2.5, 11373,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis for a efficient a program which would take less space and work in the fastest time possible .,2.5, 11374,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Different Algorithms use different times and take up different amounts of space to solve the same problem. Some algorithms take more time to solve a particular problem than others. The objective of algorithm analysis is to find the optimal algorithm for a particular problem or set of problems that solves it in the least amount of time and takes the least amount of space possible.,2.5, 11375,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","Algorithm analysis tells us about the algorithm's efficiency, its space usage, etc. This helps us to compare the algorithms and choose the best one depending upon the case.",2.5, 11376,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",to make the programs more efficient and fast for the end user. it should provide as seemless experience as possble.\n,2.5, 11377,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis so that we can optimally use the resources of the system and can carry out the operations in an efficient way.,2.5, 11378,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","Algorithm analysis is necessary for a code because every problem has different kinds of solutions, and each solution has it own specialities\nby doing this analysis we get to know that which solution to the problem suits best to what we desire as a result.",2.5, 11379,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to find the optimum solution of a problem which has least time and space complexity.,2.5, 11380,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is one of the important aspect to judge the specific algo with others to choose the best suited one.\nNow this include majorly few things first major aspect is the time complexity and the other one is the space complexity . ,2.5, 11381,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis to see the time/space complexity i.e., the amount of time or space an algorithm is going to take. It is essential to determine this so that we can use the most optimal algorithm.",2.5, 11382,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis to find the least time complexity so that we can write an efficient code to solve a particular problem. We can also find the comapre two alogrithms before even running it on the compiler,2.5, 11383,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To predict the behavior of an algorithm without implementing it on a specific computer. It is much more easier to have simple measures for the efficiency of an algorithm than to implement the algorithm and test the efficiency every time a certain parameter is passed.,2.5, 11384,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","because some algorithms may be correct but take a lot of time or space. this also could end up in failure of the code. to avoid this, we analyze algorithms to make sure to run efficient algorithms only",2.5, 11385,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",algorithm analalysis is helpfull in case of where we want greedy answer or faster answer in lessder timew or..we want optiumal solution of various problems ,2.5, 11386,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","In order to find the best possible algorithm/solution that keeps in mind for the time and space complexity for a given problem, we need to do algorithm analysis.\n",2.5, 11387,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To check the efficiency as efficient algorithm can directly affect system performance.It might take more time or more space than the required time and space which might lead to more hardware which wont be cost efficient too or it can lead to system failure too,2.5, 11388,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis to understand and implement algorithms in a better and improved way and suggest the necessary changes required.,2.5, 11389,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do algorithm analysis so that our proposed algorithm would work more efficiently on the basis of space and time,2.5, 11390,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to analyse algorithm to frame a suitable working complied running code which throws no error,2.5, 11391,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",to learn about it's space and time complexity and use memory space efficiently and improve program's performance.,2.5, 11392,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm is the basic implementation of the code.\nAlgorithm Analysis is needed because it makes easier for programmer to code if we have develop a algorithm or the basic implementation for the required output.,2.5, 11393,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Because the accidental use of an inefficient algorithm can significantly impact system performance.,2.5, 11394,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis provide theoretical estimation for required resources of an algorithm to solve.,2.5, 11395,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis to solve our problem more efficiently and optimally. It reduces the error and helps to reach our goal within required time complexity. ,2.5, 11396,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do Algorithm Analysis to analyze the time and space complexities of a program. The lesser the time and space complexities the better the program works.,2.5, 11397,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",For getting optimal analysis of the algorithm for getting better time and space complexity.,2.5, 11398,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Because when we attempt to solve a particular type of problems all of then use same type of conditions so we make a algorithm to make it easier to understand a type of approach to a question. ,2.5, 11399,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need a algorithm analysis to efficiently perform and find a optimized solution in terms of time and space.,2.5, 11400,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","Algorithm analysis is required to compute the efficiency of any algorithm in its best case, worst case or average case. This also gives us an idea about which algorithm is best suited for performing a particular task.",2.5, 11401,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",algorithm analysis is basically steps which we write after looking into the problem\nthrough the step wise description it become better to understand and deal with the problem,2.5, 11402,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis to find the efficient algorithm for a particular set of problems, that would satisfy the required time and space complexities.",2.5, 11403,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis so that we get the information about the time and space complexity so that we can reduce this and make better algorithms,2.5, 11404,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To analyze the time and space complexity of an algorithm to optimize them and make them efficient so that they run faster and with fewer resources.,2.5, 11405,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","To know how much work our program is doing without algorithm and \nto make it efficient using different algorithms to reduce the work,\nto make our program optimal and in better time complexity and space analysis.",2.5, 11406,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithms Analysis is important because there are various algorithms for a problem\n and to differentiate when one is faster(time) and require less memory(space),2.5, 11407,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","when we need a code which is well structured , easy to understand with a better time and space complexity , algorithmic codes comes handy to us. we analyze so as to interpret what the code is trying to tell us , there are plenty of algorithms which has numerous applications , in order to understand all this , we need to analyze the algorithm. ",2.5, 11408,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis because the accidential or unintentional use of an inefficient algorithm can significantly impact system performance. It gives the best efficient solution which takes less time and less space.,2.5, 11409,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",so that we can have information related to time taking space taking of an algorithm...so that we can use particular algorithm as per our need.,2.5, 11410,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",algorithm analysis is need to get the time and space complexity of the algorithm .,2.5, 11411,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","To check for the time complexity, and space complexity we do algorithm analysis. We need algorithm to solve the problem in lesser time and the code should be memory efficient.",2.5, 11412,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to understand the working and functionality of a particular algorithm. We can understand the time and space complexities by analysing the algoritm.,2.5, 11413,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do algorithm analysis because it helps us to understand which algorithm is better and more efficient.,2.5, 11414,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to optimize our algorithm to find the solution with best time and space complexity ,2.5, 11415,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis to find out the best possible solution for a problem. Best possible solution would be with least time and space complexity. ,2.5, 11416,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to analyse algorithms for the better performance of the code logic.it is necessary for optimizing the algorithms and comparing two different algorithms and for improving efficiency of code.,2.5, 11417,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm Analysis is an essential habit while coding as it allows solving of a problem with a critically well-optimized code. ,2.5, 11418,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to compare the run time and space occupied of two different approaches to solve the same problem so that we can choose the better algorithm.,2.5, 11419,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",In order to get an idea about the time and space used by the algorithm and further optimize the algorithm.,2.5, 11420,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","it's essential as the unintentional use of an inefficiency in algo can impact system performance ,In time sensitive code algo taking too long to run useless. ",2.5, 11421,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is needed to compute the complexities of a given segment of code so that a problem could be solved using the best algorithm possible.,2.5, 11422,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","Algorithm analysis is necessary because it helps in analyzing the the time taken and the space occupied by the program .After analyzing we can optimize the code to ensure that the same work is done faster and occupy less space, which helps in cost cutting for an organization.",2.5, 11423,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to determine given an input size the time it takes to execute the program (time complexity) and the space it consumes to executes (Space complexity).\nAlgorithm analysis helps us to compare different algorithms and their space and time complexity.,2.5, 11424,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","The analysis of algorithms tells the some interesting thing about the algorithms in terms of performance. If we analyze the performance of the algorithm then we can say that the algorithm user friendliness, modularity, security, maintainability, etc. And also we can predict the speed and problem solving capability of algorithm.\n",2.5, 11425,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","Algorithm analysis is important to analyze the algorithms in terms of their working, time complexity and space complexity. There are many algorithms, so to choose where to use which algorithm, we have to analyze their working and complexities.",2, 11426,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","Algorithm analysis is necessary in order to choose the most appropriate algorithm according to the problem. Analysis of algorithm is done on the basis of time complexity, space complexity etc.",2.5, 11427,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis to do space optmization , to see that different algorithm time complexities and to compare which one is the best",2.5, 11428,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis to understand the time and space complexities of an algorithm so that we can find the efficiency of a given algorithm.,2.5, 11429,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","we need to do algorithm analysis to check the time and space complexity of an algorithm, which will help to optimization of any code for better performance.",2.5, 11430,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do the algorithm analysis because :\n1. To predict the behaviour of an algorithm without applying it on specific computer.\n2. It is so much convinient to have simple measures for the efficiency of an algorithm than to implement the algorithm and test its efficiency. ,2.5, 11431,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithmic analysis provide us a way to optimize the techniques used to solve problems on the basis of time spent and space leveraged to solve that problem particulary called time and space complexity. It fastens the process which can be seen effective on a large scale application.\n,2.5, 11432,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is required to analyze the time complexity and space complexity of different algorithms which are designed to perform a particular task so that we can analyze and compare them to find the most efficient algorithm with minimum cost(space and time) which will eventually makes the code more efficient.,2.5, 11433,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis because algorithm takes time and space so we need to check weather the algorithm take long time or small time .Better the time complexity better is the algorithm as well as better the space complexity better the algorithm.,2.5, 11434,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is needed to identify the time complexity and auxiliary space spent by the algo. Hence by analysis we can make an efficient algorithm.,2.5, 11435,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to-\n1.) Take in account the time and space required to process with the current algorithms\n2.) Compare the two different algorithms and realize the importance to use one of them\n ,2.5, 11436,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",,2.5, 11437,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","To find the optimum solution using a particular algorithm in a certain time, so to solve and find the best possible solution in best possible time.",2.5, 11438,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To predict the behavior of an algorithm without implementing it on a specific computer.\nIt is much more convenient to have simple measures for the efficiency of an algorithm than to implement the algorithm and test the efficiency every time a certain parameter in the underlying computer system changes.,2, 11439,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to use algorithm analysis to find the solution briefly and in less space and less time,2.5, 11440,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis to conclude whether it is an efficient algorithm or not and if it will get the job done in the available time and space. We also analyse it so that we can find the shortcomings of the algo and improve it by reducing computations wherever possible.,2.5, 11441,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis helps to find how much time and space an algorithm will consume to run the program so based on this we choose better algorithm whose time and space complexity will be less and will do the same work in minimum space and time.,2.5, 11442,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to check the running time and space used in the code inorder to understand the working of the code,2.5, 11443,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis to reduce time and space taken to implement an algorithm or to do it more optimally.,2.5, 11444,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do algorithm analysis to compute how much time the algorithm takes in execution and how much space it occupies in memory,2.5, 11445,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",algorithm analysis is required to form the most optimized solution to the problem in order to achieve best possible space and time complexity of the solution.,2, 11446,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",to effectively run our program in optimum way by requiring less time and space utilisation.,2.5, 11447,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",algorithm analysis is needed to know the space and time complexity of that algorithm and to compare between algorithms to find out which algorithm is better and more efficient . ,2.5, 11448,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","An algorithm is a list of steps to perform a particular task. When solving problem that require mathematics or some particular logic then it is important that we make sure the that process does not use a lot of space on the system and a lot of time. Every algorithm we create has a time complexity and a space complexity that help the user decide or approximate how much time the algo will take. In order to make the systems more efficient, solve problem quicker all the while using less amount of space we need to do algorithm analysis.",2.5, 11449,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithmic analysis because accidental and unintentional use of inefficient algorithm can significantly impact system performance.,2.5, 11450,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis because an algorithm gives us the exact idea about what we are going to do in our program or we can say that what is the approach of solving the problem .,2.5, 11451,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To know how the algorithm is working and to compare between more algorithms on basis of various parameters like time and space complexity.,2.5, 11452,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We perform algorithm analysis before we write the code in order to analyise the particular steps required in order to solve the particular question and make them more efficient in terms of complexities ,both time and space.",2.5, 11453,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",algorithm analysis helps in realizing the time taken and space utilized while obtaining a solution to a problem so as to reach the maximum level of optimization while solving a particular problem.,2.5, 11454,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis to get the most optimized solution of a problem to achieve best possible time complexity and space complexity.,2.5, 11455,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To analysis the behaviour of that algorithm with large inputs. As we want to identify how much time and space our algorithm will take when it is given large inputs.,2, 11456,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to fnd out which way of solving a particular problem is better.,2.5, 11457,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis so that we can find the best algorithm with minimum time and space complexity. Then further make the whole code using the algorithm.,2.5, 11458,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","As we know that we can write brute force approach for any question but this will consume a lot of memory and space. But we know that in real world scenerios, the memory and space are very costly and hence we need to do algorithm analysis. By doing algorithm analysis, we can find the time and space complexity of the given algorithm, also it become very easy for us to find how our algorithm will work in worst case and average case and hence it will become very easy to compare any two algorithm on the bases of space and time. And hence we can opt the best algorithm according to the requirement of real world. For example, We know that we have different type of string matching algorithm, So if our memory is not costly then we can use suffix tree approach and if the memory is costly then we can use another algorithm like rabin karp, naive string matching algorithm etc. So it become possible only due to the complexity analysis that we choose the best algorithm.\n\n",2, 11459,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis to measure various parameters about the algorithm like time complexity or space complexity so that we can compare different algorithms to choose a better one if possible. ,2.5, 11460,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis for calculating the efficiency of a program and how much space and time it will accquire.,2.5, 11461,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do algorithm analysis to find the solution by most efficient way in terms of time complexity and space .,2.5, 11462,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is necessary because using and inefficient algorithm can make our system slower and outdated. ,2.5, 11463,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to bring efficiency in our code. We also use it for resource management. Algorithm analysis is used to find the most efficient way of doing a task which is assigned to us which is by reducing the time taken by a code to give output. It also reduces the memory bits taken by a code. ,2.5, 11464,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","Algorithm analysis is required to solve a problem efficiently, using proper steps to save time and space.\nUse of a proper algorithm enables us to give up-to-date solutions to a problem.",2, 11465,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",because the accidental use of the algorithm can result in change in the system perfomence either in a good manner or bad.\n,2, 11466,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To see effectiveness of the algorithm and how much time or space it uses. This helps us see the tradeoff and decide which algorithm we should choose to solve a particular problem. Other parameters like hardware can affect the working of the code as well. ,2.5, 11467,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis to guess how an algorithm will behave without actually implementing it on the system . Also , by analyzing different algorithms, we can compare them to determine the best algorithm needed.",2.5, 11468,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",algorithm analysis is as it helps programmer which algorithm is most efficient and best suited for a required problem. it also helps in reducing computation time.,2, 11469,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis because it provides theoretical estimation for the required resources of an algorithm to solve a specific computational problem. ,2.5, 11470,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",The analysis of Algorithms improves the efficiency of the program and states the time and space complexity of the code.,2.5, 11471,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is important in calculating complexity theory that provides accurate result for a particular problem to solve a particular logical problem .therefore analysis is required to calculate how efficient it is in terms of time and space by calculating time and space complexity.,2, 11472,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",algorithm analysis is to be done because we need to find the best solution to our problem so that it can be solved fast and effectively without taking much space on the user's system or any much of his valuable time ,2, 11473,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","the use of algorithm analysis helps us in minimizing the time and to understand the it better and to understand and perform suggested improvements, it also helps in maintaining a good time complexity by which our system and our code can work efficiently together",2, 11474,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need Algrithm analysis to make the codes more efficient and easy to umderstand.It helps in simplification the learning of the codes.,2.5, 11475,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","we need to do algorithm analysis because we need to know the behavior of the program before we implement it to a computer, since it is very hard to predict the behavior of algorithms.",2, 11476,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm to find any solution briefly and less spacing with less timing.,2.5, 11477,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",algorithm analysis is important because inefficient use of sufficient algorithm can affect system performance. It can cause or affect the complexity or performance of the system.,2, 11478,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","to determine the efficiency of an algorithm, that is how much time and space does and algorithm take in its operation",2, 11479,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need it to find out time complexities of different algorithms to see which one gives the solution in the lowest amount of time,2, 11480,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to find wether the algorithm actually helps in solving the problem in most efficient way.,2.5, 11481,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis to study how much time and space required algorithm performs the task associated . It helps us analyse how effective is a particular algorithm when it comes to best case , average case or worst cases of a particular problem.",2.5, 11482,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is an key part of complexity theory which provides theoretical knowledge for the required resources of an algorithm to solve a specific logical problem.,2, 11483,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",the analysis of algorithm helps us to unterstand it in a more better way and also help us to make it more improved i.e. making your program more faster and efficient,2, 11484,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do analysis to find out how efficient the algo is how much time and space it is taking so that we can compare the different algos in terms of space and time.,2, 11485,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is required so that that user can completely understand the program and identify all the base cases which are applied in the code.\nProgrammer can also find the time complexity of the program by doing the algorithm analysis.\n,2, 11486,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","we need algorithm analysis to run the given question's program in better way, better time complexity and better space complexity.",2.5, 11487,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to analyze algorithms in order to find the best possible algorithm suited for our problem without actually having to implement it on the computer. Having certain measures to analyze the algorithm saves considerable time than implementing the algorithm everytime a system variable changes.,2, 11488,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis to know the running time complexity of the code as it is a vital factor when the size of the input is very large and also to know about the space it occupies\nto execute the code.,2.5, 11489,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis because of following points\nTo understand use of which data structure is used in that algorithm.\nTo understand its time complexity and memory required \nTo further optimize the algorithm ,2.5, 11490,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis because it helps to get knowledge of time and space complexity ,2.5, 11491,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to evaluate how an algorithm functions and how optimized an algorithm is to solve any given problem and the use appropriate data structure and algorithm gives us the most efficient space complexity and Time complexity which is possible for any algorithm as such.,2.5, 11492,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","Algorithm analysis is important in practice because the accidental or unintentional use of an inefficient algorithm can significantly impact system performance. In time-sensitive applications, an algorithm taking too long to run can render its results outdated or useless.\n",2, 11493,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","Analyzing various algorithms helps us in understanding and building the efficient and optimum solution to the problem statement. It helps us in understanding the uses of data structures, how we can utilize them to solve the questions. The time complexity and space complexity can be compared to understand the versatility of our code.",2, 11494,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is now days very important to solve a particular problem in very efficient time and space.\nEvery problem can be solve through many algorithms/methods but we can get the most efficient solution by only analyzing the different algorithms. ,2, 11495,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis to find the time/space taken by the algorithm, to find what can be done to improve complexities and to propose a alternative better solution in future. ",2.5, 11496,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algotrithm analysis to check which is the best suited algorithm for the given problem.Since,every problem is different,has different constraints and requirements,different data structures are required for each and to figure out which will be the best suited for the given problem,we need algorithm analysis.We also need to check which approach has the least time and space complexity so as to produce the most optimal result.",2.5, 11497,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is required to analyze the space and time complexity of an algorithm and to understand the logic so that we can check if any better solution can be there or not.,2, 11498,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We do algorithm analysis to compare algorithms and chose the one which is the lightest on any software or hardware. This ensures compatibility and optimization for as many devices by reducing the complexity to run the algorithm (time complexity and/or space complexity).,1.5, 11499,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do algorithm analysis to know how much space and time it will be using is it a efficient one or not,1.5, 11500,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",to verify if a optimal solution is there to do the question,2, 11501,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","we need algorithm analysis to ensure that the algorithm we have gives the best optimal solution , with best time and space complexity. Algorithm analysis also tells the cases in which an algorithm fails and how to solve that case. Once the correct algorithm is obtained the code can be written easily.",2, 11502,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",to find its time and space complexity.,2, 11503,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis in order to calculate the time and space requirements of the code/algorithm we are using.,2, 11504,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","we need algorithmic analysis to find a solution which occupies least space as well as having least running time complexity(both time and space optimsed solution),depending upon the problem,to deal with it and provide an effective solution.",2.5, 11505,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We do algorithm analysis to search for the best possible solution to a problem, to optimize a solution, We can find least run time (time complexity min)",2.5, 11506,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis because we have to find most effecient solution for a problem we will take less time and space.,2.5, 11507,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we use algorith for making problem easy and less time to doing it.,1.5, 11508,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","to find out the algorithms that are more efficient in terms of the occupied space and running time (considering, multiple solutions are available for the same problem).",2.5, 11509,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","Every algorithm take certain amount of time, hence algorithm analysis is important to check whether a certain algorithm can be performed in less time or not. \nMore than time we also want to check and reduce the space complexity of the algorithm. Hence to make an algorithm works efficiently we want to reduce the time and space complexity.",2.5, 11510,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To obtain most optimized solution for a given problem,2.5, 11511,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",To obtain the most optimal solution for a problem which is most time efficient and space efficient.,2.5, 11512,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do Algorithm Analysis because it helps us to know how efficient our program is if we do analysis of our algorithm it may help us to generate efficient time and space complexity for our program ,2.5, 11513,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do algorithm analysis because accidental use of insufficient or wrong algorithm can effect the system,2.5, 11514,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to make our code efficient and less time consuming. There are different ways to achieve a particular end result but certain defined algorithms make them more efficient and provide better end user experience.,2.5, 11515,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis in order to optimize the code in terms of its time complexity and space complexity so that the algorithm runs in a more efficient way.,1.5, 11516,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","we need algorithm analysis so that we can check the utility of an algorithm in a particular problem, that how much is it useful. these are done by analysing the space and time complexity of the algorithm",2.5, 11517,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis to know the efficiency of the algorithm on the basis of different parameters such as time and space. this analysis is used to compare different algorithm and see which algorithm is best suited for the given task and its requirement. ,2.5, 11518,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis to understand the proper functioning of the program we intend to develop. Algorithm analysis also gives the ability to use the most efficient algorithm keeping the desired requirements intact to give best system performance.,2.5, 11519,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis defines how efficient an algorithm or the program is. It describes the least and max time and space taken by the program. ,2.5, 11520,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","we need algorithm to make our code very efficent and also take less timing ,take less memory in algorithm we can solve one question in many ways .\n",2.5, 11521,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need algorithm analysis so that we can figure out the best and most optimised algorithm to solve our problem. Each algorithm takes certain space(memory) and certain running time. Because we want to complete our work using minimal memory and time, algorithm analysis is essential.",2.5, 11522,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do algorithm analysis to determine the running time and space time complexity of the algorithm,2.5, 11523,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",it is important because the accidental use of an inefficient algorithm can be effect system performance,2.5, 11524,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis to find the best approach to a particular type of problems statements.,2.5, 11525,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis in order to determine the time and space complexity of the algorithm and to know when the algorithm is taking the best time and when it is taking worst.\nIt also tell us how much space we need in order to implement that algorithm.,2.5, 11526,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","To prepare a blueprint before the execution of actual program and to generalize a problem statement , we need to do algorithm analysis.",2.5, 11527,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis because it helps us to understand the process of any algorithm step by step to understand the time complexity of any problem.,2, 11528,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do algorithm analysis because to optimism \n the code and save the runtime time complexity and space in the code,2.5, 11529,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis allows us to create a preview of the working of the algorithm thus determining the time and space complexity beforehand as a rough sketch and also if the algorithm is functioning properly and as desired or not.,2.5, 11530,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algorithm analysis to find there running time complexity and space complexity,2.5, 11531,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis is use to give a basic structure to program or precise the code. ,1, 11532,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do algorithm analysis to know the time and space complexity of algorithm and also find the best way to solve the problem. W analyze the algorithm to find its benefits and drawbacks. of used algorithm.,2.5, 11533,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do analysis of algorithm in order to find efficient solutionn as per given complexity,1.5, 11534,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need algorithm analysis for performing specific task through best algorithm in order to find optimal algorithm we compare and imply changes in specific algorithm to achieve optimal algorithm in terms of space and time complexity.,1, 11535,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we use algorithm analysis so we can shorten the time complexity and space complexity of a particular code. So to save the cost of computing in the future.,1, 11536,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","algorithm analysis is needed to know about the program efficiently and acknowledge the complexity and details about the problem, to provide the solution efficiently. ",1, 11537,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do algorithm analysis in order to practice the coding for program for the given problem,0, 11538,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","We need to do algorithm analysis to get an idea of and determine which algorithm would take the most optimal amount of time and memory space. We do this because , both time and memory are limited in nature and using it efficiently hence becomes important for the developer",2.5, 11539,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",We need to do algorithm analysis to solve the problem statement into sub problems.,0, 11540,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","it is because by algorithm analysis , we will get to know what is the procedure and approach that we have applied to solve particular problem.\nbasically a step by step approach towards given problem.",0.5, 11541,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","we use algorithm analysis to solve multiple set of problem by the methodof travelling salesman problem , coin change etc.",0, 11542,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do algorithm analysis mainly to find out about their time and space complexity.\nspace complexity is the memory/storage used up by the algorithm.\ntime complexity is the time taken by the algorithm to complete.,2.5, 11543,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need algo analysis to optimize the the performance of our system for getting a desirable output.,0, 11544,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",Algorithm analysis helps us keep in track with the time and space efficiency of our code.,1, 11545,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",because analysis is need time min and maxing time optimization's and storage optimization or resource optimization,1.5, 11546,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",find easy method to the problems.,0, 11547,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.","we need algorithms for solving day to day problems like traveling salesman problem ,coinage problem etc and have a better understanding about data structures ",0, 11548,Why we need to do algorithm analysis?,"A problem can be solved in more than one ways. So, many solution algorithms can be derived for a given problem. We analyze available algorithms to find and implement the best suitable algorithm.",we need to do algorithms analysis to determine the appropriate way to deal with the problems given. ,2, 11549,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",We determine the efficiency of an algorithm on the basis of it's time complexity and space complexity.,2.5, 11550,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","BigOh(theta), bigoh(omega), smalloh(theta)\nasymptotic analysis ",1.5, 11551,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","its input should be given , output should be specified ",1.5, 11552,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","There are two basic criteria for algorithm analysis: 1) Time Complexity; 2) Space Complexity. Time complexity measures the amount of time taken by a particular algorithm, whereas space complexity measures the space taken by the data structures used in the algorithm",2.5, 11553,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","We consider time complexity, space complexity and the various data structures that are required with a particular approach. In time complexity we check how the time taken by the algorithm changes with the size of the input data. In space complexity we check how much space is used by the algorithm to store values and how it uses the stack memory. ",2.5, 11554,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","There are criteria for algorithm analysis like time and space.\nWe tried to find algorithm complexity like in best ,worst and average case .\n",2.5, 11555,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",all algorithm must satisfy the following criteria :\n zero or more input values .\none or more output values .\n clear and unambiguous instructions .,1.5, 11556,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria of algorithm is time and space.,2.5, 11557,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria for algorithm analysis is that the algorithm should do the required operation in minimum time and space .,2.5, 11558,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",1. understand and analyze the program carefully\n2. work on how to approach the program in a particular way\n3. find out the data structures which would execute the code in the most efficient way\n4. combine your approach along with the data structures to develop the code,1.5, 11559,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria of given problem is-\n1. study the given problem and to analyze it .\n2.prepare a approach for the given problem.\n3.find the data structure which is most suitable for the given problem.\n4.write your approach .,1.5, 11560,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria's are :-\n1) Time complexity\n2) Space complexity \n3) Optimized solution approach\n4) Optimum answers ,2.5, 11561,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","First is to understand the problem, and generate the basic idea nd solution for it.\nWriting the solution an ideology in statements and then implementing it through code.",1.5, 11562,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",We judge any algorithm based on the amount of time it takes to execute a task and the amount of space it requires to do the same. Thus the TIME and SPACE COMPLEXITY are the two criteria.,2.5, 11563,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",following are the criteria for algorithm analysis:\n-time complexity\n-space complexity,2.5, 11564,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.", Space and Time Complexity.,2.5, 11565,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",1. start by first analyzing the loops since the loops take the maximum time \n2. try to reduce the number of approximations you take\n3. don't leave out any piece of code while analysis\n4. ,2, 11566,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of algorithm analysis are as follows:-\n1. Code must compile and run successfully.\n2. We must know all the basic technical terms and procedure of calculating it.,1.5, 11567,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Algorithms can be detected using the space complexity and time complexity ,whether it covers all the cases in best efficient manner.\nthe shortness of code also helps to reduce cache",2.5, 11568,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria of algorithm analysis are time and space complexity,2.5, 11569,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,0, 11570,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,0, 11571,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","The criteria for algorithm analysis is to check time complexities,space compllexities ,to check the optimisation and the algorithm is meeting the desired condition.",2.5, 11572,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Algorithms that give us the solution in minimum time and acquire minimum space are better for our use. Hence, algorithms with less space and time complexity are considered more useful over those with high time complexity or space complexity. ",2.5, 11573,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Time complexity , space complexity , optimised solution ",2.5, 11574,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Time complexity, Space complexity",2.5, 11575,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The algorithm should ,0, 11576,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",WE need to find an optimal solution to the given problem and use the least time and space to implement our solution. This leads to finding an efficient approach.,2.5, 11577,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",algorithm are analyzed on the bases of : \n1) Time complexity\n2) space complexity\n3) its accuracy \n4) its efficiency.,2.5, 11578,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of algorithm analysis are time complexity and space complexity.,2.5, 11579,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",time complexity\nspace complexity,2.5, 11580,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The basic criteria is :\n1) time complexity\n2) space requirement\n3)time require to provide output (suppose we design an algorithm that is providing output in 2 days then I don't think this is a good algorithm. we always focus on providing output in lesser time ),2.5, 11581,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",algorithm analysis is done on majorly two basis :-\n1) in terms of time :- time complexity.\n2) in terms of space :- space complexity\n ,2.5, 11582,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",time complexity\nspace complexity ,2.5, 11583,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of Algorithm is \n1. Best Time complexity\n2. Space Complexity\n,2.5, 11584,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","The criteria for algorithm analysis is that while analyzing, we should focus on wither reducing the time complexity or the space complexity.",2.5, 11585,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","the criteria of algorithm analysis is its efficiency , time complexity and space complexity.",2.5, 11586,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of Algorithm analysis is Time and Space complexity.,2.5, 11587,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",there are two criteria of algorithm analysis: \n1. Time complexity. \n2. Space complexity,2.5, 11588,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",algorithms are analysed on the basis of space and time complexities. A good algorithm uses less time and space combination.,2.5, 11589,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Algorithms are analyzed by checking time and space complexities. It is in terms of the variables (for example n, where n is the length of the given problem).",2.5, 11590,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","The criteria of Algorithm analysis lies with :\n1) Amount of time required - Few algorithms require constant time while some take exponential time. The prior takes less time , hence more efficient.\n2)Space consumed - Few Algorithms require more space while others take constant space. The latter works more efficiently in comparison as they allow space for other algorithm to work simultaneously accessing the remaining spaces. ",2.5, 11591,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","While analyzing the algorithm, you should take care of the time complexity, efficiency, ",2.5, 11592,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria of Algorithm Analysis:\n- through which do we receive an optimal solution\n- less time and space complexity\n,2.5, 11593,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",There are three different criteria for the algorithm analysis:\n(i)Time basis\n(ii)Space complexity\n(iii)consistency,2.5, 11594,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria for algorithm analysis:\n1. Time complexity\n2. Space complexity,2.5, 11595,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Criteria in order to analyse a Algorithm are as follow:\nTime Complexity, Space complexity.",2.5, 11596,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of algorithm analysis is that the program must be executed within minimum time and space complexity.\nThe program should be most optimum one in respect of time and space complexity.,2.5, 11597,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The basic criteria of algorithm analysis are: time should be minimum\n space should be minimum\n program should achieve the given task,2.5, 11598,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of algorithm analysis is that the time taken should be minimum and space complexity should be minimized.,2.5, 11599,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Algorithm analysis has following criteria: \nIt should be time and space efficient i.e it should be less time and space consuming. \nIt should take a finite input and then generate a finite output.\nIt should not produce infinite output.\nIt should always produce the desired output in a finite amount of time. \nIt should be language independent as well.,2.5, 11600,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Algorithm should take finite time to complete,\nit should take finite space\nit should take finite input from user and\nshould return finite output.",2.5, 11601,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","An algorithm is a finite set of instructions that, if followed, accomplishes a particular task. \nAll algorithms must satisfy the following criteria:\nInput. An algorithm has zero or more inputs, taken from a specified set of objects.\nOutput. An algorithm has one or more outputs, which have a specified relation to the inputs.\nDefiniteness. Each step must be precisely defined; Each instruction is clear and \nunambiguous.\nFiniteness. ",2, 11602,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the algorithm should have zero or more well-defined inputs.,1, 11603,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the criteria of algorithm analysis is time and space complexity. The algorithm having least time and space complexity is fastest and most efficient.,2.5, 11604,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",There are two criteria of algorithm analysis - time complexity and space complexity. Time complexity refers to the amount of the the computations take in an algorithm whereas space complexity refers to the total memory which all the data structures in an algorithm occupies during it's execution.,2.5, 11605,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","getting the optimal solution for a problem where by the solution obtained is optimized in time and space complexities,\nthereafter for some approached like greedy, the solution may or may not be optimized but it is simpler to understand an goes with the flow",2.5, 11606,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Firstly, the algorithm is written to get the solution of a particular problem. Also check if the solution we get is complete and optimal. \nSecond step is to find the time required for each step and then summing them up to find time complexity. \nThird step is to find how much space the algorithm takes to solve and finding the space complexity. \nOn these basis, we analysis if the algorithm is effective or not.",2.5, 11607,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Algorithm analysis include following parameters:\nTime complexity\nSpace complexity\nInplace or not\nStable algorithm or not\netc.,2.5, 11608,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",1)feasibility\n2)optimality,1, 11609,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",resources used and time taken,1.5, 11610,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",There are two of them \none is time analysis and another is data analysis,1.5, 11611,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",There is 2 criteria of algorithm analysis\n1.Time complexity \n2.space complexity ,2.5, 11612,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",algorithms must satisfy the following criteria:\n1. there should be finite input and outputs in a program\n2. the code should be unambiguous\n3. Each step of the algorithm must be feasible,1, 11613,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",AN algorithm should have 0 or more values of input.,1, 11614,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",There are multiple criteria for analyzing an algorithm. We can break down a given algorithm into multiple sub problems and solve the given question (divide and conquer) or find the first possible solution of the same (greedy algorithm). The approach towards a problem and the algorithm used gives rise to need for analysis. ,1, 11615,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","The criteria of algorithm analysis is checking whether it is complete, admissible, minimum time and space complexity.",2.5, 11616,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",All the algorithm have the criteria have satisfy zero or more input values one or more output values clear instructions. Means the value of input is zero or mpore than one.,1, 11617,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",there are two criteria of algorithm analysis \n1) Time complexity- the time it takes for a program to run completely\n2) space complexity - the space a program takes in the system ,2.5, 11618,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The following criteria are used for algorithm analysis: \n1. The time complexity\n2. The space complexity,2.5, 11619,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,0, 11620,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",resources and time taken,2, 11621,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",An algorithm is judged on the basis of its time complexity (time taken to run that algorithm) and space complexity (space occupied by that algorithm)\n\n,2.5, 11622,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",All algorithms must satisfy the following criteria: Zero or more input values. One or more output values. Clear and unambiguous instructions.,1, 11623,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",1. The solution should have least time complexity.\n2. Least space complexity.,2.5, 11624,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Two major criteria are\nTime complexity:\nIn order to judge the speed of the work or job done by the algorithm we need to do analysis of its time complexity.\nSpace complexity:\nIn order to judge the algo over its consumption of its space in terms of variables and data structure space complexity is must.,2.5, 11625,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","there are three types of algorithms on the basis of analysis.\nbest case, average case and worse case algorithms. They are categorized on the basis of time complexity.\n",2, 11626,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the criteria for algorithm analysis are\n1. TIME COMPLEXITY OF THE ALGORITHM\n2.SPACE COMPLEIXTY\n,2.5, 11627,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",All algorithms must satisfy the following criteria: Zero or more input values. One or more output values should be available.,1, 11628,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",time complexity\nspace complexity,2.5, 11629,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",algorithm analysis is getting optimal answer,1, 11630,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",We assume that every statement is completed in O(1) i.e. constant time\n,1.5, 11631,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","time complexity,space complexity",2.5, 11632,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",All algorithms must satisfy the following criteria: \n1. Zero or more input values. \n2. One or more output values.\n3. Clear and unambiguous instructions.,2.5, 11633,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",main criteria of algorithm analysis are space and time complexities that a algorithm would take\n,2.5, 11634,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.", Criteria of algorithm analysis is Time and Space complexity,2.5, 11635,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",space complexity\ntime complexity\nprogram reliability\n\n,2.5, 11636,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Algorithm should be in basic language so that programmer can understand it easily.,1, 11637,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.", zero or more input values and one or more output values are the criteria of algorithms analysis. ,1, 11638,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",All algorithm satisfies following criteria: \nZero or more input values.\nOne or more output values.,1, 11639,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",criteria of algorithm analysis is time and space complexity ,2.5, 11640,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Time and Space,2.5, 11641,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Space , time complexity.",2.5, 11642,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","when making a algorithm there are criteria's like base cases , when there should be inputs,outputs and clears instructions for processing them.",2.5, 11643,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",We analyses algorithm on the basis of recurrence functions it helps to gain knowledge which algorithm is best for the case ,2.5, 11644,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria of algorithm analysis is:-\n1. Time complexity\n2. Space Complexity,2.5, 11645,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the criteria is get a probelm\nlook into the problem\ndivide into parts and find out the ways\nthen quickly merge them out,1, 11646,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of algorithm analysis is:\n1- Time complexity of the algorithm.\n2- Space complexity of the algorithm.,2.5, 11647,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Time And Space,2.5, 11648,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","An algorithm can be analyzed on the basis of the time it takes to solve a problem or the space it takes in the memory stack. It can be seen on the basis of the best case, the worst case and the average run time of an algorithm.",2.5, 11649,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","To get the reccurance relation to know how much time it usually and to make it work in less time complexity, \nspace it takes to run the program, how much memory it uses to run it efficiently\nand to make it optimal, in case of recursion to reduce the stack space it usually\ntakes to run recursive calls, how much code in how many lines and to reduce the work done by it makes it a criteria of analysis.\n",2.5, 11650,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","There are 2 main criteria for algorithm analysis\n->TIME ,, which one algorithms require less time to run i.e less Time is more faster algorithms\n-> MEMORY(space) ,, which one algorithms require less space to run i.e less memory is more faster algorithms",2.5, 11651,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",it should have lesser time complexity \nspace complexity should be minimum\nalgorithm should be well structured and easy to understand.,2.5, 11652,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of algorithm analysis is that zero or more input values and one or more output values.,2.5, 11653,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","on the basis of time complexity(time taken by different operation like loops ,conditionals)\non the basis of space complexity(total number of characters used)",2.5, 11654,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,",", 11655,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",We check for time complexity and space complexity.,2, 11656,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Algorithm analysis is limited because of hardware restriction. We can analyse the time and space complexities of an algorithm.,2, 11657,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria are time complexity and space complexity.,2, 11658,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",We find the optimized solution on the basis of space and time complexity,2, 11659,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria of algorithm analysis are time and space. ,2, 11660,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",criteria of algorithm is based on time complexity analysis and space complexity analysis,2, 11661,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",1) Time Complexity\n2) Space Complexity,2, 11662,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",time and space complexity,2, 11663,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",time and space,2, 11664,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The following requirements must be met by all algorithms: any number of input values. any number of output values. Unambiguous directions that are clear. ,2, 11665,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Time taken by the algorithm and the memory consumed by it,2, 11666,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,",", 11667,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",There are two criterias:\n1. Space complexity \n2. Time complexity,2.5, 11668,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","1. Input: An algorithm should have zero or more but should be a finite number of inputs. We can also say that it is essential for any algorithm before starting. Input should be given to it initially before the Algorithm begins.\n2. Output: An algorithm must give at least one required result from the given set of input values. These output values are known as the solution to a problem.\n3. Definiteness: Each step must be clear, unambiguous, and precisely defined.\n4. Finiteness: Finiteness means Algorithm should be terminated after a finite number of steps. Also, each step should be finished in a finite amount of time.\n5. Effectiveness: Each step of the Algorithm must be feasible i.e., it should be practically possible to perform the action. Every Algorithm is generally expected to be effective.",2.5, 11669,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",1. Working Structure - How the algorithm is working\n2. Time Complexity - How much time it is taking in solving any problem\n3. Space Complexity - How much space it takes,2.5, 11670,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Criteria of algorithm analysis are time complexity , space complexity etc.",2.5, 11671,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",1. time complexity\n2. space taken by the algorithm,2.5, 11672,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria for algorithm analysis are Time and Space.,2.5, 11673,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",1 -> speed or run time an algorithm \n2 -> how much computer space it uses while running.,2.5, 11674,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The different criterias of algorithm analysis are :\n1. It should occupy as less space as possible.\n2. The run time of any program based on that algorithm should be as low as possible.\n3. The algorithm should be user-friendly.,2.5, 11675,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,",", 11676,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.", time complexity and space complexity are the two criteria on which algorithms are analyzed and compared with each other .,2, 11677,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Time complexity and space complexity,1.5, 11678,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of algorithm analysis are as follows :-\n1) Time Complexity\n2) Auxiliary Space used\n\nThe aim is to minimize the above two criteria's.,2, 11679,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The algorithms are majorly determined on the basis of space and time complexity.,2, 11680,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,",", 11681,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,",", 11682,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","input, output, ",1, 11683,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the criteria of algorithm analysis is to check time complexity and space complexity for example we need to check that a algorithm is in a worst case or average case or in a best case by algorithm analysis,1, 11684,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","We can analyse the algorithm on the basis of time and space. When analysing on the basis of time there are three cases to be considered: worst case, average case, best case. When talking about space we see whether it is auxiliary space or not. ",2, 11685,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.", The criteria of algorithm analysis is that its time and space complexity should be minimum ,2, 11686,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria to do algorithm analysis are space and time analysis by which we can compare the different methods of solving the problem efficiently,2, 11687,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","The criteria of algorithm analysis can be time taken ,or space taken by the program, or the amount of battery is uses. It depends on the user.",2, 11688,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the criteria of algorithm analysis are posteriori analysis and priori analysis,2, 11689,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",space and time are the most important criteria for algorithm analysis.,2, 11690,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",time complexity\nspace complexity,2, 11691,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",criteria of algorithm analysis is to calculate the space and time complexity of the algorithm ,2.5, 11692,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria for algorithm analysis when we are performing it theoretically is that we imagine that all the computers will have similar processing power and will be working under the same conditions. We need to make sure that the pseudo code we write can be run in a majority of main programming languages. ,2, 11693,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",1.Zero or more input values\n2.One or more output values\n3.Clear and unambiguous instructions,2, 11694,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of algorithm analysis is that it should be applied to every kind of that problem and it should not give different outputs with the same input or it should give the correct output as per the input.,2, 11695,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the criteria is to analyze each command of the analysis and compute its complexity.,2, 11696,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Criteria for algorithm analysis is at first to mark definite steps to solve that particular question. Secondly, to analyise the steps in terms of complexites, both time and space in order to make it more efficient. ",2, 11697,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",there are two parameters involved:\n1. time \n2. space,2, 11698,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of algorithm analysis is time complexity and space complexity.,2, 11699,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",We analysis algorithm mainly on both that is on the basis of time and space complexity.,2, 11700,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",criteria of algorithm analysis are:\ntime it takes\nspace required,2, 11701,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Algorithm analysis includes finding out the time and space complexity.,2, 11702,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","The criteria to do the algorithm analysis are Space and Time. We generally do algorithm analysis on the bases of these two factors and generally find the best one according to our real world problem requirement. By doing algorithm analysis, we can find the time and space complexity of the given algorithm and hence it will become very easy to compare any two algorithm on the bases of space and time.",2, 11703,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Time complexity\nSpace complexity,2, 11704,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","The criteria for algorithm analysis is: Use of recursion or iteration, use of complex libraries or time taking commands, code redundancy etc",2, 11705,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",algorithm is analzsed on the basis of time complexity and space used in the algorithm,2, 11706,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the criteria of algorithm analysis: \n\n,2, 11707,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria of algorithm analysis are:\n1. Efficiency\n2. Space and Time taken by the code\n3. Scalability and Predictability \n4. Resource Management ,2, 11708,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria for algorithm analysis- \nThere can be zero or more inputs.\nThere can be zero or more outputs.\nThe instructions should be clear and not ambiguous.,2, 11709,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the criteria of algrothm analysis is to give one or more input values.either zero or any other number\n ,2, 11710,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria for algorithm analysis is mainly the space and time an algorithm uses. Hardware and software versions the user is using and other such parameters may also affect the working. ,2, 11711,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria for algorithm analysis is input size and time and space complexity.,2, 11712,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",criteria for algorithm analysis are time and space complexity. ,2, 11713,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Pseudocode and flow chart can be used to represent an algorithm. Repetition is included in the steps of an algorithm. It is written in human understandable language.\n,2, 11714,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Time Complexity--- It checks the speed and run time of the code \nSpace Complexity--- It analyses the space occupied by the code,2, 11715,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria for algorithm analysis is zero or more input values returning the output as one or more input values with clear language efficient time complexity and space complexity with efficient algorithm.,2, 11716,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,0, 11717,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the criteria of algorithm analysis are:\nzero and more input values\n,2, 11718,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of the algorithm analysis is to make algos and ways to solve the paricular types of the questions.,2, 11719,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,0, 11720,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the criteria of algorithm analysis should be zero or more input values ,2, 11721,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","the criteria which algorithm must follow are:\n1)It should have 0 or more input value\n2)It should have 0 or more output values\n3)It should have clear ,sufficient and unambigious instructions.",2, 11722,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the main criterion of analysis of an algorithm is its time and space complexity,2, 11723,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","The criteria must be there should be an unambiguous, fineness.",2, 11724,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Time complexity\nSize complexity,2, 11725,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of a algorithm analysis is to measure its time complexity and space complexity .,2, 11726,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The main criteria to analysis the algorithm is to first understand the the logic behind the algorithm and impliment it in a systematic manner.,2, 11727,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",it should always satisfy more than 1 input and give efficient output\nit should always return the type of error being occurred at the time of running as well as the complexity of the program,2, 11728,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Criteria of algorithm analysis is finding least upper bound of time complexity, highest upper bound of time complexity and then finding out average case time complexity.",2, 11729,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria is to find the best possible time complexity for the program which covers all the base cases and also find the error in the code if present.\n,2, 11730,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",there are two criteria a algorithm analysis time complexity and space complexity.,2, 11731,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","An algorithm must satisfy the following criteria:\nInput: An algorithm should have zero or more but should be a finite number of inputs. We …\nOutput: An algorithm must give at least one required result from the given set of input …\nDefiniteness: Each step must be clear, unambiguous, and precisely defined.\n",2, 11732,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","run time, and space required for the code to execute",2, 11733,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",first we analyze the algorithm based on its time complexity and then we analyze it on the bases of its memory \nand the best algorithm which is taking less time and space is considered,2, 11734,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,0, 11735,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","The criteria of algorithm analysis basically includes analyzing the Time complexity and space complexity of an algorithm such that it takes less memory , space and time for the same. \nFor analyzing the Time complexity of an algorithm - the criteria depends on how many times each function is running in the algorithm(considering main() as a function). As each time the algorithm runs (or parts of it) the time complexity of it keeps increasing. For example - Each \",2, 11736,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","An algorithm should have 0 or more well-defined inputs. Output − An algorithm should have 1 or more well-defined outputs, and should match the desired output. Finiteness − Algorithms must terminate after a finite number of steps. Feasibility − Should be feasible with the available resources.",1, 11737,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Symptotic and Asymptotic.,2, 11738,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Criteria for Algorithm analysis:\n1) Time complexity of the algorithm. We analyze an algorithm according to the time the algorithm takes, the algorithm whose Time complexity is better will be consider as the better approach to solve a problem.\n2) Space complexity is also an important criteria to analyze an algorithm. ",2, 11739,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","The Criteria for algorithm analysis is:\n1.time required by the algorithm in best case, worst case and average case. \n2.space required by the algorithm in best case, worst case and average case.",2, 11740,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Criteria of algorithm analysis :\n1.Time complexity:We go for the algorithm rhat has the least time comlexity.We avoid exponential complexity and go instead usually for linear or better time complexities.\n2.Space complexity:We choose the algorithm that takrd the least space and has the least space complexity.Sometimes,the algorithm having the least time complexity may not have the least space complexity and vice-versa.Then,according to the problem,we choose the most suited algorithm.",2, 11741,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",1. time complexity\n2. space complexity,1, 11742,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Speed of execution of the algorithm or (the code implemented using the algorithm).,2, 11743,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",criteria of algorithm analysis is time and space complexity and develop a optimise solution . Analysis of time complexity is done with help of asymptotic analysis,2, 11744,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",time and space complexity,2, 11745,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Some criteria's of algorithm analysis-\n1. gives best time and space complexity. \n2. gives optimal solution.\n3. does not take up a lot of space to store data.,2, 11746,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",we do analysis to find optimal solution . analysis in done according to the updation required for a variable like increment or decrement.,2, 11747,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of algorithm analysis is that we have to find a solution which is time efficient as well as space efficient. We do analysis according to number of updation (increments and decrements) in a variable.,2, 11748,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","criteria of algorithm analysis is that the solution that we have derived must be better in terms of space and time complexity in comparisonn to the previous solution.It also includes the fact whether the problem can be broken down into further sub-problems or the data is associated in some way or not,etc.",2, 11749,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","optimized solution, best case run time",2, 11750,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of algorithm analysis is-\nTime complex\nspace complex,2.5, 11751,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",I have first approach is that the algorithm . is not be large and main approach is that less time complexity in comparing to other method . For developing the algorithm we know the appropriate logic to attempting and solving the problem.,1, 11752,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","there are 2 major criteria of algorithm analysis, time and space.",2.5, 11753,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",There are two criteria of algorithm analysis \n1. Time complexity \n2. Space complexity,2.5, 11754,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",there are 2 criteria that a good algorithm should meet:\n1. less time complexity\n2. less space complexity,2.5, 11755,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Time Efficiency\nSpace Efficiency\nOptimum Solution\n,2.5, 11756,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",criteria of Algorithm Analysis is to find the time complexity and space complexity of given program \nwe can find time complexity from different methods like recursion method etc.,2.5, 11757,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the main criteria of algorithm anallysis is that how fast the algorithm works we need to solve problem in quick time for that we need to design algorithms which work fast and accurately,2, 11758,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Algorithm is analiysed mainly on two criteria : \n1) Space complexity - How much space (space in RAM taken by variables and many other things) our program require.\n2) Time complexity - How much time is taken by certain pieces of code to perform a certain operation.,2.5, 11759,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria of algorithm analysis is that the analysis of algorithm should be done through its space and time complexity in order to make the algorithm as efficient as possible so that it runs in a much more efficient way and at the same time it takes as less time and space as possible.,2.5, 11760,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",time complexity and space complexity are the two criterias ,2.5, 11761,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",algorithm analysis generally takes place on the basis of two criteria time and space.,2.5, 11762,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Algorithm analysis is done on the basis of purpose, the time complexity generated and the ease to use them. ",2.5, 11763,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria for algorithm analysis: \n,0, 11764,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",two criteria is required mainly in algorithm \n1. space complexity-in which how much time we take to solve the\n2.time complexity- ,2.5, 11765,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",There are two criteria for algorithm analysis:\n1. Time complexity : The criteria which tells us in which factor running time grows as size of input(n) increases.\n2.Space complexity: The criteria which tells us in which factor memory required grows as size of input(n) increases.,2.5, 11766,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",a good algorithm analysis is the one in which the time complexity and space complexity is the least,2.5, 11767,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,0, 11768,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,0, 11769,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",,0, 11770,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","Algorithm analysis works on the criteria of building a solution which is generalized for same category of problems ,we describe the main function which is to be executed to solve the problem.",0, 11771,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","The criteria to understand the algorithm analysis is delta, omega theta etc.",0, 11772,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",to analysis the algorithm see the number of steps formed number of line ,0, 11773,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",There are two criteria for algorithm analysis:-\n1. Time complexity analysis: To determine the time taken by the algorithm.\n2. Space Complexity Analysis: To determine the space used by the algorithm for the whole processing as well as generating output.,2.5, 11774,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",algorithm can be analysed by 4 methods \n1) substitution method \n2) recursive method\n3) tree method\n4) master theorem,0, 11775,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",There are some criteria of algorithm analysis:\n--> Subsitution method \n-->,0, 11776,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","criteria of algorithm analysis are time complexity , what approach a algorithm is based.\n",2, 11777,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",in order to do algorithm analysis we must know firstly the asymptotic notations ,0, 11778,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Space complexity and Time complexity are the two main criteria of algorithm analysis.,2.5, 11779,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",criteria of algorithm analysis is time complexity and space complexity.,2.5, 11780,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",criteria of algorithm analysis is to know about the problem first and divide it into fewer subproblems and come to solution at last,0, 11781,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",Criteria of algorithm analysis :-\n1) substitution analysis\n2) interpret analysis\n3) divide and conquer analysis,0, 11782,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The worst case is always given priority when doing algorithm analysis\nWe should look at the complexity when the independent variable which is time is tending to infinity\n,0, 11783,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The basic criteria of algorithm analysis is that problem must be divided into sub problems.,0, 11784,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",like we see the time complexity and space complexity that problem has and among various thinking process and approach towards particular problem we are able to know the best technique. ,2.5, 11785,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",criteria of algorithm analysis is to make the code to algo to easy understanding .,0.5, 11786,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",criteria for algorithm analysis is to minimize the time complexity and storage required to run the program.,2.5, 11787,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",The criteria is to maintain the time complexity and optimize a code to get a peak outcome of the product so that the major criteria is time complexity ,2, 11788,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the criteria of algorithm analysis\n1) time efficient\n2) space efficient,2.5, 11789,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",time and storage and resources,2.5, 11790,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","recursive function, time compexity etc.",2, 11791,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.",the criteria for analysis is that we give anylaze algs on each step and combine all the results that are griven from the indivdual solution ,0, 11792,What are the criteria of algorithm analysis?,"An algorithm are generally analyzed on two factors − time and space. That is, how much execution time and how much extra space required by the algorithm.","criteria of algorithms analysis is notation, searching, time complexity, ",0, 11793,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11794,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic analysis of an algorithm is to determine the algorithm belongs to BigOh(theta), bigoh(omega), smalloh(theta)",1, 11795,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",its calculate the running time of the algorithm,2, 11796,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis is used to show three basic cases of any algorithm, namely: 1) The Best Case, 2) The Average Case, 3) The Worst Case; which calculate the complexities for the best case of the algorithm, general case of any algorithm, and the worst case respectively",2.5, 11797,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis is a way of representing the time complexity of an algorithm. It allows us to bound the time taken by the algorithm in 1)Lower bound(minimum time taken) 2) Upper bound(maximum time taken) 3) Average bound. ,2.5, 11798,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of an algorithm is a type of analysis to find the upper and lower bound of the complexity of algorithm.,2, 11799,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis of an algorithm is a process of calculating the running time of an algorithm in mathematical unit to find programs limitation. ,2, 11800,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis of an algorithm inform us about where the time complexity of an algorithm lie whether it is in upper bound (O) avg bound (theta) lower bound (omega),2.5, 11801,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis divides the time taken by algorithm into three parts that is worst case best case and average case time,2, 11802,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis is to analyze the time complexity as well as the space complexity of the given program,2.5, 11803,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",To study the complexity of a given problem such as finding the best or worst or average time complexity asymptotic notations are being analyzed.,2.5, 11804,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis is done to get the knowledge of time taking at every step of an algorithm and to know the overall time complexity of the algorithm.,2.5, 11805,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis algorithm is an algorithm which defines the ultimate answer or solutions of the program we are running.,2.5, 11806,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",The calculation of time taken for each statement in the program to execute based on the complexity of that statement is asymptotic analysis.,2, 11807,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis involves the use of \nbig o \ntheta\nomega notations for knowing the time complexities of a program,1, 11808,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis refer to determining a mathematical expression for Time and Space complexity of an algorithm. \n,1, 11809,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis refers analyzing the algorithm based on certain parameters such as no of iteration in a loop, no of iterations in a recursive function, etc.\n",1, 11810,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11811,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic notation are used to calculate the time complexities in term of equal ,less, more ",2, 11812,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis helps us to analize the algorithm using certain notations.,1, 11813,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis is the analysis regarding time and space complexities of various cases like best , worst and average cases in an algorithm. This analysis helps us in improving the overall efficiency of an algorithm.",2, 11814,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic notation gives us a method for classifying functions according to their rate of growth. ,1, 11815,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic Analysis shows the complexities of algorithm which is being solved through some particular notations,which makes it easier to know which algorithm takes more time and which is optimised. It is recognised by the functions and algorithm used in program.",1.5, 11816,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of algorithm deals with the time and memory the algorithm uses to function. ,1.5, 11817,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","here we analyise the lower bound of the solution time complexity , like our solution existing time complexity is O(n) then its lower bound should be also O(n)",1, 11818,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",To find the time and space taken by an algorithm to function o different types of test cases.,1, 11819,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",The analysis of an algorithm in the form of algebraic functions to denote the time or space consumed by the program is knows as Asymptotic analysis. ,1, 11820,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",The analysis of an algorithm in the form of an algebraic function and denotes the time and space consumed by the algorithm is known as asymptotic analysis.,1.5, 11821,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11822,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm means finding the time complexity of an algorithm on the basis of its recurrence relation or given algorithm using substitution method, recurrence tree method, master's theorem, etc.",1.5, 11823,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11824,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",The asymptotic analysis of an algorithm is to represent an algorithm in some type of notation so that we will analysis it further. we analysis the algorithm in many ways :\n1)with the help of Reccurance. relation\n2)by plotting the graph and analysing it\n3)with the help of master theorem\n,1, 11825,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",study of an algorithm in terms of mathematical expression and using math graph is basically asymptotic analysis of algorithm.,1, 11826,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11827,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm means whether the time complexity of an algorithm will be in big-oh, omega , or theta. There is specific criteria to identify whether we have to take big-oh, omega or in theta. ",1, 11828,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of an algorithm refers to the examining and analysis of a program to calculate its running time. We check the time taken by the program to give an output. ,1, 11829,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",It tells the running time of the algorithm.\n,1.5, 11830,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic Analysis gives us the possible range of time that in how much time the algorithm is taking to run the program.,1, 11831,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis is a way to display the time complexity of a particular program in the form of equation by analyzing the code of that program.,1, 11832,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis refers to the analysis approximated in the order of the fastest changing(growing) term without finding the exact duration for which it runs on the given problem.\n,1, 11833,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm is the analysis in order of the fastest changing, term without finding the exact term.",1.5, 11834,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Analysis of an algorithm for the lowest and upper bounds as well as the average bounds of time and space that the algorithm might consume to devise and compare for the most efficient ones is known as asymptotic analysis of an algorithm.,2, 11835,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",writing a time complexity of an algorithm and then going by it is what ,1, 11836,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic Analysis is analyzing an algorithm and designating appropriate symbols with its time complexity.,1.5, 11837,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",The time taken by any algorithm for the completion of its full step is known as asymptotic analysis of an algorithm.,1, 11838,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm analyzes the algorithm based on notations like theta notation to calculate the best-case scenario of a particular algorithm, big oh notation to calculate the worst-case time complexity and omega for average case. These notations compare the algorithms using graphs of functions used in algorithms.\n\nAsymptotic analysis involves calculating time complexities and space complexities.",1.5, 11839,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm is based a technique to analyze the Time and space complexity using Graph.\nits basically shows how with time the data grows, whether linearly or exponentially.",1, 11840,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of an algorithm is to execute the program in O(n) time complexity.,1, 11841,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic analysis of an algorithm is representing the time complexities of an algorithm in terms of O, theta and o.",1, 11842,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm represents the time complexities of an algorithm in the form of O, o and omega.",1, 11843,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis is used to analysis algorithms to give the time complexity and space complexity of the algorithms using certain notations. These are the standard notations developed so that the complexity analyzed throughout remains same. ,1, 11844,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","there are the representations to provide the time and space complexity of an algorithm. eg big Oh' (O) , theta, omega.",1.5, 11845,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm is a method used in computer science to analyze the performance of an algorithm in terms of the input size. It helps to determine how the algorithm's runtime and memory usage grow as the input size increases, and to compare different algorithms in terms of their efficiency.",1, 11846,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",the mathematical definition of an algorithm is its asymptotic analysis.,1, 11847,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm is calculating time and space complexity and representing them using different notations such as big O, omega and theta , i.e, best , average and worst complexity.",1, 11848,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","The asymptotic analysis in done by the concept of best case , worst case and average cases which may occur in a program.",2, 11849,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11850,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis is the analysis of an algorithm for different test cases - the best case, average case and the worst test case.\n It allows you to find upper and lower bound complexities for your algorithm. ",2.5, 11851,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of algorithm is used to determine the time complexity of programs,1, 11852,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm refers to the finding of best, worst and average time complexity of any algorithm.",2.5, 11853,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",analysis of time taken,1.5, 11854,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis the big O notation and the time complexity of an algorithm so that we can choose the most efficient algo,1, 11855,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",omega and big O notation,1, 11856,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis of an algorithm is the mathematical representation of the run time of a program.,1, 11857,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","When we have made a equation to represent the running time of an algorithm and we use it to find out the best , average or worst case running time that could be defined as the asympotic analysis of an algorithm.",1, 11858,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptomatic analysis of algorithm is is computing the running time of an algorithm in terms of mathematical function eg. f(n),1, 11859,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","The asymptotic analysis of an algorithm is to analysis it on the basis of its best, average or worst case time complexity.",2.5, 11860,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asympotic notations have the bounded the mathematical formula in the algorithm .And with the help of the asympotic notation we can define the complexity of the alghorithm .\n ,",", 11861,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",it is the method of analysis in which we meeasure the nest worst and average case scenario of a algorithm .in asymptotic algorithm input is needed if there is no input thrn program will run in constant time,2.5, 11862,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis goes through every line of the algorithm to find the mathematical equation of the time complexity of an algorithm. We can find either the best case, worst case or average time complexity of an algorithm using asymptotic analysis.",2.5, 11863,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11864,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",time taken,1, 11865,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","It is the analysis of the algorithm on three scenarios : best case , average case and worst case.\nOn the basis of the performance of the algorithm on these cases , we select the suitable algorithm for the given problem.",2.5, 11866,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of an algorithm is the the various calculations that take place to calculate the time which a particular code takes from run-time to its final compilation.,1.5, 11867,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Process of calculating running time of an algorithm.,2, 11868,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm."," Asymptotic analysis of an algorithm is to analize the algo on the basis of three major cases that are:\n Best case, Average case, Worst case.",2.5, 11869,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of an algorithm means analyzing an algorithm so that it takes as minimum time as possible and produces the best result.,1, 11870,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","the asymptotic analysis of the algorithm is finding the trend of time complexity of the algorithm when the number of elements (n) varies in the algorithm discarding other factors\nit can be exponential, log(N),o(N) and other ",1, 11871,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis is the process of calculating the running time of an algorithm or its run-time performance. The goal is to determine the best case, worst case and average case time required to execute a given task.",1, 11872,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",it is the analysis of how much time an algorithm or line of code will take to execute. it can be calculated for the worst case scenario or average scenario.,2, 11873,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",uper and lower bound is done in this,2, 11874,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of an algorithm provides the necessary means to compare multiple algorithms and to find the best among them.\n,1, 11875,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","exact time analysis,worst case time complexity and best case time complexity is the asymptotic analysis of the algorithm",1, 11876,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of an algorithm refers to defining the framing of its run-time performance.,1, 11877,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis is finding the best average and worst time complexities that a algorithm would take,2, 11878,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.", Asymptotic analysis of an algorithm is done to find the complexity of the program such as time and space complexity so that we minimize the complexity if it takes more than required and make it an efficient and optimal algorithm,1, 11879,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",analysis of algorithm based on it's graph function ,1, 11880,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11881,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of an algorithm is mathematical foundation of its run time performance.,1, 11882,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11883,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis of an algorithm helps us to calculate maximum and minimum time complexity of given function. ,2, 11884,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Analysis of the the time and space complexities of an algorithm,1, 11885,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis are the criteria of analysis is done there are worst case , best case , average case analysis.",2.5, 11886,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.", explicit conplexities of algorithm.,1, 11887,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11888,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis tells us the degree of an algorithm.\nFor example: bubble sort has the time complexity O(N^2).\nHere O( ) is the asymptotic notation which tells the time complexity of the algorithm.,1, 11889,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",it basically tells about the running time of an algorithm using the mathematial computation like ,1, 11890,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm means studying the algorithm on the basis of its upper bound or lower bound conditions that is analysis on the basis of best case , worst case and average case time complexities.",2.5, 11891,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",In asymptotic analysis of an algorithm we find upper bound and lower bound ,2, 11892,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptomatic analysis means when we analyze the algorithm on the basis if the most dominating term and do not consider the terms which don't have that much impact on the value of the time and space complexity,1, 11893,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic analysis of an algorithm refers to in how much time our program runs and how much space it requires to run to keep that in mind to design a best program.\nlike BIG OH (O(n)) here BIG OH refers to upper bound it will be maximum this value and not be greater than this.\nnext can be OMEGA (N) it refers to lower bound means min value, it will be greater than this value for sure.\nTHETA (N) refers to exact complexity of that particular algorithm ",1, 11894,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",One of the method to analysis algorithm\nAsymptotic Analysis of algorithm is mainly actual time analysis of algorithm\nFrom which we get information about time measurement of algorithm,2, 11895,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic notations are basically a measure of time that a code takes to compile and run . \n,0.5, 11896,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",The asymptotic analysis of an algorithm is the process of calculating the running time of an algorithm in mathematical units to find program limitations or run-tme performance.,1, 11897,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","the most time can an algorithm take ,what is its upper bound, least time it can take or its lower bound value and its worst case.\nafter this we have knowledge about each and every aspect of an algorithm.",2.5, 11898,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","it define the mathematical foundation of its run-time performance. by using this we can conclude the best case, average case, and worst case scenario of an algorithm.",1, 11899,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",We try to write equation of time complexity using asymptotic analysis. For example -> T(n)= 3*O(n^2)+2*O(n),1, 11900,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis uses mathematical operations to find the best case, worst case and average case time complexity of an algorithm. It uses the plot of the assumed and approximate values and then perform operation to find complexities.",1, 11901,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic analysis is analyzing an algorithm for its best, worst and average case and finding the time and space complexity for respective cases.",1, 11902,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic notation are used to compare and find the space and time complexities of the algo and optimize it,1, 11903,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm refers to analysis of time where time tends to infinity, covering all possible cases.",1, 11904,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis is used for the efficiency of algorithms when there are very large inputs also or inpits are tending to infinity.,2, 11905,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Comparison of time complexity based on the three notations.,2, 11906,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Analysis of the algorithm in the best, worst and average case is called asymptotic analysis.",2, 11907,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Helps to find the higher time limit of the algorithm( worst case), lower limit (best case) , average time (average case). It is done with help of asymptotic notations. Helps in comparison bw two algos",1.5, 11908,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","In these type of notation the algorithm is judged on the basis of best case,worst case or average case scenarios.",1.5, 11909,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Defining a mathematical statement in order to compute the time taken by the algorithm in best case, worst case ,average case.",1.5, 11910,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,",", 11911,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,",", 11912,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis is the process of calculating the running time of an algorithm in mathematical units to find the program’s limitations, or run-time performance. The goal is to determine the best case, worst case and average case time required to execute a given task.",2, 11913,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,",", 11914,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis is used with the help of regression,2, 11915,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",in which we compare time complexties of algorotihms on notations line big O\nomega etc.,1, 11916,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis is to anlayze an algorithm on the basis of notations like Big Oh, Big Omega and Big Theta.",2.5, 11917,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","theta notation, bigO notation, o notation, omega notation",2, 11918,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",The asymptotic analysis is the process of calculating the run time of a program in mathematical units to find the program's limitations or run-time performance.,2, 11919,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,",", 11920,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic analysis is a process in which time complexity and space complexity of the algorithms are represented in the form of asymptotic notations like big-o and small-o in the order of n, log(n), n*log(n) and many more.",1, 11921,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",analysis of algorithm on the basis of time complexity is called asymptotic analysis,1, 11922,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,",", 11923,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis refers to a criteria to determine the efficiency or complexity of the algorithms by the use of some symbols called \,1, 11924,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,",", 11925,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,",", 11926,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","yes, algorithm is asymptotic analysis ",2, 11927,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",the analysis in which we calculate the running time ,2, 11928,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic analysis is when we take different testcases for an algorithm and try to found out its best, worst and mainly the average case of the approach using various methods like Master Theorem.",2, 11929,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","In asymptotic analysis, We use Mathematical tools and calculation to analyze the time and space complexity of the algorithm. ",2, 11930,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis of an algorithm are the analysis of space complexity and time complexity of the algorithms,1, 11931,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,",", 11932,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis of an algorithm is analysis of algorithm as a function of time like O(n) this tells the order of function in which the analysis of algorithm takes place but it does not tell the exact time the algorithm's analysis has taken ,1.5, 11933,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","The asymptotic analysis of algorithm helps in defining the best, average and worst time and space complexity of the program.",1, 11934,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",in asymptotic analysis we analyse the best average an worst cases for a particular problem solution and compare them in their complexities.,1, 11935,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic analysis is finding the value of asymptotic notations like BIGO(n). o(n), thetha(n), each notation represent different thing .",2, 11936,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm is the process in which we approximate or try to calculate the max amount of a time a process can take. For example the some of the major problems require time complexities like O(n), O(n^2), etc these mean that in the case of n inputs that maximum time that the process can take is of n^2 complexity. Asymptotes are lines that come very close to one another but never touch each other. Similarly in asymptotic analysis the process can come very close to the complexity we have calculate but it never touches or exceeds it. ",2, 11937,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Defining the mathematical foundation of its run-time performance.,2, 11938,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",The asymptotic analysis of an algorithm is that how much time that particular algorithm will take considering an average time criteria whether it should be less or more.,1.5, 11939,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis is about finding the range of time and space complexity,2, 11940,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic notations stand for notations used to define or to structure their complexities. There are many types of asymptotic notations that are big-O, Big-Omega, Small o ,small Omega. Analysis by which we define and find the complexities of the algorithm we have structured is called asymptotic analysis.",2, 11941,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis refer to the time limitations while solving a particular problem that is when the time tends to infinitely large number what is the behaviour of the graph of the function.,2, 11942,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm is getting the worst, average and best time complexity and space complexity of a problem. ",1.5, 11943,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic means tends to infinity. By asymptotic analysis we mean to find how our algorithm will work when it is given large inputs which are tending to infinity.,1.5, 11944,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis is analysing the algorithm according to its max and min time it takes.,2, 11945,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis is the analysis of a code done before the code runs.,2, 11946,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm is the analysis of Time and space complexities as per tight upper boud, tight lower bound and tight average boud according to the requirement.",2, 11947,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",a asymptotic analysis of a algorithm is to analyze an algorithm based on loops its takes in time complexity or new space used in space complexity,2, 11948,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm refers to the time analysis of a program based on its worst, average, and best case .",2, 11949,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",it is a method to calculate time complexity of any algorithm.,2, 11950,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of an algorithm has an ,2, 11951,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",It is the mathematical approach of finding time or space complexity of an algorithm in which an algorithm is defined as a function of n (f(n)). ,2, 11952,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11953,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis of algorithm is describe the mathematical framing while it is running,1, 11954,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","The asymptotic analysis of an algorithm includes see how the function is growing over time using mathematical functions. we are more interested in degree of the polynomials. We don't need to look at all the cases but get a brief overview. Like we can look at the best case, worst case and average case and see overall and get idea of how the algorithm would be performing. these analysis then help us compare the different algorithms. ",1.5, 11955,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptomatic analysis of an algorithm is when algo is analyzed on the basis of input size.,1.5, 11956,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","in asymptotic analysis we take different test cases and find the best, worst and average test case",1.5, 11957,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",It is the process of calculating the run time of an algorithm.\n,2, 11958,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","The asymptotic analysis of an algorithm is done to find out the Best, Average or worst case for the Time or Space complexity of a program",1.5, 11959,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of the algorithm is to calculate or estimate the running time of the algorithm and therefore calculating the worst best and average case of the particular algorithm,1.5, 11960,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11961,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic Analysis of an algorithm is ,1.5, 11962,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of an algorithm is ,1.5, 11963,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11964,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",The process of calculate the running time of algorithms in mathematical units to find the program limitations.,1, 11965,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",It refers to giving mathematical foundation of its runtime performance.,1, 11966,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",the analysis of the upper and lower bound of an algorithm is called its asymptotic analysis,1.5, 11967,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",The asymptotic analysis refers to the study of running time of an algorithm.,1.5, 11968,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Analysis based on algorithm's time complextiy is called asmptotic analysis,2, 11969,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic ananlysis is the study of upper bound time or lower bound time complexity analysis of a particular algorithm.,2, 11970,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis is the process in which we calculating the run time of an algorithm in mathematical units to find the program’s limitations and run time perfomance.,2, 11971,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",refers to computing the running time of any algorithm in mathematical units of computation.,1, 11972,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis include finding worst case time , best case time and average case time complexity for a particular algorithm.",2, 11973,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11974,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",approx time complexity analysis of an algorithm.,1, 11975,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm refers to defining the mathematical foundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case, and worst-case scenario of an algorithm.\n",1, 11976,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","it is the analysis in which we analyze the running time complexity of an algorithm for best ,average and worst case.",1, 11977,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",An asymptotic analysis of an algorithm is to analyze the code time complexity at every operation of the proposed algorithm so that we can get \nthe information about the time complexity of code\n,2, 11978,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic analysis of algorithm is analysis of algorithm in best time case ,average time case, and worst time case",2, 11979,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm."," increases the time complexity, any \",1, 11980,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm refers to defining the mathematical foundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case, and worst case scenario of an algorithm.",2, 11981,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","In which we compare the problem statement at hand with a pre-existing analyzed statement. And we just try to reduce the complexities in the form of the other one. In this manner we can comment on the best case, worst case and average case time complexities.",1, 11982,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11983,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis represent to analyzing respective algorithm on basis of time and space:\nIt includes finding upper bound, lower bound ,average bound of a system by studying f(n),g(n) and respective best case, worst case and average case. ",1, 11984,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of an algorithm is the ananlysis of algorithm to figure out the complexity of the algorithm.,1, 11985,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis is done to check the time complexity of a program so that we can get an idea about the best and worst time it is taking to run a particular program.,1, 11986,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptomatic analysis gives a rough idea of the time the algorithm will take in execution given we have the variables like user-defined inputs.\nIt can be used for the analysis of the time complexity, space complexity or any required auxiliary space.",1, 11987,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic analysis is done to check how good the Algorithm is and how much time it would be taking it is mainly used in calculating time complexity of a algorithm . there are different types of asymptotic notations like big O, theta, omega,",1, 11988,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","it is the analysis of time complexity of a given algorithm to get the complexity in best, average and worst time cases",1, 11989,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","It is the best , average and worst case time complexity of an algorithm. These can be used for comparison. ",1, 11990,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 11991,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",It is analysis of the algorithm using a criteria in which we find time complexity of an algithm.,1, 11992,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic analysis of an algorithm is a process to determine the time complexity of an algorithm using various theorems ,laws etc. , like master theorem can be used to find it's complexity effectively.",2, 11993,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",it helps in giving the time complexity of a problem,1.5, 11994,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",It is the analysis of time complexty and space occupied.,2, 11995,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","thats the time depending approch for algorith.means that how much time will take the algorithm running ,like its have notation for describe the time complexity. ",2, 11996,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",the analysis of the running time of a particular algorithm is called asymptotic analysis. it is algebraic or graphical in nature.,2, 11997,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of algorithm is an analysis where we calculate the time complexity of the algorithm.,2, 11998,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",It refers to the analysis of time and space complexities of an algorithm,2, 11999,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Determination of how an algorithm in perform in its best case and its worst case scenario helping .Time complexities are denoted with the symbols accordingly,2.5, 12000,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic Analysis of an algorithm 1)best case2)average case 3)worst case ,2.5, 12001,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 12002,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis deals with best case worst case and average case of an algorithm,2.5, 12003,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","The asymptotic notation of an algorithm is the representation of time and space complexity of the algorithm in terms of Big O, Big omega notations, By this we can judge two algorithms whether the given algorithm should preffered over other or not.",2.5, 12004,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",this the analysis of space and time complexity using asymptotic notations like \nbig O\nbig alpha\nbig omega,2.5, 12005,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic analysis is the analysis of algorithm based on two complexities time and space. in asymptotic analysis we use asymptotic notation to give best case, worst case and average case out comes of the algorithm.",2.5, 12006,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic Analysis of an algorithm refers to the analyss,0.5, 12007,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Considering the efficiency of algo in three cases \nThe Best Case\nThe Worst Case\nThe Middle Case ,2.5, 12008,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",\nBig theta : average case\n\nBigO: best case ,0.5, 12009,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of algorithm refers to analysing time and space complexities using various notations to fit various requirements like having time or space complexity less than, greater than or equal to a certain order of n.\n",2.5, 12010,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis is obtaining the time complexity using mathematical expressions ,2.5, 12011,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 12012,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis means to find the various and more efficient approach to a problem using the different asymptotic notations ,0, 12013,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 12014,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 12015,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","big omega, big theta, big delta",0, 12016,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 12017,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis of an algorithm is the measurements of time taken by the algorithms in asymptotic denotions(namely, oh, omega and theta). In those too, it is divided into different parts, such as big oh, big omega, small oh, small omega.",2, 12018,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptomatic notations can be analysed in 3 types \n1) big o notation - it is the upper bound\n2) omega notation - it is the lower bound\n3) theta notation -,2.5, 12019,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",there are three type of asymptotic analysis of an algorithm:\n--> Big O notation.\n--> Omega notation.\n-->Theta notation.,2, 12020,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis of an algorithm basically a notations in which a algorithm is performed,0, 12021,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis of an algorithm reffers to the practice of analysis on the basis of notation in which complexity can be expressed,2, 12022,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",In asymptotic analysis of an algorithm we categorize the algorithm in 3 categories so that we can figure out what max time our algo will take in worst case and min time in best and avg. time in avg. case. With the help of analyzation we can find Time Complexity of the Algorithm.,2.5, 12023,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic analysis of an algorithm is the analysis of the time complexity the algorithm takes, where big omega is for best case big thetha for average case and big O for worst case time complexity. We analyse through these aasymptotic algorithm so we can analyse our code for time complexity.",2.5, 12024,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis of an algorithm is to analyse the problem and divide thye problem into fewer subproblems.,0, 12025,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Types of asymptotic analysis are :-\nBig O notation = upper bound graph\nOmega notation = mid bound graph\nTheta notation = lower bound graph,2, 12026,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","Asymptotic analysis is the practice of figuring out the space and time complexity of the algorithms in order to determine which algorithm would be the best to use. A key point here is that we take the complexity of the functions into consideration when the independent variable is tending to infinity. Hence, the name asymptotic.",2.5, 12027,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",Asymptotic analysis of an algorithm is to understand the space and time complexity of any algorithm. ,2.5, 12028,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",in which we get the best average and worst case of algorithm and according to that we can apply the suitable technique.,2, 12029,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",,0, 12030,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis refers to using substitution method or master theorem to find out the mathematical complexity of our algorithm,0, 12031,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",asymptotic analysis of an algo is is we measure a performance of algo in the term of different mathematical notation like big o and many more ,2.5, 12032,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm."," asymptotic analysis is the analysis of the code in terms of time complexity of the code.\nsome asymptotic notations - O(worst case), Theta(average case) and omega(best case)",2.5, 12033,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",min time omega\nmax time big oh\navg time theta\nsame as storage,2, 12034,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",they can never change the time.,0, 12035,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.",the analysis which uses asymptotic notations for telling the time complexity of given program or problem ,2, 12036,What is asymptotic analysis of an algorithm?,"Asymptotic analysis of an algorithm, refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case and worst case scenario of an algorithm.","asymptotic analysis are basically for the prefix , suffix problem in a given question.",0, 12037,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12038,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"BigOh(theta), bigoh(omega), smalloh(theta)",2, 12039,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,its calculate the running time of the algorithm,1, 12040,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"There are three asymptotic notations: 1) O(): The big O notation shows the worst case complexities, 2) theta: The theta notations show the average case complexity, 3) omega: The omega notation shows the best case complexities",2.5, 12041,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"In asymptotic notations we have Big oh notation which is the upper bound, Theta notation which is average, Omega which is the lower bound.",2.5, 12042,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"The asymptotic notations are bigoh(n),average o(n) and omega(n).",2.5, 12043,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,asymptotic notations is used to describe the running time of an algorithm .how much time algorithm takes with a given input 'n'. there are three notations. \nbig O \nbig theta\nbig omega.,2, 12044,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Big oh , omega ,theta.",2, 12045,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,-> Big oh - worst case time - the algorithm will not take more than this time\n-> theta - average case time - the algorithm will take average this much time\n-> omega - best case - the algorithm will take minimum this much time,2.5, 12046,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic notation is a mathematical notation used to analyze the time complexity and runtime of an algorithm for a large input,2.5, 12047,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,To study the time complexity and space complexity of a given problem we use notations that are known as asymptotic notations.,2, 12048,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Notation used to represent the time , whether it is linear , quadratic , cubic , and etc. .\nsome of the notations are :\n0(1) --> constant\no(n) --> linear",1, 12049,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations are which declares the meaning like ending the code, comparing the values, using brackets etc.",1, 12050,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"The asymptotic notations include Big O notation, theta notation and omega notation. These are used to denote the upper bound, lower bound and average time taken by any algorithm to function. eg O(nlogn), o(n^2)",2.5, 12051,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,asymptotic notations are :\nbig o \ntheta\nomega,2, 12052,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,We have various asymptotic symbol :-\n- Big O is for determining upper bound.\n- Omega is for determining lower bound.\n- Theta if for determining exact value.,2, 12053,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,1. best case analysis --> sigma Notation\n2. average case --> theta Notation\n3.worst case --> Big Oh Notation,2.5, 12054,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12055,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"they are omega, theta, big O.",2.5, 12056,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,examples are:\n1)Big O : f(n)<=g(n)\n2)Big Omega : f(n)>=g(n)\n3)Little o : f(n)g(n),2.5, 12057,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations gives us the information regarding the time and space complexities in various cases like the best , worse and the average cases. It helps us in comparing the efficiency of the program from various angles. It has O() for worst case , omega() for best cases and theta() for average cases.",2, 12058,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notation gives us the information about the space and time complexities in various cases, it could be the best, worst and average case. ",2, 12059,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"asymptotic notations like big O,omega and theta which represents the possible cases an algorithm can be solved. Big O represents best case scenario ,theta represents average case scenario while omega gives worst case scenario of an algorithm. It is identified by the functions used in algorithm which makes it easier to differentiate and to justifies particular scenario, for space and time complexities.",2.5, 12060,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,There are three asymptotic notations which are used for time complexity. These notations are:\ni) theta ( )\nii) O( ) \niii) omega ( ),2, 12061,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,to check lower bound of the solution. we use asymptotic notations. ,1, 12062,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Big O (O) -worst time complexity\nTheta- Average time complexity\nOmega- Best time complexity,2.5, 12063,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"The Notations that are used to denote the functions generated by the algorithms are knows as asymptotic notations. For example, Big Oh, Theta, Omega are the bounds of an algorithm, Big Oh denotes the upper bound, Omega denotes the lower bound and Theta denotes the average.",2.5, 12064,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"The notations generated to denote a function generated for the algorithms are called asymptotic notations. Omega, theta and Big oh are the bounds for an algorithm and denote lower, average and upper bound respectively.",2.5, 12065,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12066,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic notations mean representing the time complexity of an algorithm in the form of an equation (recurrence relation).,2.5, 12067,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,big O(n),1, 12068,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,The asymptotic notation is to represent the given problem in terms of time complexity. so that if there is chance to reduce its complexity then we can do it by applying suitable complexity. \n1)Big O notation\n2)theta notation\n3),2.5, 12069,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"asymptotic notations are mathematical terms which are used to analyze an algorithm. They are basically used to measure the time taken by an algorithm.\nsome common examples of asymptotic notations are :-\nBig-oh,\nBig- omega\ntheta ,etc. ",2.5, 12070,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12071,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic Notations are basically a method to represent the given Algorithm in Mathematical terms . Some specific notations are being defined to check or state whether the time complexity of an algorithm will be in which of the form of asymptotic notations.\nFoe ex; 1. Big-oh\n 2. omega \n 3. theta ,2, 12072,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations tells about the running time of a program. It tells us how much time can a program take to give an output. Asymptotic notations are divided in big O, theta and omega notations.",2, 12073,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"asymptotic analysis are big O, theta and omega.",2, 12074,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"These are a kind of approximations of time and space complexities which tells us the program that in how much time the algorithm is taking to run the program. These are denoted by some kind of symbols such as theta, Small and Big O. ",2, 12075,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations are the ways to represent the time complexity of a program. Example: bigO, omega(w), theta.",2, 12076,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Big O\ntheta\nomega\ndelta\netc.\n,2, 12077,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations are the notations used to express complexities, for example:\nBig O\nBig Theta\nBig Omega\nSmall O",2, 12078,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Analysis of an Algorithm can be done using notations that give us the information about the lower and upper bounds or exact constant time or space that the algorithm might take:\n1) big O notation - It specifies the minimum upper bounds of time and space that the algorithm might take.\n2) omega notation - It specifies the highest lower bound of time and space that an algorithm might take.\n3) theta notation - It specifies the average time and space that an algorithm might take.,2.5, 12079,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"it is a method for the notation of the time complexity of an algorithm. Big oh, theta, small o",2.5, 12080,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,big o - O : Worst Case Time Complexity \ntheta- Average Case Time Complexity\nomega- Best case Time Complexity,2.5, 12081,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,There are different types of asymptotic notations:\n(i)Big-O\n(ii)Omega\n(iii)Theta\n(iv)Small-o,2.5, 12082,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,There are various asymptotic notations like:\n1. Big oh (O) Notation: Calculates the upper bound time complexity. Shows the worst-case input scenario for a particular algorithm.\n2. Theta Notation: Calculates the lower bound time complexity. Shows the best-case input scenario for a particular algorithm.\n3. Omega Notation: Calculates the average case time complexity. Shows the median-case input scenario for a particular algorithm.,2.5, 12083,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,the asymptotic analysis use certain notation in which the time complexity of an algorithm can be written.\nthose notations are called as asymptotic notation.\nthere are major 3 notations:\n1)Big O\n2)Big omega\n3)Big Theta\n,2.5, 12084,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic Notations are:-\nBig of O\nBig of Theta\nBig of Omega,2.5, 12085,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12086,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations are in the form of Big O(O), small O(o) and omega.",2, 12087,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations are the representation in which the space and time complexities are analyzed and shown. Few asymptotic notations are Big O Notation, Theta Notation etc.",2, 12088,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"there are the representations to provide the time and space complexity of an algorithm. eg big Oh' (O) , theta, omega.",2, 12089,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations are a way to express the time complexity of an algorithm in computer science. They provide a formal way to describe the rate of growth of the running time of an algorithm as the size of the input increases. The three main asymptotic notations are Big O, Omega, and Theta, which are used to describe the upper, lower, and tight bounds of the time complexity, respectively.",2, 12090,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"big O notation, the big theta notation and the big omega notation",2, 12091,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"different notations such as big O, omega and theta , that represent best , average and worst complexity",2, 12092,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"There are big o , theta and omega.",2, 12093,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12094,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations are the notations to represent different test cases - the best case, the average case and the worst case. \nThese notations are theta, big-O notation and the omega notation. The theta is represented for average case, big-O notation for worst cases and the omega for the best test case.",2.5, 12095,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations include Big Oh, Theta, and Omega.\nBig Oh is for the worst case time complexity\nTheta is for the closest time complexity\nOmega is for the least time complexity",2.5, 12096,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,1)Big O\n2)Omega,2, 12097,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"notations used to measure time like big o , theta , omega ",2, 12098,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,It is used to describe the running time of an algorithm,1, 12099,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Its Mathematical notation to compare between two things which is bigger or lesser ,1, 12100,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,asymptotic notations are: \n1.best case ( omega notation)\n2. average case (theta notation)\n3. worst case (big O notation),2.5, 12101,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,The equations which we made as per the code for finding the running time of a algorithm are known as asympotic notations.,1, 12102,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptomatic notation means the amount of time the algorithm will take to run like eg. O(n) or Theta time.,1.5, 12103,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations are theta, ohm and O(big O) FOR best, worst and average case respectively.",2.5, 12104,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,It is a mathematical notations that represent the complexity or performance of an algorithm for large inputs or when the input size changes.,2.5, 12105,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,it is used to describe the run time of a given algorithm it gives how much time does a algorithm take to run,1.5, 12106,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic notations are: \n1. Omega\n2. Theta\n3. Big - O,",", 12107,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12108,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation., ,0, 12109,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"It is used to show the complexity of the algorithm in best , average or worst case.\nThere are three asymptotic notations :\n1. Big O notation \n2. Theta notation \n3. Omega notation ",2.5, 12110,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic notations are the mathematical notations used to describe the running time of an algorithm when the input tends towards a particular value or a limiting value.,1, 12111,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Mathematical notation used to describe running time of an algorithm.,1, 12112,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations are the notations which is widely used in order to identify the three cases of time complexity analysis of an algorithm, that are\n->Best case (thetha)\n->Average case(Omega )\n->Worst case(Big O) ",2.5, 12113,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"The asymptotic notations are o, big o, and delta. These are notations used to denote the best, average and worst case of an algorithm.",2, 12114,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic notations are \n1. BIG O (O) worst time complexity\n2. theta(N) Best time complexity \n3. average case time complexity\n,2.5, 12115,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic notations are mathematical notations that are used to analyze the runtime of a given algorithm for a large input. It helps us to compare the runtimes of different algorithms without actually calculating their runtimes manually. Asymptotic notations are used only for larger inputs. ,1, 12116,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"big O, small o, big omega, small omega",2, 12117,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,big o notaion ,1.5, 12118,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"There are symbols depicting the time complexity (Big O, Theta, Omega)",2, 12119,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"o(n),O(n),T(n),W(n)",2.5, 12120,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic Notations are the mathematical notations used to describe the running time of an algorithm when the input tends towards a particular value.,2, 12121,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,big O\ntheta \nomega \ntime complexities,2, 12122,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations are denoted using O ,THETA AND OMEGA.Big o and small o has f(n)g(n) and theta has c1n This one is used to show worst case scenario.\nTheta -> This is used to show the average case.\nOmega -> This is used to show best case.,2.5, 12242,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"These are notations used to represent the time and space complexities of an algorithm, these are:\n1. big Omega\n2. small Omega\n3. big O\n4. small O\n5. big theta\n6. small theta",2.5, 12243,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Big O :-For checking the upper bound\nBig Omega :- For checking the lower bound\nBig Theta :- Fore the average case scenario,2.5, 12244,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic Notations of an Algoithm basically defines the algorithm which tend towards infinity ,0.5, 12245,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12246,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,BigO : Average case\nBigTheta : Best case\nBigOmega : Average case,2.5, 12247,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic notations are a way of representing the time complexity of a particular algorithm by representing the time complexity in terms of big o and big omega where big o notation is considered to be the best as it gives the average of the time complexity of the algorithm. Generally we preffer to judge an algorithm in terms of its worst time complexity as by judging to algorithms by their best case will not give us the better result.,2.5, 12248,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,these are the tools which are used to analyze a particular algorithm\nBig O\nbig omega\nbig alpha,2.5, 12249,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"these are the symbols used to define the complexity of the algorithm in the best case , worst case and the average case, then there are loose bound and tight bound notationns\nthese are donated by symbols O, sigma and theta",2.5, 12250,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12251,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"These notations take use of special symbols how efficient a program is by considering 3 things best case(Omega), middle case(Rho) and the worst case( Big(O)) ",2.5, 12252,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12253,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Notations made to perform asymptotic analysis are asymptotic notations . They are:\n1. Big Oh: it is the tight upper bound.\n2.Big omega: tight lower bound.\n3. Theta: average case\n4.Little oh: loose upper bound.\n5. Little omega: loose lower bound.,2.5, 12254,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,asymptotic notation is when time complexity of an algorithm is expressed using theta and omega notation,2.5, 12255,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,this is used to define the running time of algorithm,1, 12256,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,various types of asymptotic notations are \n1) big O(n)-best case \n2) theta(n)-\n3) sigma (n)-worst case,2.5, 12257,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic notation are used to denote the time complexity of the program / algorithm:-\n1:- Big O \n2;- Big Omega\n3:- Big theta,2.5, 12258,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12259,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,asymptotic notation are the notation that are complex in nature,0, 12260,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12261,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic Notations are the calculations of time complexity of an algorithms.\nSome of them are:-\nBig Oh: Denotes the maximum time taken by the algorithm!\nBig Omega: Denotes the minimum time taken by the algorithm!\nBig Theta: Is the average time between the two!\n,2.5, 12262,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,asymptomatic notations are notations through which we can give time complexity or space complexity of algorithm,0.5, 12263,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12264,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12265,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"these are Big 0 , omega ie , low level and theta notation",2, 12266,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,i) Big O Notation : Upper Bound of algorithm c1g(n) > f(n)\nii) Omega Notation: Lower Bound of algorithm c2g(n) <= f(n)\niii) Theta Notation: main function c1g(n)> f(n) >= c2g(n),2.5, 12267,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Big O, Big Omega, Big Thetha",2.5, 12268,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12269,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12270,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"Asymptotic notations are mathematical notations to represent the complexity of the algorithm. The three most popular asymptotic notations are Big O, Big Omega and Big Theta notation. Other two notations are small omega and small o.",2.5, 12271,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,asymptotic notations are those which is used to represent the time and space complexity as a function of an algorithm.,0, 12272,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,big theta\nomega\n,1.5, 12273,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,,0, 12274,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Big oh of n\nTheta of n\nOmega of n\netc,2.5, 12275,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,Asymptotic notation is the mathematical term to measure the performance of the algorithm like optimization's in the term of time complexity and maintaining the system power and the space consumption of the server ,0.5, 12276,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"some asymptotic notations - O(worst case), Theta(average case) and omega(best case)",2.5, 12277,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,big oh\nomega \ntheata,2.5, 12278,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,big omega & big theta.,2.5, 12279,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,"the notation such as big o ,omega and theta are asymtotic notations and used for telling the time complexity for the algorithms ",2.5, 12280,What are asymptotic notations?,Asymptotic analysis can provide three levels of mathematical binding of execution time of an algorithm – (1) Best case is represented by Ω(n) notation. (2) Worst case is represented by Ο(n) notation. (3) Average case is represented by Θ(n) notation.,asymptotic notation are the notation which is ,0, 12281,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,,0, 12282,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure are those which store data in a linear form and not in the form of levels examples include array, stack,queue,linked list",2.5, 12283,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure ,data structure where elements are arranged linearly or sequencially like array ,queue",2.5, 12284,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear Data Structure are the data structures that store data in the memory contiguously, i.e, data is stored one after another",2.5, 12285,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure is a data structure that is represented in memory contiguously. For example, array is a linear data structure. Each element is represented in memory one after other. If one element is at 4000 then next element of array will be at 4001(in case of char array).\n\nNon linear data structure would be a linked list where different nodes are present at different location in memory and each one is linked using pointers to their memory addresses.",2.5, 12286,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structures are data structures used to store data in a 1-dimensional array. \nTraversing the total data structure will only take take O(n) time complexity.\nExamples : array,string",2.5, 12287,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure., linear data structure is one where data items are arranged in a linear fashion. each member is attached to its neighboring element. the structure allows single level data storage because the data elements are stored in linear fashion. ,2, 12288,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,,0, 12289,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure is a 1 dimensional data structure like 1-D array link list ,1.5, 12290,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure., Data structure where data elements are arranged linearly where each and every element is attached to its previous and next adjacent is called a linear data structure .,2.5, 12291,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure is basically the data structure in which the static memory is used to allocate space in the memory.\nex- arrays. linked list,2.5, 12292,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Data structures that use linear time complexity or we can say 0(n) this time complexity's to evaluate any algorithm . ,2.5, 12293,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure is the place which stores the data in a linear or single form.,2.5, 12294,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure include arrays ,2.5, 12295,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,a data structure which stores value in a single order are called linear data structures .\nex: array.,2.5, 12296,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Storing data/values in consecutive manner for example Array, Linked List.",2, 12297,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Data structures that store the data in a linear format are called linear data structures\n\nExample: array, Linked List",2, 12298,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"There are many data structures which stores the data in different manners or ways.\nLinear data structures, stores the data linearly in themselves. ",2.5, 12299,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structures are one dimention in space just like 1D array .,2.5, 12300,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure is the data structure which uses 1 dimension such as list, 1-D array, stack, queue,",2.5, 12301,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A linear data structure is a data structure where all the individual elements are arranged in a linear order so traversal and many other operations become very simple. \nIn linear data structures like an array or linked list the elements are connected in a single order without any branches . Every other element is only connected to two other \nelements unlike graphs and trees.,2.5, 12302,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,a linear data structure is one where the elements are arranged in a linear order. Examples of linear data structure- linked list,2, 12303,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Data Structures are basic unit to develop an algorithm.Data Structures which can be solved in linear time complexities are termed as Linear data structures. If the algorithm carries time and space complexity of O(n) it can be classifies under linear data structures. ,1.5, 12304,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structures are those data structures which occupy space in memory in form of continuous blocks. Some examples of linear data structures can be array, stacks, queues, etc. ",2.5, 12305,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"liner data structure take O(n) space , such as array , linked list , stack and queue .where our most of the operations take linear time to give us solution.",2.5, 12306,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Arrays , Linked list, stacks , queues which have elements in one line are linear data structures. searching in them is done in O(n) time. ",2.5, 12307,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A data structure that that has no child nodes(levels or heights) and can be stored in the form of a single 1-d array are called as linear data structures. For ex, linked lists, stacks, queues, arrays etc.",2.5, 12308,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A structure which has no child noes ( Height of the tree is 1), this can be stored in a 1-D array . Examples are linked lists and arrays",2.5, 12309,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure are those data structure which store data in only one direction that is either row wise or column wise. like array ,vector, linked list etc. here we can see the array, linked list store data one by each node of the linked list contain the address of the other and we do nt find two path (either left or right) while traversing from one node.",2.5, 12310,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A data structure that stores data linearly (adjacent to each other) in continuous memory location is known as linear data structure.,1.5, 12311,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure are structures in which the tasks are performed one by one linearly,2.5, 12312,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure involves simple data structure like sorting ,searching .",2.5, 12313,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure is a data structure which is in linear form in memory and can be traversed linearly in one - direction (parallel and anti-parallel).\nevery memory block is linked to only one memory block.\ncommon examples are array, linked list etc. ",2.5, 12314,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,In data structure tasks are performed linearly one by one.,1, 12315,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A linear data structure is a data structure which takes time complexity of O(n)\nFor ex: 1. 1-D Array\n 2. pointers\n 3. linked list,2.5, 12316,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure is a data structure in which the elements are arranged linearly. All the elements can be traversed in one go.,2.5, 12317,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,elements are in liner order in linear data structure like array.,2.5, 12318,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"The data structures which can be traversed only at a 1 dimensional plane or they are 1 D in nature are know as Linear data structures .\nEg: 1-D array, Linear Linked List",2.5, 12319,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Liner Data Structure are the data structures which has only one link to the next element.\n1. array.\n2. linked list,2.5, 12320,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"a linear data structure has only a single link to the next element like array, linked list,etc.",2.5, 12321,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A data structure in which the data is stored in a linear format such as an array or a linked list.,2.5, 12322,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Those data structure that has no ambiguity while accessing the next or previous element as they are arranged in a linear format , one after another. are called linear data structure. They have only one element succeeding or preceding them.",2.5, 12323,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure includes arrays, queues, string, linked list. In linear data structure you perform operations like merge sort, bubble sort, quick sort, etc",2.5, 12324,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure is one that stores data linearly. \nE.g.: Array, Linked List.",2.5, 12325,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A data structure which store values linearly one by one as in an array,is known as linear data structure.",1.5, 12326,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structures are those that stores the data in linear form where a chain like memory is formed in and data are linked to each other in successive format. Example queue, linked list, etc.",2.5, 12327,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is such that that can be implemented using one\nEg: Array, Stack, Queue",2.5, 12328,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is a type of data structure that can be implemented in 1D.\nEx: Array, stack, queue, etc.,",2.5, 12329,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"a linear data structure is a data structure which stores data in 1-D such as arrays, stack, queue, etc.",2.5, 12330,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure are those data structures which works on a single level. They do not form multiple levels. They store the data in 1-D such as queue, stack, etc.",2.5, 12331,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure is defined as a type of data structure that stores data or information one after the other linearly. Ex :Arrays,2.5, 12332,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Data structure which stores data linearly is called linear data structure.,2.5, 12333,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure.\n\n,2.5, 12334,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,it is a data structure with linear data.,2.5, 12335,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structures are basic data structures which do not have children or branches. The elements are inserted in a sequence. Ex-> Array, Linked list, etc.",2.5, 12336,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structures are the data structures in which the data is stored in a linear 1-D format. In these data can be stored in only a unidirectional way. Eg. - array, vector. ",2.5, 12337,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,the data structure with only 1 hashing involved are known as linear data structure,2, 12338,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure are those which occupies linear space in the memory. For example - Arrays, Linked List",2.5, 12339,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structures are data structure that go in only one direction. You don't have different paths from a particular point. Arrays, linked lists, vectors are linear data structures. Trees, graphs are non linear data structure",2.5, 12340,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure refers to the approach to any solution within linear time complexity. Example: Linear search,2.5, 12341,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,data is stored linearly,2.5, 12342,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A linear data structure is where data is stored linearly with the neighbor element connected to each other,2.5, 12343,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,data structure which have fixed size and we can update it that called linear data structure,2.5, 12344,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structures are those where data is stored in a linear format. example linked list, stacks and queues",2.5, 12345,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A data structure that could be defined in which items are inserted or arranged in a linear order. Example- Array, linked list.",2.5, 12346,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Data structures that take the input value linearly and eject the values in the same way are linear data structures. Example of such data structures are as FIFO (first in first out), LIFO (last in first out)",2.5, 12347,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is a type of data structure which perform its operations linearly like insertion, deletion, updating and searching/",2.5, 12348,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.," In the Linear data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure. In linear data structure, single level is involved.",2.5, 12349,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,it is a data structure in which data is arranged linearly like array and linked list,2.5, 12350,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A linear data structure is one that stores data linearly in the memory. An array is an example of a linear data structure. ,2.5, 12351,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure are the type of data structures in which the elements are stored in sequential memory locations. One can traverse through all the elements knowing only the location of first element in the structure. For example: Arrays.,2.5, 12352,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"data structure that stores data sequentially, after after another\nfor example: queue, vector, lists. etc",2.5, 12353,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure : array ,1.5, 12354,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is one where data items are arranged in a linear fashion. Each member is attached to its neighboring elements. The structure permits single-level data storage because the data elements are stored in a linear fashion. The data can be traversed in one run. \ncertain examples of linear data structure are-stacks, linked lists, queues etc.",2.5, 12355,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,It is a data structure where elements are arranged sequentially or linearly.\nFor example arrays. ,2.5, 12356,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure is a data structure in which the elements or the required data are kept linearly for example:\nArrays, Queue, stack, vector etc.",2.5, 12357,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is a data structure that can only be traversed unidirectionally. Eg: Arrays, linked list, etc.",2.5, 12358,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,a linear data structure is a one in which the data is allocated in such a way that we traverse the data in linear fashion like (one after the other) example in an array rather than jumping from one memory location to other. ,2.5, 12359,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure. Here can traverse all the elements in single run only. Linear data structures are easy to implement because computer memory is arranged in a linear way. Its examples are array, stack, queue, linked list, etc.",2.5, 12360,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"data structures that store information one after the other in the memory.\neg: array, string",2.5, 12361,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,in which each data are4 connected one after the other ,2.5, 12362,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"In a linear data structure, the elements are stored in a continuous memory space",2.5, 12363,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structures like 1d array,stack,queue",2.5, 12364,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A linear data structure is one where data items are arranged in a linear way. Each member of the data structre is attached to its neighboring element. ,2.5, 12365,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structures:\narray\nlinked list\nstack\nqueue,2.5, 12366,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure stores data in 1D manner.Example-array,vector,stack,queue",2.5, 12367,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,a linear data structure is one that stores single type of data such as array,2.5, 12368,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear Data Structure has lesser time complexity ,1, 12369,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure is arrangement of data where data is arranged in linear way. ,2, 12370,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure is arrangement of data where data items are arranged in a linear way.,2, 12371,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure is the structure in which node has only one child or one branch . You can go only in one direction.,2, 12372,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A linear data structure is a data structure having elements arranged in a linear fashion \nEg - Array,2, 12373,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure are the data structure that performs operation in single dimension such as array , strings , stack , queue and etc.",2.5, 12374,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,having elements arranged in linear fashion.,2, 12375,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Data structures that are linear in size like linked lists are called linear data structures,2.5, 12376,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,The data structures in which the data is stored in a sequential order is a linear data structure. For example: arrays.,2.5, 12377,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear as the name only suggest it is arranging something in the linear or the sequntial order \nso in linear data structure the data is arranged in the linear order,2.5, 12378,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,The linear data structure includes:\n1-Stack\n2-Queue\n3-Lists,2.5, 12379,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,all data items are connected in linear manner example array,2.5, 12380,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is the one in which we can iterate through the whole data without without coming back to an element which has already been iterated through. For example, an array, a singly linked list, a hash table. Here the length of the data structure is the number of hops or iterations it takes to reach from the starting element to the ending element.",2, 12381,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"like arrays, linked list, that data structure that can be useful linearly in both its work and while iterating ",2, 12382,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear Data Structure are Data Structure which have continuous memory for storage\nfor eg. array , linked list etc..",1, 12383,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure means a structure which is connected linearly to each other in some manner . for example an array is connected with indexes starting from zero whereas a linked list unlike array is connected through addresses of a pointer index.,1, 12384,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure is the data structure where data items are arranged in a linear fashion. Each member is attached to its neighbouring elements.,1, 12385,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,data structure in which data is stored in linear way for example array and lists.,1, 12386,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,in linear data items are arranged in a linear way. and the data can be traversed in one run.,2, 12387,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Data Structure In 1 D is known as linear data structure. It stores data horizontally memory blocks. These group of memory blocks can also be called an Array. A single iterator is used to traverse memory chunk and assign the values to the memory blocks.,1, 12388,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure stores data in a one dimensional or linear fashion. Examples of linear data structures are arrays, stacks and linked lists.",1, 12389,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"it is a type of data structure in which the data is stored linearly example- array, stack, etc.",1, 12390,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is defined as a structure in which the data is arranged in linear order. Ex : array, list\nExample of non linear ds: Trees",1, 12391,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structures are data structures which store data in contiguous memory locations. Eg: Array\nThese can be traversed linearly, in a specific order in which the data is saved. ",1, 12392,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,a data structure in which the elements are organized in a linear manner.ie. the elements are arranged one after the other in a specific order.\n,1, 12393,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A linear data structure is a data structure in which each data value is linearly connected with the one that precedes and suceeds it . ,2, 12394,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure are data structures in which data is stored in a line/linear manner. For example- array, vector, list.",1, 12395,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,all elements are stored at the same level in linear ds like arrays and linked lists.,1, 12396,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure is linearly connected to all other nodes of the data structure as in i.e linked list.,1, 12397,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A data structure in which the data is stored one after another such that every element is connected to just one element which is it's intermediate.,2, 12398,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.," inputs which are provided to it . There are three types of notations i.e., big O, big Theta (Θ), and big Omega (Ω).",2, 12399,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structures are one dimentional data structures. Eg: Lists, 1-d array ",1, 12400,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structures are data structures in which data elements are stored in a linear sequence.\n1 Arrays\n2 linked list\n3 stacks\n4 queue,2, 12401,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Arrays, vectors, stack, queues are all linear data structure. We store the elements linearly means in a line and all the algorithms we apply on linear data structure are in a line only like traversal, searching, sorting etc. They have linear time complexity - O(n).",1, 12402,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure is ,1, 12403,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,We can define Linear data structure -> the adajacents elements in linear data structure are connected lineraly to each other .\nex. Linked Lists,2, 12404,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is one which stores data in a linear manner.\nEx-Array, List",2, 12405,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure is a way of storing data in which storage buckets or connected linearly and no multi-dimensional is present after fully creation of data structure.,2, 12406,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structures are the data structures in only one dimension.\n Some of the examples are 1D array, stack, queue etc.",2, 12407,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure stores data in contiguous memory locations which means that they are stored in memory in adjacent memory places.,2, 12408,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"a linear data structure is a 1D data structure like a list, array, linked list, queue and many others in which one parameter like height or width is set to one.",1, 12409,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"The data structure that use linear structure format like stack ,linked list, queue . These data structure traverse, search linearly.",2, 12410,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"The data structures which can imagined to be placed in a line.\nEx, Array, Stack, Queue.",1, 12411,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Asymptotic Notations are symbols used to determine the time and space complexity of the algorithms.\nThey are-\n1.) Big Omega Notation\n2.) Big O Notation\n3.) Theta Notation\n4.) Small Omega Notation\n4.) Small O Notation,1, 12412,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure refers for finding elements one by one and comparing one by one , not optimal ",2, 12413,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"data structures which are uni directional and doesnt have any branching. like 2d arrays, linlked lists.",2, 12414,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure is linear function who function create linear structure ,2, 12415,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure help us into perform some function in a linear format for example we can use linear data structure using array and we can not use linear data structure using matrix ,1, 12416,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure is a data structure where all the data can be iterated over linearly, it will take n iterations, n being the size of the linear data structure. All the data is in a line, like in arrays, stacks, queues, lists.",2, 12417,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure includes array, linked list etc ",1, 12418,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure are termed as array , linked list which has the address of the next node in a linear way, such as we can move to other elements of the data structure in a linear way",2, 12419,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is one which has no branches, one node is connected is at most connected to 2 nodes.",1, 12420,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"it is a data structure which is linear in size example linked list, arrays",1, 12421,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure such as array have only one way implementation of operation on them . ,1, 12422,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A linear data structure is used to store data in a linear fashion as in array where each element is stored as contiguous memory in a linear way.,1, 12423,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure are like linked list , arrays . that stores values ",1, 12424,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is the one that stores the data linearly and there is only one dimension when trying to access the data. For example a single dimensional array, a stack, a queue or a linked list are all linear data structures. As we can move in only one dimension in these data structures. ",2, 12425,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,where data items are arranged in a linear fashion,1, 12426,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure are the data structures that stores data linearly or we can say that one by one .For example, suppose any object comes first then we will place it at first position and if after that any object will come then we will place it at second position and so on.\n ",2, 12427,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A data structure in which we can traverse in only one direction i.e we don't have other paths .. eg. arrays , stack , queue.",2, 12428,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Data Structures in which we can store data linearly is called linear data structure. Examples of linear data structure are arrays, linked list(doubly linked list, circular linked list etc.)",2, 12429,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure are the ones that travel in one direction as if walking on a line. for example an linked list is a linear data structure where the traversal happens in one direction unlike a tree where the movement from the root nodes can go in either of the direction of its child nodes.,1, 12430,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is which is of linear size eg - arrays, linked lists and only insertion operation is performed.",1, 12431,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"It is a data structure which stores the data in linear format that is it assigns a value to every corresponding index in a straight line .For example: Array ,vector ,etc. ",1, 12432,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"liner data structure is a way of storing the data in way that the time complexity is linear while doing operations such as inserting, deleting, traversing. For example arrays.",1, 12433,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structures are the data structures that move only in one direction and work linearly eg: arrays. ,1, 12434,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure are those data structures which store data in the system on contiguous memory locations(in a linear fashion). The best example of the linear data structure is array which store the data on continuous memory locations and hence it become very easy to access the data in O(1) time complexity and also we can decide according to the row major order.,1, 12435,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,a linear data structure is a data structure in which data is stored 1 dimensionally eg. arrays stacks queues etc.,1, 12436,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,In linear data structure there is no branching among the elements and the traversal is in a linear order where each element is denoted by a specific index for example arrays.,1, 12437,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,array is an example of linear data structure,1, 12438,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear Data Structure helps stacking data in a linear manner. ,1, 12439,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is a data structure which stores data in a single dimension and a single row. eg Array, Vector",1, 12440,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is a one which stacks data in a linear manner. For example, each pointer points only to one particular address of the other data value.\nExamples- Stack, Queue. linked list",1, 12441,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure are the part of data structure which deals with arrays in linear form like 1d array ,1, 12442,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure are one dimensional data structures elements linked to each other. They are stored in a line that is linearly in the memory for example arrays, stack , queue etc. Levels or hierarchies aren't present. ",1, 12443,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structures is a collection of data which can be easily accessed through the use of pointers and indices.,1, 12444,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure is a structure which stores data linearly like array, stack, queue etc.",1, 12445,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,,0, 12446,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure is the data structure where the data can be iterated linearly,1, 12447,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,in linear data structure data or the items are arranged linearly in a straight line ,1, 12448,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structures include types like singly linked lists, doubly linked lists , queues, stacks, heaps etc. which avoid a hierarchical structure using a data type. ",1, 12449,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure,1, 12450,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A linear data structure are like: arrays strings etc.,1, 12451,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure is a structure of data where data are arranged in a linearly. Each member is attached to its neighboring elements. This data structure permits single-level data storage and can be traversed in one go.,1, 12452,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A linear data structure in which data is arranged in a linear way.,1, 12453,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,a linear data structure are the one where data items are arranged in a linear fashion. Here each member is attached to its neighboring element.,1, 12454,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A data structure in which the arrangement of data items is in linear order that is one after the other and only one to one that data structure is known as a linear data structure. for ex. array, linked list",1, 12455,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"This data structure stores the data in linear fashion like arrays, stacks, queues, etc.\n",1, 12456,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A data structure which stores its data in a chain or in linear manner . Exampe- stack, queue, array",1, 12457,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,An example of a linear data structure is an array ,1, 12458,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure which we can stored in a linear manner. like array, string etc.",1, 12459,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure is one where all data items are arranged in linear fashion i.e in a single row\nfor Eg: Arrays,Strings",1, 12460,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structure is a data structure which can be implemented in linear time.,1, 12461,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"It is a type of data structure in which time complexity is always constant . Some of its examples are linear search , binary search.",2, 12462,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure is data structure in ehich we can traverse from start to end in a sigle direction.,1.5, 12463,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Data structure where data elements are arranged sequentially or linearly where each and every element is attached to its previous and next adjacent is called a linear data structure. In linear data structure, single level is involved. Therefore, we can traverse all the elements in single run only. Linear data structures are easy to implement because computer memory is arranged in a linear way. Its examples are array, stack, queue, linked list, etc. \n",1.5, 12464,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,a data structure in which data is stored only in one direction such as array,2, 12465,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structures are those data structures that share continious memory location\n example of linear data structure is array,2, 12466,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure is in which we form operations in 1d sequence and it types are array,string and many linear data structure ",1, 12467,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Asymptomatic analysis gives us an a definite view on the Time complexity of an algorithm. Various different functions depending on how many times they run. increase the time complexity. Asymptomatic analysis gives us a mathematical view to define the worst and best case scenarios on the efficiency i.e. Time complexity and space complexity of an algorithm. Ex- O(n),Theta(n).O(n^2).etc",1, 12468,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,It has data elements arranged in sequential manner and each member is connected to its previous and next element.,1, 12469,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structures like lists - arrays, linked lists etc. These are basically storage data structures which store multiple values while utilizing space in linear pattern, repeating at fixed intervals .i.e. according to its fundamentals.",2, 12470,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A liner data structure stores data linearly in a sequence.\nExamples of linear data structure: \n1) Array\n2) Linked List\n3) Stacks\n4) Queues,2, 12471,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure are the primitive dat structures present in the respective programming language using which other data structure are implemented or generated.\nfor eg, array, linked list etc.",1.5, 12472,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,The data structures having a linear sequence.The linear data structures we have studies are as follows:\nArray \nLinked list\nStacks\nQueues\n,1, 12473,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,These are the primitive data structure which can be used to generate new data structure.\neg : array ,1, 12474,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,,0, 12475,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure are structure like array in which data is stored linearly and can be accessed using index or pointers,1, 12476,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"is a base for all the other data structures, for example, array is a data structure from which we can derive other data structures",1, 12477,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structures are arrays. They are the base for complex data structures. ,1, 12478,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"in linear data structure the data in connected or stored in linear fashion.\nex. linked list, array etc.",1, 12479,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,a linear data structure is type of data structure in which the elements are connected in a linear fashion. Each element is connected to only one element which is generally the next element. Examples are-linked list.,1, 12480,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"a linear data structure is a type of data structure in which data is stored in a connected fashion,i.e. linearly.for example- linked list.",2.5, 12481,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Data structures which store data in a linear manner are called linear data structures. example stacks, queues",2.5, 12482,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"In linear data structure the data is stored one after another so if we have to go to last data we have to go through every stored data eg-array,linklist.",2.5, 12483,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,,0, 12484,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Data structure that can be traversed in a linear order, example arrays, linked lists.",2, 12485,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"The data structure which does one thing that is to store or pass the data. Examples of linear data structure is array, however linked list is not a linear data structure as it not only store the data pass also stores the information of the next the node.",1, 12486,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,These are the data structures which stores data in continuous memory blocks. example: array,2.5, 12487,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structures such as array ,2, 12488,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear Data Structure is used for searching linearly ,1, 12489,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure is a 2d type data structure \nfor example array,linked list",1.5, 12490,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Data structures that occupy continuous memory locations in RAM are called linear data structures. Ex stack, queue. ",2.5, 12491,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is the data structure which stores data in a linear fashion for example arrays, linked lists, stack, queue etc.",2.5, 12492,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,,0, 12493,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,a linear data structure is one dimensional data structure which generally save the data in consecutive blocks of memory ,2.5, 12494,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structures are those data structures that creates a linear system of usage, for example linked list is a data structure that contains a node which is made of a data variable and a pointer variable associated to it which gets used to linked it to an another node. The visual representation of a linear data structure is a non loop containing structure that allowes traversing either of the two sides and not randomly.",2.5, 12495,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Array, vector, Linked List are Linear Data structures.",1.5, 12496,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure is in which that occupy continuous memory location in ram ,2.5, 12497,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure., Data structures which store the data in continuous or simultaneous memory locations are linear data structures.,2.5, 12498,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"list,\nqueue\nstack\nlinear data structure is one in which the data structure is only in 1d\n",2, 12499,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"In linear data structure the collection of nodes is linear, data is present in more linear form",1.5, 12500,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure means data structure in 1D form\ni.e int, double, char, string etc",1, 12501,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Arrays , linked list , stack , queue are the linear data sturcutre in which data is in linear form i,e in sequence not in graph form.",2, 12502,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,,0, 12503,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linked list ,sorting , searching are the linear data structure",1, 12504,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure are such as tree graph array \nthese are know as linear data structure ,0, 12505,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Linear data structures are data structures arranged in a line-like structure where the elements are linked together in a linear(line) manner. \nSome of them are:-\n1. Arrays\n2. Linked Lists\n3. Queue,2.5, 12506,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linear data structure are those in which data is entered in linear form for ex - stack, queue ",2, 12507,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,,0, 12508,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A linear data structure is a data structure in which a a data structure in linear form,1.5, 12509,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure reffers to the sorted structure whose searching complexity will be O(n). ,1.5, 12510,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,Arrays and Linear lists are linear data structures used for storing data in a linear (line-wise) fashion\nFoe e.g.: arr[5]: In this data is stored from Indexes 0 to 4.,2.5, 12511,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structure can be traversed linearly like lists, arrays, etc.",1.5, 12512,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure is linked list etc,1, 12513,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,,0, 12514,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,A linear data structure is a data structure which is continuous in nature. An example of the linear data structure is an Array.,2, 12515,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"Linear data structures are the those arrays, stacks and queues, heap.",1, 12516,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,arrays- used to store data ,0.5, 12517,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,,0, 12518,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"A linear data structure is a one dimensional structure.\neg. queue, stack, array.",2, 12519,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure is used to store the data in a data base in the form of different variable ,0, 12520,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"data structures which are arranged in a line structure are linear data structure.\nsome examples - queues, stacks. arrays.",2.5, 12521,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structure is saving in memory continues way that way linear data structure like array ,2.5, 12522,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,"linked list, array, stack ,queue etc.",1, 12523,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,the data structures which are not derived from another data structures like \n1)array\n,1.5, 12524,What is linear data structure?,A linear data-structure has sequentially arranged data items. The next time can be located in the next memory address. It is stored and accessed in a sequential manner. Array and list are example of linear data structure.,linear data structures can be the processes in which time complexity is very small,0, 12525,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Searching , sorting, adding elements, deleting elements",2.5, 12526,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"operations that can be performed on a data-structure are insertion, deletion, searching, merging, sorting",2.5, 12527,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"common operation that can be performed on a data structure are insertion ,deletion ",2.5, 12528,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"1) Insertion, 2) Deletion, 3) Searching and Retrieving, 4) Sorting, 5) Updating",2.5, 12529,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Insertion- at start, at end, at given index.\nUpdate- change the value of a given key to new value\nDelete- delete a particular element from the data structure.\nSort- sort the data present inside a data structure\nSearching- searching a given value inside the data structure.",2.5, 12530,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The common operations that can be performed on a data structure is searching ,deletion, update, retrieving, inserting",2.5, 12531,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,commom operations that can be performed on data structure are :\nsearching \nsorting \ninsertion .,2.5, 12532,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,. Seaching\n. Sorting\n. insertion \n. deletion,2.5, 12533,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on a data structure are insertion, deletion, swaping, traversing, searching, sorting and many more. ",2.5, 12534,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1. traversing\n2. insertion\n3. sort\n4. update\n5. stack,2.5, 12535,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common operations are as follows-\n1. creation \n2. implementation\n3. Display,2.5, 12536,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common operations that can be performed on a data-structure are :-\n1) Insertion \n2) deletion \n3) selection \n4) sorting \n5) Merging ,2.5, 12537,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The common operations are storing data, transferring data, retrieving data, insertion deletion in the given data.",2.5, 12538,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on a data structure are\nAddition of data\nDeletion of data\nTraversal of data\nStoring data in a apt, easy to access format ",2.5, 12539,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,common operation that can be performed on data structures are :\n- traversal\n- deletion\n- insertion,2.5, 12540,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common Operation on the data Structure :-\nInsertion, Deletion, Traversal, Display, Sorting.",2.5, 12541,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1. Insertion Of data\n2.Searching for data\n3. Retrieval of data if required data found after searching\n4.modifying the data,2.5, 12542,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,,0, 12543,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"some operations like searching ,sorting, insertion ,deletion, heapify, construction of trees ,forming recurrences ,finding shortest path of all in graph",2.5, 12544,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on data structure:\n1)Searching: Linear Search, Binary Search, Median Search\n2)Sorting: Bubble Sort, Merge Sort, Insertion Sort, Selection Sort\n\n",2.5, 12545,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Searching , Insertion , Deletion , Dividing , Merging , Reversing ,Traversal.",2.5, 12546,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"the common operations that can be performed on searching , sorting , deleting ,merging, traversals etc.",2.5, 12547,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,common operations performed on data structres :\ninsert: used to add particular element into the data structure\ndelete: used to delete a particular element from the data structure\n\n,2.5, 12548,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common operations that can be performed on a data structure are :\ni) traversing\nii)insert\niii) delete,2.5, 12549,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insertion , deletion , traversing , reversal , search",2.5, 12550,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Some common operations are traversal , insertion and deletion.",2.5, 12551,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Searching, Traversal, Sorting, Insertion, Deletion etc",2.5, 12552,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Searching, insertion, deletion, sorting, Traversal, etc.",2.5, 12553,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,the common operation that can be performed on data structure are :\n1) pushing an element in the provided data structure.\n2)popping the element from the given data structure.\n3)getting the first and last element from the given data structure.\n4)Getting the address of the element from the given data structure.,2.5, 12554,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on a data structure: insertion, deletion, searching, sorting (in some data structures).",2.5, 12555,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Some common operations which can be performed in data structure are searching and sorting like depth first search or breadth first search, we can calculate minimum cost problems, minimum /maximum distance problems, travelling salesman problem, inserting an element, deleting an element and so on",2.5, 12556,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1) inserting \n2)deletion\n3)searching \n4)sorting\n,2.5, 12557,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,the common operations that can be performed on any data structures are :-\nsearching an element\nextracting an element \ninserting an element,2.5, 12558,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"searching, sorting ,depth first search and breadth first search ",2.5, 12559,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Some common operations that can be performed on a data-structure are :\ninsertion, deletion, sorting",2.5, 12560,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"adding an element, removing an element, searching or sorting in data structure.",2.5, 12561,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,searching and sorting are common operations that can be performed on a data-structure.\n,2.5, 12562,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,The common operations are :\nsearching and sorting ,2.5, 12563,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common operations that can be performed on a data-structures are:\n1. searching \n2. sorting.,2.5, 12564,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,various operations include:-\nsearching\nsorting \ndeleting\ntraversing\nadding or inserting,2.5, 12565,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Searching, sorting, insertion, deletion are some of the common operations that can be performed on a data-structure.",2.5, 12566,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"A data structure can be used to store, search and retrieve and delete if required, any piece of information. Various data structures can be used in various situations to perform the mentioned operations.",2.5, 12567,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Sorting, searching, data storage and operations like arithmetic operation etc. ",2.5, 12568,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Some common operations that can be performed on data structures are:\n- Insertion\n- Deletion\n- Sort\n,2.5, 12569,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Various operations that can be performed on a data structure are arithmetic operations , boolean operations , relational operations like or( | | ),and( && )",2.5, 12570,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on a data structure are:\n1. Insertion\n2. Deletion\n3. Updating\n4. Calculation, etc.",2.5, 12571,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operation carried out on Data-Structure are storage, insertion, deletion, and calculation or computation.",2.5, 12572,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common operations that can be performed on data structure are:\nInsertion\nDeletion\nSelection\n,2.5, 12573,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1)Searching\n2)Sorting\n3)Deletion\n4)Insertion,2.5, 12574,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations such as searching, sorting, insertion, deletion.",2.5, 12575,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Data structures are used to store data and hence the common operations performed on these are storing the data, searching the element and keeping the record by adding or deleting nodes.",2.5, 12576,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common Operations on data structures.\n1. Traversal\n2. Insertion\n3. Deletion\n4. Update,2.5, 12577,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Traversing ,Searching ,Sorting, Deletion ,Insertion",2.5, 12578,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"searching, sorting, deleting, inserting, merging etc.",2.5, 12579,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Insert, Delete, Update are the most common operations",2.5, 12580,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, and searching.",2.5, 12581,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"implementation of linked lists, stacks, queues, graphs, and various types of trees including heaps ",2.5, 12582,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common operations that can be performed on a data-structure are:-\n1. Insertion\n2. Deletion\n3. Searching\n4. Finding and extracting minimum and maximum,2.5, 12583,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Accessing the elements\nInsert\nDelete\nUpdate\nDisplay,2.5, 12584,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1)Insertion\n2)Updation\n3)Deletion\n4)Searching,2.5, 12585,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"add data , remove data , find frequency of element , add two together , convert from one data struct. to another",2.5, 12586,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Searching Sorting Insertion\nDeletion,2.5, 12587,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Insertion , traversing and deletion operation ",2.5, 12588,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,common operations that can be performed on a data structure are\n1.input\n2. output\n3. search,2.5, 12589,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The common operations that could be performed are insertion, deletion, union , find min or max.",2.5, 12590,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Operations that can be performed on a data structure are searching anything in data, sorting the data accordingly (increasing or decreasing), Insertion of elements into the data structure or deletion of elements from the data structure.",2.5, 12591,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on a data-structure are insertion, searching, sorting, deletion , updating etc.",2.5, 12592,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,The operations are :-\nINSERTION\nDELETION\nUPDATION ,2.5, 12593,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insertion ,deletion, update ,modify ",2.5, 12594,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,The following operations can be performed on a data structure: \n1. Insertion\n2. Deletion\n3. Search,2.5, 12595,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Searching, Insertion, Deletion, Sorting are some common operations that can be performed on a data structure. ",2.5, 12596,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, iteration",2.5, 12597,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common operations performed on a data structure are:\n1. Insertion \n2. Deletion\n3. Searching\n4.Modification\n,2.5, 12598,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"searching,sorting,insertion,traversal,deletion etc.",2.5, 12599,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Searching, sorting, traversal etc. ",2.5, 12600,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Following are the common operations that can be performed on a data-structure:\n->Insertion\n->Updation\n->Deletion\n->Traversal,2.5, 12601,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The common operations that can be performed on a data structures are sorting, storing, merging, insertion, deletion, etc.",2.5, 12602,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,THE common operations that can be performed on a data structure are \n1 deletion\n2 union\n3 traversal\n4 searching \n5 sorting\n,2.5, 12603,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common operations are:\n1. Traversing\n2. Searching\n3. Sorting\n4. Insertion \n5. Deletion,2.5, 12604,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,we can add or delete items. we can traverse the data structure ,2.5, 12605,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,,0, 12606,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1. Insert Data\n2. Delete Data\n3. Move Positions\n4. Edit,2, 12607,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,common operations are adition subtraction multiplication accessing the elements,2.5, 12608,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,some common operations that can be performed on data structures are:,2.5, 12609,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"common operations like insertion merging searching , sorting can be performed on a data structure",2, 12610,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,we can perform insertion deletion and searching operations on a data structure,2, 12611,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,insert or store data\ndelete\nupdate data\nsearch an element stored in data structure,2, 12612,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Insertion\nDeletion\nSelection\nSearching,2.5, 12613,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Searching, Sorting are the operations that can be performed on a data structure. ",2, 12614,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations are:\nSearching, Sorting, insertion of new data.",2.5, 12615,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insertion, deletion , finding maximum and minimum element.",2, 12616,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Sorting\nSearching\nTraversing,2.5, 12617,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,The common-operation that can be performed on a data-structure are taking input and printing outputs.,2.5, 12618,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"searching, sorting, inserting, deleting",2.5, 12619,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Insertion and deletion at any position , finding element are common operations that can performed on a data structure",2.5, 12620,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Following operations can be performed on a data structure:-\n1. Insertion\n2. Deletion\n3. Traversal\n,2.5, 12621,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,operations performed are searching sorting insertion,2.5, 12622,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,The common operations that can be performed on a data-structure are:\n1-Traversal\n2-Insertion\n3-Deletion\n4-Searching,2.5, 12623,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Search , Insert , Delete",2.5, 12624,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Searching, sorting, heapify or then making it to a min heap or a max heap, get minimum, get maximum",2.5, 12625,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"adding, deleting a particular thing, updating, forming its structure\nwell like trees in case of trees we can add a node and delete a node \ncan be done using traversing a node, here a node can be anything that you wants to represent.\naccording to our need we can perform various operations.",2, 12626,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,->Insertion\n->Deletion\n->Updating\n->accessing data,1, 12627,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,searching\nsorting\npossible shortest path and many more,1, 12628,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations on a data structure are traversal,insertion,deletion,searcing,sorting and merging.",1, 12629,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,insert-insert the element\ndelete-delete any element\nupdate-update element with another element,1, 12630,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,sorting and searching.,1, 12631,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common operations such as remove and insert can be performed on data structure. Commands used in STL to this is pop and push ,1, 12632,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on data structures are insertion, deletion, updation, searching etc.",2, 12633,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"common operations that can be performed are insertion, deletion, updation.",1, 12634,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Insertion\nDeletion\nsearching\nSorting,2, 12635,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on data structures are Searching , Sorting and traversal. Some types of searches are: Binary search, linear search, etc. Some types of sorting are: selection sort, merge sort , quick sort, etc. Based on the time complexities of these algorithms in the best and worst case , the appropriate searching , sorting algorithm is chosen.\n",2, 12636,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,searching \nsorting\ninsertion deletion,2, 12637,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1) Traversal/Printing\n2) Delete\n3) Insertion (In most cases at any particular position too)\n4) Updating \n,1, 12638,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Sorting Searching,1, 12639,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1. Insertion\n2. Deletion\n3. Traversal,2, 12640,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"operations that can be performed are: searching, sorting , deleting , input of nodes etc.",2, 12641,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations include entering data, deleting data ,searching, sorting, merging",2, 12642,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Linear data structures are those stores data in a linear manner such as array ,vector, stack ,queues , in these the data in stored one by one .",2, 12643,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Insertion \nDeletion\nSearching ,2, 12644,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Traversing \nsearching\ninsertion \ndeletion\nupdate,2, 12645,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"1. We can find sum of an array\n2. Maximum Element & Minimum Element\n3. Searching - Binary Search, Linear Search, Interpolation Search, Median Search\n4. Sorting - Selection Sort, Bubble Sort, Merge Sort, Quick Sort, Heap Sort",2, 12646,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"common operations that can be performed on data structures are sorting ,searching etc.",2, 12647,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1. Deletion\n2. Insertion\n3. Transversal,1, 12648,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Operations-Insert, Delete, Update",1, 12649,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Sorting, Searching, pop, push, delete, extract min, extract max, transversal, bi-directional pointing ",2, 12650,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Their are many operations that can be done on different data structures such as :\n1 . Traversing \n2. Searching\n3. Insertion\n4. Deletion,1, 12651,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Finding min and max data, extraction of particular data or min or max element, sorting of data in particular order, ",2, 12652,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,some common operations that can be performed on data structures are:\n1. insertion\n2. deletion\n3. swapping\n4. modification\n5. searching\n6. sorting\n7. printing\n8. traversing,2, 12653,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, traversal, searching.",1, 12654,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The common operations that can be performed on a data-structure are insertion, deletion and replace.",1, 12655,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Linear Data structures stores the data in a linear form.\nFor example- arrays, list, etc.",1, 12656,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"operations performed on data -structure :\ncomparing , finding best optimise solution , decreasing time complexity, finding optimal path on map, graph coloring , string matching ",1, 12657,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,operations like input and output of data. storing and searching required data. deletion and replacement of data.,2, 12658,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"sorted, merge, push back, create function, insert, tree, array, stack, graph, searching",2, 12659,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"we can perform search ,sort ,insertion operation and many more on a data structure",1, 12660,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Some of the common operations that can be performed on a data structure are pop or remove or erase(which can be used to delete elements), push, insert(which can be used to add elements), size( which can be used to access the size of the data structure), empty( to check whether the data structure is empty or not).",1, 12661,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,The operation are \nInserting the element \nDeleting the element\nSearching the element,1, 12662,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,The common operations which can be performed on data structure are \nInsertion \nDeletion\nSearching,2, 12663,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insertion,deletion, search.",1, 12664,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, rotation are some operations that can be performed on a data structure",1, 12665,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insertion of elements into them ,deletion of elements ,sorting of elements, swapping of elements",2, 12666,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,search\ndelete\ninsert\nsort,1, 12667,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,common operation that can be performed on data structure are :-\ninsertion \ndeletion \n,1, 12668,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The most common operations that are performed on any data structure are traversal, inserting an element, deleting an element, modifying an element.",1, 12669,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1.Insertion\n2.Deletion\n3.Sorting,1, 12670,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The operations that can be performed on a data-structure are deletion , insertion and updating .",1, 12671,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,searching and sorting.,1, 12672,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"There are various data structures. Most simply to start with array, linked list, stacks, queue, heap and much more. Operations such as adding new element, deleting an old element, changing the value of the particular element, printing all elements are operations that could be performed in a data structure.",1, 12673,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,insertion\ndeletion\nsearching\ntraversal\n,2, 12674,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on a data structure are insertion, deletion , finding of an element , etc. ",1, 12675,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Generally, common operations include insertion, deletion, updation, searching etc.",1, 12676,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on a data structure are: Inserting, deleting, traversing, searching.",1, 12677,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insertion, deletion, searching, sorting are the common operations that can be performed on a data structure.",1, 12678,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The most common operations that can be performed on a data structure are -\nSearching an element, \nSorting the data of that data structure in a perticular fashion like in ascending order and in descending order,\nDeletion of an particular element or more than one elements from the given data structure.\nInserting an element in the given data structure.\nUpdation in the given data value in a data structure.\nAccessing the element from front or back also deletion of an element from both front and bachl.\n",1, 12679,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,insertion\ndeletion\nupdation\ntraversal,1, 12680,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations which can be performed are:\nInsertion , Searching And Deletion of an element in a data structure.\n",1, 12681,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Searching, sorting, finding a pattern,etc.",1, 12682,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The common operations that can be performed on a data structure are linking a list, gaming program, searching and sorting. ",1, 12683,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common operations that can be done in a data structure are:\n1. Sort\n2. Search\n,1, 12684,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations and can be performed on data structures are- searching, sorting, merging, partition, etc.",1, 12685,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,common operations performed on data structure are \nsorting\nbacktracking\nrecursion ,1, 12686,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on data structures are insertion, deletion, updating, traversals, searching and more.",1, 12687,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Insertion, deletion, sorting, searching",1, 12688,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"size, to check if empty, searching, sorting, deletion, insertion and updating are some commonly used operations on data structures.",2, 12689,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Searching, sorting, insertion, deletion",2, 12690,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Stack, Queue, Searching ,Sorting , Deletion, Insertion, Traversal, Pointers , etc. can be performed on a data structure.",1, 12691,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Insertion, Deletion, Searching ,Sorting are commo n operations performed on a data-structure.",1, 12692,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"searching , sorting , traversal etc.",2, 12693,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The common operations that can be performed on data structures are:\na)add,subtact\nb)print\nc)max min\n",1, 12694,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common Operations that can be performed on a datastructure are :insertion deletion searching etc.,1, 12695,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,,0, 12696,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"search operation , sort operation , insertion etc. can be commonly performed on a data structure",1, 12697,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,common operation that can be performed in data structure are:\n1)searching \n2)sorting\n3)insertion\n4)deletion,1, 12698,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"You can change the shape, structure and order of data items, you can insert, delete and modify the data items in a data structure.",1, 12699,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Sort, insert, push, pop",1, 12700,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Some common operations are:\nSorting\nMerging\nSearching\nInsertion\nDeletion,1, 12701,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The common operations that can be performed on an data structure are traversal , insertion ,deletion opertations .",1, 12702,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"common operation performed on data structures are sorting, searching, traversing, storing etc. ",2, 12703,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"searching, sorting, insertion, deletion ,object creation etc.",2, 12704,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations include insert, delete, sort, etc.",2, 12705,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"There are a number of operations which can be performed in data-structure such as insertion , deletion , addition , subtraction , multiplication division and so on.",1, 12706,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insertion , deletion ,replacing, search an element in it ,sort the element.",1, 12707,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Traversing: Traversing a Data Structure means to visit the element stored in it. It visits data in a systematic manner. This can be done with any type of DS. \nSearching: Searching means to find a particular element in the given data-structure. It is considered as successful when the required element is found. Searching is the operation which we can performed on data-structures like array, linked-list, tree, graph, etc.\nInsertion: It is the operation which we apply on all the data-structures. Insertion means to add an element in the given data structure. \nDeletion: It is the operation which we apply on all the data-structures. Deletion means to delete an element in the given data structure. \n\n\n",1, 12708,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insert an element ,search for an element ,remove an element",1, 12709,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence, common operations that can be performed on a data-structure are \nInsertion\nDeletion \nupdation\n,1, 12710,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,common operations that can be performed is insertion and deletion,1, 12711,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Asymptomatic notations are mathematical representations to define or assign the complexity and efficiency of any algorithm. \nThere are mainly 3 - \nBig O notations , ex - O(n)\nTheta notations \nOmega Notations ",1, 12712,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1)Searching\n2)Sorting\n3)Insertion,1, 12713,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,insertion.\ndeletion.\nsize.\nto check if its empty.,1, 12714,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Operations performed on a data-structure: \n1) Sorting\n2) Searching ,1, 12715,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common operation are;\n1.Insertion;\n2.Deletion;\n3Retrieval;\n4.Updation.,1, 12716,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The common operations that can be performed on a data structure are searching,sorting,",1, 12717,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence," Searching, Sorting and Traversing.",1, 12718,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Insert: To add/insert a new value in the structure (for example: inserting new values in Linked Lists)\nDelete: to delete a pre-existing or user-inserted value\nEdit: To edit any inserted value.\nUpdate: To replace the original value with a better or later/newer one. (used in: MATLAB version of an SR Latch),1, 12719,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,we can delete the element\nwe can search the element\nwe can insert or update the data structure,1, 12720,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,common operations that can be performed on a data structure are:\n1)searching\n2)sorting\n3)traversing,1, 12721,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"data is stored. operations such as searching, sorting in ascending or descending order, returning maximum or minimum element, traversaL can be performed on data structures,",2, 12722,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1. storing the elements\n2. searching the elements\n3. deleting the elements,2, 12723,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The common operations that can be performed on a data structure include storing the elements, searching for any element, deleting the element.",2.5, 12724,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"common operations that can be performed on a data-structure are searching, sorting,insertion ,deletion,insertion and deletion at end /beginning/or at a particular position,merging,dividing,etc..",2.5, 12725,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"add element to the data structure (push), delete element from it (pop), finding the top element etc",2, 12726,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The common operators are-sorting, searching , insertion, deleting. ",2, 12727,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Like creating a node ,linked list ,and making tree for searching the node ,using bfs and dfs,\nmain is for sorting and searching that have many techniques for solve them.",2, 12728,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"traversal, sort, search, insertion, deletion",2.5, 12729,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Many common operations can be performed on a data-structure like searching, sorting, traversing etc.",2, 12730,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Inserting elements, Deleting elements, traversal on elements in data structure",2, 12731,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on data structures are insertion, deletion ,update and sort.",2, 12732,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Common operations that can be performed on a Data Structures are Insertion,Deletion,searching,sorting etc",2, 12733,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,searching\nsorting \nare common operations that can be performed on a data structure,1.5, 12734,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Some common operations are: Searching and sorting.,1.5, 12735,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"The common operations that can be performed on a linear data structure are we can insert new data, pop a value, replace a paricular value by another value,swapping two values, deletion etc.",2, 12736,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,additon updation and deletion of data,2, 12737,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,the common operations are push and pull ie insertion or retrieval of data. then there is sizeof operation which is to know to size of data structure. isfull() and isempty() structures are also used commonly.,1.5, 12738,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Some common operations that can be performed on a data structure includes insertion into it, deletion and traversal through it. Sorting can also be done on the member items of a data structure.",2.5, 12739,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Push\nDelete\nFront\nTop\n,1.5, 12740,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"searching , sorting are the common operation ",1.5, 12741,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1. Insertion\n2.Deletion.\n3.updation.\n4.Searching .,2, 12742,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,insertion\ndeletion\nsearching\nsorting,2, 12743,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,,0, 12744,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"common operations that can be performed are addition(+), multiplication(*), subtraction(-), division(/) of numbers into one another \ninsertion and deletion of inputs etc ",0, 12745,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Insertion , Deletion , Sorting , Searching are the common operation thar can be performed on data structure.",2, 12746,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Searching,Sorting,Insertioin,Deletion are some of the operations that can be performed on a data structure.",2, 12747,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Insertion, deltion,traverse",2, 12748,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,sorting searching ,1.5, 12749,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Some of the common operations that could be performed on a data structures are:-\n1. Insert:- To insert a value in the structures.\n2. Delete:- To delete the value from the structures.\n3. Traverse:- To visit the elements and values on the structure.\n4. Edit:- To edit the values of the structures.\n5. Store:- The data can be stored in the structures.,2.5, 12750,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insert , delete , findmin , extractmin , sorting , searching",2.5, 12751,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,,0, 12752,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,searching\nsorting\nmerging\n,2, 12753,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"it can be insertion , deletion ,replacement etc...",1.5, 12754,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Inserting\nSearching\nSorting\nDeleting\nExtraction,2, 12755,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insert, delete,etc.",2, 12756,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"searching, sorting",1.5, 12757,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,data storing and searching can be performed on a data structure.,1.5, 12758,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Common operations performed are :\nadd() : to add an element\npop(): to delete an element\nisempty(): to check if the data structure is empty\nisfull(): to check if the data structure is full,1, 12759,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"Some common operations the can be performed on a data - structure are searching, insertion, deletion.",2, 12760,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,searching \nsorting \nmerging\ndividing\ntraversing,2.5, 12761,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,insertion \ndeletion \ntraverse\nsorting ,2, 12762,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,Insertion\nDeletion\nTraversing\nSearching,2.5, 12763,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"insert , delete , search ",2, 12764,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,,0, 12765,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1 modified\n2 insert\n3 delete\n\n,2, 12766,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,linear & non linear.,0, 12767,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,1)insertion \n2)deletion \n3)traversal,2, 12768,What are common operations that can be performed on a data-structure?,The following operations are commonly performed on any data-structure – (1)Insertion − adding a data item (2) Deletion − removing a data item (3) Traversal − accessing and/or printing all data items (4) Searching − finding a particular data item (5) Sorting − arranging data items in a pre-defined sequence,"operations that can be performed on data structures are Boolean , algebra, matrix multiplication ",0, 12769,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Algorithms are developed by first analysing the problem, then looking for a solution and then modifying our solution as to make sure the time and space complexity conditions are met.",1, 12770,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,firstly we develop a pseudocode for the algorithm also known as naive approach and then we proceed to the development of the algorithm by determining the time complexity of the algorithm ,2.5, 12771,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"there can be many approaches to develop an algorithms we can use approaches like greedy algorithms , dynamic programming and divide and conquer ",2.5, 12772,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Algorithms can be developed easily by following this methodology: \n1) Brute Force: Uses the maximum amount of loops and comparisons to find the solution\n2) Divide and Conquer: Divide problem into subproblems and then solve each subproblem to get the solution\n3) Backtracking: Traverse through every available solution if it matches the correct solution continue else backtrack to the previous step\n4) Greedy: Find the local Optimal solution(can have multiple answers to a single problem)\n5) Dynamic Programming: Find the most optimal solution by using memoization,2.5, 12773,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Brute Force: Direct approach to solve given problem. Usually it is not the optimal solution and is not efficient in terms of Time complexity or space complexity.\nDivide and Conquer: It involves dividing the problem into smaller subproblems then solving the sub problems and joining the solutions back together to solve the initial problem for example in merge sort.\nBacktracking: It involves considering all the possible outcomes of a particular step in a given problem. We then consider each of the possibility and check whether it is correct and it can be part of the solution or not. If it is then we move further else we go back and consider a different solution to the previous step. We do this till we acheive the final outcome.\nGreedy Approach: It involves considering the best available solution at every step. This may not give the optimal solution always.\nDynamic Programming: It involves initalising various intial values and then using these initial values to find the next values. This is done using matrices.,2.5, 12774,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Algorithms are develop to solve a problem in a good way according to its time and space complexity .\nFirstly the basic approach is Brute force search where we don't consider time and space as a barrier. our only aim is to find solution of a problem.\nSecondly there are algorithms like divide and conquer and many more which always tried to solve the problem in a less time and space complexity than brute force algorithms.\n,2.5, 12775,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12776,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Approaches to develop an algorithms are :-\n. Greedy approach\n. Divide and conquer\n. Backtracking \n. Dynamic programming,2.5, 12777,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,There are many approaches used to develop algorithms\ngreedy approach - it is used for optimization purposes it not necessarily gives the best solution but the solution it gives takes less time and space\ndynamic programing - it is also used for optimization problems but it check every solution available and always gives the best solution\nbacktracking \ndivide and conquer- it divides the large problem into similar sub problems and solve them first and then combine them to solve the larger problem,2.5, 12778,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12779,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,approaches are as follows-\n1. analyses of the given problem\n2. Thinking of the most suitable data structure which could solve the problem\n3. Build the naive approach to tackle the problem first\n4. find the best approach that could solve the problem in less complexity(space and time) than other .,2.5, 12780,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approach to develop an algorithm is done in the following steps :-\n1) study the problem theory carefully\n2) Try to find the solution of the problem using calculation .\n3) Observe the solution and use notations to get the time complexity \n4) optimize you solution in terms of time and space complexity\n5) write the algorithm in a easy manner and implement it on the terminal ,2.5, 12781,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Algorithms can be written by first understanding the given problem, then firstly taking the input values, then applying the basic idea and solving the problem, writing it in steps form.\n1.)write the basic solution.\n2.) take the input.\n3.) write the easiest n understandable algorithm.",2.5, 12782,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approach to develop an algorithm include understanding the problem thoroughly and then suggesting a solution which satisfices the criteria of having suitable time complexity (ideally linear) and consuming minimum required external storage.,2.5, 12783,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,different approaches are :\n- divide and conquer - understand the problem break it into sub problems and then solve the subproblems and then step by step move to the main problem\n- greedy approach : in each step find the best possible solution for the time being.,2.5, 12784,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,- Understand the problem and break it into smaller problem.\n- Write steps to solve the smaller problem (irrespective of any programming language).\n- Optimise your solution and write steps for bigger problem.,2.5, 12785,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"1. start with what you have - the input\n2. identify the end goal - the output\n3. now identify is there any way you can use the basic algorithms(like for ex binary search, LCS, LIS, etc) to get the desired output\n4. now write the intermediate steps that can be used to take you to desired results",2.5, 12786,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"In order to develop thr algorithm, we must;-\n1. First input all the information you have been given\n2. Predict the output by dry-running it.\n3. \n",2.5, 12787,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"1.predict and understand the problem statement .\n2.find the best suited data structure that can be used.\n3.develop all edges, base cases form recurrences if needed, function needed.\n4.analise the time constraints set the limits of the function accordingly .\n5.check if the time and space complexity can be reduced further.",2.5, 12788,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Approach is as follows:\n1)We need to deeply understand what the problem statement is actually saying. For that we can use some examples to understand the problem.\n2)Then we need to find the best suited data structure for the given problem.\n3)Then draw the recursive tree for the problem to understand the approach.\n4)Side by side, write the algorithm for each step of the recursive tree.\n\n",2.5, 12789,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12790,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12791,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,For developing algorithms \n1. understand the problem statement \n2.find all possible way to solve that problem\n3.develop the algorithm which takes minimal time as well as the space complexities \n4.to check if the particular problem is optimizable.,1, 12792,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Approach to develop algorithm :\n1. to write statements and step by step approach\n2. in form of pseudo code,1, 12793,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1) try to get the output .\n2) try to get best Time complexity and space complexity in optimization\n3) first we check if the algorithm is able to handle Average case or not.\n,1, 12794,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,First we read and understand the problem given to us.\nThen we think about the most optimal approach to solve the problem.\nWe check its time and space complexity and see that if there is any approach which takes lesser time.\nWe finally code the approach we have made.\n,1, 12795,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"1. First, we need to look for an efficient approach to solve a solution i.e. whether to use backtracking, greedy or DP approach. \n2. Once, the approach has been decided, then the solution to the problem is implemented using the approach. For example, in dive and conquer, the problem is divided into smaller sub-problems and then we solve those sub-problems and then in return, the the main problem is also solved.\n3. After the algorithm is designed, we should try and check for the least time complexity possible. This will give an optimal solution.\n\n",2.5, 12796,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"1.Firstly we divide the problems into sub problems. \n2. Try to find an optimal and efficient solution to them individually using Backtracking, DP, Greedy and brute approaches.\n3. We try to implement the approach designed by us and compile our program with main function.\n4. After our algorithm is complete, we look for time complexity and analyze if any better way to modify the algorithm is possible.",2.5, 12797,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Approach to develop an algorithm are:\n1) Analyze the given problem statement.\n2)Try to find the rough solution of the problem and try to create a flow chat for better understanding.\n3)write the pseudocode from the flowchart developed above.\n4)Check that the solution created by you is optimal and efficient or not if not try do develop other optimal solution for the given case.\n5)one optimal and efficient solution if found then that become the algorithm.,2.5, 12798,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Some approaches to develop algorithms are:\n1. Greedy approach: to consider the value or path that seems like best meeting our requirement without analyzing it further. May or may not give optimal solution. Eg: to find the shortest path to a goal, the next nearest city from the start is taken into our solution.\n2. Dynamic approach: to analyze all the possible solutions and then choosing the optimal one. Always gives optimal solution.",2.5, 12799,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"the approaches are firstly analyze the given problem then try to find the basic solution to that problem without going into the details at first then try to write the pseudo code for the solution according to you then dry run the code ,dry run the code for some of the random values then check whether you have got the desired or required result also consider the time complexity which is required to solve the given problem because half of the problem can be solved through that.",2.5, 12800,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,we divide the given problem in smaller problem and start writing code for smaller problem . with this approach we will start developing techniques for bigger problem.,2.5, 12801,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12802,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,the approaches to develop algorithm is basically the basic logic applied in then question then develop the pseudo code required for the problem all the data structure to be used in that solution and then try to run the code with logic and data structure for all the test cases.,",", 12803,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12804,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Approaches to develop and algorithm are space complexity based or time complexity based. for lowest space or time complexity possible,",2.5, 12805,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,the approach to develop the algorithm is to take the input first then write base condition and then break main problem to sub-problems.,2.5, 12806,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approaches to develop Algorithms are:\n1. First check that what kind of Data Structure can be use to solve the problem .\n2. Then develop the cases which can be use to solve the problem \n3. Find out that what kind of Time and Space complexity is perfect for the problem .\n4. Find out the base cases.\n5. Implement the searching and sorting operations if needed then apply the particular cases.\n6. Call the function.,2.5, 12807,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Approached to develop algorithms are:\n1. First take input.\n2. divide the problem into sub problems.\n3. solve all the sub problems using same logic.\n4. Merge all the sub problems after solving them.\n5. Display the answer.,1, 12808,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,First the problem is analysed and the basic data structures and concepts are identified which will be definitely used. \nThen the logic is developed for which the lesser space and time is taken.\nfunctions are used and the final values returned.\n,1, 12809,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Firstly a brute force is thought upon the solution. It is the most basic solution which any problem can have, without worrying about any complexity.\nThe we try to break it in smaller problems and think solution for it and make recursive algorithm for the same.\nThen we analyze if there is repeatition of of any smaller problem and if yes then we store it as we won't call it again and simply use the stored value (Dynamic Programming - DP)",2, 12810,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Algorithms can be developed using Divide and conquer techniques. Greedy mechanisms, Dynamic Programming, backtracking concepts etc.",2.5, 12811,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"First step should always be to understand the problem first and then start to look out for the data structures you can use for the same and then accordingly calculating the time complexity of the approach. Always remember that the best algorithm is the one which is the fastest and covers all the use cases of the problem(be it base case, corner case, etc) ",2.5, 12812,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Our approach to develop an algorithm must be how to receive an optimal solution that also takes the minimum time and space.\nNow we can choose which one is more appropriate:\n-Divide and Conquer: To divide our problem in to subproblems then solve the subproblems and then eventually obtaining the required solution.\n-Backtracking- Exploring all the possible solutions of a problem and finding the right answer following our given constraints.\n-Greedy- Using a greedy approach to get a solution (to get more profit)\n-DP- To ensure optimal substructure and no overlapping problems.,2.5, 12813,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Algorithms can be developed on the basis of their efficiency. i.e, based on their time , based on their space complexity etc\nthat is through dynamic programming or greedy approach etc.",2.5, 12814,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Approaches to develop am algorithm are:\n1. Divide the problem into sub-problems. \n2. Define the input. \n3. Check if you can directly use any of the existing algorithms.\n4. Modify the existing algorithms to solve the given problems.\n5. Try to make the algorithms more optimized by using approaches of dynamic programming.,2.5, 12815,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"There are many approaches to develop Algorithms:\nSome of the most popular approaches are:\n1) Divide and Conquer:\nin this technique we divide the current problem in multiple subproblems such that each sub problem is exactly same as big problem.\neg: Rat in a maze, n-queens, uses backtracking that comes under Divide and conquer.\n2) Greedy Approach: In this approach we write algorithm in such a way that we get locally optimised result at each step.\neg: fractional Knapsack, Job scheduling etc algorithms uses this approach.\n3) Dynamic Programming: This is more optimised technique which aims at getting the optimised result at the end when program terminates.\nfor this this approach used memoisation and tabulation so that the repeated occurences can be ommited and value can be stored in a @-D array.\neg: 0/1 Knapsack, Longest Common Subsequence etc.\n",2.5, 12816,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approaches to develop algorithms are:\nDivide and conquer - dividing the problems into smaller problems and getting the solution\nGreedy algorithm - Checking all the possible outcomes of a given problem\nDynamic Programming - Finding the most optimum solution to the given problem using memory memorization. \nBacktracking - Moving back and finding the the output to our solution.,2.5, 12817,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Firstly we need to write down the problem we need to solve, then we see if that problem can be divided into smaller sub problems, then we find a solution to solve that problem in the least time, then we implement that solution into a code.",2.5, 12818,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"To develop an algorithm first write the problem, then divide it into sub-problems (if possible), then solve the sub problems to find an optimized solution, then merge the solutions to find the final solution.",2.5, 12819,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"An algorithm is defined as the finite number of steps or sequence of operations required to solve a problem. To develop an algorithm we need to first check the user requirements, then design an algorithm as per the requirements. The algorithm should take a finite input and generate a finite output in the required amount of time complexity. It should be able to generate optimal solution to the problem in order to be efficient algorithm.",2.5, 12820,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1. Divide and Conquer: We solve small problems and handle base case so recursion will solve bigger problem.\n2. Backtracking: here we try all possible combination and pick the best one.\n3. Greedy Approach: here we try to pick best solution at every step.\n4. Dynamic Programming - Try all possible solution and save them and pick the best one.,2.5, 12821,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,here are three commonly used approaches to develop algorithms −\nGreedy Approach − finding solution by choosing next best option\nDivide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently\nDynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,2.5, 12822,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"each algorithm is developed in a different manner, but the main focus goes like analyzing the algorithm, implementing a brute force stratergy first , then trying out a more subtle approach with much less time complexity considering various methods of algorithm forming like backtracking, divide and conquer, greedy approach or a dynamic approach and finally seeing if there is any other method to optimize the problem further.",2.5, 12823,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,the first approach is thinking a brute force approach to solve a problem. then optimizing the algorithm using various data structures and making changes in the approach to solve complex problem efficiently,2.5, 12824,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"there are many common approaches such as brute force , greedy and dynamic programming to develop algorithms. Brute force is the simplest way in which apply any possible simple logic to solve the problem at hand. IN greedy approach we try to take the best possible root at each step which increases the possibility of getting the best result. Dynamic programming always ensures the most optimal solution in all cases , as in this we go through all possible outcomes and choose the best among them.",2.5, 12825,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,first we look closely upon the problem statement and briefly understand the things asked\nthereafter we use different approached like divide and conquer or greedy or backtracking and many more to obtain the solution\nafter which the space and time complexities are compared to get the optimized solution of the given problem,2.5, 12826,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Approaches to develop algorithms: -\n1. Algorithm must give complete solution to a problem. \n2. The solution may or may not be optimal.\n3. Less Time consuming ,2.5, 12827,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"1)Waterfall approach\nDeveloping algorithms include understanding the problem, taking into consideration the space and time complexity, checking the feasibility of the problem, whether the algorithm is complete and optimal",2.5, 12828,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"1)divide and conquer : we divide the problems in subproblems\n2)greedy : the first approach which hit mind first , it does not provide optimal solution\n3)dynamic programming : using recurssion we divide problem into subproblems which provide optimal solution",2.5, 12829,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"we analyze our requirements , and find the best algo for the problem which takes the least time and uses least amount of resources",2.5, 12830,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,\nAnalyze data\nObjectify need \nTime analysis \nSpace analysis\n,2.5, 12831,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1.first understand the problem properly\n2.apply the brute force approach \n3. Try to reduce the time and complexity and optimize it \n4. If its work that particular set of information then algorithm developed ,2.5, 12832,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"to approach developing an algorithm \n1. we need to read and understand the problem carefully\n2. apply brute force for to problem first\n3. now see how we can optimize the solution \nwe can use different techniques like divide and conquer, backtracking, greedy etc.",2.5, 12833,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"recursive , divide and conquer, greedy, dynamic",2.5, 12834,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approaches to develop algorithms is coming up with a pattern with the knowledge of DS and attempting to use minimum space and complexity in order to form the most optimum algorithm ,2.5, 12835,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approach to develop algorithm is based on its efficiency to find the solution in minimum time while taking minimum space in memory of our system,2, 12836,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approaches are to the develop of the algortihm:\nGREEDY APPROACH\nDYNAMIC APPROACH\nDEVIDE AND CONQUER APPROACH,2.5, 12837,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,we used first find all the possible ways and then check the complexity for the program so it can run in the least time possible ,2.5, 12838,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"There are divide and conquer which divides problem into smaller problems. Backtracking algorithms follow a particular way and if a solution is not found, backtracks and goes to another way.",2.5, 12839,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12840,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"the approach these day is to find the fastest way to search, sort, iterate through the data, for fast reponse time.",2.5, 12841,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12842,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"the approaches to develop algorithms are firstly, we understand the problem and try to devise various ways using different test cases \nthen we implement a simple code using the algorithm that we've devised and then we workout on the pre designed algorithm and implement the one which is best suited with respect to our problems.",2.5, 12843,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Master's theorem,2.5, 12844,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Following are the approaches to develop algorithms.\n->Greedy algo: Taking descision at every step\n->Dynamic Programming: Taking out best/efficient possible answer by framing a formula or method.,2.5, 12845,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,An algorithm is developed depending on its use. Most algorithms are used to find the optimal result of of the problem like the search algorithms. They are very helpful in various fields and studies.,2.5, 12846,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,the approaches to develop the algorithm is finding the optimum and efficient solution of the problem ,2.5, 12847,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12848,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"the algorithm should be time and space efficient. this means that the program shouldnt contain any unnecessary loops. predefined data structures take up a lot of space as well, so its better to take the input dynamically so that no space is wasted at all \n",1, 12849,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,we develop algorithm so that to get get the good or optimal approach for any problerm,1, 12850,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Try to understand what the problem wants you to do\nFind a data structure for the given problem\nTry solving the problem with brute force\nTry to make your solution better by making efficient algorithms in terms of time and space complexity,2.5, 12851,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,greedy method:finds local optimal solution\ndynamic:stores the solution of the sub problem in dp[][] to provide efficiency by decreasing time\ndivide and conquer:divides the problem into sub problem until it cant be divided further and then solves each sub problem,2.5, 12852,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12853,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,to develop algorithm take a variable and develoop such that it takes the minimum time less space,1, 12854,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,. write the pseudo code \n. do dry run,1, 12855,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,define a solution to a problem\ncheck if the approach to the problem gives reliable and consistent solution,1, 12856,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12857,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12858,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Approach to develop Algorithm:\n,2.5, 12859,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,approach to develop algorithms is to by building logic to reach the goal in given time and space complexity.,2.5, 12860,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,While developing algorithms we take care of the time and space complexities and write a program which implements the logic satisfying these conditions,2.5, 12861,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approaches to develop algorithm is to make a certain code to takes less space and take less time to works.,2.5, 12862,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,development of algorithm can be done by first thinking of all possible cases and then finding some base case which will have a surely solutions to them without the help of other functions,1, 12863,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,first we analyze and write a pseudo code that efficiently solving the problem in terms of time and space .we find this complexities with the help of recurrence functions and then we implement the algorithm.\nThese are the steps:\nAnalyzing and thinking a solution\nsolving (pseudo code)\nimplementation \n,1, 12864,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The algorithm should must return a feasible output.\n,1, 12865,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12866,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12867,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,There are several approaches like divide and conquer in which first we divide the problem in subpart and then merge them,2.5, 12868,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"First try the brute force approach to solve a problem. Then try try to optimize the solution by making use of different techniques like divide and conquer and greedy approach. We can use recursion. If we can see the there is scope for improving the space complexity and time complexity namely to reduce the number of repeated operations, we can apply dynamic programming. ",2.5, 12869,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"approaches can be to know how much work it does, to get the need of it\nto use the current data structure at correct place.\nto know the edge cases involved in developing algorithms\nto keep in mind about the complexity \n",2, 12870,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,To Develop Algorithms we need to\n->Firstly Understand Ques Correctly\n->Develop the logic \n->Then think which Data Structure is most Suitable\n->then try to optimized the algorithm in terms of time and memory\n->Most Importantly our algorithms must have correct output of all test cases and edges test cases,1, 12871,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"divide and conquer approach , brute force approach ,FIFO , LIFO etc.",1, 12872,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Approaches to develop algorithm are mainly the devide and step techniques. Divide the given problem into a set of subproblems. Solve every problem individualy recursively.Combine the solution of subproblems into a solution of the whole problem.,2, 12873,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"by developing recurrence relations \nusing specific time complexities space complexities, keeping the record of its worst case best case we can develop algorithm.. which will work accordingly",1, 12874,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,, 12875,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Analyze the given question \nlist out the memory blocks to be used for solving the problem\nimplement solving technique using your code, for example - while using backtracking to solve N queen problems, recursive tree is drawn, \nbased upon the logic try to write a pseudo code",2, 12876,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,To develop an algorithm we first need to know where that algorithm will fail and where will it apply.,1, 12877,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,approaches are to first understand the problem statement and then write down the pseudo code briefly and then also analyze the edge cases and handle them. ,2, 12878,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,First we should analyze the algo thoroughly and then optimize it according to the best space and time complexity found.,2, 12879,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"first of all we need to identify what the problem is. We should then make a pictorial representation of the data structure used and the whole working of how we want to approach the problem on paper. Then we should start writing the code. As far as approach is concerned, observe which data structure can be used to solve the problem in most effective way. Then using our prior knowledge about the data structure, we must either apply the classic approaches, and if we find a better approach, we should apply that.",2, 12880,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,approach includes-\nunderstand the algorithm\nanalyse it\nbreak down the algorithm\nwrite the pseudocode or flowcharts,1, 12881,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"With context to the problem, we have multiple ways of working out the solution. But we have to choose our approach in a very sensible manner while taking care of the optimization and the test cases. For example, in knapsack problem. DP and Greedy both can be used to derive the answer. But 0/1 problem becomes a problematic approach if we choose greedy. ",1, 12882,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,We first think of a brute force approach that can solve the porblem and calculate its complexity and then we try to optimise the problem using an \,2, 12883,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Basic approaches remain the same for all the algorithms where it is divide and conquer, backtracking ,etc. \n1. Try to simplify the problem into simpler cases. \n2. Try to find out data structures that can be used to solve the cases. \n3. Look for validity using test cases. \n4. Further optimize it and look for better ways/ data structure.\n\nDivide and conquer -> divide problem into smaller subproblems and find solution of each of the smaller subproblems. Then recombine these to solve the bigger problem,\n\nDP - we solve each of the cases and store all the solutions to smaller problems in matrices or arrays to cut out the overlapping subproblems of the recursion.\n\nBacktracking - > Go in all the directions to find the solutions (except those which are cut short because of invalid advancement. for example - in rat in a maze problem, we try all the paths to reach the finish block but we don't in the directions blocked by the obstacles. ",2, 12884,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Main approaches are:\nGreedy method\nDynamic Programming\nBack Tracking \nLinear method \n,1, 12885,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Brute force approach: To try to develop an algorithm without using any pattern or pre requesite \nGreedy approach: This approach solves the problem step by step so that the problem occurring first is solved first\nDivide and conquer approach: This algorithm divides the problem into set of sub problems and each is solved individually,1, 12886,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Data structures can be used for collectively storing various data types together for solving a particular question.,2, 12887,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Step 1. Implement a bruteforce solution\nStep 2. Try to reduce the time and space complexity \nStep 3. Apply asymtotic analysis and various data structures that can reduce the time and space complexity of the algorithm.,2, 12888,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,There are three commonly used approaches to develop algorithms −\nGreedy Approach − finding solution by choosing next best option\nDivide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently\nDynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1, 12889,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"First, we read the problem and then we think how to solve it, not efficiently but only a brute force method to solve. Then step by step, we try to reduce time complexity and reach an efficient solution. For example - Like while solving backtracking questions, we first think about the problem, then apply brute force solution. After that, we try to apply recursion and solve more efficiently.",2, 12890,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"an algorithm of a problem can be developed by divide and conquer, backtracking. greedy or dynamic programming approaches.",1, 12891,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Greedy\nBacktracking\nDivide and conquer\nDP\n,2, 12892,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"To develop an algorithm, understand the problem, try and build a solution which uses less time even on larger inputs and also does not take a lot of space.",1, 12893,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"first understand the problem, second break it into sub problems and achievable steps, third brought down a way of achieving that sub problem, fourth check is there another way!, if yes then find which one is more efficient use that, if no move further to next step, fifth write the algorithm in the form of code for the problem and test if it works properly.",1, 12894,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1. Understand the problem statement.\n2. Try to find the best possible approach to find the solution of that problem.\n3. Use the analogy of real life solutions in computing terms.\n4. Design the algorithm keeping all these things in mind. \n5. Try to minimize the space and time complexity of the designed algorithm.,2, 12895,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Divide and conquer - First the data sstructure is divided until the given condition and once it is fulfilled , it is operated upon.\nBranch and bound - \nGreedy approach - Problem is solved by sorting the data structure in a particular order and then finding the max , min or the data fulfilling the specidied condition\nDynamic programming - Reducing the time and space complexity by storing the values processed in the recursive stack space in an array so that the function need not process the value for the same input when encountered and can access it from the array.\n",2, 12896,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"while developing an algorithm we first write our requirement and the information given to us then we decide which approach to use to create the algorithm like divide and conquer, greedy method, dynamic programming & backtracking. after that we write the pseudo code for the algorithm which is basically breaking the problem into different steps like making a counter, running a loop. etc. and then after that code is written for the algorithm in a particular language.",1, 12897,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,To develop an algorithms we need to understand the requirement of the algorithm and develop a pseudo code and check it for different test case and specially find the base case where algorithm may act differently. Moreover take care of time complexity and space complexity better the time and space complexity better the algorithm. ,1, 12898,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approaches to develop algorithms :-\n1) Identify problem\n2) Identify data structure to use and their working\n3) Implement the algo\n4) Try to make it more efficient,1, 12899,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Common Operations performed on data-structures are-\nSearching\nSorting\nInsertion\nDeletion,1, 12900,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,for developing the algorithms first you should have to make approach for solving the problem as ,2, 12901,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,, 12902,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"greedy approach, ",1, 12903,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,we have to follow some rules before developing an algorithm first is that algorithm following the rules that are given or not and second is to save the time and space according to the question,2, 12904,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"First we analyse the problem at our hand, and try to find out the best solving technique be it backtracking, divide and conquer, or dynamic programming. We can also use brute force to get a clear idea of the problem and get a vanilla algorithm and then work on it. After designing an algorithm there are 2 ways: prerioiri and postreori to find the time complexity of the algorithm, after deducing it we see if it has scope for improvement, if yes then do so.",1, 12905,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,we wil use following approaches to develop algorithm :-\n1) if the algorithm is complete or not.\n2) check its time and spaces complexity (means they should be minimum).\n3) check for admissable means if the solution given by the algorithm is optimal or not.\n\nbased on these approaches we will develop the algorithm,1, 12906,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approaches to develop an algorithms are\n*)understanding the problem statement .\n*)understand the asymptotic notations such as desired time complexity and space complexity.,1, 12907,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12908,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,by writing pseudocode,2, 12909,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"first try to connect the problem with real world scenario , then develop a raw solution to the problem ,once it is able to handle all the possible test cases try to optimize it by minimizing its time and space complexity.",1, 12910,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,to develop algorithms following approaches are taken-\n,1, 12911,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approach to develop algorithms is to \nfirst understand the problem \nfind put the ,1, 12912,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"The approaches to develop algorithms are based on the nature of the problem i.e. if the problem can be divided into smaller problem of similar nature, what kind of data structure we require to efficiently solve the problem. Based on these techniques there are various approaches like divide and conquer, brute force, dynamic programming, greedy approaches, etc.",1, 12913,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1.Divide problems into set of subproblems\n2.Solve every subproblem individually\n3.Combine the solutions to obtain solution for the original problem,2, 12914,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"To develop the algorithms, we simple require an overview of what we are going to do to solve the problem and the general steps which we are performing one by one to approach the solution.",1, 12915,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1. analyze the problem clearly.\n2. break the problem into sub problem if its too large.\n3. design the algorithm for the sub problem if possible.\n4. Analyze the complexity.\n5.Dry run for various inputs and try to optimize it.,2, 12916,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Algorithms are written in order to find the most efficient way ,precisely saying the way having least time complexity. Approaches to algorithm include firstly to find out any way through which we can get to solution of our problem. Secondly to find any other way involving less time, Thirdly to analyse if its the best possible way out. Fourthly to code it.",1, 12917,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,approaches to a developing an algorithm are:\nrecursive\niterative\nsubstitution\n,2, 12918,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"First, analyze the problem thoroughly. Then write down the basic , common ideas or the steps to achieve that algorithm somewhere and when the brute force gets ready, then look upon the time complexity and after that on the space complexity.",1, 12919,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Basically, algorithm is a collection of steps that tells about how a particular task is happening through code. ",1, 12920,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12921,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,approaches to develop an algorithm are \nbrute force approach\ngreedy approach\ndynamic programming\ndivide and conquer,1, 12922,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"An algorithm is a set of generalized steps which are obeyed to write computer programs by which we can solve a certain problem.\nThe approaches to develop an algorithm is-\nFirstly clearly under stand the problem statement and understand the edge cases and all the constraints.\nNow, we will be in need to find the best data structure to be used to code out that particular algorithm.\nTry to solve the problem on the bases of brute force approach and then try to do optimization for the solution.\nTry to use the properties of existing algorithm and then invent new algorihtm by writing the steps.",1, 12923,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Greedy Approach - we make optimal decisions for present case to get a optimal solution for case\ndynamic approach - we store the data used in case it is needed in future\nbacktracking - in this we backtrack to previous case if answer not found ,1, 12924,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"The main purpose of developing an algorithm is to keep in mind it must work in every language.\nTo develop an algorithm we must look at the problem in a simpler manner and develop an efficient code which can help us achieve our solution\nWhich can be obtained by implementing any of the following strategies: Divide and Conquer, Greedy approach, Backtracking and Dynamic programming",1, 12925,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"algorithm is a stepwise solution to a problem. To develop an algorithm first we will try to think about the most naive approach, then break it into subproblems and try to improve it in a such a way that it become more cost efficient and time complexity and space complexity is better.",1, 12926,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,the approaches to develop algorithm are to find the time complexity and space complexity.,1, 12927,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,First we use a brute force approach and check whether we can solve the question by it in the best time and space complexity. Then if we can get a better time complexity than the original brute force approach then we try to make the algorithm more efficient by checking whether the question given to us can be solved using any other approach. Then we make the algorithm more efficient by changing its space and time complexity.\n,2, 12928,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"To develop an algorithm is to solve a smaller problem, which in turn solves a bigger problem. like. taking example of a Fibonacci series try to solve the first to two or three answers and accordingly frame a formula or algo and hence apply it to the bigger problem.",2, 12929,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,some common approaches for developing algrothm are \n1. dynamic programing\n2. backtracking\n3greedy approach\n4. divide and conquer,2, 12930,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Approach to develop algorithm is first we need to understand the problem. Then think of brute force solution. See the time and space complexities and how we can improve those. See if existing algorithms or methods exist and how and if using those algorithms or modifying them we can solve the problem. the pseudo code is written and seen if it is better than previous approaches and then finally converted to code. ,1, 12931,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Divide and conquer approach - the problem is divided into smaller subsets and then solved\nBacktracking approach - all the possible solutions of a problem are traversed to get the optimum result\nGreedy approach-the first optimum solution is taken into consideration\nDynamic Programming approach-tabular solution for the optimum solution,1, 12932,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1) analysis of the problem at hand\n2) writing the approach and pseudo code\n3) finding the best solution for the given problem\n4)adjusting the solution according to the problem\n5) debugging the solution,1, 12933,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12934,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Firstly, the given problem is analyzed and then the problem is divided for further analysis into subproblem\nThen, the best solution for every subproblem is analyzed and then the solution of the subproblems are adjusted according to main problem \nMost Efficient method found in this process is used at the last",1, 12935,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Approaches to develop algorithms:\nfirst we develop the brute force of the algorithm working in the question\nthen we find out if any better approach with better time complexity and space complexity could we used and then we apply that approach to solve our problem.,1, 12936,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,the approach to develop algorithms is that they should take the least time complexity and space complexity when solving a problem ,1, 12937,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approaches to develop algorithm are:\na)Firstly we see what the question is asking\nb)We ,1, 12938,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Approaches to develop the algorithms are:-\n,1, 12939,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12940,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12941,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,approaches to develope an algorithm are:\n1)divied and conquer\n2)backtracking\n3)greedy algorithm\n4)dynamic programming\n5)branch and bound algorithm,1, 12942,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,to develop and algorithm you must understand the problem statement thoroughly and its requirements. After that you must identify the time and space complexity of you approach and them improve it to the better and best algorithm possible,1, 12943,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12944,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"We try to find a solution to a problem such that it is also efficient. We can use greedy method, dynaminc programming, divide and conquer, backtracking etc.. to do so",1, 12945,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12946,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approach to develop an algorithm is to first analyze the logic behind the outcome and then develop the particular algorithm behind it.,1, 12947,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,steps to develop an algorithms are:\n1. understand the problem in your mind and perform a dry run on pen and paper\n2. think accordingly which data structure to use\n3. form your algo according to the knowledge you get from dry run.,1, 12948,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12949,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"The task of user is to find the best possible approach to develop the algorithm so that it has the minimum time complexity and it covers all the possible test cases so that the program does not fail for any of the hidden base case. There are many approaches such as 1) greedy approach, 2)dynamic approach, 3) divide and conquer approach, 4) brute force approach.\n",1, 12950,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,algorithms are develop according to better time and space complexity.,1, 12951,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Greedy Approach − finding solution by choosing next best option\nDivide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently\nDynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1, 12952,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1.analyze the problem\n2.check what do we have\n3.think how can we solve the problem with the data given\n4.come up with solution,1, 12953,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"First find the best suitable approaches that may be applied on given theorem such as greedy , dp etc.\nthen find the suitable data structure that ease to traverse the data \nand then build the algo step by step",1, 12954,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12955,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"Linear data structure, is when traversing goes in a single line ex-array, linked list, stack",1, 12956,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1)Brute-force or exhaustive search.\n2)Divide and Conquer.\n3)Greedy Algorithms.\n4)Dynamic Programming.\n5)Branch and Bound Algorithm.\n6)Randomized Algorithm.\n7)Backtracking.\n,1, 12957,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1. Understand the problem statement.\n2. Try to devise steps that can lead to the solution.\n3. Write those steps in simple language to make the understanding easier for the reader.\n4. Include all the necessary information that leads to the solution.,1, 12958,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1.) Divide and conquer approach where we work on a sub problem and keep on adding the solution to get the solution of the big problem.\n2) Backtracking approach which is used to find all the solutions of a problem whether it is optimal or not .\n3) Greedy Approach where we find the best possible solution at each step.\n4) Dynamic Approach,1, 12959,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,To develop a algorithm:\n1.We firstly generate the problem statement;\n2.A problem solution is proposed;\n3.Asympotmatic analysis;\n4.Testing;\n\n,1, 12960,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"The approaches to develop algorithms include first breaking down the problem statement,then choosing the best suited data structure or data structures as per the requirement \nand writing the solution in a simple understandable language.",1, 12961,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1. Analyze the problem and generate a problem statement.\n2. Think about the possible ways to solve the problem.\n3.Write the optimize algorithm according to your knowledge.,1, 12962,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12963,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"approaches to develop algorithm are-;\n1-check its time complexity, analysis of best case, worst case all types of scenarios\n2-check its space complexity how much space it would be requiring and optimise it to use least space as more space can exhaust large amount of memory of system\n",1, 12964,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12965,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"First the problem is studied thoroughly and best solutions are written. Then using backtracking , divide and conquer techniques an optimal solution is found. In some cases values of past problems are stored to refer to incase the program faces the problem again , like in dynamic programming.",1, 12966,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,algorithms should have optimal time complexity and space complexity and it should give the optimal solution . the algorithms should be efficient,1, 12967,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approaches to develop algorithms include the motive of finding the optimal solution to a problem i.e. the solution which is both time-efficient and space efficient.,1, 12968,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"there are various approaches to develop an algorithm ,one such is known as brute force or naive approcah,having absurd time and space complexity.After which we try to optimise our solution by using a suitabledata structure and a suitable algorithm ,thereby providing both a time and space efficient solution.",1.5, 12969,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"the first approach to develop algorithm is to reach the solution, which can be done by making the problem smaller and smaller and finding its solution. then find ways to optimize that solution in the best way possible way. time complexity should be kept in mind",1.5, 12970,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"First we have to identify the problem after that we have to find algorithms which may solve the problem ,after that we have to find space and time complexty and chose the most effecient one .",1.5, 12971,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,I have first approach is that the algo. is not be large and main approach is that less time complexity in comparing to other method . For developing the algorithm we know the appropriate logic to attempting and solving the problem.,1.5, 12972,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"first we find a solution to the given problem, then we find ways to optimize our solution. divide and conquer, greedy approaches are some examples of algorithms.",2.5, 12973,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"The first approach is to apply brute force, that is the process without thinking about the time complexity. Then we can try to optimize the algorithm aiming to reduce the time complexity. We should always consider the worst case scenario while writing any algorithm and take further step accordingly.",2, 12974,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,divide and conquer approach\nback and bound approach\nbacktracking approach\ngreedy approach\ndynamic programing,2.5, 12975,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Objective of developing an algorithm is offering the user with the most time efficient as well as with the space efficient solution to his problem .The solution must perform best amongst the best and worst case scenarios.,1.5, 12976,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,First we should read the question and find which Data Structure is being used in that particular program and to find that data structure we have to know what operations has to be used to solve that problem then make a flowchart and write the program acording to it like if in a question it is asked for a function that performs last in first out then we have to use stack in it ,1, 12977,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,to develop a algorithm first we need to check the problem and than we need to think how efficiently and producitvely we can solve the problem for that we have to divide the problem in parts and than solve each part to get the final solution by ths we can develop a algorithm\nexample dyanamic programming \ngreedy approach \ndivide and conquer,2.5, 12978,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,An algorithm should have least time and space complexity. we constantly try to make algorithms that have lesser time complexity.,1.5, 12979,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,There are multiple approaches to develop an algorithm like by optimsing the time complexity of algorithm and optimising the space somplexity of the algorithm.,1.5, 12980,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,first we analyse the problem and then approach towards the solution,1, 12981,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,first we can use brute force approach and then from there work on reducing its complexities,1.5, 12982,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Approaches to develop algorithm can include identification of the basic mechanism involved in the problem following to this will be the time complexity efficient algorithm that would be given priority in selection of algorithms,1.5, 12983,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12984,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12985,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"1. Divide and conquer approach: Divide the problem into subproblems . Reach the smallest subproblem recursively . Write solution for smallest subproblem. Backtrack to reach final answer.\n2. Recursion and backtracking: use recursuion to trace all solutions . If you find an invalid path , backtrack.\n3. Greedy approch: At each step, write the best fit solution for that time.",2.5, 12986,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"approaches TO develop algorithms;\n1.using recurrence relation ->we obtain the recurrence relation \n2, guess approach -> we guess and then obtain time complexity\n",2, 12987,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12988,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1) read the problem statement \n2) think of the similar examples\n3) think of a particular solution to it \n4) develop some possible test cases and run them roughly\n5) find the more efficient solution once you have find the basic approach,1, 12989,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12990,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,First we have to analyse the problem and then we have to identify suitable type of data structure that could be used to solve the problem.,0, 12991,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,concept of notation which helps in develop algorithm,0, 12992,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,to develop the algorithm understand the problem statement break it into task perform each task separately optimism the algorithm ,1.5, 12993,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,Algorithms can be developed through several approaches wheather it be time approach or space approach. ,1, 12994,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,first we have to understand the problem then we have to find a perfect algorithm,1, 12995,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 12996,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1) we should understand the need of problem\n2) build the logic find its is correct approach or not\n3) find the time complexity of developed algorithm,1, 12997,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"the one an only approach to make algorithm is by using greedy approach in which we are getting more profit and less usage of space , also reduces time complexity",1, 12998,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1. Problem Statement\n2. Sources available\n3. Time efficiency\n4. Space efficiency,1, 12999,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,to develop algorithm we first analyse the code and check for its time and space comlexity and find ways in which we can edit the code so that we have lower time and space complexity and our output is close to accurate.,1, 13000,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"to develop algorithm firstly one should know how to approach to the problem, what are the mandatory conditions required for the problem to solve, then write each steps in normal english form mentioning the mandatory conditions",1, 13001,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,to develop an algorithm first we will understand the problem \nthen we will try to find the method or approach to solve the problem\nafter finding the appropriate approach we will create the steps to execute the approach which we call as algorithm,1, 13002,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,There are two approaches to develop algorithms:\n\nPriori:\nDoes not depend on machine\nDo analysis before implementing the algorithm \n\nPostriori:\nDepends on machine\nDo analysis after implementing the algorithm ,1.5, 13003,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,The approaches to develop algorithms are understanding the problem statement for which we have to develop the algorithm then divide the problem into subproblems and find approach to solve the subproblems ,2, 13004,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,need to solve the problem\ntechnique which we will apply to solve it\nability to compare the problem with real word experiences.\n,1, 13005,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,,0, 13006,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,"first the logical algorithm is written \nthen it is converted to pseudo code\nthen into languages like c++,java etc.",0, 13007,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,for building a certain algo we need to address the problem and look forward to that with the possible nearest solution by which we can get the our desirable output and we meet to build algo by take computation power and the time complexity in the mind .,1, 13008,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,1getting the right approch the probelem using basic ,0, 13009,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,it depends of need ex greedy approaches dynamic approaches for optimization's,2, 13010,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,greedy.(is the use of maximum optimization).,1, 13011,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,na,0, 13012,Briefly explain the approaches to develop algorithms.,There are three commonly used approaches to develop algorithms –(1) Greedy Approach − finding solution by choosing next best option (2) Divide and Conquer − diving the problem to a minimum possible sub-problem and solving them independently (3) Dynamic Programming − diving the problem to a minimum possible sub-problem and solving them combinedly,approach to develop algorithms:\n1. find the time complexity \n2..correct approach for the question\n3. result should be minimal,1, 13013,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Longest Common Subsequence, Djikstra Algorithm,Recursion, FLoyd Warshall Algorithm, Hamiltonian Path, Knapsack.",1, 13014,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points)," examples of divide and conquer algorithms are genome sequencing, dictonary searching etc",1, 13015,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),some examples of divide and conquer algorithms are merge sort and quick sort in which we divide the problem into smaller problem and then solve them,1, 13016,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1) Merge Sort\n2) Binary Search\n3) Quick Sort\n4) Shortest distance between points in a Graph,2.5, 13017,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Merge Sort\nQuick Sort\nPairwise shortest distance between two points,2.5, 13018,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"There are some examples of divide and conquer algorithms like Merge Sort ,Quick sort",2.5, 13019,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),examples of divide and conquer are binary searches and merge sort . \n,2.5, 13020,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),. quicksort.\n. mergesort\n. binary search,2.5, 13021,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),examples of divide and conquer algorithm are \n- Merge sort\n- Binary Search\n- Quicksort,2.5, 13022,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1. quick sort\n2. merge sort\n3. Strassen's algorithm,2.5, 13023,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some examples of divide and conquer are as follows-\n1. Closest pair problem\n2. Stock pricing problem\n3. Strassen multiplication problem\n4.Merge sort \n5.Quick sort,2.5, 13024,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1)Merge sort \n2)Quick sort \n3)closet pair path problem,2.5, 13025,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Quick sort, merge sort, binary search",2.5, 13026,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Merge and Quick Sort,2.5, 13027,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),examples of divide and conquer algorithms are :\n- quick sort,2.5, 13028,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points), Merge Sort\n- Matrix Multiplication.\n,2, 13029,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),divide and conquer algorithms are best used when the subproblems of a problem are similar to the original problem and same approach can be used to solve all the sub-problems and lead us to desired output\n\nSome examples are: \n1. Merge Sort\n2. Matrix Multiplication,2, 13030,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),,0, 13031,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort, quick sort, median search, binary search",2.5, 13032,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Examples are:\nBinary Search\nMerge Sort\n\n,2, 13033,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort, Quick sort",2, 13034,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"insertion sort , quick sort are the very common examples of divide and conquer algorithms.",2, 13035,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Some Examples of divide and conquer algorithms are- Binary search,merge sort,bubble sort,selection sort,insertion sort and median search ",2.5, 13036,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Divide and conquer algorithms are used in solving many problems (like to find minimum distance between two points in a plane, etc ) . The concept of this algorithm is to divide the main problem into smaller subproblems. Then we find solution of these smaller subproblems and subsequently compute the solution of main, big problem. The main catch in this algorithm is that the smaller subproblems should be similar to the parent problem, otherwise this algorithm will not work. \nSome examples of Divide and Conquer algorithms are : merge sort, quicksort, etc. ",2.5, 13037,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort ,quick sort etc. are the example of divide and conquer as in divide nd conquer we divide the problem into subproblem and then recursively get the resultant output by combining the output got from subproblems.",2.5, 13038,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Merge Sort: In which we keep dividing the arrays into sub arrays until only one element is present in each sub array. Then we merge those sub-arrays into a sorted array.\nQuick Sort: The pivot divides the array in 2 parts one side sorted and one side unsorted. the pivot keeps on changing as the array gets sorted.\nBinary Search: We keep dividing the sorted array into halves until we find the element.\n,2.5, 13039,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Binary search, quick sort and merge sort.",2.5, 13040,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Binary search, quicksort and merge sort.",2.5, 13041,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some example of divide and conquer algorithm are :\n1) merge sort\n2)quick sort\n3)binary search\n\n\n,2.5, 13042,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some examples of divide and conquer algorithms are:\n1. Merge sort\n2. Closest points,2.5, 13043,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"some common examples for divide and conquer algorithm are merge sort, quick sort, binary search, radix sort.",2.5, 13044,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),graph coloring\n\nHamiltonian cycle\n,1, 13045,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"some common examples of divide and conquer algorithms are merge sort, quick sort ,etc.",2.5, 13046,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),some examples of divide and conquer are-1->merge sort 2->radix sort 3->binary search 4->quick sort.,2.5, 13047,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Some Examples of divide and conquer algorithms are: \nMerge sort, Quick sort, binary search, etc. ",2.5, 13048,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Some examples of divide and conquer are Binary search, Merge Sort and Quick sort.",2.5, 13049,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Examples are:\nquick sort , binary search , merge sort",2.5, 13050,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some examples of divide and conquer algorithms are : Merge and Quick Sort.,2.5, 13051,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some examples of divide and conquer are:\n1. Merge Sort.\n2. Quick Sort.\n3. Binary Search.,2.5, 13052,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"divide and conquer algorithms include binary search, finding subsets, merge sort, quick sort, etc.",2.5, 13053,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Binary search\nMerge Sort,2.5, 13054,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"some examples of divide and conquer Algorithms include median search, quicksort, merge sort ,binary search etc. Here they divide the problem into further smaller sub problems and recurs to find perform the desired operation.",2.5, 13055,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"in divide and conquer algorithm you divide the problem into multiple small problems and then accordingly try to find the desirable solution in all the small problems. \nImagine you have to search for a particular value in a given array of input by the user, it will be very time consuming if you do it by brute force approach it is better to divide the array into small piece and then run the search for it. IT WILL SAVE TIME!",2.5, 13056,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Divide and Conquer algorithms are to divide the bigger problem into smaller subproblems, then solving the subproblems and eventually obtaining the result of the original problem.\nThe best example of this algorithm is - Merge Sort.\nIn Merge Sort, the array is divided into subarrays till one element is left in each. Then it is sorted then the subarrays are merged and again sorted until the entire original array is sorted.",2.5, 13057,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Various searching and sorting techniques use the divide and conquer approach like normal search , binary sorting, insertion sort, selection sort etc",2.5, 13058,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Examples of divide and conquer are:\nBinary search algorithm, quick-sort, merge sort, N-queens problem, etc.",2.5, 13059,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"example of Divide And Conquer algorithm are:\nQuicksort\nMerge Sort\nBinary Search\nN-Queens,\nRat in a MAze",2.5, 13060,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Examples of divide and conquer algorithms are:\nN-knights\nRat in a maze\nN-Queens,1, 13061,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Binary search, merge sort, etc.",2.5, 13062,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Examples of Divide and conquer algorithm are- merge sort, binary search.",2.5, 13063,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Various sorting and searching techniques are based on divide and conquer algorithm like merge sort, binary search. Binary tree traversal also comes under divide and conquer algorithm.",2.5, 13064,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Examples:\n1. Merge Sort\n2. Quick Sort\n3. Binary Search,2.5, 13065,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge Sort, Quick Sort",2, 13066,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort, quick sort, etc.",2, 13067,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"It can be used in merge sort , quick sort and other algorithms that require breaking the problem into smaller pieces, solving them and then recombine",",", 13068,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort, quick sort ",2, 13069,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort\nquick sort\nradix sort and many more,2.5, 13070,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Examples to divide and conquer algorithms - merge sort, quick sort, binary search ",2.5, 13071,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort, \nQuick sort\nBinary search\n",2.5, 13072,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1)Fibonacci series\n,1, 13073,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort , quick sort",2.5, 13074,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Quick Sort\nBinary Search\nMerge sort,2.5, 13075,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Binary search ,1.5, 13076,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),examples of divide and conquer algorithms:\n1. merge sort\n2. binary search,2.5, 13077,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Some examples are merge sort, quick sort, binary search.",2.5, 13078,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),There are multiple examples of divide and conquer few of which are \n1. merge sort ( splits the given data further and further while swapping)\n2. binary search ,2.5, 13079,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Divide and conquer algorithm examples are merge sort, quick sort and closest-pair algorithm",2.5, 13080,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),EXAMPLES OF THE CONQUER ALGOROTHMS ARE :_\nMERGE SORT\nQUICK SORT\nSELECTION SORT\nINSERTION SORT\n,2.5, 13081,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"quick sort ,merge sort ,binary search",2.5, 13082,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some examples of divide and conquer algorithms are: \n1. Merge Sort\n2. Binary Search,2.5, 13083,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Quick sort, Binary search, Merge sort are some examples of divide and conquer algorithms.",2.5, 13084,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort, quick sort.",2.5, 13085,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1.Binary Search\n2. Merge sort\n3. Quick sort,2.5, 13086,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"divide and conquer algorithm works on the basis that we divide the problem into set of small problems and then solve them at an individual level and later compile them together to define the final solution of the problem.\neg-Merge sort, insertion sort, selection sort.",2.5, 13087,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),quick sort\nmerge sort,2.5, 13088,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Following are some examples of divide and conquer algorithms:\n->Merge sort\n->Quick sort\n->Binary search,2.5, 13089,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort, quick sort are some of the examples of divide and conquer algorithms.",2.5, 13090,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),some divide and conquer algorithms are\nquicksort\nbucket sort\nradix sort\nbinary search\n,2.5, 13091,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Merge Sort and quick sort is the the example of divide and conquer.,2.5, 13092,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),binary search\nmerge sort,2.5, 13093,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"divide - merge sort ,",2.5, 13094,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge Sort, \nQuick Sort,\nBinary Search",2.5, 13095,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort,binary search",2.5, 13096,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),some examples of divide and conquer algorithms are:\nMerge Sort\nQuick Sort\nBinary Search,2.5, 13097,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"binary search , merge sort, quick sort",2.5, 13098,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),quick sort and merge sort,2.5, 13099,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),binary search\nmerge sort,2.5, 13100,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Merge Sort\nQuick Sort\n,2.5, 13101,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort , quick sort are some examples of divide and conquer algorithms.",2.5, 13102,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort, quick sort, Closest pair of points.",2, 13103,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort, quick sort and binary search",2, 13104,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Merge Sort\nQuick Sort,2, 13105,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort , binary search ",2, 13106,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort, insertion sort",2, 13107,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort , quick sort, closest pair problem, are the examples of divide and conquer algorithm",2.5, 13108,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort, quick sort are some examples of divide and conquer.\nFinding closest pairs in a plane is a problem in which we can apply the divide and conquer approach.",2.5, 13109,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),sorting techniques like quick sort and binary sort can also be an eg,2.5, 13110,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some examples of divide and conquer are:\n1- Binary Search\n2- Merge sort\n3- Quicksort,2.5, 13111,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Quick sort , merge sort",2.5, 13112,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Solving the n queen problem, merge-sort",2, 13113,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),used in MERGE SORT here the array is divided into two halves and smaller of the two values \ngets matched at the end.\nused in BINARY SEARCH here we first sort the array and find the mid element and place the right element in its \nright position and reducing our complexity which reduces to O(LOG N)\n,1, 13114,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),One good Example of divide and conquer is binary Search in which we divide our search space accordingly and doing operation on that required search space.\nOther examples are:\n->Quick Sort\n->Ternary Search (somewhat extension of binary search,1, 13115,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort\nquick sort,2, 13116,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Examples of divide and conquer algorithm are binary search , dynamic programming. It is used when same subproblems are not evaluated many times.",2, 13117,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort\nquick sort\nradix sort,1, 13118,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Binary Search\nQuicksort\nMerge Sort\n,2, 13119,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Quick Sort\nMerge Sort - The Array is subdivided to smaller arrays and after reaching the unit array they are combined.\nBubble Sort- An array element constantly being compared with previous array element then swapping takes place.\n,1, 13120,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some examples of divide and conquer are Merge sort and quick sort,1, 13121,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort, N-queen, rat in a maze",1, 13122,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort, binary search",2, 13123,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge Sort, Quick Sort, Radix Sort,",1, 13124,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort\nbinary search,1, 13125,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Divide and Conquer utilizes solving of a problem by breaking down the data set into smaller subsets and then performing the desired operations on it. And then subsequently, perform it again and again while bringing it all together to achieve the final solution.\nFollowing are some examples\n1) Quick Sort\n2) Merge Sort",2, 13126,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points), whose complexity is better than the brute force approach.,1, 13127,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1. Merge sort\n2. Binary search \n3. Quick sort,2, 13128,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),divide and conquer is used in binary seach for eg. to search a page in dictionary\nalso in merge sort eg. to sort an array of elements.,2, 13129,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort , quick sort, Closest Pair of Points\nStrassen’s Algorithm of matrix multiplication",2, 13130,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"There are various approaches to develop an algorithm such as divide and conquer ,backtracking .\nThe algorithms which is developed using the divide & conquer techniques involve three steps: Divide the original problem into various subproblems. Solve every subproblem individually, recursively. Combine the solution of the subproblems into a solution of the whole original problem.\nThe algorithm which is developed using backtracking involves moving to the answer at each step and note the other available paths for that step ,if it reaches the output then its good otherwise it retracts its steps and try other available paths to reach the output.",1, 13131,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort, Binary Search",1, 13132,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),selection sort\ninsertion sort \nquick sort\nmerge sort,2, 13133,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Divide and conquer includes dividing the array in parts and then apply algorithms. Examples are - Merge Sort & Quick Sort,1, 13134,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),quick sort and merge sort are examples of divide and conquer.,1, 13135,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points), Binary Search\nMerge Sort\nQuick Sort,1, 13136,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Merge Sort\nQuick Sort\n,1, 13137,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"binary search, merge sort, quick sort",2, 13138,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),,, 13139,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Binary search, Merge sort",1, 13140,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"binary search, interpolation search finding square root or cube root of a number and many more.",1, 13141,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"sorting of array using quicksort, stock buy and sell to attain max profit .",1, 13142,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),The examples of divide and conquer algorithms :-\n1) Quick Sort\n2) Merge Sort\n3) Binary Search\n4) Interpolation Search,1, 13143,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Algorithms are developed by first-\nUnderstanding the problem, Finding the solutions from pre-existing algorithms, If not available then finding the new algorithm, design the optimal algorithm",1, 13144,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),in divide and conquer algorithm merge sort algorithm and quick sort algorithm comes .,2, 13145,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),,, 13146,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort, closest pair point.",1, 13147,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),those algorithm that can be perform by dividing a problem into small parts and then solved separately those problems comes under divide and conquer algorithm ,1, 13148,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge Sort uses divide and conquer strategy, as well as Binary search in we keep dividing or search space into 2.",1, 13149,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),The examples are :\nmerge sort \nquick sort,2, 13150,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some examples of divide and conquer technique is that\na}It is Used in binary search of an element\nwhich has many advantages in real life such as counting the occurence of a number ,2, 13151,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"some examples are mergesort , quicksort etc.",1, 13152,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"binary search, quick sort, merge sort, strassen multiplication are some examples of divide and conquer algorithms",1, 13153,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"binary search ,median search ,different sorting algorithm like quick sort, merge sort",2, 13154,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort\n,1, 13155,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),examples of divide and conquer :-\n1. merge sort \n2. quick sort ,1, 13156,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Some examples of divide and conquer algorithms are binary search, merge sort, etc. These problems are the ones where we solve a smaller part of the problem first and then club all those results together to get the solution to the bigger and the main problem.",2, 13157,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),binary search,1, 13158,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Simply, when we want to shorten our problem we use divide and conquer like when we calculate the time complexity of a recursive recurrence relation we use divide and conquer , in binary search ,in merge sort , etc.",1, 13159,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1.binary Search\n2.quick sort\n3.merge sort,2, 13160,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),,, 13161,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort, quick sort, binary search, ",1, 13162,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Examples of divide and conquer algorithms are binary search , sorting techniques like merge sort, quick sort, etc. ",2, 13163,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Examples are: Binary search, Merge sort, etc.",2, 13164,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort, quick sort are some of the examples of divide and conquer algorithms.",2, 13165,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort\nquick sort\nbinary search,2, 13166,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Binary Search, Merge sort , Quick sort are some examples of divide and conquer algorithms.",2, 13167,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),binary search\nquick sort\nmerge sort,2, 13168,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Some basic examples of divide and conquer are : Merge Sort , Finding the shortest path between two points etc",2, 13169,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"binary search, merge sort,etc.",2, 13170,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Some examples of divide and conquer algorithms are as follows: \nQuick Sort. Merge Sort, Greedy Algorithms including Knapsack, Travelling Salesman Problem, ",2, 13171,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1. Merge Sort\n2. Traveling Salesman\n3. Coinage\n4. 0/1 Knapsack,2, 13172,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Divide and conquer examples-\nMerge Sort\nQuick Sort\nGreedy technique\n,1, 13173,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1. in railways to sort which train will come on which platform and at what station \n2. To find information about particular in seconds while a person will take days to find in a company,1, 13174,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Some examples of divide and conquer algorithms are merge sort, quick sort, binary search. ",1, 13175,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Merge Sort\nQuick Sort\nBinary Search,1, 13176,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort and binary search uses divide and conquer algorithms.,1, 13177,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"There are some sorting techniques such as merge sort, quick sort and some searching techniques such as binary search.",2, 13178,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Merge Sort\nQuick Sort,2, 13179,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),examples of divide and conquer are:\nmerge sort\nclosest pair of points.\nsprinklar problem.,2, 13180,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort , helix sort , selection sort ",2, 13181,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some examples of divide and conquer algorithms are:\n,1, 13182,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),In divide and conquer algorithms we use to divide the things into smaller ones and then conquer for example:- ,1, 13183,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),binary search \nquick sort\nmerge sort\n,1, 13184,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Binary Search can be the example of divide and conquer algorithms.,1, 13185,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Examples of divide and conquer algorithm are:\nmerge sort, quick sort, binary search, etc.\n",1, 13186,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),examples of divide and conquer algorithms are merge sort and quick sort,1, 13187,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort, quick sort, insertion sort.",1, 13188,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort, quick sort, binary search",1, 13189,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Some examples of divide and conquer algorithms are BINARY SEARCH , MERGE SORT AND QUICK SORT",1, 13190,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort and quick sort is the one of the most suitable example of divide and conquer algorithm.,1, 13191,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),some examples of divide and conquer stratergy is :\n1. merge sort\n2. quick sort\n3. insertion sort,1, 13192,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1. Binary search\n2. Ternary search\n3. Merge sort\n4. Interpolation search\n,1, 13193,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1). Merge Sort\n2).Quick Sort\n3).Binary Search\n4).Linear Search,1, 13194,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"closest pair of points, merge sort and quicksort.",1, 13195,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"1. Quicksort is a sorting algorithm. The algorithm picks a pivot element and rearranges the array elements so that all elements smaller than the picked pivot element move to the left side of the pivot, and all greater elements move to the right side. Finally, the algorithm recursively sorts the subarrays on the left and right of the pivot element.\n2. Merge Sort is also a sorting algorithm. The algorithm divides the array into two halves, recursively sorts them, and finally merges the two sorted halves.\n3. Closest Pair of Points: The problem is to find the closest pair of points in a set of points in the x-y plane. The problem can be solved in O(n^2) time by calculating the distances of every pair of points and comparing the distances to find the minimum. The Divide and Conquer algorithm solves the problem in O(N log N) time.\n4. Strassen’s Algorithm is an efficient algorithm to multiply two matrices. A simple method to multiply two matrices needs 3 nested loops and is O(n^3). Strassen’s algorithm multiplies two matrices in O(n^2.8) time.\n\n",1, 13196,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort,1, 13197,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Merge sort \nQuick sort\nare the some examples of divide and conquer algorithms,1, 13198,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"examples of divide and conquer algorithms are manly search and sorting algorithms \nbinary search, linear search , merge sort, quick sort",1, 13199,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Common operations that can be performed on a data structure are input of data, and manipulation of data. Manipulation of data takes place via different methods depending on our algorithm and what we use as such. Ex- sorting a data, finding the element with the max or min value in the data structure, finding common elements in the data structure etc.",1, 13200,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge Sort,Quick Sort,",1, 13201,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Binary search\nmerge sort\ninversion count\nquick sort,1, 13202,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1.) The one of the most known sorting technique MERGE SORT .\n2.) Binary Search \n3) Quick Sort,1, 13203,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Few examples of D& C are;\n1.Merge sort;\n2.Binary Search;\n3.Stock and sell problem;\n4.Quick sort\netc.,1, 13204,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some examples are:\nRecursion\nQuick sort\nBinary search,1, 13205,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Quick sort and merge sort.,1, 13206,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Merge Sort \nQuicksort \nStrassen's Matrix Multiplication,1, 13207,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),some examples of divide and conquer algorithm are-;\n1-quick sort\n2-merge sort\n,1, 13208,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),examples:-\nmerge sort\nbinary search,1, 13209,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort and binary search are examples of divide and conquer algorithms.,1, 13210,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort\nquick sort \nbinary search,1, 13211,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Some examples of divide and conquer algorithms are quick sort, merge sort ,binary search.",1, 13212,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort ,quick sort",2.5, 13213,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"network flow algorithm, graphs etc",0, 13214,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Some example of divide and conquer algorithms are-\nmerge sort, binary search.",2.5, 13215,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"examples for divide and conquer algorithm is merge sort ,quick sort,",2.5, 13216,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"binary search, merge sort, quick sort",2.5, 13217,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),In divide and conquer algorithm we first divide the problem in many sub-problems and then try to solve the sub-problems and in the end we try to merge everything together to finally solve the bigger problem.,1, 13218,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort\n,2, 13219,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Binary Search, Merge Sort ",2.5, 13220,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Merge sort And Quick sort ,2.5, 13221,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),in railway network \nin stock exchange problem,0, 13222,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some examples include: Merge sort and quick sort algorithm,2.5, 13223,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Some examples of divide and conquer algorithms are binary search, merge sort etc.",2.5, 13224,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),quick sort algorithm\nmerge sort algorithm,2.5, 13225,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1. binary search\n2. quick sort\n3. merge sort,2.5, 13226,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),,0, 13227,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1)Merge Sort\n2)Quick Sort\n,2.5, 13228,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),quick sort and merge sort ,2.5, 13229,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1. Merge sort\n2. Quick sort.\n3. Binary search.,2.5, 13230,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort\nquick sort\nare the examples of d and c algo.,2.5, 13231,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),,0, 13232,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),divide and conquer approach is to break the problem statement into parts and solve them separately \nfor eg:- addition and multiplication of 2 linked lists,1.5, 13233,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1:- Merge sort \n2:- Quick sort\n3:- N-queen ,2, 13234,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some of the examples of divide and conquer algorithms are :- \n1.Merge Sort\n2.heapify,2, 13235,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),sorting and searching,2.5, 13236,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"merge sort ,quick sort ,binary search ",2.5, 13237,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some examples are:-\n1. Merge sort\n2. Quick sort,2.5, 13238,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort \nbinary search \n,2.5, 13239,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Google , Amazon , etc are some example of divide and conquer algorithm.\nmerge sort algorithm is used in divide and conquer.\n",1.5, 13240,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),quick sort\nmerge sort,2.5, 13241,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),binary search\nmerge sort\nsubarray sum problem\nquick sort,2.5, 13242,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Binary Search \nMerge Sort\n,2.5, 13243,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Merge sort, binary search, quick sort.",2.5, 13244,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),example of divide and conquer algorithm merge sort and quick sort,2.5, 13245,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Example of Divide and Conquer algorithms are :-\n1) Quick sort\n2) Merge Sort,2.5, 13246,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Some examples of Divide and Conquer Algorithms are Binary Search and Merge Sort. ,2.5, 13247,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"Some examples of divide and conquer algorithms are Dijkstra algorithm, ford Fulkerson algorithms,",0, 13248,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),merge sort \nquick sort,2.5, 13249,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"in divide and conquer algorithm , we first divide the elements then take it one by one step and then write in right manner. ",1.5, 13250,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),Merge sort\n,2.5, 13251,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),when we are doing aeration in which large database is concern and we have to find out the certain function from that database we use divide and conquered \nlike during searching someone profile on social media we can use divide and conquer it had database which divide a system into a serial potion and sech on that bases ,2, 13252,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),some of the applications of divide and conquer algorithms are used in:\n1) Merge sort\n2) Quick sort,2.5, 13253,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),divide and conquer algorithms we solve big problem it sub parts example matrix multipi,2.5, 13254,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),master theorem.,0, 13255,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),1)merge sort\n2)quick sort,2.5, 13256,What are some examples of divide and conquer algorithms?,The below given problems find their solution using divide and conquer algorithm approach – (1) Merge Sort (2) Quick Sort (3) Binary Search (4) Strassen's Matrix Multiplication (5) Closest pair (points),"examples of divide and conquer\nrat in a maze,\ntravelers theorem\nHamiltonian graph\n",0, 13257,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stack uses the LIFO (last in first out) principle that is elements that are added last are deleted first. There is only one same path of adding and deleting elements, elements are stacked on top one over another and the element at the top of the stack is deleted first. ",2.5, 13258,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks uses LIFO principle i.e. last in first out we use stacks to store the recent data in order to access it as fast as we can. it stores the values at the compile time,2.5, 13259,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stack is a data structure in which first element which is inserted in a stack comes out last it follows LIFP appoch \n,2, 13260,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks because:\n1) They do not require limits like arrays\n2) They provide LIFO process (Last In First Out) that reduces time complexities of many algorithm and operations,2.5, 13261,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stack offers a methodology called LIFO which stands for Last In First Out. For ex, website navigator. Last website visited is brought first when we click back. Undo also does the same.",2.5, 13262,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack are LIFO data structure used to store data in last in and first out form. Stack are used in place of array to reduce space complexity and operation like push and pop are easy to implement on stack.,2.5, 13263,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",a stack is used in evaluating expressions consisting of operands and operators. ,2.5, 13264,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack gives last in first out operation. Stack helps in finding the parenthesis of the expression,2, 13265,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stack is a linear data structure which follows last in first out method and is used for many purposes like parenthesis and many more,2, 13266,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",,0, 13267,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stacks are the linear data structure that are used to store the values of a particular data ,in LIFO format i.e. Last In First OUT ",2.5, 13268,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stacks are used , when we need to perform the operation on every part of string or any number and make better use of it . Stacks basically have insertion and deletion both from the top , it follows FIFO approach.",1, 13269,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stack for storing information in FIFO form(first input first output).,1, 13270,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is a data structure that is ideally used to store data in a linear format ,1.5, 13271,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks to implement the LIFO ( last in first out ) technique.,2.5, 13272,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack Data structure follows LIFO (Last In First Out) Rule. We use stack in :- \n- Depth First Search\n- Inorder Traversal of binary tree. \n- Finding postfix expression,2.5, 13273,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are based on the principle of LIFO i.e last in first out\n\nthe data that was entered in the last will be retrieved first,2.5, 13274,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are the data structure which works on the principle of \,1, 13275,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are used to compute to prestore some values and then compute the function given.it helps to give element from top and end in much less complexity.,1, 13276,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks to easily push the element in the list.,1, 13277,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks to temporarily store elements in an order which we can use later on. In other words it is a temporary holder of elements and \nmany other operations can be conducted with the help of stacks.,1, 13278,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks to store data in an order which we can utilise later. The various operations that can be perfor,1, 13279,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are the type of data structures which uses the mechanism of Last In First Out.They are helpful in storing large amount of data and is used in the algorithms which takes high space complexities.,2.5, 13280,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is a data structure which follows LIFO( last in first out ). We use stacks when we have to extract something in reverse order of its insertion. ,2.5, 13281,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","as stack is LIFO , we need a stack to get some of our operations in constant time . like insertion , deletion ",2.5, 13282,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks use LIFO (Last In First Out) approach which means the last element to be inserted gets deleted first. Stacks are used in various algorithms when we want to know the last element that was inserted or want the delete the latest element inserted. Stacks are used in recursion as the function waits for the answer from the latest recursive function callled.,2.5, 13283,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks use the LIFO (last in first out) approach which helps when our requirement of the problem requires us to have to delete the element inserted most recently.,2.5, 13284,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks to store the element/ data on LIFO basis. ( When the most recent information is required in the solution ). We use stacks in DFS where we are traversing the data using stack data structure.,2.5, 13285,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack are the data structure used to store data inside it. Stack are used when we want to pop the that data first which is pushed at last. It follows first in last out approach. ,2.5, 13286,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","We use stacks as per our requirement in a problem, when we want to address the last inserted value first (LIFO). Eg: Depth First Search",2.5, 13287,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are the data structures which are used to store the data in it and is used to delete some data or insert some data.,2.5, 13288,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks is also known as last in first out(LIFO). ,2.5, 13289,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",,0, 13290,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks is a special data structure with some functions similar to array. stacks help to store data from top and result out the data in different order is called stacks convert the arrangement of values from ascending to decreasing form.```,2, 13291,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",,0, 13292,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are used to add/remove elements in a particular order. Stacks can also be used for backtracking algorithms.,2, 13293,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks to add or remove elements in particular order.,2.5, 13294,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is a kind of Data Structure which is used for storing the data . Stack is very efficient to store the data if we want to store the data in order . Stacks are a better option to use over linked list because these can also be used in STL and we can easily perform many operations (like insertion and deletion ) in stack which is difficult to use in linked list .\nStacks use LIFO(Last In First Out) method .,2.5, 13295,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks when we want to represent data in the vertical form nd use functions which follows the principle of \,2.5, 13296,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks when we have to store the data in a vertical format or when we havew to access it on the LIFO principle (last in first out). We can use several built in functions to deal with the data stored in stacks for accessing the top most element or delete it.,2.5, 13297,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack works on the principle of Last In First Out (LIFO). IT is used to store object on which we want to perform operations later on and operations on those objects first which entered last.,2.5, 13298,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks can be used in conditions where we need to use the concept of first in first out.(FIFO) Examples of places where stacks can be used are undo/redo operations etc.,1.5, 13299,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","we use stacks for multiple use cases, for sorting, for prefix and post fix notation",2.5, 13300,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","We use stacks when we have to use the First In First Out (FIFO) approach. In stacks the element gets added to the top of the stack and the last element is removed when we want to delete (pop). Stacks are also used to solve the infix, prefix, postfix expressions.",1.5, 13301,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","A stack work for the retrieval of last element in the first order....It works on the basis of first come , last serve.",2, 13302,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks to store data in form of chronological order so as to retrieve the data accordingly. Stack allows us to use the memory efficiently by maintaining the top variable and keeping the count of data.\n ,2.5, 13303,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks when we want to work on the that last inputted value at the begining of our program as it used the property of LIFO (Last in First Out),2.5, 13304,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stack whenever we require FIFO(First In First Out) property in our solution.\n,2, 13305,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stack whenever we need FIFO(First In First Out) property in our solution.,2, 13306,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are used to fulfil the need of FIFO(First in First out) in the solution.,2, 13307,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are the data structures that are used to store large number of data.,1.5, 13308,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack are the type of data structures which are used to store large data.,2.5, 13309,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","it is a linear data structure in which elements are accessed, inserted and deleted from one end called the top of the stack. Stack follows the LIFO approach. Two basic operations on a stack are push and pop.",2.5, 13310,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",One good use of stack is to remove the implementation of recursion as it can recursively provide data instead of having to call a function again and again.,2.5, 13311,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are a linear data structure that works in Last In First Out method .They are used to store data and solve problems that require reversing and sometimes in trees.,2.5, 13312,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are useful data structures which follow LIFO (last in first out) . This can be be helpful in algorithms like depth first search in binary trees. ,2.5, 13313,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stack is a form of data structure which is like putting plates over another place it completely overlaps and whenever required we use the topmost plate.... similarly to store data in such a form where after storing we get obliged by last go first out format we use stack,2.5, 13314,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are used for LIFO purposes. LIFO stands for Last In First Out.\nIt is used to explore deep branches of trees and graphs. For example - Used in depth-first searching,1, 13315,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stack follows the last in first out approach. We use stacks to keep track of the order of operations\nfor eg. in a compiler the functions that are called last would finish first\neg2. to check parathesis, stacks are used\nDepth first search is used using stacks",2.5, 13316,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",1)for LIFO-last in first out\n2)problems are solved in order\n3)no direct jump to another function before completing one,2.5, 13317,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","to add or remove an element , it is FIFO",1, 13318,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Last in first out\nwe can use the data structure where we need to enter in last and take it out first,2.5, 13319,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",when we have use the functionality of first in last out then we use the stacks ,2.5, 13320,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","we use stacks to store data, which can be used later on. It uses the technique of last come first serve ( LIFO).\nexample: function calling uses stack implementation",2.5, 13321,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","We use stacks to insert data in a LAST IN FIRST OUT manner, it enables us to extract the piece of data that was inserted at the last . We can use top for getting the information regarding the data present on the top of stack and push , pop could be used respectively for insertion and deletion.",2.5, 13322,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","stacks is a data structure used to store in the values, it used the concept of LIFO (last in first out) and ejects values accordingly. It is used in searching algorithm and also in tries.",2.5, 13323,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks for storing the data linearly in such a way that we can use the oldest information first for our purposes as it is a LIFO(Last in first out)Process.,2.5, 13324,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc."," A stack is a linear data structure in which elements are accessed, inserted and deleted from one end called the top of the stack. Stack follows the LIFO ( Last In First Out) approach. Two basic operations on a stack are push and pop.",2.5, 13325,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are useful if we need to add or remove something in an array in an particular manner ,1, 13326,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",It is an easy way to store and access elements that only need to be used once.,1, 13327,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We can use stacks to make Last In First Out(LIFO) programs. ,2.5, 13328,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","we use stack to store memory temporarily, it uses LIFO which is helpful to recover data if lost.",2.5, 13329,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Application of stack is : In depth first search\nRecursive functions also use stack.,2.5, 13330,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. It can be used for systematic Memory Management, and even piling up of data.",2, 13331,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is used when we want to use the last element first as stack works on the principle of last in first out.,2.5, 13332,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Whenever we are in a need to store data linearly and have a tendency to take out the last inserted there we prefer to use stacks .,2.5, 13333,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is a last in first out data structure which is commonly used for storage of information and in some algorithms as well.,2.5, 13334,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks when we have to store the data in lifo fashion(last in first out)\nstacks are the data structure used in the background for backtracking and other operations,2.5, 13335,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stack or queue instead of arrays when we want the elements in a specific order. The order can be LIFO or FIFO anything.,2.5, 13336,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","stack is a data structure that follows LIFO. thus, the data on top will be out first, kind of like a bucket.\nstacks can be used to store temporary data files",2.5, 13337,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stack to calculate the operations like DFS we use stack so that first er focus on the deepth stack is first the last in first out is used in stack in which we traversal on each element ,2.5, 13338,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks is a data structure following the rule LIFO\nThe element entered in the last will the first one to come out\nStacks can also be used to make better algorithms for different data structures,2.5, 13339,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are last in first out based .\nthey can be understood as a pile of books \nthey are real life possible thing.\nwhen constrains of lifo are applied in a 1-D array it becomes a stack we use stack for organsing are data as examle:the recent incident is ought to be searched more in google this way we can store the data in stack and the recent input will be the answer reducing the time complexity,2.5, 13340,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can also be used for Backtracking.,2.5, 13341,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","stacks works on last in last out which can be used graph traversal , prefix suffixes etc.",1.5, 13342,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is a LIFO data structure that is last in first out.We use stack to keep track of memory and space used in a program so that when a stack overflows is gives us an error.,2.5, 13343,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stack uses last in first out technique so we use it when we need to access most recently entered data first,1, 13344,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks is a LIFO (last in first out) data structure in which it returns the last value stored in the stack when we pop out the top value and returns -1 if the stack is full.,2.5, 13345,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stack is used for backtracking. ,1, 13346,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack can be used for backtracking.,1, 13347,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks when Last In First Out method is used. ,2.5, 13348,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack implements Last In First Out(LIFO). Whenever we need this situation we use stacks.,2.5, 13349,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stacks are the data structure that performs operation in FILO, we majorly use stacks to use this operation. ",1, 13350,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stack for the use of first come last out approach. ,1, 13351,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",it is a efficient data structure that has a property of last in first out (LIFO) this property helps to perform certain action easily that why we use stacks,2.5, 13352,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is a data structure that follows the LIFO (Last In First Out Rule). A stack can be implemented using an array or a linked list. Stacks have different applications. \n1. It is used in Depth First Search (DFS) traversal of a tree.\n2. Recursive functions can be used to convert into iterative using stacks.,2.5, 13353,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are used to carry out and evaluating the operations and operands,1, 13354,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.", Stack is a data structure that stores the data according to FIFO (First In First Out) principle i.e. the data can be accessed through one way only. The data item that was stored at last will be accessed first. It is very useful while performing various searches.,2, 13355,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stack so that we get the information about memory or space like when we get stack overflow,2.5, 13356,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks because it is a linear data structure and is of the type last in last out. If we want to quickly store a value which needs to be accessed immediately afterwards (and discarded) we can use it. It is especially useful in divide and conquer strategy of algorithm solving. ,2.5, 13357,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","stacks works on LAST IN FIRST OUT, the element that has put in the last we have to access it first\nlike in case of DFS traversal of graphs.",2, 13358,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stack is a data Structure in which we can say our data is stored in stack ,(pilled up)\nIt is LIFO type Data Structure(Last in First Out)\n| 6 |\n| 5 | --> illustration of Stack\n|___4_ _ |\nit is used when we need to excess data which we entered latest.",1, 13359,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",when we are told to solve a question which demands first in first out approach or required to pop or put data in top to down manner then we use stacks.,2, 13360,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.", A stack can be used for evaluating expressions consisting operands and operators. It can be used for backtracking. It can be used to convert one form to other form.,2, 13361,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",so that we can remove first inserted element at last. as it works on last in first out principal last inserted element will be removed at first.,2, 13362,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression",1, 13363,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stacks is based upon first in first out principle or FIFO. The data that you are inserting in stack would be pushed out first after that the second, the third and so on.",1, 13364,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is a type of data structure to store the data. It works on the principle of first in first out. So if we need to store data and then retrieve it in opposite order of the values places then we should use stack data structure.,1, 13365,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are used when we want to use the last in first out principle as stacks works on LIFO.,1, 13366,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack uses LIFO approach (Last in first out) that means we can stack our data and the recent data is called first. Stack has some major applications in the understanding of recursion.,1, 13367,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks works on the principle of LIFO: Last in First out. This approach of retrieving the data and using it for it other purpose is useful in many problems and helps to reduce the steps of our solution. The stack module of STL library has predefined functions which reduce the effort of writing the most used pieces of code.,1, 13368,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",it is data structure works on last in first out basis.\nwe use it for\n1 expression evaluation-for evaluating arithmetic operations\n2undo/redo functions\n3.for backtracking and recursion,2, 13369,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stacks follow the Last in, First out procedure. So they are basically used to maintain the record whenever we need to fill a dataset and use these properties. ",1, 13370,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Merge sort, N queens problems, Closest pair problem",1, 13371,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","We use stacks wherever Last in First out property is required.\nFor example in parenethesis matching problem, stacks are used to store opening parenthesis until closing arrives.",2, 13372,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are used to arrange data in first in last out fashion.,1, 13373,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Whenever we need to access the data entered at last in a data structure first of all,1, 13374,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Merge sort ,1, 13375,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stacks are data structures that are based on the principle of Last In First Out (LIFO). We use stack to implement techniques such as recursion, some other examples are : Tower of Hanoi , Reversing Linked Lists etc.",1, 13376,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks rather than array to use elements in a specific order,2, 13377,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stacks are like a block in which we can push our elements. Then, we can find the top most element, pop out top element etc. It's time complexity depends on the operation but space complexity is O(n) as we are taking memory. Stacks can be helpful in questions like we have to find a count of a number, to check duplicate numbers. In such questions, we can pass each and every element of array in a stack. Then start popping out top element with necessary conditions.",1, 13378,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks work on the principle of LIFO (last in first out). Stacks can be used to record the track of elements stored.,1, 13379,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks to do the questions or algorithms in which we have to push the first element as pop it at last. as stack is filled bottom to top .\nLast in First out property,1, 13380,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks when we need to perform the LIFO (Last In First Out) operation in a particular problem.,1, 13381,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",it used in the cases for which we want the operation \,1, 13382,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is a linear data structure that follows LIFO method to perform all the operations.,1, 13383,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stacks are used to store data that are in order. They work on the principle of LIFO ( Last in First Out ). So , elements are stored when an array or any data structure is traversed and the last element traversed is stored on the top and can be retrieved first. This helps in accessing the recent or last data being stored and can be operated upon.",1, 13384,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stack is a data structure which the principle of LIFO (Last in First out). which can be seen in many places in daily lives like stack of a plate. sometimes this technique is used to solve various problem like like problem in which 3 rods are given and we have to move the discs from one rod to another and arrange them in a particular manner.,1, 13385,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are used to keep the record of the element .It follow the LIFO approach last come first out which mean the last element which inserted in stacks will come out first.,1, 13386,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are used for their FILO (First In Last Out) or LIFO (Last In First Out) properties.,2, 13387,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Merge Sort and problems such as shortest distance on 2D graph are the examples of divide and conquer algorithms.\n,2, 13388,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","stacks used LIFO (last in first out ) approach , we use stacks for comparison of words, string , for example we use stack in string matching algorithm . ",2, 13389,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",they are data structures used for storing data mostly in the form of first in last out order. \nyou can push and pop data nodes according to youyr requirements.\n,2, 13390,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","it is the faster, it is the use very easy",2, 13391,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stack for easy pushing and popping of an element the working of an stack is like a element is pushed at the end of the stack and one element popped from the top that we need ,2, 13392,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stack to solve problems where the data moves in a firs-in-first-out manner i.e. the data we push or insert in the stack last should pop or get removed first.,1, 13393,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are the data structure in which uses the principle of last-in-first out (LIFO) .it uses the push function (to insert the element) and pop function.,1, 13394,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks as it uses to implement LIFO technique last in first out technique and it can be very useful to solve mathmatical equations ina very efficient ways,2, 13395,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stacks are used to solve problems like undo text, ",1, 13396,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",depth first search uses stack data structure in its execution,1, 13397,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","stacks work on the principle of last in first out(LIFO),thus are useful when we want to remove elements in a this manner.",1, 13398,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",for last in first out kind of operations,1, 13399,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stack is used to implement last in first out ( LIFO) . the element we enter ,1, 13400,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks in the cases where we need to get the data from only one direction. It works on the principle of LIFO so in any case where we want to store the data in a linear data structure and we only need to get or access the element that was last inserted in in we use Stacks. It is very commonly used in search algorithms for Graphs. ,2, 13401,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are LIFO (Last In First Out) operators. Stack are used in balanced parenthesis problems where we have to check if the opening parenthesis are balanced by the number of closing parenthesis.,2, 13402,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is a linear data structure which follows the LIFO principle which says that last in first out and in many problems we need LIFO principle and we easily solve those problems by using stack.,2, 13403,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",when we have problem where we have to implement last in first out,2, 13404,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stacks are used in order to store data such that only 1 field is required at that time. As the name suggests, its just like stack of blocks we can say storing the data.\nTo take an example in order to make it more clear we use stacks in undo and redo operations. like in undo it gives what was the last step done. ",2, 13405,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","stacks are used to arrange the function calls in any problem, where we use the concept of last in first out, that is it for example there is a function which is has a function call of a print function within so it stops the execution right away and puts the print function on top now and solves it first and then goes back to the original problem.",1, 13406,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks as it eases the process of algorithm as the elements get arranged like stacks.,1, 13407,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks basically follows the principle of LIFO that is last in first out. And at many places we want this principle and hence we use stack there. Example where we use stack is depth first search.,1, 13408,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks work on the principle of LIFO that is Last In First Out. So whenever we deal with a problem where we need to deal with the current element first we would use stack.,1, 13409,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks follows first in last out property. so where we need to perform an operation where this type of operation is needed we use a stack.\n,1, 13410,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stack are the data structure use to store the element in such a way that the element which will come in Last, will get out firstly.\nIt obeys LIFO property and hence whenever we need it we use it.\nSome examples of use of stack are Depth First Search, For doing preorder or inorder traversal iteratively without using internal stack space, For solving any recursive problem, the system internally uses the stack.\n",1, 13411,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",in stacks as we use LIFO last in first out therefore it helps in problems where we need the data we entered last before others.,1, 13412,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks in cases when we need to insert the data from front and also take it(pop) from front. For instance in a library book management system we can use stacks for storing the data regarding the books. ,1, 13413,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","we use stacks to store the elements , then we can pop ,push the element , find the topmost element, etc.",1, 13414,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks uses the LIFO technique to form a linear data structure. ,1, 13415,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks to store data in the \,1, 13416,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is used when we require a linear data structure which follows LIFO technique. it is very useful when we need to apply recursion in program.,1, 13417,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are used for finding the particular order in whcih actions are perfomed.,1, 13418,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stack is based in Last In First Out property. These are at the basic level arrays only and can be implemented from the same. These are useful for performing quick operations like push, pop and where we need to remember the last element at which we were as it makes accessing the last element easier than in an array. ",1, 13419,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack follows FILO - First In Last Out rule.,1, 13420,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are used first in first out problems. the data enter first is pop out first,1, 13421,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",because it follows LIFO rule.,1, 13422,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are used to solve the problem where the data moves in FirstIN LastOUT manner,1, 13423,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks to store the data with last in first out system.it is used as a container to store the data items.,1, 13424,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",,0, 13425,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stack because:\na)to organize the data (large data)\nb)to provide the best time complexity\nc)to make our question easier,1, 13426,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks to store the data in form of LIFO i.e Last in first out,1, 13427,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks because of the feasibility of use and we also use it for back tracking.\nit also helps in converting one form of equation to another from.\n\n,1, 13428,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks can be used mainly for backtracking. It can also be used for convert one expressions to another expressions.,1, 13429,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stack is basically used for last in first out scenarios. It can be used in backtracking for eg. to check parenthesis matching in an expression,1, 13430,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stack to solve the algorithmic problems that require LIFO (Last in first out) data structures,1, 13431,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks use LIFO operation which means Last data in will be displayed first. It can be used in DFS tree traversal. ,1, 13432,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stack for applications that need first in last out type applications. It is a data structure that stores data in such a way that data entered last leaves first. It is also used to remove recursion.\n,1, 13433,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack data structure follows the principle where the first input is will be output last . It is used where we need to store the previous information but the operation we are asked to perform on the last entered input . LIKE STACK DATA STRUCUTURE IS USED IN DFS TRAVERSAL OF GRAPH .,1, 13434,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stack is used to store data in first in last out manner.,1, 13435,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stack are lifo operation which means the data we entered at last will come out at first.,1, 13436,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stack is a data structure which has property of last in first out (LIFO), so we can access only top element. It is widely used in recursive approaches such as devide and conquer algos as it stores all the recursive calls made. It is also used in evaluating prefix and postfix notations.",1, 13437,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are needed to insert and pop the data which it does in constant time complexity. It follows the LIFO(last in first out) fashion.\nInsertion and deletion of the data is very simple in stacks. There are various other operations that a user can perform by using stacks.,2, 13438,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stack used when we want to follow the order of LIFO. last in first out element arrive in last will remove at first.,2, 13439,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks work on last in first out basis. We use stack or queue instead of arrays/lists when we want the elements in a specific order i.e. in the order we put them (queue) or in the reverse order (stack). \nstacks are dynamic while arrays are static. So when we require dynamic memory we use queue or stack over arrays,2, 13440,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stack when we have to process data in linear manner,2, 13441,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack Data structure is of LiFo type data structure i.e. \nLast in first out type it is used in many algorithms but the main use of stack is while doing problems \nthat use recursion as the last call of any recursive function will be executed first,2, 13442,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are used on the concepts of last in first out which includes a data structure in which element which is added first come out last and the element which is inserted at lsst is first out,2, 13443,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","The approach to develop algorithms depends on the problem we are solving that is given to us. An appropriate data structure is chosen, multiple of them can be used as such. And then we try to reach the end goal of the solution using the least amount of traversal or time complexity and manipulate our data accordingly. ",2, 13444,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","A Stack can be used for evaluating expressions consisting of operands and operators. Stacks can be used for Backtracking, i.e., to check parenthesis matching in an expression. It can also be used to convert one form of expression to another form. It can be used for systematic Memory Management.\n",1, 13445,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",LIFO data structures. Last in First Out.\nSo we can use stack when we want to compare an element with its next element. We can solve the problem in linear time complexity and linear space complexity. Stacks are very useful in questions where we are dealing with piles or related scenarios. Like for example two piles of stones from which we can remove the stone on top to make one of the piles shorter in height. ,1, 13446,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are used to store large amount of data.\nStacks are very much important data structure as it has unique property of LIFO.,1, 13447,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is a modification of array which follow LIFO(Last in first out )property.\nWe use stack data type when we need these operations like in BFS algorithm we need parent node information which is visited lastly so we use stack for this so we can delete that element which is used lastly.,1, 13448,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stack as a memory to store elements or usually to store large amounts of data,1, 13449,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",There are certain problems which can be solved very easily using stacks in place of array because of it works on the principle of LIFO(Last In First Out).,1, 13450,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","For secondary or auxiliary storage to store some particular values, \nStack operates on LIFO - Last In, First Out.",1, 13451,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are last in first out data structure when we use recursive functions stacks are used by recursion or whenever we need functionality like last in first out we use stack,2, 13452,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks is used as a better substitute to solve certain problems in place of using an array,2, 13453,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stack is used to implement linked lists. In place of arrays , stack is better suited to solve certain problems.",2, 13454,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stack works on the principle of LAST IN FIRST OUT. when we want to use LIFO type of data structure we use stack,1, 13455,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","We use stacks for the cases where we need to solve problem according for LIFO(last in first out ).In other words, we use it where we need to solve the problem by solving for sub problems. We solve the main problem in the last and sub problems firstly.",2, 13456,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","we use stacks when we want to access the last element added in the data structure ,i.e. we want to use LIFO principle.",2.5, 13457,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks to store data in a way such that it can leave or enter,2.5, 13458,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","The stack is - last in first out, it mean we are going to fill the stack with data but if we take the data from stack it will give the lasted data which have been inserted in the stack.",2.5, 13459,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stack is used in arrays it used sometimes for sorting ,deleting the index given term and it works like first in last out for this approach it solve easily ",0, 13460,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks to store data in a linear fashion and retrieve data in Last In First Out manner.,2.5, 13461,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","We use stack to store data, it is follows the principle of LIFO; that is last in first out. The element we enters at last should be pop out first.",2.5, 13462,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stack in an algorithm whenever we need to have a track of the previous element in the algorithm,2.5, 13463,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Since stacks follow the principle of LIFO which makes insertion very easy in stack .Function by default use stack data structure.,2.5, 13464,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks are used when we need a data structure which requires LIFO(Last in first out) Lets assume there is a problem in which we need values for the last added data in our query so by using stack it will help us to reduce the time complexity ,2.5, 13465,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",,0, 13466,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stack when we have LIFO priority i.e. data that comes last executes first. Example : in our printers.,2.5, 13467,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks in cases where we need to traverse a particular data in a sequential manner and at the same time store the data from that given data in a paricular sequence as per the conditions. For example we us e stack stack to traverse a string and convert it to infix to post fix there we need satck because stack allows first in last out . So we can use the stack to pop or push any values in a sequential manner. ,2.5, 13468,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks because it follows last in first out approach,0.5, 13469,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stack is data structure which uses last in first out approach. it gives data that is added most latest in the data structure. it has various applications and is used to solve many famous problem such as tower of hanoi . it is also used by operating system to set priority of tasks ,2.5, 13470,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is a data structure that allow its data member to pop out in a LIFO manner which means the last in first out which translates to an opposite of what queue does. ,2.5, 13471,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack are Last In First Out or LIFO data structures. Whatever comes last in the stack will leave first and correspondly with other elements in the stack. They are often used in DFS or depth First search.,2.5, 13472,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",,0, 13473,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",We use stacks when we want to always access the last element that went in the stack while performing pop operation. (LIFO),2.5, 13474,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks to store data \nwhen output is required in in lifo manner ,2.5, 13475,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","we use stacks to easy our programing,",0, 13476,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",as stacks works on the principle of LIFO (last in first out)\nfor eg:- if you have assign the various trolleys (numbered from 1 to 50) in a mall to the customers coming \nso we can no. the first customer with 50 and next will be assigned with 49 and so on.,2.5, 13477,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","using stacks , we can easily search an element",0, 13478,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks works on the principle of FIRST IN LAST OUT ,1, 13479,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stack for swapping values e3asily.,0, 13480,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are use to organize the data in a sequence so that it can be accessed easily \nis stack data is arranged in the form of fifo(first in first out ) \n,0, 13481,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stacks are used when we have to follow the Last In First Out(LIFO) principle with the given data, i.e. when the latest data holds the greater priority to be taken out.\nSome of the uses are:-\n# DFS(Depth First Search)\n# Tower of Hanoi\n# In Prefix, Postfix and Infix problems",2.5, 13482,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are linear data structure which are used to store the data,0, 13483,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",,0, 13484,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stack to arrange the element it flows first in first out policy in which a element which come first will terminate first.,0, 13485,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks are the data structures used for storing data and impliment it by following the property of LIFO (last in first out),2.5, 13486,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stack is a type of data structure use to store data ,0, 13487,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","because stacks works on last in first out so stacks are useful in graph traversals and other searching techniques. push, pop etc are also used in stacks",2, 13488,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","we use stacks to perform the problem in less time interval, their are predefined stl functions, we also use push and pop approach in stack for the functioning of the problem.",1.5, 13489,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",,0, 13490,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","Stacks can be used for traversal. Stacks can also be used to store data. It uses the Last In First Out Principle. Stacks are used in recursion, the undo - redo feature, etc .",2, 13491,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks is used to store the extra data of some set that is not in use but can be required in further research.,0, 13492,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","like there are some problems we face while working on arrays that is when we want add more items in array we need to preallocate the memory whereas in stacks we need no pre allocation and we can add or remove any item at that instant, ",2, 13493,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.","we use stack , to solve the problems in FILO form , like n number of plates are kept in such a manner that the first plate in the last and last plate which inserted in last , chosen to first.",2, 13494,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",the stack data structure is used when we need a first in first out type of algorithm for our program.\nthe stack library is easy to understand and use.,0, 13495,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stack to store a data in a a database in a ferment of form of fist in last out it help to optimizer the performance and the result of the given problem ,1, 13496,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",Stacks can be use dto ,0, 13497,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",stacks provide fist in fist out FIFO approach that way we use stacks ,1, 13498,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",last in first out method,1, 13499,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",we use stacks for problems which require FIFO and for the prefix and suffix problems too .,0, 13500,Why do we use stacks?,"Stacks follows LIFO method and addition and retrieval of a data item takes only Ο(n) time. Stacks are used where we need to access data in the reverse order or their arrival. Stacks are used commonly in recursive function calls, expression parsing, depth first traversal of graphs etc.",the purpose of using stack is to store the data in the present file,0, 13501,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"enqueue(addition of elements),dequeue(deletion of elements)",2.5, 13502,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,operations that can be performed on Queues are \ninsert a node from end\nremove a node from beginning\nremove a node from middle\nsearch a given node\ndelete a node from beginning \ndelete a node from end,2.5, 13503,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"some common operation which can be perfomed in queues are inserting an element in a queue ,deleting an element from the queue ",1.5, 13504,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"1) Insertion: Inserts at the top of queue\n2) Deletion: Deletes the first element of the queue\n3) finding the topmost element\n4) Searching: Find the topmost element, if not correct delete it and continue",1, 13505,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,enqueue\ndequeue\nsort\n,2.5, 13506,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"The operations that can be performed on queues are enqueue , dequeue, and to check whether it is empty we can call isEmpty() function. we can also do searching in queues.",2.5, 13507,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Enqueue( )\nDequeue( )\npeek( )\nisfull( )\nisnull( ),2.5, 13508,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,. searching an element \n. sorting an element,2.5, 13509,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Following operations can be performed on queue\n- Insertion of node (enqueue)\n- Deletion of node (dequeue)\n- Searching\n- Sorting,2.5, 13510,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,,0, 13511,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,operations that are performed on queues are as follows-\n1. is empty(); \n2. is full();\n3. insert(); // to insert value in the queue\n4. delete(); // to delete values from queue,2.5, 13512,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1) top\n2) isempty\n3) merging of queue\n4) pop\n5) push \n,2.5, 13513,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,The basic operation of queues is to store data in such form by arranging its minimum and maximum data in according to priority queue.\npop\npush\ndeletion\ninsertion\n,1, 13514,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Since Queue works on FIFO- first in first out mechanism we can perform functions on it like PUSH (to enter data) and POP(to remove the data).,2.5, 13515,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,operations that can be performed on queue are :\n- dequeue\n- enqueue\n,2.5, 13516,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,enqueue\n- dequeue\n- peek,2.5, 13517,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,queue follows FIFO i.e first in first out\n\noperations that can be performed are:\n1. insert data in queue\n2. retrieve data from the queue,2.5, 13518,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full," (LIFO).\nIn this, if we enter/push the values at the last of the stack then the first value will be returned.",2.5, 13519,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"insertion, deletion, extract min ,extract max can be done on queue",1.5, 13520,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"push, pop can be performed",2, 13521,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Enqueue , Dequeue ",2.5, 13522,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,enqueue and dequeue are the very common operations that can be performed on queues,2.5, 13523,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Queues are type of data structures which use the mechanism of First In First Out. the operations which can be performed on queues can be \n1.Enqueue: entering particular element in the queue \n2.Dequeue: deleting the particular element from the queue ,2.5, 13524,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Queues are data structures which follow FIFO ( first in first out ). Operations that can be performed on queue are :\ni) push() : inserts data in queue\nii) pop() : deletes data in queue which lies at first position (i.e. inserted first),2.5, 13525,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"enqueue ,dequeue ,traverse , get size , reverse , search ",2.5, 13526,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,enqueue: To add an element to the queue.\ndequeue: To delete and element from the queue.\nfirst: To find the first element in the queue.,2.5, 13527,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Insertion, Deletion, Traversal",2.5, 13528,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"push, pop and finding the address ( using iterator) of an element in queues.",2.5, 13529,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,there are several operation that can be performed on Queues :\n1) pushing element into it.\n2) popping element from it.\n3) find address(iterator) of an element of Queues.\netc.\n,2.5, 13530,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"On queues, we can perform post-fix, pre-fix conversions, Breadth First Search.",2.5, 13531,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"pushing, popping are some operations which can be performed on queues",2.5, 13532,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Queues :First in first out (FIFO)\nwe can perform various operation on queues like:\n1)enqueue (to insert a element in queue)\n2)dequeue(to delete a element in queue) ,2.5, 13533,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,,0, 13534,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Queues help us to perform certain operations which are pushing and popping a particular element from the queue to get the order and element we want.,2.5, 13535,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"\nOperations that can be performed on queues are \ninsertion, deletion, function call, ",1.5, 13536,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Operations that can be performed on a queue are enqueue (adding an element to the end of the queue) and dequeue (removing the element at the starting of the queue),2.5, 13537,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"enqueqe, dequeue ",2.5, 13538,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,The are many operations which can be performed in queue like searching and sorting but the most important one is FIFO (Fist In First Out ) method.\nIn FIFO method the element which inserted first should be deleted first.,2.5, 13539,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full, or \,0, 13540,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,we can push an element in the queue on the FIFO principle using push and also pop the last element inserted using pop.,1, 13541,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Enqueue (Insertion into queue)\nDequeue (Deletion from queue)\nFront (To print the front of the queue),2.5, 13542,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Queues can be used in the cases when we require to use the concept of LIFO (last in first out). For example shortest job first , breadth first search in graphs, level order traversal of trees etc.",2.5, 13543,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Sorting can be performed so amazingly on queues, simple functions like push and pop can be use to sort out an array of the given input by the user.\n",2.5, 13544,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Operation that can be performed on queue are:\n- Dequeue (delete)\n- Enqueue (insert)\n- Disjoint-set operations: -union -find,2.5, 13545,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,A queue works on the basis of first come first serve and it performs various dynamic operations .,2.5, 13546,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Operations that can be performed on queues are:\n1. Insertion\n2. deletion\n3.rbegin\n4.rend,2.5, 13547,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Various Operations that can be performed on Queues are:-\n1)Push_back\n2)rend\n3)rbegin\n4)begin\n5)end\n5)pop\n6)deletion,1, 13548,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Following operations can be performed on queues:\nInsertion\nDeletion\nSelection\nPush back\nEnd\nBegin\nPop,2.5, 13549,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,The following operations can be performed on Queues:\n1)Insertion\n2)Deletion\n3)Selection\n4)End\n5)Begin\n6)Pop,2.5, 13550,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Deletion, Selection, Insertion, Pop, Begin",2.5, 13551,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"We can perform various operations on queues like Insertion,Deletion,Union etc.",2.5, 13552,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Major operation performed on queue are\n1. Enqueue - Used to insert data in queue in FIFO order.\n2. Dequeue - Used to remove data from queue. it always removes first element.\n3. Front - used to return first node or first element from queue.,2.5, 13553,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"queues follow FIFO , first in first out \nenqueue and dequeue\nDFS can be performed using Queue",1, 13554,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"enqueue, dequeue, insertion and deletion based upon FIFO (First In First Out) technique and searching is also done by removing each element and inserting them back.",2.5, 13555,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,push and pop operations can be performed on queues,2, 13556,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Insertion and deletion can be performed in queue. Since in follows FIFO (first in first out). New data is inserted at latest node and data is deleted from earliest node.,2, 13557,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,storing of data \nimplementations of stack and various data structures\nfirst go first come type scheme\n,2, 13558,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Operations that can be performed on Queues - \n1. Push - inserting an element\n2. Pop - deleting an element\n3. front - getting the top element \n4. end - getting the last inserted element\n5. empty- to find if the queue is empty or not,2.5, 13559,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Queues follow the first in first out approach\nQueues have the following operations\n1) insert/enqueue\n2) delete/ dequeue\n3) front \n,2, 13560,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1)Insertion\n2)Deletion\n3)Updation-Priority queue,1.5, 13561,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"add or remove an element , compare elements , etc",1, 13562,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Queue()\nenqueue()\nempty()\nnull()\npeek(),2.5, 13563,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,insertion and pop operation ,1, 13564,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Some of the operations that can be performed on queues are:\n1. insertion\n2. deletion,1, 13565,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"The operations that could be performed on queue(FIFO) are push(helps too insert), pop(helps to delete the first position); first(returns the first position data); last( returns the last position data).",2.5, 13566,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Many operations can be performed on queues like insertion of element and deletion of elements and searching and sorting ,1, 13567,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Operation that can be perform on Queues are insertion, deletion and searching.",2.5, 13568,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,QUEUE IS FOLLOW THE FIFO THE OPERATIONS ARE PERFORMED IN ARE :-\nINSERTION \nUPDATION \nDELETION,2.5, 13569,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"enqueue , deque, peek, isfull",2.5, 13570,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,The following operations can be performed on queues: \n1. Insertion\n2. Deletion,2.5, 13571,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Enqueue, Dequeue, Search, Empty, Reverse are some of the operations.",2.5, 13572,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"insert back and pop front, other operations can include iterating the data",1, 13573,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1.Insertion \n2. Deletion \nQueue is used to perform breadth first search in trees or graphs.\n,2.5, 13574,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"insertion, deletion, searching, ",1, 13575,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1. reversing\n2 traversing\n3. searching of an element.\n4. sorting,2.5, 13576,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Following operations can be performed on Queues:\n->Enqueue\n->delqueue\n->delete ,2.5, 13577,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Deletion, merging, insertion can be used on queue while priority queue arranges the information with respect to the information provided by the user.",1, 13578,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,the operations that can be performed in queues are\n1 push( insert an element)\n2. delete( delete the element from the queue)\n3 emptying of queue,2.5, 13579,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,The queue operations are as follows:\n\n1.create\n2.enqueue\n3.dequeue\n4.isEmpty\n5.isFull\n6.size,2.5, 13580,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,enqueue (push)\ndequeue (pop)\ntraversal,2.5, 13581,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,queues is used for first in first out and it is uesd for various operation such as BFS and varipous other operation .it is used to treverse on level vise on the graph.,2.5, 13582,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,queue()\ndequeue()\nfront()\nisEmpty()\npush(),2.5, 13583,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Queues are FIFO (first in first out).Can be related as to a queue of a movie ticket .push() pop() front() top() enqueue() dequeue(),2.5, 13584,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,basic operations that can be performed on queues are :\nEnqueue() - Insertion of elements to the queue.\nDequeue() - Removal of elements from the queue.\nPeek() - Acquires the data element available at the front node of the queue without deleting it.\nisFull() - Validates if the queue is full.\nand many more.,2.5, 13585,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,operations can be performed on queues are insertion deletion merging searching sorting,2.5, 13586,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,enqueue and dequeue,2.5, 13587,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,enqueue-add data to queue\ndqueue-delete data from queue\nsearch element \n,2.5, 13588,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Enqueue, Dequeue",2.5, 13589,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Dequeue, Enqueue are the operations can be performed on Queues. ",2.5, 13590,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Operations in queue are- enqueue, dequeue, peek.",2.5, 13591,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"deletion, insertion, sorting ,",2.5, 13592,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Queue implements First In First Out(FIFO). \nInserts the element and takes out that element first.,2.5, 13593,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"The operation that can performed on Queues are Push() , Pop() , Top() and etc. ",2.5, 13594,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"queue, dequeue, front",2.5, 13595,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,queues are basically first in first out (FIFO) so it helps in many ways to solve problems ,2.5, 13596,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Operations that can be performed on a queue:-\n1. Enqueue (insertion)\n2. Dequeue (deletion)\n3. Traversal,2.5, 13597,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,push pop enqueue dequeue,2.5, 13598,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Following operations can be performed on queues:\n1- Insertion\n2- Deletion\n3- Searching,2.5, 13599,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Enqueue , Dequeue",2.5, 13600,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"On analysis if n queens problem when observing a queen, we can discard the entire row, and entire column of the 2D array. Further we can eliminate other positions by going from [ i ][ j ] to [ i+1 ][ j+2 ] till the end of the j column and then doing j++. A queen can move vertically, horizontally and diagonally form her position at [ i ][ j ].",2.5, 13601,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,like push refers to adding an element to a queue\npop refers to deleting a top element from a queue.,2, 13602,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,FIFO Type Data Structure(First in First Out)\nOperation:\n->pop\n->push,2, 13603,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"FILO operations can be performed , to build heap we use queues.",1, 13604,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Operations that can be performed on Queues are enqueue i.e., adding an element to the end of the queue , dequeue i.e., remove an element from front of a queue, isempty to check if queue is empty or not.",1, 13605,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,push \npop,1, 13606,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Enqueue() \nDequeue() \nPeek() \n,2, 13607,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,q.push - insert elements in queue\nq.pop - delete elements in queue\nq.isempty() - checks if the queue is empty or not \n,2, 13608,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Queue is used to store data and then retrieve it in the same order as placed. We can insert, delete, and search in a queue.",2, 13609,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,operations that can be performed on Queues are push and pop.,1, 13610,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,pop(): Removes the element from the front\npush_back(): pushes the element at the back\ntop(): return the front most element\nempty(): checks whether the queue is empty or not,2, 13611,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"push, pop, sort, are the most basic operations that can be performed on queues. push gives us the first entered element. pop deletes the first entered element. Queue works on FIFO: First in first out. ",2, 13612,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,top():returns the top element\npop():eliminates the top element\nempty():to check whether the queue is empty or not,1, 13613,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Push and Pop operations can be performed on Queues. We can also check if it's empty or not. ,1, 13614,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Stacks follow LIFO order. Last in first out.\nThey are used because we can insert and delete elements in them with ease.,1, 13615,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1. Enqueue - Insertion\n2. Dequeue - Deletion\n3. Traversal \n4. isempty\n5. isfull\n6. find top element,2, 13616,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"push operation,\npop operation,\nsearch operation",2, 13617,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Enqueue()\nDequeue() \nPeek()\nisFull() \nisNull()\n,1, 13618,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Expressions with operands and operators can be evaluated using a stack. To check whether the parenthesis in an expression match, stacks can be utilised for backtracking. Additionally, it can be used to change one expression into another. It can be applied to methodical memory management.",2, 13619,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Some operations that can be applied on the queues are:\n1. Push (to insert elements at the end of the queue)\n2. Pop (to remove elements from the start of the queue)\n3. Seek (Top) operation (to get the first elem of the queue)\n4. Size operation (to get the size of the queue),2, 13620,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1) create\n2) enqueue\n3) dequeue\n4) isEmpty\n5) isFull\n6) size,1, 13621,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1. We can find front element\n2. Rear Element\n3. Pop out elements\n4. Sorting\n5. Searching\n6. Number of elements,1, 13622,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"pushback(). top(), pop() and other operations can be used on queue.",2, 13623,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,isempty \nsearch \nenqueue\ndequeue,2, 13624,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,The most common operations on queue are Push and Pop. ,1, 13625,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full, or \,2, 13626,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,There are many opearions that can be done on Queues. Some of them are :\n1. Insertion\n2. Deletion\n3. Traversal,1, 13627,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Extraction of first element present or we can call popping out, Reducing the size of the queue, Sorting on queues are possible, Min-Max elements retrieval, Insertion , Deletion ",2, 13628,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1. push operation to add some object in the queue\n2. pop operation to remove some object from the queue\n3. seek operation returns the object present at the first place in a queue\n4. size operation returns the size of the queue\n5. is_empty operation to check whether the queue is empty or not,1, 13629,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Inserting , deleting ,searching , traversing .",2, 13630,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Queues are used for their FIFO (First In First Out) properties. The operations that can be performed are pop, push, peek, is empty.",2, 13631,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Stack uses LIFO (Last In First Out) principle which means that element occurred last will exit first. It majorly used in reversing the given input and also in some algorithm of Graphs and trees.,1, 13632,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"operations which can be performed on queues are:\ncomparison of string , calculating the pattern we want from text,\nqueue ca be used in binary tree for finding complete binary tree",1, 13633,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,,, 13634,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"create, eequce, dequce, size, is empty, is full.",1, 13635,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,,, 13636,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"pop()->deletes the very first element in the queue, push(x)-> inserts x at the back of the queue, size()->tells the size of the queue, empty()-> checks whether the queue is empty.",1, 13637,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,The Operation performed in queues are\n Enqueue (for inserting the element )\nDequeue (for removing the element )\n,1, 13638,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,In queues we can perform \na)push()\nb)pop()\nc)delete() \nd)isEmpty() operations,2, 13639,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,some operations are:\n1)queue- add element to the queue\n2)dequeue-remove element from the queue,1, 13640,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"insertion, deletion can be performed on queues",1, 13641,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"insertion ,deletion",1, 13642,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,first in first out operations,1, 13643,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"push() ->to push the data into the queue , pop()-> to remove the front element , top() -> to show the value of the front element ",2, 13644,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,The most common algorithms that can be performed on a Queue are \npush - to insert an element\npop - to get the first inserted element\nisempty - to check if the stack is empty ,1, 13645,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1.push:can enter an element\n2.pop: can delete the element at the top\n3.front: can return the top element(which is entered in starting)\n4.size: can return the size of existing queue\n,2, 13646,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"We can perform operations like enqueue(insertion in queue) , dequeue(deletion in queue). ",1, 13647,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,dequeue : to remove the first element from the queue.\nenqueue : to push an element at the end of the queue.,1, 13648,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Operations which can be done on Queue are enque, deque, changing the value of element etc.",1, 13649,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"enqueue, dequeue",2, 13650,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Operations that can be performed on queues are insertion, deletion , finding the first element of queue using top function, etc. ",1, 13651,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"We can push the elements(enqueue) , pop elements from queue(dequeue). ",1, 13652,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,enqueue is used to add a new element in the queue.\nDequeue is used to delete the first element in the queue,1, 13653,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,queues can perform\ninsertion - push\ndeletion - pop\noperations,1, 13654,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Queue is FIFO type datastructure.\nThe operations performed on queues-\nPush - Used for pushing or inserting the element in the queue from back.\nPop- Used for popping out an element from the front of the queue.\nTop- Used to get the top most element from the queue.\nRemove or delete- For removing a particular element from the queue. For updating the queue.,1, 13655,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,enqueue() = insertion \ndequeue() = Deletion\ntop()\n,1, 13656,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Operations which can be performed are:\nenqueue, dequeue, pop, push, isfull, isempty, delete, sort etc",1, 13657,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"we can create min, ,max heap, priority queue, which is works efficiently in searching max or min functions.",1, 13658,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Queues use the first in first out technique. (FIFO),1, 13659,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full," fashion. If we want to store something in a data structure and pop(remove) it in the last, then we use this data structure",1, 13660,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Queues can have the following operations-\nFirst in, First out\nSearching\nSorting\n\n ",1, 13661,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"insertion,deletion can be perfomed on queues",2, 13662,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Operations that can be performed on queues - enqueue, dequeue, isempty()",1, 13663,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Pop operation - delete an element from rear\nPush operation - insert an element from front,1, 13664,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,pop()- to delete the element\nisempty()- to check is queue is empty or not\npush()- to insert a element on top \n,1, 13665,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Insertion, deletion and search.",1, 13666,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Push-- To insert element\nPop --- To delete element\nSize---\nisEmpty- To check Empty Queue,1, 13667,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"enqueue , dequeue ",1, 13668,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"enqueue , dequeue ",1, 13669,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,The operations which can be performed on queues are:\n,1, 13670,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,,0, 13671,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,dequeue()\nenqueue()\npeek()\n,1, 13672,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,,0, 13673,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"operations that can be performed in queue are:\nenqueue(insertion) , dequeue(deletion), front(to get the first element), back(to get the last element), size(to get the size of a queue), isEmpty(to check whether it is empty or not), etc.",2, 13674,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"you can insert, remove and check the front element in a queue, you can also check the size of queue and whether it is empty or not",2, 13675,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"insert, pop, isempty",2, 13676,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,pop- returns and delete the first object or the object that was entered first\nenqueue- insert a new element at the end\nsize()- return the size of queues\nisempty- checks wether the queue is empty or not\nfront- to get the first element,2, 13677,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,The operations that can be performed on queues is enque and deque,2, 13678,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Queue is structured as an ordered collection of items which are added at one end called rear end, and other end called front end.",2, 13679,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1. enqueue\n2. dequeue\n3. isempty\n4. isfull\netc\n,2, 13680,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Queue supports first in first out (FIFO) property, we can perform :\n1. pop operation -> It gives you first element that was inserted in queue\n2. push -> it pushes a element at last in queue\n3. front -> it gives you the front element present in queue",2, 13681,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Queue are needed to insert and pop the data which it does in constant time complexity. It follows the FIFO(First first out) fashion.\nInsertion and deletion of the data is very simple in case of queues. There are various other operations that a user can perform by using Queues.,2, 13682,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"pop, push and many other.",2, 13683,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1. enqueue: adding a element at the end of the queue.\n2. dequeue: deleting an element from the front of the queue.\n3. traversal\n,2, 13684,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,push-insert an element at the end of the queue\npop-remove an element from the front of the array,2, 13685,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Push function\nPop function\nTop function\ndelete function\nare the function performed on queues,2, 13686,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,queues are used in first in first out in this data structure first element is get out at last and last element is out at last,2, 13687,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Merge sort and quick sort are examples of divide and conquer algorithms ,2, 13688,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1)Enqueue()\n2)Dequeue() \n3)Peek() \n4)isEmpty() \n5)isNull() ,2, 13689,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Comparing with real life scenarios, like the ticket line, songs playlist.\n\nWe can control as per our preferences (and even the generic preferences - Priority Queue), the order of activities that we want to experience. Some performable operations will be - \n1. Insertion 2. Deletion 3. To know what's at the top 4. To compare the time/other activity related queries if provided with the information.",2, 13690,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1) Enqueue\n2) Deque\n3) Front\n4) Insert\n5) pop,2, 13691,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Common operation are;(FIFO property)\n1.Insertion from top;\n2.Deletion from top;\n3Retrieval;,2, 13692,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,The operations that can be performed on queues are:\nEnqueue\nDequeue\nInsert\n,2, 13693,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Deletion, Insertion and Retrieval. ",1, 13694,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Insert (known as Push)\nDelete (known as Pop - can only be used on the chronologically first entered number)\n,1, 13695,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,operations that can be performed on linked list are-;\n1-push( )-which pushes the element in the queue\n2-top( )-to get the top element of the queue\n3-pop( )-to remove the top element from the queue,1, 13696,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1)insert\n2)delete\n3)retrieve,1, 13697,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,enqueue and dequeue are the functions required to make a queue in c++ . Queue follows first in first out. ,1, 13698,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,it works on FIRST IN FIRST OUT principle. we can perform various operations like:\npush()->inserting in queue.\npop()->deleting form queue.\ntop()->gives the top element of queue.,1, 13699,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"push(),pop(),top() etc.",1, 13700,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"pop,push/push_back,sorting,top,etc.",0, 13701,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"queue, dequeue",2, 13702,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"The operations that can be perform on queues are-push, pop , remove . ",0, 13703,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,In the queue operation will be used that the element of array initialize first in last out.,0, 13704,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"push, pop",0, 13705,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Queue is similar to stack but it follows the principle of FIFO; that is first in first out. Many operations can be performed om queue like sorting and searching.,1, 13706,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Insertion of element, deletion of an element, swapping between elements, traversing on elements.",1, 13707,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Enqueue & Dequeue can be performed on queues Priority Queues can also be made. Queues follow FIFO principle.,2.5, 13708,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"queue can perform push,deletion,searching ",0, 13709,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,enqueue \ndeque are the operation which can be performed on queue,2.5, 13710,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Push and dequeue can be performed on queues.,1, 13711,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"The operations that can be performed on queues are-: push, pop, isempty etc.",0, 13712,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"push, pop, top",0, 13713,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1. enqueue\n2. dequeue\n3. isfull\n4. isempty,2.5, 13714,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Two common operations that can be performed on a queue includes insertion and deletion.,0, 13715,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"push, pop, front are some of the operation that can be performed on Queues.\n\n",0, 13716,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,push in queue and pop and top are perform in queue ,0, 13717,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1. Push: push to first location\n2.Pop: pop from first location\n3. Delete: from a particular position.\n,0, 13718,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,enqueue\ndequeue\n,2.5, 13719,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,,0, 13720,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"operations on queues are\npush, pop, insert, delete\n",0, 13721,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"Insertion , deletion , sorting , searching are the operation ",2.5, 13722,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Enqueue and Dequeue are two operations that can be performed on queue.,2, 13723,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,enqueue and dequeue,2, 13724,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,operation on queues can be performed such as lifo (last in first out ) ,0.5, 13725,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Several operations can be performed on queue like:-\n1. Insert:- To insert a value in queue from the rear side\n2. Delete:- To delete the value from queue from the front side.\n3. Traverse:- To visit the elements and values on queue.\n4. Edit:- To edit the values of queue.\n5. Store:- The values can be stored in queue for later access.\n\nQueue specific operations are:-\n1. Q-In: To insert the value from the rear side.\n2. Q-Out: To delete of push the value out of the queue. ,2.5, 13726,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"enqeue ,deqeue",2.5, 13727,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,there are two operation perfom on Queues:\n--> Enqueues\n-->Dequeues,2, 13728,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"in queue we can performed sorting ,searching ,insertion and deletion operations",0, 13729,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,insertion \ndeletion\n,2.5, 13730,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Enque: Inserting data in Queue\nDeque: Deleting data from Queue,2, 13731,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"insert, pop,push",0, 13732,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,insertion deletion etc,0.5, 13733,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Enqueue and Dequeue,2, 13734,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,The operations that can be performed on Queues are :\nEnqueue : Enter the element in the queue via the end of the queue\nDequeue: Remove the element in the queue via the start of the queue\nisFull : Checks if the queue is full or not\nisEmpty : Checks if the queue is empty or not,2.5, 13735,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Operations that can be performed on Queues is ,0, 13736,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"dequeue , enqueue,\ninsert .delete",2, 13737,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,we use enqueue and dequeue ,2, 13738,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,Insertion: Queues follow the Last in first out order.,1, 13739,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,in queues the method which is used insert update delete,0, 13740,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,,0, 13741,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,queues provide fist in last out FILO approach operation insert delete push pop ,0, 13742,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,first in first out.,1, 13743,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,1)insertion\n2)deletion\n3)enqueue\n4)dequeue\n5)isempty()\n6)isfull(),2.5, 13744,What operations can be performed on Queues?,The below operations can be performed on a stack – (1) enqueue() − adds an item to rear of the queue (2) dequeue() − removes the item from front of the queue (3) peek() − gives value of front item without removing it (4) isempty() − checks if stack is empty (5) isfull() − checks if stack is full,"sorting, searching, algorithms can be performed on queues",0, 13745,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is a basic searching algorithm in whick the element to be searched is stored within a variable and is then compared with every element of the array till the element we are looking for is found.,2, 13746,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is when we search for the elements from beginning to end and at whatever location the number is found we return its address its time complexity is O(n) ,2.5, 13747,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in linear searching we search for the given element one after the other so the time complexity of linear searching is O(nm) \nit can be useful if we a small array ,1.5, 13748,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear search checks every element of the data structure and checks if the values match, if not, it moves on to the next element",2, 13749,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search is basic searching algorithm which goes through the entire data structure like an array and returns tthe element if it is found. It checks the entire length of the data structure and hence is less time efficient.,2, 13750,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear search is used to search a element in a data structure like array, string in o(n) time complexity. Here we implement a for loop on to traverse the data structure and match its every element to the element we are searching for, if it gets matched ,then break and we get out of loop.",2.5, 13751,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is the simplest method of searching a data set.,1, 13752,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","In linear search , the algorithm traverse the whole array and if it finds the key element or the desired element then it prints that element.",2, 13753,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted."," In Linear searching the program traverse through each and every element in array or node in link list and checks whether the element matches the key or not, if key is found the program returns the element and its position otherwise it displays key not found",2, 13754,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found,2, 13755,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",this is searching in which values to be searched is to be searches from the first index till the last index until the value is found .It takes o(n) time .,2.5, 13756,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Searching of any thing in a linear time is called linear searching . For instance u have a 1-D array and have to find the element then it will be an example of linear searching .\nint find= 25; , int n ( size od array)= 6;\nfor (int i =0 ; i < n ; i ++)\n{\n if (a[i]==find)\n{ return i ; }\n}",2, 13757,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",This is the searching technique in which we compare the given key one by one in a linear form.,1.5, 13758,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Search is a form of element traversal and searching in which we start from the initial element and go on checking the next element until we find the desired element in any data structure. Though it takes linear time complexity it is not feasible for large amount and we thus need to resort to other searching techniques like binary search, median search etc. ",2, 13759,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a searching technique that uses for loops to search the values .\nits time complexity is : O(n^2),2, 13760,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",In this searching method we are searching required element from index 1 to last index consicutively until the element is found.,2, 13761,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching refers to searching all the elements one-by-one\n\nIt is a brute force search technique and will use the maximum time to finish,2, 13762,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",,0, 13763,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is the manner in which we iteratively traverse the whole array to search the given element present in it.it has complexity of 0(n),0, 13764,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is searching whether an element exists in a linear list or not. It is a simple search where we check each element of the list and compare it to the element we have to find. If the element is found then we make the counter=1 otherwise the counter remains 0 as we had intitially initialised it.\n,0, 13765,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",When we search for the target in an array or any other data structure by going one by one from one end to the other is known as linear searching. It is a brute force and a very simple approach but it takes more time compared to other efficient algorithms.,2.5, 13766,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","When we search an array or any other data structure in a specific direction , one by one from one end of it to another , then it is known as linear searching. However linear searching is more time consuming than the other efficient algorithms.",2, 13767,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is a way to search for the particular element in a given array. Each element of the array is comparted with the element to be searched when the required element is found it returns the index as well as that element from the array taking O(n) time complexity. ,2.5, 13768,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search is a searching algorithm which used to find a \,0, 13769,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching take O(n) time to search an element from the data structure. example array take O(n) time to search an element.,1.5, 13770,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",When we search for an element linearly in an array or linked list by traversing one by one through the array or list till we find the element required in O(n) time where n is the size of the array or list.,2.5, 13771,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",The kind of search which takes linear time(O(n)) for searching an element is called linear search.,2.5, 13772,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching technique which takes linear time O(n) to find an element in a given sequence/array.,2.5, 13773,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching the data from start to end one by one is called linear search. The time complexity of linear search in O(n). ,2.5, 13774,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","When we traverse an array from the beginning till the end checking each element, this approach is known as linear searching.",2, 13775,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is the searching in which the particular element is searched linearly that is the first element of the array is checked first and it linearly increases from arr[0] to the size of the array. That's how the element is searched one by one in a linear manner. It has the time complexity of O(n).,2.5, 13776,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching: suppose we are given an array and a element value (key) then we will iterate on every index of an array until we find that key. this will take o(n) time.\n,2.5, 13777,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is basically searching an element in a linear time where searching element say x is compared to every element present in the data structure.,2, 13778,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a searching in data structure helps to search a particular element in a given array.\nIt start from the first element and checks the element then second and continue until found the particular element in the array in o(n) time.,2.5, 13779,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",In Linear Search we traverse each element of the given array and we run a for loop from starting index of the array to the last index of the array. We start traversing each element and we will stop at that index at which the element which we want to find is equal to the element while traversing the array . And after that we will return that index . And if that element doesn't exist in the array then we will return -1. ,2, 13780,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search is a searching technique. In linear search we use key element to compare each element in a given array. ,1.5, 13781,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",It is a searching technique in which we iterate the array and compare each element with key element.,2, 13782,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",In the Linear Search we will search the element by going on every index.\nWe will implement a temporary variable which will traverse the array and if the element will found at any of the index it will return the index of the array then we will able to found the element through the linear search. ,2, 13783,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",(LIFO).,0, 13784,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching refers to traversing all the elements one by one resulting in O(n) time complexity.,2.5, 13785,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Searching for an element by traversing in the given data structure element by element is known as linear searching. Its time complexity is O(n), n being the size of the given data structure. ",2.5, 13786,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A search technique that requires the visiting or analyzing each element while traversing to find the required element is called linear search. Its time complexity is O(n).,2.5, 13787,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a method defined under the searching methods of linear data structure. in this yo go left to right to search for the desired value.,2, 13788,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is the most basic search algorithm that we can perform. It has time complexity O(n).\nIn this we set the element that we want is set as \,2.5, 13789,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Comparing an element with the every element of an array from beginning to end is known as linear searching.,2, 13790,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear search algorithm uses a loop to singly traverse the data and search for a particular key on a specific time. Its time complexity is equal to O(n) where n is the number of elements in worst case.,2.5, 13791,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is the most common searching algorithm used to search a particular value in a array by traversing over each item present in a array.,2, 13792,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is a process of checking each and every element of the given data structure with the key element. ,2, 13793,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is the algorithm in which we search for an element in an array by looking at every element in the array from start to finish.,2, 13794,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching means to search a particular element in a single line or at a same level from the start to the end.,2, 13795,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is defined as method of finding the element by traversing through the data structure one after the other and matching it by each element linearly. ,2, 13796,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is a type of searching technique in which system traverse on each and every element in order to search a particular item.,2, 13797,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching involving the time complexity of O(n),1, 13798,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",a linear search algorithm is where we traverse through an entire row of elements and compare each of them separately to check for the element we need to search for.,2, 13799,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is the method simply find the target element in list of values provided with n2 time complexity using only for loops,1.5, 13800,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is the simplest form of searching in which we search for an entity in a given set of data one-by-one in a linearly order.,2, 13801,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is the brute force method to search a particular number or character in a given input of list or array respectively,2, 13802,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching is searching by using one iterator. \nLinear searching can be done in arrays, linked list, hashing, etx.",2, 13803,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching includes going at every element in a list from the start and searching for the element\nIt take O(n) time where n is the number of elements in the list,2.5, 13804,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is the process of searching using linear time complextiy ie. Big O of n.,2.5, 13805,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",to search for an element linearly in all elements ,1, 13806,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is just simply moving right of element is greater and left if lesser and finds the element this way,1, 13807,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear Search is defined as a sequential search algorithm that starts at one end and goes through each element of a list until the desired element is found, otherwise the search continues till the end of the data set. It is the easiest searching algorithm.",2, 13808,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","linear searching is the easiest method of searching. Starting from the beginning of the data set, each data is matched from the key (element to be found) until a match is found.",2, 13809,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",When we start searching from the first element of data set and keep searching each element linearly one by one until the element is found.,2, 13810,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search is the simplest form of searching where you can directly compare the given element to the next element and reorder according to their sizes,1, 13811,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a type of searching where we search our info linearly i.e by iteratively visiting the each node.,2, 13812,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",In the linear searching we traverse a array one to one if the element is find than stop and print the element and is time compexity is O(n).\n,2.5, 13813,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is the most basic type of searching in it we search for the element by checking them one by one in an array,2, 13814,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching refers to searching for a particular data in a linear fashion, i.e, going from one data to another as they are stored in an array.",2, 13815,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","In linear searching, the element to be searched is compared sequentially with each of the elements in array. Its time complexity is O(n).",2.5, 13816,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","linear searching is searching sequentially one after another, time complexity o(n)",2.5, 13817,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",When we search for an element by traversing the array. \nIt takes linear time .,2, 13818,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","linear searching is one of the sorting techniques in which we declare an array and then compare each element of the array with the key or element we are searching for.\nas soon as the key is found, we print the key along with the position in the array where it was found.",2, 13819,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",When we search the element linearly and check them element which we want to search with every element of the data structure from first element to last and when we find the element we can return true.,2, 13820,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching as the name suggests is the process of searching elements linearly generally it has O(n) time complexity. ,2.5, 13821,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is when the array is searched in ascending order of its index value in a unidirectional manner.,2, 13822,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is the searching of a data structure in a linear fashion by comparing the element that we have to find with each element of the data structure(array) and if we find the element we return true and note the position of the element. ,2, 13823,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","A linear search is the simplest approach to search for an element in a data set. It examines each element until it finds a match, starts from the beginning of the data set, until the end. The search is finished and terminated once the element is located. If it finds no match, the program gets terminated",2, 13824,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",traversal of the data structure while matching it with required item/data is known as linear searching. we can use loops for the same ,2, 13825,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",this is the algorithm which search the element in ,1, 13826,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","It is a searching method that searches a given array of elements linearly, that is from the first memory block to the last, OR\nfrom i[0] to i[n - 1]",2, 13827,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Linear searching is searching algorithm with linear time complexity such as linear search,it wll view every element till the required element is not found.Its worst case time complexity is n.",2, 13828,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is a searching technique in which we check each element of the list in a linear order until the desired element is obtained.,2, 13829,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search is searching from start checking one by one at a time whether the no is found or not,1.5, 13830,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a searching technique that takes O(N) of time complexity.It starts from first index and compares every element with the required element till it finds the element.On finding the element it returns it index if not found return -1.,2.5, 13831,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",it is a searching technique that involves visiting each element individually and is efficient in case of unsorted data.,2.5, 13832,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",In Linear Searching it compare each number with every other number and then gives the output. \nIt has time complexity of O(n) times.,2.5, 13833,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is the searching of the element one by one. ,1, 13834,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",A sequential search is made over all items one by one is known as linear searching.,1.5, 13835,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","in linear searching, we compare every element of the array to the element which is to be found.",2, 13836,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear Searching is traversing the array in a linear fashion. \nStart searching from the first element and go on searching until you find it.,2, 13837,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is a algorithm in which we perform our searching a array element one by one if the element of our search present in the array . We return the element from our search.,2, 13838,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",a searching method which used to search a data in a liner form it has no special condtions it will just check every element which is data structure.,2, 13839,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",in linear search we compare (if it is equal or not ) the element we have to search with every other element present in the array and return the index if we find the element or else return -1,2, 13840,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching in a linear time is called linear searching.\nLinear searching is an example of this type of searching. It has a linear time complexity [O(n)].,2.5, 13841,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching up the elements one by one linearly pointer starts from the start moved and looks at every index wherever it matches it stops ,2, 13842,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is searching a data item through simple looping method i.e. searching the entire array for the particular data item.,2, 13843,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",We compare each element of the array one by one with the element we want to find if its equal then we found the element . Its time complexity is O(n)\nfor(int i=0;i o(n) where the n is the length of the array,2, 13929,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is to search the target at every index of array one by one\nits time complexity is O(n),2, 13930,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is which in which we search linearly and only one for loop is used and its time complexity is O(n).\n,2, 13931,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","Stacks work in the way of FIFO (First in first out ) method. It is a data structure which is used to efficiently manipulate data in a way such that the element on the top of the stack goes out and when output is displayed or accessed and there when we input any element in the stack, it goes on top of it. Any algorithm or problem which benefits from the same uses stack.",2, 13932,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Traversing the whole data structure and searching whether the required element in the data structure or not.,2, 13933,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.","When we are provided with data, for example in the form of an array. And we need to search for an element in the array of datas. So we can traverse throughout the array and look for the data. We can maintain a flag variable to mark the existence of the data. We do this in linear time because in the worst case we will have to traverse through all the data provided. This is linear time searching. ",2, 13934,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching is searching technique/algorithm in which our algorithm traverse through our data single time.,2, 13935,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Linear searching a searching technique for array/linked list which is used to find inputted element by traversing the array/linked list one by one from starting till element is found. Its complexity is O(n). ,2, 13936,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",The search that can be completed in linear time is linear searching.,2, 13937,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",It is a type of search in which each we take the element to be searched and it is being compared to all the elements present in the array. ,2, 13938,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",Searching elements in a data structure or algorithm where all the elements being searched at the time are at the same level.\nExample: Level-based search in Binary Search Trees.,2, 13939,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear searching is a technique in which we go to every possible position one by one in a data structure and check it if it matches the given target it is done in O(n) complexity,2, 13940,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",searching an element of an array and comparing them with all the elements present in the array,2, 13941,What is linear searching?,"Linear search tries to find an item in a sequentially arranged data type. These sequentially arranged data items known as array or list, are accessible in incrementing memory location. Linear search compares expected data item with each of data items in list or array. The average case time complexity of linear search is Ο(n) and worst case complexity is Ο(n2). Data in target arrays/lists need not to be sorted.",linear search involves checking each element of the array with the input . A for loop is run and an if condition is put inside it to check if the required value is in the array. The time complexity is n.\narr[n];\ncin>> x;\nfor(int i=0; i Quicksort firstly picks up an pivot element from the list \n-> Then is divides the list into three sub lists 1. element lower than pivot element 2. elements equal to pivot element 3. elements greater than pivot elements\n-> Then it does the same for th,2, 14242,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot,1, 14243,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"It works on divide and conqueror approach whole array is divided by choosing an element as pivot and then elements less than pivot are in one array and element grater than or equal to pivot are on other side ,when only 2 elements are present in array after dividing ,using the Partition function we sort the array and solve the smaller part of the question so that to get the solution of whole problem.",2.5, 14244,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort 1st divide the array and traverse it from both the side if it found the element greater then from there is again breaks the array and do it till the heaviest element comes at start and lowest at end and then merge the array again , basically it uses divide and conquer approach .",2.5, 14245,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works on divide and conquer method , first it divide the given array in two and then further dividing it until it consist two values which are then sorted the given array and then again adding together to form the sorted array.",2, 14246,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick Sort is based on divide and conquer mechanism , we take a pivot element and two pointers on either end of the array. The pointer on the start (p ) moves towards the left and the one of the end (q) moves towards the right while comparing the values to that of the pivot element. Conditions of pivot element being greater than value of q or less than q are checked for the pointer to move forward and if the pointers cross each other then the element is swapped with the pivot and this continues till the entire array is sorted.",2.5, 14247,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works on the basis of divide and conquer methodology.,1, 14248,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"We randomly pick a pivot element \nWe have two pointers front at 0th index, back at (n-1)th index, front pointer will increase and back pointer will decrease.\nElement smaller than pivot element will be placed to the left and element bigger then the pivot element will be placed at right side.\nWhen front > back , front and pivot will swap the element.\nSame procedure will be repeated for left side and right side of the pivot element until array is sorted.",2.5, 14249,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort works by creating a partition on an element in the array such that all the elements on the left of the partition are smaller than the partition element and all the elements on the right side are greater than the partition element,2.5, 14250,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"The only difference between insertion sort and selection sort is that of the selecting item.\nIn selection sort, one of the very beginning item is selected and it is compared with all the rest of the items ahead.",0, 14251,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort finds the partition element in the array first or the pivot element mostly the first element.\nthen it place the pivot to its correct position and we passes two recurrences from 0 to partition -1 and partition +1 to last element of the array.\nin each iteration of recurrence all the pivots are places to its correct position thus the array become sorted. partition places to its correct position by shifting the element smaller than it to left and bigger on right.\n\n\n,2, 14252,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick Sort is a sorting technique used to sort a list given to us.\nIn quick sort we make a function partition(). We start traversing the list given from the start as well as the end using the variables say, 'start' and 'end' respectively.\nThese two variables act as starting and ending indexes of the values respectively in the list.\nWe also choose anyone element of the list say the starting element and store it in a variable say 'part'.\nWe compare the starting element and ending element with the element stored in variable 'part'. If the starting element is greater than 'part', then we move the start index forward. If the ending element is smaller than part then we move the end index backwards. This way we do until the start and end indexes cross each other, as soon as it does we replace the element at the end index with the element stored in variable 'part'. We proceed in this way till we obtain the sorted list.",1, 14253,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort we select a pivot element which can be the first , last , middle or any other random element and then we partition the array with the pivot element as the divider.\nWe use divide and conquer algorithm as the basis for doing this sort then individually we sort the small parts and lastly join them together to get our sorted array.\n",2.5, 14254,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort we select a random element from the array which could lie anywhere in the array and then we divide the array with the pivot element at wherever that random element lies. It could be the first , last or the middle element.",1, 14255,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 14256,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Insertion sort and selection sort are sorting algorithms with time complexity of O(n^2). The main difference between these sorting techniques is that in insertion sort, we sort the elements by comparing every element with its neighbors and placing it accordingly in the array. However in selection sort, this is not the way elements are sorted. ",0, 14257,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort take a pivot value and divide the array in such a way the left side al element should be smaller then pivot element and at left of the pivot all element should be greater then pivot it does this operation in partition function. \nbasically it follows divide and conquer strategy to sort array \ntime complexity : O(nlogn) ,2.5, 14258,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,We take a pivot in the array and we have a partition function. An iterator( i ) moves from the left till it finds and element larger than the pivot and an iterator( j ) moves from right till it finds an element smaller than the pivot. If i> j then we swap the elements if not then the elements remain the same. The pivot is then shifted to the next element in the array and repeating these steps the array gets sort. This is how quick sort works.,2.5, 14259,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"A pivot element is chosen and then two pointers(i and j) are initialized, one which begins from the left of the array and the other which begins from the right. The pointers are traversing trough the array and the elements in the respective position are compared to the PIVOT element. Any element smaller than the pivot is inserted before the pivot. \n",2.5, 14260,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"We take a pivot element and two pointers are taken as reference ( I and j ) which are initialized at the beginning and the end of the array respectively, and move in forward and backward direction ( left to right and right to left). The pointers traverse the whole array comparing with the pivot and place the element correctly by satisfying the given conditions using swap function. \n when array[I] crosses array[j] swap the pivot and position of j pointer. Also when comparing the array if array[I] > array[j] swap the elements and move further.",2.5, 14261,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 14262,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, an element is taken as pivot and is inserted in its correct position by shifting the smaller elements to its right and the larger ones to its left. In this way the entire array is sorted.",2, 14263,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort has the worst time complexity of n log n which is better than the worst time complexity of merge sort but the best time complexity and average time complexity of merge sort and quick sort are same.,1, 14264,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,The basic steps involved in quick sort is:\n1)partition : we divide the given array in two parts \n2) pivot element: we take pivot element and sort the two different parts\n3) after sorting we merge the two different parts which is already sorted in a new sorted sequence\n O(n log n ),2, 14265,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quick sort works on the divide and conquer approach where the array is divided in parts using a pivot element which can be in middle ,start or end of the array and then merge in sorted order.",2, 14266,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,time complexity of quick sort is - n log(n)\nquick sort is a sorting technique helps to sort out the number in a required order .It makes 2 pointers temp and I for 1st and 2nd element and then check element one by one to know which one is greater than the other if a[i]>a[temp} then swap the function.\n\n,2, 14267,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick Sort works using partition method . \nIt uses Divide and Conquer approach.\nIt chooses a pivot element. Then it make comparison with pivot element and further it proceeds with quick sort Algorithm procedure. \nIt takes O(n^2) time. ,2, 14268,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort algorithm uses divide and conquer algorithm to sort any given array.,1, 14269,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,a quick sort works by selecting a pivot element and then arranging the elements according to the pivot element and then again repeating the steps till the array is sorted.,2, 14270,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,First we will apply the base case .\nThen we will two temporary pointers first one is for the element from which we will have to start the traversing of the array and next one is for the next element of the previous one.\nlets take them i and j\nin this we have cases when i is smaller than one then just return noting and when they are equal then also return nothing but when i is greater than j then we have to swap it depends upon from which side we are traversing and and in which order we will have to traverse.,2, 14271,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Linear Searching is the process of searching in which we search the elements by traversing all the elements in the given order one by one till the element to be searched is found.,0, 14272,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort uses a pivot element to sort the rest of the elements around it. it moves the pivot element to the right place and lesser elements to the left of it and greater to the right and then applies quick sort again in the left and right sepetrately. Works on divide and conquer algorithm.,2.5, 14273,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, elements are picked one by one and then shifting it to its correct position by counting elements smaller than it in the given array and then placing it.",1, 14274,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works by choosing a pivot element randomly and comparing all elements to it and swapping when it encounters a larger element . it then stores it as partition variable and divides the array into two parts with indexes from 0 to p and p+1 to n and performs the above mentioned step till it reaches division of array length of 0. ,2, 14275,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it is sorting technique that involves sorting the array be analyzing the values and then sorting according to them.,1, 14276,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In Insertion sort, the next smallest element is inserted in the array at it's appropriate place.\nIn Selection Sort, the smallest element in the array is found and selected to place it appropriately.\n",0, 14277,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"A quick sort separates the array into two parts and then compare the pivot element with each element if the sub array, if it is again not found , then it again divides the sub array into half ..it does it until the array is sorted in the order. The pivot element is the smallest element of the array.",1, 14278,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works by maintaining a pivot element. We start two loops maintaining two pointers i and j, i starts from 0th index while j starts from end and traverse towards the start. If the ith element is less than the pivot element the pivot and element are swapped and if pivot is greater than jth element and pivot and jth element are swapped, when i crosses j the pivot is shifted to that point and the loop starts again and goes on till all the elements are sorted.",2, 14279,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quicksort is a sorting technique that have a complexity of (nlogn ) and is widely used in carrying out sorting.\nit calculates a pivot element and and then traverse the array which has to be sorted and check whether each element in array is smaller than or greater than pivot element and \narrange them according untill very end.\nPivot Element can be calculated as a first element or as a last element or as middle element.,2.5, 14280,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In the sorting technique the pivot element is compared with the other elements and then the positions of the element is changed accordingly.\nThis sorting technique uses a time complexity of O(n log n).,1, 14281,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In the sorting technique the pivot is compared to the other elements and changed accordingly.\nTime Complexity= O(n log n).,1, 14282,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, we select a pilot element and then compare it with other elements swap accordingly.",1, 14283,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort is a type of sorting technique. It works on the algorithm of divide and conquer. It takes a pivot element and two other pointers up and down. It then compares the pivot elements with up and down pointers element respectively and swaps the elements based n few conditions. \nIf pivot<=down move to next \nElse swap (pivot,arr[down])\nIf pivot >up then move to next\nElse swap (pivot,arr[up])\nIf up or down crosses each other ",2.5, 14284,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In quick sort algorithm we take an element from array which is called pivot and place it on the position such that all elements on the left hand side of pivot element are smaller that pivot element and on right hand side all elements are greater than pivot element. This is done recursively to sort array.,2.5, 14285,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,QuickSort is a divide-and-conquer algorithm that selects a pivot element and partitions the array such that all elements smaller than the pivot are moved to its left and all larger elements to its right. This process is repeated recursively on each partition until the entire array is sorted.,2.5, 14286,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quick sort works through the method of divide and conquer, it involves an array being split and selection of a pivot point and swapping of the elements based on the pivot point.",2, 14287,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, a pivot element is selected which can be fixed in front , back or middle of the list and then the list is divided in parts based on this pivot element and certain conditions . we sort the individual parts and then combine them finally ",1, 14288,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It selects one element and puts it in it's rightful position and then do it for the elements on it's right and on it's left recursively.,1, 14289,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quick sort uses a pivot point for the sorting purpose and categorize the equal to, less than, and greater than where the pivot point is again selected and the procedure goes again till the list gets sorted",2, 14290,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort takes a element as a partition and divides the array and then with the help of swapping, it arranges all the numbers which are smaller than the partition element to the left of the array and the elements which are larger than the partitioned element are arranged to the right of the array. The process repeats till the whole array is sorted. \nAlgorithm used - Divide and Conquer",2.5, 14291,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, \n1)choose a pivot element randomly from a list.\n2) All the elements lesser than the pivot are put to the left side of the pivot, and all the elements greater than the pivot are put to the right side of pivot\n3) The process is repeated for the left and the right side",2.5, 14292,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort uses a key value and then compare with other elements present in the array.,1, 14293,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"picks an element as pivot and partitions using it and then sorts , it is based on divide and conquer",2, 14294,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It works on the model of Divide and conquer algo in which it is divided in two parts then sorted and recursive steps are call to receive a sorted data,2, 14295,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"its sorting algorithm its take O(n) time in sorting \nIts divide the number of element in 2 part and take the key and find whether the mid element is greater, equal and lesser than or not .if not again its divide its. ",2, 14296,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we take a random element which works as a pivot and then partition the elements according to the pivot and placing the pivot in its correct position,2, 14297,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"We need a pivot point , then we consider all the elements smaller than pivot to the left of it and sort them , then we consider all the elements larger than the pivot at the right of pivot and sort them . At the end we have a sorted array.",2.5, 14298,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort takes a middle element and sorts according to whether the coming element is greater or less than the given element ,2, 14299,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In quick sort we choose a pivot it can be last or first element of an array than we break it into two parts such that we have pivot+1 elements in one array and remaining in another array then we sort the array by keep on comparing it with pivot and meanwhile increasing the index of pivot.,2, 14300,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In the quick sort we define the pivot point where pivot point can be define as a first element of the array ,last element of the array and the middle part of the array .By the help of pivot point we can traverse the the i and j pointer so that sort the given array .and after the print the array. And the complexity is different for all the different pivot points.",2, 14301,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it a divide and conquer based searching technique,1, 14302,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, we first define a pivot element, for which we can take the first, last or the middle element of the array. We then sort the array according to the pivot element such that it reaches its sorted position. We then repeat the process on both sides of the pivot element using recursive call until all the elements are sorted. ",2, 14303,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, a pivot point is selected and all the other elements are compared to that element. The elements smaller than that element are placed on the left side of that element and the elements larger than the element are placed on the right side. The same procedure is repeated on the left side elements and the right side elements.",2.5, 14304,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quicks sort works on the principle of divide and conquer,1, 14305,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works by taking a random element 'a' from the array and assigning the rest of the elements to three arrays s1 , s2 and s3. \ns1 contains the elements that are less than a\ns2 contains element 'a'\ns3 contains elements greater than 'a'\nif |s1|>a\ncall the function with (a,|s1|-a,s2,s3)\nelse if |s1|+|s2| > a (a,|s1|+|s2|-a,s2,s3)\n",1, 14306,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort is one of the most efficient sorting algorithms. It works by breaking an array (partition) into smaller ones and swapping (exchanging) the smaller ones, depending on a comparison with the 'pivot' element picked.",2, 14307,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It divides the array into parts till it got divided into individual units and then compares the 2 units at a time and then combined them in sorted fashion till the array gets sorted.,2, 14308,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is to find a pivot elemnt then comparing the elements if greater put right side else left side.,2, 14309,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort takes a pivot element and based on the value of the pivot all smaller elements goes left while all larger goes right of the pivot. The array is broken down into sub arrays like in merge sort and then we sort the basic sub arrays just to merge them and form the sorted array once again. ,2.5, 14310,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,\nin quick sort the array is divided in half with each pass till we reach upto the minimal level that is element level and then compare it with the array next to it to sort it in the correct order ,2, 14311,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quicksort is a type of divide and conquer algorithm for sorting an array, based on a partitioning it\nTo sort an array using quick sort we do following steps:\n1. You will make any index value in the array as a pivot.\n2. Then you will partition the array according to the pivot.\n3. Then you will recursively quicksort the left partition\nAfter this we will recursively sort the array.",2, 14312,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 14313,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort algorithm is the process of arranging the element in the some order as accending order or decending order this algo take the privote element and sort the element in better timr complexcity and give as trhe result in faster way.,1, 14314,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"We make a pivot element,\nWe start a loop, i starting from position 0 and j starting from position n - 1, comparing the elements, if the element is smaller than the pivot element, send it to the left side of the pivot element and if it is greater than the pivot element, send it to the right of the pivot element",2.5, 14315,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we take a pivot point and then count the number of elements smaller than the pivot.Move the pivot to its original place.move the elements smaller from pivot to the left (order/sorting)doesnt matter and bigger than pivot to right pass both the array to quic sort again.this eventually selects pivots and keeps them in right places until the array is sorted.,2.5, 14316,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick Sort works by breaking an array into smaller ones and swapping the smaller ones depending on the comparison based on the pivot element picked.,2, 14317,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we take a pivot element and compare the numbers from the pivot element such that small numbers are present on the left side and greater numbers are present on the right side,2, 14318,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works by taking a pivot either as start element,mid element,or last element,Then initialising i and j index Doing i++till we get an element at i that is greater than pivot and j++ till we get an element less than pivot, comapring with pivot and swapping pivot and A[j].It is a divide and conquer algorithm.",2.5, 14319,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works by taking a pivot element than comparing it with an element in the array and changing swapping elements if the element greter than or lesser than it is found depending upon pivot element that is chosen.,2, 14320,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort firstly select a pivot point and then place that selected pivot point at its correct location. ,1, 14321,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 14322,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort works by breaking an array into smaller ones and swapping the smaller ones depending on the element picked.,1, 14323,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quick sort works by assigning random (preferably first or last) element to pivot, and then using quicksort algorithm we rearrange elements less than pivot to the left of pivot and elements greater than pivot to the right of pivot. This algorithm works recursively until array is sorted.",2.5, 14324,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort works on the Divide and Conquer principle.\nIt is partition's the array using Lomuto partition and then joins it in a sorted manner.\nIt is a tail recursive function.,2, 14325,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort are the sorting algorithm in which we compare our element to the just next element of our array . If the next element of our array is less than the previous one then we performs swap function between those two element else we do noting.,1, 14326,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,first we chose a pivot and divide the araray in more 2 parts and we continue to do it and at the end we combine them while sorting happens.,1, 14327,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works first we have to find partition element it is generally the last element of the array then we find partition array in which we fix the correct position of the partition element and then with divide and conquer algorithm we make recursive call to find position for elements before partition element and after the partition element.,2, 14328,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is a divide and conquer algorithm. It has an average time complexity of nlogn but in worst case the time complexity is O(n^2)\n1. In quick sort an element is made a pivot element.\n2. The array is partitioned on the basis of the pivot element.\n3. Quick sort is recursively called on the partitioned arrays too till they become sorted.\n4. The sorted arrays are then combined and we get whole array sorted.,2.5, 14329,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we choose a pivot element and the ones which are less are arranged on the left side and greater ones on the right side and then again sorting is done in three sided after that the entire output is merged,2.5, 14330,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works according to divide and conquer approach, in this sorting method we make the use of \",1, 14331,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In insertion sort we place element one by one on its correct position . In selection sort we first find the minimum and maximum element and then compare other element with these minimum and maximum element and swap the element,1, 14332,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is done by taking a random element (for example the middle element and taking the element as the pivot and then sorting the array in the sense that all elements lesser than the pivot are sorted to the left side of the pivot and all elements grater than the pivot are in the right side of the pivot (Although not necessary in the sorted increasing order at first). Then we recursively call the quick sort algorithm for both the left and the right sides of the array. After this the array is sorted in an increasing order.,2.5, 14333,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,we try to place every element in its correct position in the array\nwe make two pointers and start traversing from first and then check if the last pointer value is lesser or greater\nif greater than move the pointer and else swap it and move the pointer forward and similarly repeat this\nyou will every element in its correct position. ,1, 14334,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Divide AND Conquer Algorithm\nwhich divides our let say array in two different halves one by one then recursively sort and combine the array\n,1, 14335,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,takes the first index and checks it whether it has any values smaller than that and post increment counter variable if it found the number . \nwe swap the first index with the index of counter value . \nthen we recursively checks both the sides of the first index value which is now positioned let say at x.\nthat's the working of quick sort in a nutshell.,2, 14336,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is the sorting algorithm based on the divide and conquer algorithm that picks an element as a pivot and partitions the given array around the pivoted point by placing the pivot in correct position in sorted array.,1, 14337,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,position indexing,2, 14338,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," It works by breaking an array (partition) into smaller ones and swapping the smaller ones, depend upon the comparison with the pivot element that we have .\n",2, 14339,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,A pivot is taken in this sorting. That pivot element undergoes for further comparison with key. if its less than key then key is searched in array before the pivot. ,1, 14340,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort uses a partition to divide the array into two parts and then sort the two parts individually(placing all elements at their right positions). It uses divide and conquer approach.\nIt works on the complexity of O(logn).,2, 14341,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,, 14342,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, a pivot is selected (first, last or random) using partition algo and a recursive call is made until the elements before pivot are smaller and elements after pivot are greater and the array is sorted.",1, 14343,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, we define a pivot. then we bring all the values less than the pivot to it's left and all the values greater than the pivot to its right. After that we sort the left part and the right part recursively and we have the sorted array.",2, 14344,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works on partition algorithm .we select a pivot element that can be either beginning or last or middle or random element such that the elements before it are smaller than it and elements after it are larger than it. then we recursively call for pivot elements until the array is sorted.,2, 14345,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort uses a pivot value, to split down the array. The values are compared at both sides, and then rearranged accordingly. The pivot is also switched with time and the flow of order of swapping. ",2, 14346,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In selection sort, we firstly calculate the largest/smallest element in the array and swap it with the first element. In second phase, we repeat the thing, but here we calculate the largest/smallest in the remaining array (excluding first index). We keep repeating the process until the array is sorted.\n\nIn Insertion sort,we divide the array in two parts- sorted and unsorted. We place the elements one by one from the unsorted part to the sorted part in their correct position",2, 14347,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Pivot is selected from the array. Then the array is divided into three parts cotaining elements less than, equal to, greater than the pivot. ",1, 14348,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, we take an element as pivot and we check for each element by taking two pointers and swap if it satisfies the IF CONDITION then if I>J then we just swap the pivot with j.",2, 14349,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It works by selecting a pivot element and breaking the array into smaller parts ,2, 14350,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"The insertion sort sorts a set of values by inserting the values into a presorted file. The selection sort, on the other hand, determines the least number from the list and arranges it in some order. Sorting is a fundamental procedure that involves placing an array's elements in a certain order to improve searchability.",2, 14351,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort works by\nStep 1 : finding a pivot point at a random index of the array\nStep 2: Arranging the array in such a way that the left side of the pivot is smaller than the pivot value and the right side is greater than or equal to the pivot value.\nStep 3: Make a recursive call of the fn quick_sort on the both left and right parts of the array.\nStep 4: Continue this until the base case i.e. Size of array is 0 or 1 is met ,1, 14352,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"To sort an array, you will follow the steps below:\n1) You will make any index value in the array as a pivot.\n2) Then you will partition the array according to the pivot.\n3) Then you will recursively quicksort the left partition\n4) After that, you will recursively quicksort the correct partition.",2, 14353,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works on the principle of divide and conquer technique. First we take a pivot element - it can be first element, middle or last. Then we fix that pivot element in it's correct position by using basic for loops. Then we divide the array in parts - from 0 index to pivot-1 and pivot+1. We will not take that pivot element in role as it is already sorted. Then we will apply recursion on both arrays, and the process goes on and we get a sorted array. Time Complexity - O(nlogn).",1, 14354,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works on the divide and conquer approach. it gives the ight position of a pivot and the elements on the left of the pivot should be smaller than pivot and right elements should be greater and then it works the same way on both the sides.,2, 14355,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it works on divide and conquer. array is divided on pivot element then the each part is sorted separtly .,1, 14356,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick Sort works on the basis of position indexing.\nThe position array is created which is then converted into sorted array using the indexes.,2, 14357,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,),0, 14358,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 14359,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"It works by partitioning an array into smaller arrays and exchanging the smaller ones, depending on a comparison with the 'pivot' element picked up.",1, 14360,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort a pivot element is chosen at random and then the whole array is sorted with respect to that element after that array is divided from the pivot in two parts and those two parts are sorted with a new randomly selected pivot for each part and the process continues till size of divided array minimizes to one and array gets sorted.,2, 14361,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort work on divide and conquer approach . First array is divide into two parts then further divided into two parts until it reach to one element then compare b/w to element then combine the array.,1, 14362,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is a divide and conquer sorting algo in which a pivot element is chosen which then divides the array in two parts. Left part contains elements smaller than pivot element and right part contains elements larger than the pivot.,1, 14363,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In Insertion Sort the priority element(Greatest of smallest in the remaining array) is selected and putted into its correct position by shifting the other elements in the array.\n\nIn selection sort, the priority element is swapped with the element in its correct position.\n\nTime Complexity - O(n^2)",2, 14364,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quick sort use use min heap concept for reducing the time complexity of the algorithm , it use min heap concept and reduce it to (nlogn) time . ",1, 14365,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,it uses increments and as the loop progresses it arranges the order of elements till that particular range. It uses comparison\nton sort out the order among elements and is great for larger data sets.,2, 14366,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works divide and conquer method.,1, 14367,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort it divide the array into some parts and then perform sorting and arrange in ascending order as the need of the problem,2, 14368,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort work by taking a pivot element and then partitioning the array into three parts one which contains elements smaller than pivot, other one which contains elements equal to the pivot and the last one containing the elements greater than the pivot. Then after this the process repeats itself recursively on the 1st and 3rd parts, hence giving us a sorted array.",1, 14369,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort is a searching algorithm in which we choose a pivot value from the array and make the two array and then sort the element in both the with the help of pivot element.,2, 14370,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In quick sort the one element is taken as a pivot and its correct position is taken out and then recursively we find the pivot for all the remaining array,1, 14371,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, first we partition the array and sort both the arrays left and right of the partition. Then we sort both these arrays using quicksort recursively until we have one element which is already sorted. ",1, 14372,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works on the basis of partitioning using a pivot element where we can partition the array by taking either first element or middle element or last element of the array as pivot and the array keeps on getting divided by pivot elements till the time one element is left in each partition and then sorting of elements occurs in the array,2, 14373,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in insertion sort the minimum element is first assigned its correct position and then the further next minimum element is taken into consideration by this method the entire array is sorted.\nin selection sort the user selects a particular element which is the assigned its correct position and then with respect to it other elements are sorted.\nhowever both have same time complexity of n square. ,1, 14374,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works by creating partitions ,1, 14375,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In quick sort we select an element and traverse the array and arrange elements such that all the elements smaller than our selected element are on the left side and the larger ones on right side . then we again recursively call quick sort on the left group of smaller elements and right group of larger elements . ,1, 14376,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort works by selecting a pivot in the array and then sorting all the elements smaller than the pivot and thus placing the pivot at the right place. It uses recursion and keeps repeating this process till the complete array is sorted. \n,2, 14377,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Most efficient algorithm. It Works by partitioning an array into smaller ones and swapping the smaller ones depending on comparison with the pivot element.,1, 14378,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In quick sort, we select any one element as pivot (either from start , middle or end ) and we sort the data structure as per the pivot like on the left side the elements smaller than pivot are present and right side the elements greater than pivot are present or vice versa.",2, 14379,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in this first we take an pivot element and place it at the correct index where it should be in the sorted array. we do this using recursion and divide and conqour approach.,1, 14380,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"These are different in approaches used to solve them. Insertion sort work as if we insert each element again and hence sorting them. Selection sort, as the name suggest work as if we have selected an element and then sorting it by comparing with every other element. ",2, 14381,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quick sort involves a pivot element and based on the pivot it divides the array into three parts one the elements to its left that are the ones smaller than itself, second the elements equal to itself and third the elements larger than itself onto its right and it goes on doing this recursively on the two parts the left and right one to sort the entire array.",2, 14382,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works on the basis of partitioning. First we select a pivot element and then partition the elements according to the pivot element and then sorts the array in the required order. The pivot element can be first element, last element, or middle element. ",2, 14383,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"In Quicksort, we simply take one element whether it may be first or last or any element and declare it as pivot. Then we partition our array on the basis of pivot in such a way that the pivot element reach at its correct position in the array. We repeat the process until the array is sorted.\n",2, 14384,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works on the principle of divide and conquer. First we take a pivot around which we divide the array the first half has the smaller than elements and the second half has the larger one. In this way we keep on dividing the array and lastly combine them.,2, 14385,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quick sort works using the divide and conquer approach. quick sort uses a partition element which can be any elements from the array. and sort the array according to that partition the elements lesser than the partition element move to the left of it and the bigger ones move towards the right, the movement is done by swapping the elements. The process is repeated again and again taking different partitions until the whole array is sorted.",2, 14386,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works on divide and conquer method and the partition method for sorting an array. In the partion we use a pivot either from begin , end , or accoding to desired location. \nThe complexity of this algorithm depends upon the selection of the best pivot,\nThe average case time complexity of the quick sort is O(nlogn) while in worst cases it can go to the O(n^2).",2, 14387,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we take a pivot element form the array and divide the array in two parts according to pivot element and decide new pivot element for new arrays and repeat the process\nthen sort the array and merge them one by one;,2, 14388,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort works in following manner.\nIt divides the array by selecting a pivot element for the elements in the array which are greater than pivot are inserted into a new list and for smaller than pivot into another list.\nthen these lists are sorted and merged to obtain the original array as sorted ,2, 14389,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"it first find a partition and then arrange the elements accordingly , it works recursively by repeating the same and giving the required result at the end.",2, 14390,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick Sort works works on the divide and conquer rule. A given array is divided and then sorted part by part known as partitions, to form a sorted array. ",2, 14391,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 14392,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works on the divide and conquer method, where you create partition in the array on the basis of comparing and the merge it in the ascending order.",2, 14393,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort is sorting technique which sort the array by comparing the least element with every element.,2, 14394,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works on the principle of divide and conquer and has Time Complexity of O(nlogn). it works by having three pointers. one will point at pivot. the other at beginning and the other at end of array. Pivot can be beginning, end or middle (any) element. i moves from right to left. j moves left to right. when the cross the elements are swapped and elements reach their correct place. Multiple iterations of the same result in sorting of the array. In each iteration the size of the array we are working with gets reduced as we dont need to look at the already sorted part. ",2, 14395,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sorts follows divide and conquer algorithm. We take a pivot element and the elements smaller than the pivot element are brought to the left of it and the greater are brought to the right of it. and as soon as the pointer for bigger element surpasses the smaller one , the element pointed by the small element pointer becomes the pivot. This is done till the array is sorted.",2, 14396,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort uses divide and conquer approach it picks a random element and then divide the array around it.,2, 14397,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In quick sort we use two pointers one for left and other for right left pointer traverse from left to right and right traverse form right to left.\nWe select one pivot element and if [key+left]/2mid then second pointer moves from right to left.,2, 14398,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,QuickSort is a Divide and Conquer algorithm. It picks an element as a pivot and partitions the given array around the picked pivot. There are many different versions of quickSort that pick pivot in different ways,2, 14399,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," It works by dividing an array into smaller arrays and changing he smaller arrays , depending on the pivot that is taking element from both the arrays are either incremented or swapped accordingly with smaller element present in the first array.",2, 14400,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 14401,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works work divider and conquer algorithm\nit is a sorting technique to sort the data accordingly,2, 14402,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In quick sort we use to take a pivot to sort the whole array. we use to take a pivot and compare it with the next element if the elment is small than we use to change the position of the element with the next one.,2, 14403,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"quick sort breaks an array into smaller arrays and then swaps the smaller ones, by comparing with the adjacent element.",2, 14404,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 14405,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort works with the help of a divide and conquer algorithm. Here we take the help of a recursion.\nHere first we find a partition element then we place it at its correct position then we sort the elements present before the partition elements and the elements after that partition element with the help of recursion and divide and conquer algorithm.,2, 14406,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,you select a element as the pivot and put all the elements in their correct places with respect to the pivot that and do it recursively until the array becomes sortes,1, 14407,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,We choose a pivot element and place all the smaller elements to the left of it and all the larger elements to the right of it. Then using divide and conquer we break the array from that element in two parts and solve both arrays using recursion using same method. ,2, 14408,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort works by taking one element at a time(pivot) and then placing it in its correct postition then calling the function recursively for this elements left and right side,1, 14409,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works by the method of divide and conquer . An index called pivot is first taken then the array is divided into 3 parts . 1st where the elements are smaller than the one at pivot ,2nd where the elements are equal to the one at pivot and 3rd where the elements are greater . now at each step the quick sort is called recursively for each of the part . And then finally the we get sorted array at the last and the recursion is called back.",2, 14410,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,divide and conquer,1, 14411,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,so in a quick sort first of all we take up any element as pivot element .\nthen we form a partition where all elements smaller than pivot element is put to the left of it and all elements greater are put to the right of it.\nthen we start comparing and placing every element to its correct position .\nit works in O(nLOGn) time.,1, 14412,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is a sorting technique in which we first select a random element in the array which we call as pivot element and then we put all elements which are smaller than pivot in its left and bigger in right this places our pivot element at its correct position. Then we se;ect another pivot in left and right side so to sort the whole array. Its average time complexity is O(nlogn) and worst case is O(n^2).,1, 14413,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,The function of quick sort is to sort the given array in O(n*logn) time complexity. \nIt uses the divide and conquer approach to solve the problem. An element is taken from the given array and then compared with all the elements by finding the largest element in each traversal and then placing that largest element in the last of the array. The loop runs till the count of the elements. And in such manner quick sort works.,2, 14414,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quicksort follows divide and conquer algorithm. in which we select a pivot element and arrange the element lesser than it in left and greater than it in right to sort thr element.,2, 14415,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.," The algorithm picks a pivot element and rearranges the array elements so that all elements smaller than the picked pivot element move to the left side of the pivot, and all greater elements move to the right side. Finally, the algorithm recursively sorts the subarrays on the left and right of the pivot element.",1, 14416,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,in quick sort we pick an element in random and check the number of elements smaller and larger than it \nthan we put the chosen element in its position in the array (if it were sorted)\nthan all the elements that are larger than it are put to its left side and the larger elements on the right side\nand we call the function for the left part of the array and the right part of the array,1, 14417,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works on partition theorem (Lomuto,Hoare partition theorems)\nin quick sort array is partioned about an any element (mainly first and last) and then recursive call done for two arrays while is the part of main array that is divided due to the pivot element and we repeat process untill 1 element left after that we get the sorted array",1, 14418,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,element is put in on its position and on left small elememts are kept and on right greater elements than the elements are put and for other elements recursion is called,1, 14419,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Linear searching is a simple method of searching whether an element exists in any particular data structure, It takes the required element and compares it with each of the element present in the data structure. If found. it gives us the required result .",1, 14420,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,It works by breaking an array into smaller ones and swapping the smaller ones depending upon comparison with pivot element,1, 14421,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"We get a random data from amongst the array of data available. Then we compare the value of this data with the other datas. Then we divide the array into two factions, then repeat the above procedure until we are left with NULL. Then we combine the elements in the order that they were divided and we have the sorted array.",1, 14422,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In quick sort technique we first choose an element from our array as a pivot element. Then placed the elements such that the elements which are smaller than the pivot element should placed on the left of it and elements which are greater should be on the right of it.,1, 14423,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,Quick sort is sorting technique which basically works on divide and conquer approach it find pivot element and arrange element on left and right according to the pivot.Then pivot element for two partitioned arrays are generated till the array is sorted. ,2, 14424,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,"Quick sort works on the principle of divide and conquer.It first divides the problem into smaller smaller problems,solves those and then combines those smaller problems that is it divides the array to be sorted in smaller arrays and then combines those smaller sorted arrays to get the sorted array as the solution.",2, 14425,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,In this we take a pivot element randomly and we place all the elements in either left or right of the pivot and hence we find the sorted array. ,2, 14426,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,,0, 14427,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,quick sort is based on divide and conquer technique its working is as follows:-\n1-in quick sort we randomly select a pivot element from the data\n2-we find all the elements less than and greater than pivot\n3-then we place the pivot at its correct position\n4-then we call recursion,2, 14428,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort.,a pivot element is chosen randomly from the set of elements and all the other elements are placed either to the right or left to this pivot element,2, 14429,How quick sort works?,Quick sort uses divide and conquer approach. It divides the list in smaller 'partitions' using 'pivot'. The values which are smaller than the pivot are arranged in the left partition and greater values are arranged in the right partition. Each partition is recursively sorted using quick sort., <left subtree->right subtree, left subtree->right subtree->root, left subtree->root->right subtree respectively",2.5, 14479,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",In tree traversal all the elements which are present in the tree are exactly visited once tree traversal can be done in many different ways like BFS which is breadth first search and dfs which is depth first search ,2, 14480,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal refers to traversing the tree data structure starting from root node than moving to every child of the tree,2, 14481,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal refers to the accessing the elements inside the tree. It can be done in 3 ways, preorder traversal, inorder traversal, postorder traversal. \nPreorder traversal starts accepts the root node as input, traverses root first then the left child and at last the right child.\nInorder traversal traverses left child then root then right child.\nPostOrder traversal goes left child then right child then root.",2.5, 14482,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is used to traverse every node of tree data structure. \nTraversing every node from root to leaf ,2, 14483,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is a method in which left sub tree is visited first then root is visited and at last the left sub tree. ,1, 14484,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is of 3 types postorder, inorder and preorder. Through tree traversal we write all the elements of the tree . Like in postorder traversal first it takes the left node then it takes the right node then it takes the root node.",2.5, 14485,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is visiting each and every node in a tree\nthere are three types of tree traversal \npostorder (first left then right then node)\ninorder (first left then node then right)\npreorder (node left then left then right),2.5, 14486,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is a process to visit all the nodes of a tree to carry out a particular function and may print their values too.,1, 14487,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is the traversing or visiting the each node of the tree .,1, 14488,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Checking or observing any node of a tree in order to obtain the solution of your search is called tree traversal.,1, 14489,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal means traversing tree in DFS or BFS form and going through each node and storing it's data and then retrieving it.,1, 14490,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","There are three types of traversing/ looking through/ reading the values stored in a tree, which include inorder preorder and postorder treversal. \nInorder: left child-> root -> right child\nPreorder: root -> left child-> right child\nPostorder: right child-> left child -> root",2.5, 14491,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",moving on each node of the tree is called tree traversal.\n ,1, 14492,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Exploring/visiting each and every node of the tree is know as tree traversal.,2, 14493,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree is a data structure and there are three tree traversal techniques that help us read data from all the nodes without leaving any node\n1. Breadth First Search : In this, start from root node and store all the children of root node in a queue and then take an element from queue, explore that node and keep repeating this till all nodes are found/read\n2. Depth First Search : in this start from root node and store all the children of root node in a stack and then take an element from stack, explore that node and keep repeating this till all nodes are found/read\n3. Level order Traversal : start from the first level, explore all the nodes on that level and then go to the next level and keep on repeating till you hit the bottom level",2, 14494,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","In quick sort, there exist a pivot which plays a major role in sorting the array quickly.\nIt sorts the array in such a way that the value before pivot are smaller than it and the values ahead of the pivot are greater than it.\nIt is hence to be checked again and again until pivot reaches to the last.",0, 14495,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is the technique in which we traverse each node from root to leaf of the tree effectively ,it can be post, order ,pre order, inorder traversal",2.5, 14496,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is traversing a list of elements in a tree using different approaches.,1.5, 14497,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is a pattern for traversal in a tree which covers every node of a tree in a particular set pattern .\nExample- Preorder traversal => root->left->right (It utilizes this pattern to print all the nodes of a tree)\n In order Traversal => left->root->right\n Post order traversal => left->right->root,2.5, 14498,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is meant by visiting every node that comprises of a tree, and it could be in any order. \nexample: preorder(root->left->right)\n inorder (left->root->right)or\n postorder (left->right->root)",2.5, 14499,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is a method of exploring the every nodes of tree from its root to its children node. The time taken to traverse the tree is O(logn)\nMethods of tree traversal are:\nlevel order traversal \npost order traversal \npre order traversal\ninorder traversal \n,2.5, 14500,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Quicksort is one of the most efficient sorting algorithms. This is because it has time complexity of O( nlogn ). In quicksort, a partition element is choosen, which divides array into two subarrays and the array is sorted accordingly. For example, if A={7,3,9,5,8,12} is an array with partition element 5, all elements less than 5 will come to the left of 5 and all elements greater than 5 will be placed to the right of 5. Since this array is still not sorted, we will apply same algorithm on the two subarrays which are present on the left and right of 5. Hence by divide and conquer approach, eventually entire array will be sorted. ",0, 14501,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is where we go through each and every node and print there data through our print function,\nexample :level order traversal ,preorder , Postorder , Inorder .",2.5, 14502,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",When we are searching for an element in a tree and if the element is smaller than the root we go left side of the parent node otherwise when it's larger we go right side of the parent node and this process continues as we keep on moving left and right until we find the element in the tree.,2, 14503,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",The traversal of a tree from its root note and visiting every single node until it reaches the root node is known as tree traversal.,2, 14504,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","The traversal of a tree initiating from the root node and visiting its each child using preorder, in order and post order traversal basis.",2.5, 14505,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",travelling from root to the each leaf node of the given tree is called tree traversal.,2, 14506,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tress traversal means visiting all the nodes of a tree one by one from root to the last leaf node.,2, 14507,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","travelling a tree is known as tree traversal. there are three types of tree traversal which are LNR, NLR, LRN left node right, node left right, left right node respectively\nin LNR first the left side of the tree is traversed then the node is printed then it goes to the right side. Similarly all the other traversals work.",2, 14508,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is of two types:\n1) we build a tree and travers the value by level order , level order means we traverse the each and every element at height =1 then we go to higher height\n2) we build a tree and traverse its value like going left side of tree or right side of tree, means we are going left until we find null value . ",1, 14509,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is basically going to each node of the tree once .,1, 14510,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is the process in which the top most node is the root node and all nodes are connected with 2 sub nodes(right and left ).right node (greater value than root) left node(lesser value than root) If u want to traverse to a particular node u start with root node and the on the basis of whether particular node is greater than root node or not u traverse to go to the right node or the left node. ,1, 14511,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","there are Three methods for tree traversal. \n1. In-order- first we traverse left part of the root node , then root node , and then right node. \n2. Pre-order - First we go to the root node , then traverse the left part and then the right part. \n3.Post-order - first we traverse the left part, then right part and then to the root node . ",2.5, 14512,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal refers to the process of visiting nodes in a tree. Tree traversal can be divided into in-order, pre-order and post-order.",2.5, 14513,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is visiting all the nodes of the tree including root node, parent node and child node.\ntypes of tree traversal are:\nin-order ,post-order and pre-order.",2.5, 14514,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",The traversing of the the nodes and child nodes of the tree data structure by going top to bottom or bottom to top which the help of temporary pointer is called tree traversal.\nIt can be used in many ways like finding the element and inserting the element or deleting the element or comparing the 2 or more elements.,2.5, 14515,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","In insertion sort, we divide the given array in two parts such that 1st array has 1 element which is the first element of array and 2nd array has all other elements in same order. Now, we traverse the 2nd array and find smallest element and add this element to 1st array in sorted order. We repeat this step till 2nd array becomes empty and first array has all the elements.\nIn selection sort, we take a pivot element and start comparing elements from start and end simultaneously and swap when any condition satisfies without dividing the array.",2.5, 14516,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal refers to accessing each element(node) of the tree one by one in some order.eg: inorder, preorder amnd postorder.",2, 14517,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Traversal in a tree, to find an element is present in it or not is known as tree traversal.\nIt can be done in three ways:\nInorder (left, root, right)\nPreorder (root, left, right)\nPostorder (left, right, root)\n",2.5, 14518,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Traversing the tree from its root node to its both child all along till the leaf nodes to access each nodes in the tree is called tree traversal . It can be done by traversing the nodes in three ways :-\ninorder (left, root ,right)\npreorder(root, Left, Right)\npostorder(Left, Right, root",2.5, 14519,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",in tree traversal what we do is that we perform traversal on the tree to look out for the desired solution. traversal is just like travelling from one of node of the tree to another just to find out the solution.\ninorder\npostorder\npreorder,2.5, 14520,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","In Quick Sort, a random element from the array is chosen as the pivot element (ideally, the median) and then that pivot is compared to all the elements and the elements are sorted according to it. The elements smaller to pivot on its left and the elements larger than pivot on it's right. Just like that, the array is sorted.",2.5, 14521,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","The traversal of elements of a tree array based on the root node, left node and right node.",2.5, 14522,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree is a data-structure and tree traversing means visiting each and every node of the tree to search for a particular element. We search for the elements starting from root node and going down to the child and leaf nodes of the tree.,2.5, 14523,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Accessing all the values stored in the node of tree starting from first node that is root node to all the leaf node until the pointer which is traversing gives a null is called Tree Traversals.,2.5, 14524,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is the process of exploring each and every node of the tree till all the leaf nodes are covered. ,2.5, 14525,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",The process of accessing the different nodes of the tree is called tree traversal.,2.5, 14526,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",The process of traversing(or visiting) each element of a tree is known as tree traversal.,1.5, 14527,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree Traversal is the moving of pointer at every node of tree from root to the leaf in order to print the stored data or search the element stored in a tree. Inorder,Preorder and Post order are few types of tree traversals.",2.5, 14528,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is a technique to traverse all elements of a tree node. types of tree traversal :\n1. Preorder traversal\n2. Inorder traversal\n3. Postorder traversal\n\n,2.5, 14529,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",To travel from source node/vertex to goal node in a tree ,2.5, 14530,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","it is traversal of a tree and has 3 types, left data right (ldr), left right data (lrd), data left right (dlr), where each of this reperresents the child to be traversed with repsect to the parent node. It can be easily implemented by using recursion. ",2.5, 14531,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is visiting the nodes of tree until the required outcome is obtained.,2.5, 14532,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal means in which manner we visit the nodes of the tree.,2.5, 14533,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",the tree traversal is printing a tree in simple language via going through each and every node present in the tree,2.5, 14534,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is traversing each node of the tree from root to the leaf nodes. ,2.5, 14535,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is the process of accessing all the elements of a tree\nThere are several tree traversal methods. Some include\n1) Pre order traversal \n2) In order traversal\n3) Post order traversal\n4) Level order traversal,2.5, 14536,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Traversing or traviling to each node of a tree is called tree traversal.,2.5, 14537,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",traversing to all the branches of a tree ,2, 14538,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",It means visiting each node at least once ,1, 14539,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",traversing to all nodes by level- by level,1, 14540,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal meaning walking/traversing through a tree i.e. going through every node of the tree until a specific node is reached. There are three ways in which we can traverse a tree:\n1. pre-order traversal\n2. in-order traversal\n3. post-order traversal,2.5, 14541,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal could be defined as the process of searching something inside the tree, as we start from root go to its leftmost child , then search in its child, come back(if not found ) then again search in the next child of root node and keep searching until the end of tree.",1, 14542,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","traversing the given elements in a tree based on their sizes with the smaller element taking the left and bigger one sticking to right. Based on M or the number of elements that can be entered, the levels gave m-1 values",1, 14543,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is a type of linear search where we can find the node or the string by traversing the tree .,1.5, 14544,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",In the tree traversal we traverse to root node to the leaf node.\nTheir are thre types of the tree taversal :-\nINORDER TRAVERSAL \nPREORDER TRAVERSAL\nPOSTORDER TRAVEWRSAL ,2.5, 14545,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",it is traversing of a tree from its root node to it smallest leaf node .,1, 14546,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal refers to visiting all the nodes of a tree at least once. For each node, we define if it is unvisited, visited or completely explored. Using various algorithms, we can then traverse the tree until every node has been completely explored. ",2, 14547,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Visiting each node of the tree is called tree traversal. Tree traversal can be used to search any element in the tree.,2.5, 14548,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",it is terminology given to iterating a tree data structure.,2, 14549,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Traversing each node of the tree is called tree traversal.\nFollowing are the the types: \n1. In-order traversal : Left child node->parent node->right child node\n2. Pre-order traversal : parent node->Left child node->right child node\n3. Post-order traversal: Left child node->right child node->parent node\n4. Breath first traversal / level order traversal : each node is traversed level wise,2.5, 14550,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree taversal is a technique in which the move through all the elements in the tree exactly once and print them in the desired techniques.\nthere are basically three traversal techniques, Preorder Traversal, Inorder traversal and Postorder traversal.",2.5, 14551,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal means to print the value stored in every node of a tree.,1, 14552,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is traversing each and every node of a tree following are the possible traversals:\n->Pre Order\n->In Order\n->Pos tOrder,2, 14553,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",When a data structure called tree's every node is visited in accordance to the traversal method then that is called tree traversal.,2.5, 14554,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is the process of traversing every node of the tree and exploring the child node of every till all the nodes of the are covered \ntraversal types are preorder,postorder,inorder",2.5, 14555,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is the process of visiting each node in tree exactly once. Traversing can be done by three ways inorder, preorder, postorder.",2, 14556,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",visiting all the nodes of a tree is known as tree traversal ,1, 14557,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is the traversal in tree on each node once and then ,1, 14558,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree Traversal is a method to explore/visit different nodes in a tree,1, 14559,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","visiting every node in the tree is known as tree traversal.We have different types of traversal like LDR,RDL,DLR",2, 14560,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree Traversal is a method of visiting each node a node in a systematic order.,1, 14561,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is visiting each and every node of a tree,2, 14562,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is technique where traversing starts from root node to leaf node.Every node has a parent node.In BST THE RIGHT SIDE>PARENT AND LEFT SIDEBFS(Breadth First Search):Tree is traverse level wise (Require stack to implemented)\n->DFS(Depth First Search):One Brach is traverse followed by next (recursively implemented),2, 14579,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal means travelling through the branches to the leaf node or vise versa .,1, 14580,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is basically used to traverse the whole tree either first left subtree or right or root node. Three types are inorder , preorder and postorder.",1, 14581,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",traversing to the tree from each of its nodes leaf node from top to bottom as per our need,2, 14582,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","in this traversal method, the left subtree is visited first, then the root and later the right sub-tree.",1, 14583,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Travelling through nodes in a tree is known as tree traversal.,2, 14584,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Travelling all the nodes of a tree starting from the root node to all the leaf nodes is called tree traversal. There are basically three types of tree traversals\n1) Inorder traversal\n2) preorder traversal\n3)post order traversal,2, 14585,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is traversing in the tree from one node to any other node of the tree.,1, 14586,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal refers to iterating over all the elements from the root to leaves using BFS, DFS etc.",1, 14587,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal refers to the way we travel a tree. The three types of traversals are In order, Pre Order and Post order. \nIn order: left->root node->right\nPre Order: root->left->right\nPost order: left->right->root",2, 14588,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is traversing the tree in 2 forms-\n1.dfs-depth first traversal-uses recursive algorithms\n2.breadth first traversal-uses queue data structure\n,1, 14589,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is the order in which the nodes are visited/printed for various purposes. Example: Postorder Traversal,2, 14590,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Quick sort partitions the array into two parts and sorts the both the partitioned parts hand by hand.,2, 14591,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","We go through each and every node of the tree in order to inspect all the nodes of the tree.\n\ninorder - > left, root, right\npreorder - root, left ,right \npostorder - left, right, root",1, 14592,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",It is the traversal where each node is traversed in bfs or dfs fashion.,1, 14593,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","a form of graph traversal and refers to the process of visiting (like retrieving, updating, or deleting) each node in a tree data structure, exactly once.",2, 14594,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",In Quick sort a key element is taken randomly from the array and then it is placed on its true place and then the other elements are sorted accordingly using that element.,1, 14595,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is the procedures where all the nodes of the tree are visited (traversed).\n\nThere are many kinds of traversal such as:\n1. Pre order\n2. Post order\n3. In-Order,1, 14596,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Traversing a tree means visiting every node in the tree. You might, for instance, want to add all the values in the tree or find the largest one. For all these operations, you will need to visit each node of the tree.",1, 14597,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Traversing the whole tree from root node to the leaf node is tree traversal. We have three methods to traverse:\n\n1. Preorder Traversal - First we traverse root element, then left node and then right node\n2. Inorder Traversal - First we traverse left node, then root and then right node\n3. Postorder Traversale - First we traverse left node, then right node and then root",2, 14598,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","traversing elements in order of the tree. There are three types of tree traversals in-order traversal, pre-order traversal, post-order traversal.",2, 14599,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",travelling through each node in a tree is called tree trasveral.,2, 14600,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",The method of iterating through a tree to access its elements and perform different operations is called Tree Traversal. ,2, 14601,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",linear searching is the an algorithm in which we transverse over the whole data set one by one and find if it a a matching data present in the data set.,1, 14602,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","In any given tree, tree traversal is defined as the traversal of every element at all the levels or at every height of the tree.",1, 14603,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",,0, 14604,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is a procedure in which a root node of a tree is given as input and whole traversal or order of nodes in the tree is returned as output. there are many kinds of traversals like pre-order, post-order, in-order and in-depth traversal",2, 14605,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","traversal of element present in trees data structures is called tree traversal . some tree traversal are inorder , preorder ,postorder.",1, 14606,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is the process of traversing nodes in a tree. Its usually done by traversing child nodes through the parent node.\nThere are three ways of traversal :-\n1)Preorder - Root -> Left -> Right\n2)Inorder - Left -> Root -> Right\n3)Postorder - Left -> Right -> Root,2, 14607,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Quick Sort works on the method of partition.\nIt makes partition on the array by selecting a random value and by making the problem smaller and smaller.\nFurthur it rejoins the array and the given array is sorted,1, 14608,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal refers to the binary tree or for finding the element in tree to arrange, basically by tree traversal we put number less than Node to the left side of Node and number greater than Node to right side of Node",1, 14609,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",traversing through the tree nodes vertically downward by child to child left to left nodes and then right nodes which is called depth first search. \nor traversing all the siblings at the same level which is called breath first search.,2, 14610,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",in order traversal\npre order traversal\npost order traversal.,2, 14611,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is a go through by an pointer through the whole tree to traverse,1, 14612,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is when we travel the tree covering each node and printing them or doing whatever is required. There are mainly 4 types of tree traversal: level order traversal, preorder traversal, inorder traversal, postorder traversal.",1, 14613,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal means going to each and every node of the tree.,1, 14614,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is the technique to look each node of the tree by means of some methods \nPreorder Traversal\nPostorder Traversal\nInorder Traversal,1, 14615,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal means going to each element of the tree and perform some action on it.,1, 14616,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is traversing the tree in such a way that all elements of the tree get visited, it can take place by four ways that is preorder traversal, post order traversal, level order traversal and in order traversal",1, 14617,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","in quick sort a element called pivot element is selected the that element is assigned its correct position, this divides the array into 2 parts then the element greater than pivot element are on side and element less than pivot element are on the other side. further again quick sort is applied on the two new array formed. ",1, 14618,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is the process to visit all its nodes one by one.,1, 14619,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is traversing the tree, Can be done in different ways first traversing the parent and then giving priority to their child nodes or giving priority to the parent then their child nodes ",2, 14620,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is the process of travelling or accessing all the elements of a tree. There are several ways of traversing a tree like inorder, preorder or postorder.",2, 14621,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is a process in which left subtree is visited first ,then the root and then the right subtree.",2, 14622,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is simple exploring the branches of the tree one by one or we can say that the left and right child of the tree recursively from the parent node.,1, 14623,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",visiting every node in an tree data structure.,1, 14624,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","quick sort work as if we have a arrow(cant recall the name), the fixed arrow which helps us to sort the array.",1, 14625,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal means moving from the root node towards the leaf nodes following the incoming child nodes.,2, 14626,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is traversing all the nodes of the tree from root node to leaf node using different traversals like preorder , postorder traversal, etc. ",2, 14627,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal means visiting every node present in the tree till leaf node. ,2, 14628,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is visiting each and every node the data structure tree. We can start with the root then the first level nodes, then the second level nodes and so on. We can also start with the leftmost one then its corresponding right node and so on.",2, 14629,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is reading the elements of the tree in a certain order.\nIt can be done in preorder, inorder and postorder form.",2, 14630,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","The tree traversal is the way of traversing the all nodes of a tree. There are mostly three types of tree traversal which are preorder, post order and inorder traversal.",2, 14631,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",in tree traversal we move from parent element to its child element and vice versa\neg. inorder traversal\npreorder traversal\npost order traversal\n\n,2, 14632,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is the traversing of every node of a tree from root to its children and so on . Its mainly done in three orders Postfix, Prefix, Infix.",2, 14633,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",it is the process of traversing every node of the tree from root node to leaf.,2, 14634,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",A tree traversal is the process of travelling to each and every node of the tree at least once.,2, 14635,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Quick sort partitions the array into two until every element is independent and then it returns the array sorting each element individually.\n,2, 14636,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is visiting all the nodes of a tree at least once, in any manner of traversal. ",2, 14637,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is when the linked list is represented in a tree form so that the traversal is easy using BFS and DFS,2, 14638,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is visiting each node of the tree once. Multiple techniques exist for the same. Example Inorder, Preorder, Postorder traversal. Also level order traversal. ",2, 14639,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Traversing a tree by visiting each vertex of the tree is called tree traversal.,2, 14640,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is when we travel from one node of a tree to another node of the tree. ,2, 14641,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",It is the technique use to traverse each node of a tree.,2, 14642,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree Traversal is a process to visit all the nodes of a tree and may print their values too. Because, all nodes are connected via edges (links) we always start from the root (head) node. That is, we cannot randomly access a node in a tree.",2, 14643,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is traversing through the root node of the tree and moving to left node to get number less than the root node and traversing right to find the element greater than the root node and traversing till you find the root node of the tree to traverse the whole tree.,2, 14644,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is the process of traversing through each and every node element of a tree type data structure , in order to look for a particular element or just to sort the tree as per our requirement in the problem statement.",2, 14645,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Traversal means to traverse or to check\\go through all the the nodes in an data structure. We traverse all the data structures to find what we need \nSimilarly we have tree traversal ,we traverse all the nodes of the tree using dfs or bfs to fin the information we need ",2, 14646,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal means the analization of the tree, to travel the whole tree from the parent node to the child and cover each node of the tree.",2, 14647,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal means to search and locate a given element or key from the tree.,2, 14648,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",,0, 14649,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is a process of traversing or visiting all the required nodes(including root and leafs) of a tree with the help of recursion or with the help of iteration.. Here we use the methods like DFS(depth first search using stack or recursion) and BFS(using queues).,2, 14650,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",to traverse or visit every node of the tree starting from the root node by some type of algorithm is known as tree traversal,2, 14651,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",In tree traversal we traverse all the required nodes in a tree using BFS or DFS.,2, 14652,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",The process of reading every data in a tree is called tree traversal.,2, 14653,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is way to search the elements of tree data structure . There are different ways for tree traversal like preorder , inorder, postorder tree traversal.",2, 14654,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is traverse the each and every node of the tree to search, insert of delete the data from nodes.",2, 14655,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal refers to traversing or visiting every node of the tree starting from root node to leaf node,2, 14656,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Traversing of all the nodes in a tree is known as tree traversal. There are various tree traversals such as:\n1. Preorder traversal\n2. Inorder Traversal\n3. Post order traversal\n4. Level order Traversal,2, 14657,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","It is the visiting of each node in the tree from root node to the leaf node. It explores all the parent to children node. There are various types of tree traversal such \nPre-order traversal , In-order traversal , Post-order traversal ",2, 14658,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is a way to travelling the tree from one node to another mainly to find the element.,2, 14659,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Traversal is a process to visit all the nodes of a tree and may print their values too. Because, all nodes are connected via edges (links) we always start from the root (head) node. That is, we cannot randomly access a node in a tree. \n\n",2, 14660,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is the process of traversing the elements of the tree in specific fashion \nsuch as inorder (root,left,right),preorder,post orderd",2, 14661,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is to visit every node of an tree mainly of 4 types\npre order\npost order\n in order\nLevel order \n,2, 14662,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is to traverse the tree by first taking the root node and then by taking the left node and then by taking the right node and applying recursion for the left and right node to fully traverse the tree,2, 14663,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Insertion sort performs sorting in a different way as compared to selection sort. It uses more time and is in general less efficient to sort as compared to selection sort. Insertion sort usually does it in O(n^2) time while selection sort in some cases can perform the same in O(nlogn). ,2, 14664,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","It is a method in which the left subtree is visited first, then the root and later the right sub-tree and every node may represent a subtree itself. If a binary tree is traversed in-order, the output will produce sorted key values in an ascending order.",2, 14665,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree Traversal - when we have the Tree Data Structure(might be Binary - Full, Complete, etc.). Each node has children which further serve as nodes until we get the leaves - nodes with no children. So now we have a data structure with edges that is connecting two data values in the form of nodes. So when we want to perform any simple operation on the data structure like searching, etc. We go through all the nodes while traversing through the edges ( connections). This is known as tree traversals.",2, 14666,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is technique to traverse/cover each element of a tree.\nThere are various methods to traverse a tree:\n1) Postorder\n2) Preorder\n3) Inorder\n4) BFS\n5) DFS,2, 14667,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is the technique to retrieve information from a tree, This can of different types like:\nIn-order, pre-order, level-order, post-order etc. ",2, 14668,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is a way to traverse a tree and visit the elements present in the tree.\nIt is of three types:\nPreorder tree traversal:In this kind of traversal,the root node is visited first and then the left and then the right node.\nPostorder tree traversal :In this kind,the left node is visited first,then the right and then at the end the root node is visited.\nInorder tree traversal:In this kind,the left node is visited first,then the root node and then the right node.",2, 14669,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","It is the process of gathering information from a tree by traversing a tree to perform certain operation.\neg: In order traversal ,pre order traversal and post order traversal.",2, 14670,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Traversing a tree means moving from the root node to the leaf nodes without missing a single node.\nIt needs to look through all the nodes. Used in searching a tree, inserting a new element, ",2, 14671,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is a way to traverse every node of the tree from root node to the leaf node,2, 14672,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",traversing a tree and collecting information to do certain operations,2, 14673,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",,0, 14674,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",in tree traversal we traverse the node of the tree from the root node to the element we want to search or to the leaf node. mostly we use recursion to traverse the tree.,1, 14675,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is a technique through which we traverse the tree formed using arrays i.e. we visit the nodes of the tree and perform the desired operation.,1, 14676,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","it is a way of exploring different branches/nodes/elements of the tree .we have different types of tree traversal,like level order traversal,pre order traversal,post order traversal,in order traversal,etc..which can be used according to the problem .",2.5, 14677,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tress traversal refers to a way in which we go through the elements of a tree one by one, it can be dfs(depth first search) and bfs(breadth first search). In dfs, we traverse the tree by going down or up (depth) whereas in bfs we go left or right (breadth)",2.5, 14678,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","In tree traversal we go element to element in tree by many methods like - bfs, dfs, inorder. ",2.5, 14679,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",in the tree traversal we reach the every node of the tree and if want to print by the print function also.,2.5, 14680,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","the manner in which a tree is traversed is called tree traversal. it is of three types, in-order, pre-order, post-order",2, 14681,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is the process of travelling nodes of tree, that is starting from the root node to the leaf node. The direction of tree traversal can depend upon the use cases. ",2.5, 14682,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal refers to visiting each node of a tree. for a binary tree there are three types of traversals:\n1. Preorder\n2. Inorder\n3. Postorder,2.5, 14683,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Visiting of every node of tree is refferd as tree traversal.,2.5, 14684,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal basically means how we move in a certain tree which has a root and leaves thereare some ways to traverse trees like DFS and BFS,2, 14685,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is a type of techinque which used to trsvel a tree data structure according to the problem there are many types of traversal like bfs,dfs etc",1, 14686,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Going from root node to different leaf nodes is called tree traversal.,1.5, 14687,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is a method to traverse a tree in order to visit each and every node and do certain operations accordingly. Tree traversal can be pre order, post order, in order traversal. In in order-:Left, root , right. Pre order-:root->left->right and post order->left->right->root.",2.5, 14688,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",in tree treversal we generally traverse each node and to do this there are certain methods like in one case we traverse the root first then the left side and then the right side,2.5, 14689,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",it is way to visit each element of the tree data structure for purpose of different operations such as searching. there are many types of tree traversal such as level order etc,2.5, 14690,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is a method to traverse or cover a tree. In a binary tree, traversal is done considering two sides of a tree through pointers namely right and left. Using the basic binary tree property of numbers greater than node on right and lesser on left, decision can be taken as to which side the process needs to be done.",2, 14691,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Traversing each or some node of a tree is known as tree traversal. Generally there are two algorithms utilized for tree traversal BFS (Breadth First Search) and DFS(Depth First Search).\nDFS take stack into account whereas BFS takes queues into account for the traversal.,1.5, 14692,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",in which we start from root node and then different leaf node and traverse in a levels ,2.5, 14693,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","It refers to traversing through all the nodes of the tree. Preorder, inorder and postorder are different ways of tree traversal.",2.5, 14694,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is visiting every node of the tree \nfor eg;\nbfs(breadth first search)\ndfs(depth first search)\n,2.5, 14695,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","in this sub tree is visited first, then the root tree and then right sub tree ",2, 14696,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",traversing the tree from parent node to least child node or least child node to parent node \ntwo ways are:- BFS (breadth first search ) and DFS (depth first search),1.5, 14697,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree taversal means traversing the whole tree starting from the root of the tree till last leaf node of the tree . There are three methods for tree traversal :-\nInorder , Preorder , Postorder.",2.5, 14698,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tracing the Tree form root to leaf node is known as tree traversal.,2.5, 14699,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traverse is the operation of traversing or follow the path of tree to get its leaf node or whatever be the aim of our problem.,2.5, 14700,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",in tree we have a parent node and to each parent node have a child node connected to it .\nto find any element we travel through a parent node to most right and and search left after that this operation runs until we reach to the end node,1, 14701,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is the visiting of every nodes/elements of the tree one by one through several different techniques like BFS(Breath First Search), DFS(Depth First Search), etc.",2.5, 14702,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is going on every node of tree from root.\n we have 3 type of tree traversal inorder , preorder, post order",2.5, 14703,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",,0, 14704,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is a process in which read or visit each and every node of the tree,2.5, 14705,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal reffers to the graph traversal algorithm in which each element is being traversed and arrange in the form of tree,0, 14706,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Traversing whole tree from root node to Leaf node. Thera 3 types of traversals \na) Inorder b) Post order c) Pre order,2.5, 14707,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal is a form of searching we do on tree data structure where we use diffrent types of traversal methods like postorder,inorder, preorder to search for an element.",1, 14708,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",in tree traversal we identify the parent and the child nodes of the tree according to the requirement traversal is started from root node and then reached to parent ,0, 14709,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",,0, 14710,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","Tree traversal is the process of traversing or going through the tree data structure to know which elements are present at which position or node of the tree. There are three forms of traversal which are pre-order , in - order and post - order traversal",2, 14711,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",Tree traversal is define as searching of an element ,0, 14712,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",it is when we start from the parent node of tree and come to end root by following a path,0, 14713,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","the traversal of elements , in end to start to start to end in right way in tree form , known as tree traversal",0, 14714,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","traversing the tree is going from root node to every other node in the tree.\neg inorder, preorder and postorder.",2.5, 14715,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal mean we go to each node of that given tree then we can say this tree is travers their are 2 main method of doing this BFS , DFS.",2.5, 14716,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","It is a method of tracing a tree from one node to another.\ntree traversal are of 3 type - inorder, preorder, and post order traversal.",2.5, 14717,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",tree traversal is we move one node to another node is tree traversal,2, 14718,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",bfs & dfs.,0.5, 14719,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal",traversing a tree from the root node to all the leaf nodes in a tree ,1, 14720,What is tree traversal?,"Tree traversal is a process to visit all the nodes of a tree. Because, all nodes are connected via edges (links) we always start from the root (head) node. There are three ways which we use to traverse a tree − (1) In-order Traversal (2) Pre-order Traversal (3) Post-order Traversal","tree traversal means, if the tree is given, we have to traverse the tree up to bottom.",2, 14721,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),,0, 14722,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is the tree in which all the nodes are balanced i.e the height of left subtree and right subtree should be equal so all nodes should be balanced then only it is called as an AVL tree,2.5, 14723,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"avl tree is a self balancing binary tree ,a binary tree is a tree where the node can have 2 or 0 childs ",1, 14724,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"An AVL tree inserts a new value in a binary tree by comparing if it is smaller or larger than the parent, thus making it easy for traversal ",1, 14725,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL Tree is a type of tree. Its node has a value called balance factor. Balance factor is the mod of number of nodes on left of a node - number of nodes on right side.\nThis balance factor cannot be greater than 1 at any instant. To maintain the balance factor the AVL tree has rotations which are done when there is an imbalance on any node. This helps as there can be certain cases in Binary search tree where the depth of the tree is too large and the data is stored inefficiently but rotations in AVL tree allow us to maintain the height by doing rotations hence ensuring a efficient storage of data in tree.,1, 14726,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a height balanced tree ,it means |height of left part-right part at every node| should be <=1.\nTo balance the tree we rotate the tree in RHS or LHS.",1, 14727,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL is an another balanced binary sub tree.\n AVL stands for adelson velsskii and landis ,1, 14728,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a sub form of binary tree. In which left node is less than right node.,1, 14729,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is type of binary tree in which left node is always less than right node \nit uses rotation (left and right) to maintain the property of AVL tree,1, 14730,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),an AVL tree is a self-balancing binary search tree.,1, 14731,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL is a binary tree which build the tree using functions like LR shift ,RL shift , LLR shift ,RRL shift .",1, 14732,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is form of binary tress that ensure that heavy element should be stored in the left of the tree and light element at the right side of the tree. AVL tress can be achieved by using operations like LEFT-LEFT , LEFT-RIGHT,RIGHT-LEFT,RIGHT-RIGHT rotation and it reduced the time for the purpose of searching.",1, 14733,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a tree which at least consist of two children or one, and it is a form of binary tree.",1, 14734,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),A balanced binary tree which maintains the weight of children on both its left and right side is called an AVL tree. The ratio of depth or right and left sides never exceeds 1.,1, 14735,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),a tree which allows rotation on the basis of insertion and has a height equal to the greater number of children of both the sides.,1, 14736,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"It is a type binary search tree with some condition :- \nFor every node\n| Height of left sub tree - Height of right sub tree | = [-1, 0, 1]\nTo maintain such condition we have to perform some rotation in regular binary search tree. ",1, 14737,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL Tree is a self height balancing search tree.\n\nProperties of AVL tree:\n1.All the nodes on the left of a node are smaller than the current node\n2. all the nodes on the right of the current node are larger than the current node\n3. Mod of the difference in height of the left subtree and right subtree of the root node is always less than or equal to 1,1, 14738,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),Tree traversal is a technique or a way to read a given tree and get the respective values or the information which it is carrying.,1, 14739,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),Avl tree is the balanced binary tree.\nit has all the small elements than root on the left and all bigger elements than root on right.\nthe minimum distance from root to child must be maintained .,1, 14740,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),,0, 14741,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An AVL tree is a tree where the left subtree of the root has nodes smaller than it and right subtree has nodes bigger than it and this pattern is followed in each subtree of the AVL tree.\nIn an AVL tree the difference of height between left subtree and right subtree has to be less than 2 in every position and this rule cannot be broken.\nIt is a balanced tree,2.5, 14742,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An avl tree is a binary tree where the left subtree of the root has nodes smaller than it and right subtreee has nodes larger than it and this pattern is followed in each subtree of the avl tree.Also in an avl tree the difference between the height of subtrees is not larger than 1,2, 14743,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a type of tree data structure in which the nodes are arranged in order where the smaller data is placed on left side of the parent node and the greater to the right side thus making it easy for traversals of node as arranged in increasing manner. ,",", 14744,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),Tree is a non-linear data structure. Traversal of tree refers to the different ways in which each node of a tree can be visited. There are three types of traversals:\ni) inorder traversal [left-node-right]\nii)preorder traversal [node-left-right]\niii) postorder traversal [left-right-node],2.5, 14745,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL is balanced binary searched tree , where each node have smaller element in their right side and bigger element in left side .",1.5, 14746,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"An AVL tree is a sorted Binary Search Tree in which each parent has at most two nodes and height on the left and right side is balanced, which makes searching and other algorithms work efficiently.",2, 14747,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a type of Binary Search Tree with balanced height in both left and right sub-trees.,2.5, 14748,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL Tree is a balanced Binary Search Tree.,1.5, 14749,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),A balanced binary tree is called AVL tree.,1.5, 14750,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"In AVL Tree, a node is inserted to the left if it is smaller than the current node or its right if it is equal or larger. Then, the balancing factor of all the nodes of that half of tree is checked. If it is greater than 1 or less than 1, then a rotation of nodes is made to make the tree balanced. ",2.5, 14751,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),a balanced binary tree is called AVL tree,1.5, 14752,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),special type of binary tree where for node\n|left height -right height|<=1,2.5, 14753,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a self balancing binary tree which balances itself after insertion of each node where height of each node can be -1,0,1 .As soon as height of tree or subtree gets 2 or -2 ,tree balances itself .",2.5, 14754,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),A balanced binary tree is called AVL tree,1.5, 14755,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),,0, 14756,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree refers to a balanced tree in which heights of the two subtrees of any node can only differ by 1.,1, 14757,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is the one in which the max difference between left and right subtree could be 1.,1, 14758,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),The tree which have a structure based on the branch weights of the root and child-nodes of the tree is called an AVL tree. In AVL tree the smaller elements should be at the left and the bigger elements should be at the right if the tree. AVL also consists of many rotations through the process of making it.,1, 14759,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"In quick sort, first we divide the array into two parts and perform selection sort on it and them combining it while comparing all elements to form a sorted array",1, 14760,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),an avl tree is a balanced binary search tree in which the height is restricted to (logn) instead of (n).,1, 14761,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"An AVL tree is a binary tree in which the value in every left node should be less than the corresponding parent node, and the value in every right node should be greater than the corresponding parent node.",1, 14762,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),A balanced binary search tree where the difference of depth on the right subtree-left subtree does not exceed 1 is called AVL tree. ,1, 14763,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a data structure which a bit less efficient when compared to red black tree. it is a balanced search tree, left and rifts structure are always equal",2.5, 14764,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"In Tree Traversal, each element is visited from root to leaves. In order, to find some element or maybe to calculate the prefix, postfix, infix.",1, 14765,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An array tree where there is a limit of sub node and the elements which are lesser than the root node at each level are put to the left of it and the nodes greater to the root node are put to the right of the sub node. ,1, 14766,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a improved form of data-structure called trees, it includes the concept of rotation on the basis of elements order. The aim is to build a tree which follows the property of perfect binary tree. ",1, 14767,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL is Binary Search tree that has same number of leaf nodes attach to its parent nodes that it is balanced binary search tree.,1, 14768,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),A balanced binary tree which has all balanced leaf nodes is called an AVL tree.,1, 14769,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An AVL Tree is a balanced binary tree in which all the leaf nodes are balanced.,1, 14770,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),A balanced tree in which all the leaf nodes are balanced is known as AVL tree.,1, 14771,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tress is a type of data structure that is used to store information in kind of a tree having root and leaf. It stores data in a manner that left child contains smaller element and right child contains greater element. It is also known as self balancing tree as it performs rotation whenever there is disbalance. It performs rotations like Left left,right right,left right and right left rotations based on the disbalance happened. Disbalance in AVL tree is counted by subtracting number of left child from right child and if it is greater tha equal to 2 then we perform rotation.",1, 14772,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a binary tree in which difference of height of of left child and right child is at most 1.,1, 14773,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a self-balancing binary search tree that maintains a height difference of at most one between its left and right subtrees. It was the first such data structure to be invented and guarantees a worst-case time complexity of O(log n) for insertion, deletion, and search operations.",1, 14774,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),It is a self balancing binary search tree which has rotations involved for its nodes.,1, 14775,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An AVL tree is BST tree in which the nodes are weighted based on their position and a variable is maintained which if becomes greater than 2 or smaller than -2 the tree becomes unbalanced and we need to balance the tree by rotating.,1, 14776,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An AVL tree is a binary tree in which the height of left and right children cannot differ by more than 1,1, 14777,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree are the self balancing trees which uses 0 and 1 as a balancing factor and via LL,RR,LR,RL combinations the tree balanced itself ",1, 14778,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a type of balanced binary tree. Each node of this tree is associated with a balance factor. If the balancing factor is 2 or more than 2, then it do rotations to make it balanced. ",1, 14779,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),Avl tree is a self balancing tree. It is a binary search tree which requires less swapping for balancing,1, 14780,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),It is a balanced tree .,1, 14781,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"it is a binary tree that balances itself , it has balance factor which can be -1,0,1",1, 14782,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL can be defined as the balanced binary search tree,1, 14783,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL is special type of tree where searching is easy and insertion take lots of time,1, 14784,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"An AVL tree is a balanced binary search tree where there are parent and child nodes. If the value f the child node is smaller than the value of the parent node then it will be on the left side of the parent node or else it will be on the right. Also the difference between the number of nodes on left and right should be either -1, 0 or 1. If the difference is anything other than these then appropriate rotations are made to meet the requirements.",1, 14785,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"A AVL tree is a binary search tree where elements are inserted in such a manner that the difference in the height of the level of node inserted and any other node does not becomes anything other than{-1,0,1} and if the difference becomes something else we use LL , RR. LR , RL rotations.",1, 14786,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a type of tree like red black and binary that rotates the values when one side of the tree has greater value than the other (left for smaller and right for bigger values),1, 14787,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a type of binary tree where leaf node must has 0 or 2 children.,1, 14788,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"An AVL tree is a self-balancing binary search tree. In an AVL tree, the difference between heights of left and right subtrees cannot be more than one for all nodes 2. The AVL tree are useful to get all basic operations done in O(log n) ^2.In the avl tree the sum is not more than 2 and occur more than 2 than other opearation can be performed.",1, 14789,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"it is a height balanced binary search tree. where the height difference of (left -right) of a root node is 1, -1 ,0",1, 14790,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"An AVL Tree is a type of a balanced binary tree where we use rotations to keep the tree balanced. Each node has a value attached to it : (right branch - left branch) which should always be -1, 0 or 1. Should it be more or less than that, we rotate the tree from the unbalanced node until the property is fulfilled once again.",1, 14791,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL is a self balancing tree in which the height difference between the left and right child of any node is less than or equal to 1, and in which left child is smaller than the parent and right child is greater than the parent.",1, 14792,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"avl tree is tree based data structure in which it is height balancing, each node has it's own balancing factor to perform ll,rr,lr,rl shifts",1, 14793,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a balanced binary tree in which each node has a balancing factor of 1/-1/0.\nIf on insertion the balancing factor gets disturbed then the graph undergoes either of the following rotations to retain the balance factor:\n1.LL\n2.LR\n3.RR\n4.RL,1, 14794,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a category of trees in programming where the no. of elements or we can say that the level of the tree on both the sides of its branches is equal, it is basically a balanced binary tree or a balanced k-ary tree.",1, 14795,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a self balancing tree. After inserting every node we first check if the tree is balanced or not.,1, 14796,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is nothing but a balanced binary search tree.,1, 14797,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),Avl trees are trees that are arranged in accordance to the weight of each node which is calculated by type number of nodes that tree has. The element having less weight are placed on the left hand side of the tree while the elements having higher weight then the root of the sub tree are placed on the right hand side of the leaf node. In this manner an AVL tree is generated. Later with the addition of new nodes the avl tree is readjusted so that the weight of the left hand side and right hand side does not come out to be more than 2.,1, 14798,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"avl tree is a tree in which every node has a variable which is the difference of the number of nodes of the left tree - the number of nodes in the right subtree \nto maintain the property of avl tree, every node should be balanced ( the value of diff variable can be -1,0,1) if not balancing is maintained by balancing techniques. ",1, 14799,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An AVL tree is a self-balancing Binary Search Tree where the difference between heights of left and right subtrees for any node cannot be more than one.,1, 14800,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),it is a balanced tree. it rotates on its own o maintain the balance when new nodes are added,1, 14801,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),avl tree is the arrangement of the tree on the bases of balancing factor according to trhat we make the right rotation and left rotation in it ,1, 14802,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree as a self balancing tree in which it performs some rotations so that the difference between the height of a left sub tree and right sub tree is at most 1,1, 14803,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is the balanced tree ,height of ech node is balanced and the height cannot extend from absolute 1.",1, 14804,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL Tree is a self balancing Binary Search Tree.,1, 14805,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),avl tree is a binary search tree where small numbers are present on the left side and larger numbers are present on the right side of the root node and the balancing factor of every node is between -1 to 1,1, 14806,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL Is a balanced binary tree which has a bf (balancing factor) for each node that is the length of right side - length of left side. ,1, 14807,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),an avl tree is a binary tree with the height on both of its subtrees balanced .It is a more efficient implementation of binary tree for searching an element in it.,1, 14808,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree), AVL Tree is a balanced binary tree while inserting the nodes we keep the check on the balanced factor and accordingly insert the nodes.,1, 14809,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL TREE is a tree where maximum height of tree should be 1 .,1, 14810,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is self-balancing binary search tree that can perform certain operation in logarithmic time.,1, 14811,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is the tree whose root's balanced height is {-1,0,1} . Balanced height of the node is = height of left child-height of right child.",1, 14812,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL Tree is a Binary Search Tree in which the balance of each node is either -1,0,1",1, 14813,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree are the tree in which the total node value of left child is equal to total node value of right child , if we insert any extra node we perform necessary rotations to equal the node value of each child.",1, 14814,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"a tree where every node is balanced that is every node has balance 1,0,-1.",1, 14815,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"it is a height balanced tree it has a balance factor which can take value -1,0,+1 this balance factor help to maintain the height of left and right subtree\nit perform searching in (nlog(n))",1, 14816,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An AVL tree is a self-balancing binary tree.,1, 14817,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"avl tree is also named after a balancing factor tree where we balance the parent and the root node. balancing factors can only be -1,0,1",1, 14818,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"Visiting the various nodes in a tree is called tree traversal, there are different methods:\n1-InOrder\n2-PreOrder\n3-PostOrder\n4-DFS",1, 14819,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"We start from root node then traverse each and every node one by one untill we reach the leaf node . There are three types of tree traversal postorder , preorder and inorder",1, 14820,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"An AVL is a self balancing binary tree where the tree is balanced from all of the child nodes of the root. The value of all child elements to the left are less than the value of the parent and the value of all the child elements to the right is greater than that of the parent. To keep the AVL balanced there are different rotations performed when an element is added to the the tree such as the LL, RL, LR, RR rotations.",1, 14821,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"the value of the right child is greater than the value of the root\nvalue of the left child is lesser than the value of the root\nhere these properties are of AVL trees, using this we tend to reduce our complexity while traversing and make our program efficient.",1, 14822,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a binary Tree in which right children have bigger value then left children \nand tree is constructed by following certain complex methods.\n,2, 14823,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),a binary search tree which has one parent node its leaf nodes and most importantly its left branch values should be less than parent and parent value should be less than right node..,2, 14824,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),Avl tree can be defind as a height balanced binary search tree in which each node is associated with a balance factor which is calculated by subtracted the height of the left and right subtress for any node.,2, 14825,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),height difference is equals to +-1,1, 14826,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"An AVL tree is a balanced binary search tree. Like red-black trees, they are not perfectly balanced.",1, 14827,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"It is a balanced binary tree where the difference in height of left and right subtree is 0,-1,and 1.",2, 14828,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a height balanced tree in which the difference between left subtree and right subtree cannot be greater than 1. We can always make a tree into an AVL tree by performing insertion and deletion operations.,1, 14829,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a height balanced binary tree in which, at any node the difference of height of the left subtree and right subtree is 1 or less than 1. ",1, 14830,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL is a self balancing tree which balances itself on the basis of weight(the difference of weight of the sub tree can only be b/w 0 and 2),1, 14831,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a tree formed with rotations (left, right) according to the data stored in the node. Formation of AVL tree follows a specific set of rules. ",1, 14832,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a self balancing binary search tree that maintains its height balance .\nthe height of left and right subtree differ by at most 1,2, 14833,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL Tree is a self re-arranging tree and it compares the height of the tree sides while accepting -1,1 and 0 as the values. If in case a discrepancy is faced between the right and left nodes, they are rearranged.",1, 14834,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),Visiting each and every node of the tree once is called traversal.There are three types of traversal- 1.inorder 2.postorder 3.preorder,1, 14835,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree tries to minimize the gap between the root and leaf nodes for it being equal to 2. ,2, 14836,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is height balanced BST in which each node is associated with a balance factor which is calculated by subtracting the height of its right sub-tree from that of its left sub-tree. it is said to be balanced if balance factor of each node is in between -1 to 1 else the tree will be unbalanced and need to be balanced.\n\n,2, 14837,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An AVL tree is a balanced binary search tree in which each element has a balance factor which is difference between height of left subtree and right subtree and balance factor is less than equal to 1,2, 14838,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"Tre traversal refers to the process of traversing the tree from root node and then left to right or vise versa. Some traversals are preorder ,level order traversal ,postorder traversal.",2, 14839,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL trees are the type of trees that can make their structures more search-efficient (reduce time complexity of search) upon insertion of an element by modifying it's height.,2, 14840,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An AVL tree is a self-balancing Binary Search Tree (BST) where the difference between the heights of left and right subtrees of any node cannot be more than one.,2, 14841,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a type of tree in which the difference between the height of left subtree and height of right subtree should be -1 or 0 or 1. We need to check the height in each and every step.,1, 14842,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a binary search tree in which the difference between the difference of node and left child and the difference of node and right child can be 0 ,1 or -1.",1, 14843,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree \nit compares height\nonly accepts values -1,0,1\ntries to minimize the gap between the root and leaf node.\nwe need to perform rotations to solve AVl tree",2, 14844,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL trees are those which have a height difference of +-1 between their left and right subtrees.,1, 14845,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"in insertion sort we basically pick and arrange the element according to their neighbor elements, whereas in selection sort we find the minimum element and then find exactly real position of the element and place it there.",1, 14846,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An AVL tree is a self balancing binary search tree. ,2, 14847,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"an AVL tree is a self-balancing binary search tree. The heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this proper. ",2, 14848,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),an AVL tree is a binary tree which can modify its height to the least height possible for the binary tree to exist to make its structure more efficient for searching in terms of time complexity after insertion of an element in the tree,1, 14849,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),,0, 14850,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a self balancing binary search tree(b.s.t). Its named after the initials of its designers.,2, 14851,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),Tree Traversal are the methods to traverse (or visit) the whole tree. Some of the methods of tree traversal are-\n1.) Inorder\n2.) Preorder\n3.) Postorder\n4.) Level-Order,1, 14852,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),,0, 14853,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"Avl tree is a sorted tree which has the biggest element at the top and all the arranged nodes are sorted at the input only, it can also rotate \nright to left or left to right , and even left to left and right to right if there is a colision of nodes and the order and level is disturbed.\nsmaller element goes to the ;eft and the bigger one goes to the right of the parent node.",1, 14854,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),avl tree is right side tree big roots and left side small root,2, 14855,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),it is a balanced binary searched tree after red black binary searched tree,1, 14856,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a height balanced binary tree in which at any point the difference of the height of the left subtree and that of the right subtree is never greater than 1 or less than -1. ,1, 14857,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a tree in which we rotate the element of the tree if the condition is not fulfilled. In this tree the maximum element is the parent node and node attach to it is known as child note,1, 14858,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL trees are the binary trees in which height is balanced of each and every node,2, 14859,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a type of tree in which difference of height on both branches connected to a node is 1 ,0 or -1.",1, 14860,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),avl tree is a balanced binary search tree in which elements smaller than root are left children of tree and elements greater than root are right children of tree,2, 14861,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),tree traversal means checking each element of the tree ,2, 14862,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),avl tree is a kind of binary search tree that arranges nodes of root node by checking a formula of no of left child -no of right child,1, 14863,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),,, 14864,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is the one in which there is a maximum difference of 1 between the left and the branch from any particular node.,2, 14865,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL Tree is a balanced binary search tree. Each node has an attached balanced factor whose value must not exceed 1. Balanced factor is : |height of left subtree - height of right subtree|.,1, 14866,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree are the height balanced trees in which the difference of height of the left side and right side of any node is at most 1.,2, 14867,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),the balanced binary search tree in which we also maintain height at each node.,1, 14868,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"Tree traversal refer to traverse within a tree, to travel all the nodes present in the tree. \nFor example in case of binary traversal is to travel each and every node of tree that is to travel all nodes to left of root of the tree and all nodes to the right of root of the tree.",2, 14869,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a self balancing tree where the weight of a node can be either 0 or 1 or -1, avl trees tend to reduce the overall height of the tree which helps in reducing the search time of the trees.",1, 14870,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is balanced binary tree where the elements less than the root node is on the left side of the root node while greater than the root node lies on the right side of the root node. And the tree is made also using different rotations. ,2, 14871,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a height balanced tree as in this the height of left and right tree is almost same .,2, 14872,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),avl tree is a tree where the right node should be greater than the left node in a binary tree.,2, 14873,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"an avl tree is a tree which is properly balanced tree.\nthe height difference of the left and right subtree of every node is -1,0,1 only.",2, 14874,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is the tree which is also known as self balanced tree , it uses the concept of rotation to store the elements and hence it balance the height of the tree. This method improves huge time complexity as compared to the simple tree.",2, 14875,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),an avl tree is a balanced binary search tree used to store data in which we use rotations to store data,2, 14876,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a tree where there's a maximum difference of 1 between the number of child at left node and number of child at right node.\nif the difference becomes greater than 1 then there is shifting between the nodes of the tree to re establish the unit difference.,2, 14877,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),it is a kind of binary tree which is balanced.,2, 14878,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree are the efficient form of tree building. ,2, 14879,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),Tree traversal is a way of printing a tree either horizontally or vertically by either using Breadth First Search (BFS) or Depth First Search(DFS) respectively.,2, 14880,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),A Avl tree is the one in which the difference in the height of the left and right tree cannot exceed +1 or -1.,2, 14881,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL trees are a method of traversing a tree its ful name is avial variation tree.,2, 14882,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An AVL tree is a height balanced tree. With insertion or deletion the tree automatically balances it's height. The effectiveness comes in when we use operations like searching as the tree is not skewed such operations later on become faster. ,2, 14883,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a binary search tree, in which rotations are made in order to sort it.",2, 14884,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a height balanced binary tree in which at any point the difference in height of left sub tree to right sub tree is 1 or less than 1.,2, 14885,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),It is a binary search tree in which rotations are made to sort the tree.,2, 14886,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a Balanced Binary Tree in which the left node is less than the parent node and right node is greater than the parent node,2, 14887,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),In Avl tree the lower elements are placed in the left side of the root node and higher elements are placed on the right side of the root node following this throughout the traversal till at the end root nodes are found.,2, 14888,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),,0, 14889,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is an sorting algorithm which helps to sort the elements or bits according to the algorithm of AVL tree,2, 14890,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),,0, 14891,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL Tree is a binary search tree which is balanced by height where each node is given a balance factor.,2, 14892,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),It is a balanced binary searched tree like red black tree.,2, 14893,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"avl tree is a self balancing binary search tree. It was first data structure to be invented. In avl tree, the height of the two child subtrees of any node differ by at most one.",2, 14894,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL is balanced binary tree in which the balancing factor can be only -1,1,0",2, 14895,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a balanced binary tree in which the difference in heights of the two subtrees is -1, 0 or 1.",2, 14896,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),it is a self balancing binary search tree,2, 14897,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"An AVL tree is a type of binary search tree which follow a particular rule . The rule is that the absolute difference of the height of the right subtree and the left subtree of any node should not be greater than 1 ie the difference can be -1,0,1. If conditions are not met we perform rotation like ll,rr,lr,rl rotations to make an avl tree.",2, 14898,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An AVL tree is self-balancing Binary Search Tree . where the difference between heights of left and right subtrees for any node cannot be more than one.,2, 14899,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a type of balanced search tree in which difference in the height of the two subtrees is less than 2 i.e it is always -1,0,1.",2, 14900,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a modified version of Binary search tree (BST) , in AVL tree all the nodes having value less than root node appers to be in left of root and bigger than root is places in right of root and this is followed for all the nodes, also the difference in heights of left sub tree and right sub tree is not greater than one.",2, 14901,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),It is the type of Tree in which the weight of the nodes are compared . \nThe child which is at the left side will have less weight than the parent node while the child which is at right side will have greater weight than parent node.\nThe tree which satisfies this condition is known as AVL tree.,2, 14902,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),avl tree is a tree in which left child of a node is smaller than the node and right child is greater than the node.,2, 14903,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),it is a self balancing binary search tree.,2, 14904,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),an avl tree is a self balancing binary search tree which maintains its height log n(n is the number of nodes) after every operation performed on it\nall elements that have less value than the value in the node are in left subtree and all the elements with more value in right subtree\nit is an advanced version of binary search tree,2, 14905,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),Avl tree are the balanced trees that means\nexcept leaf nodes every node have two child ,2, 14906,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),self balancing binary search tree in which every node is assosicated with the balance factor,1, 14907,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"Quick sort works by making partitions in any data structure, say it is an array, and then the array is partitioned in half. It works on divide and conquer approach so it keeps on making multiple partitions until it is efficient enough such that we can then sort the partitioned array in the most efficient manner and then re-join it such that the whole array is sorted towards the end. It takes a time complexity of O(nlogn). ",1, 14908,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree)," AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property.",1, 14909,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"A special form of Binary tree in which rotation happens itself at the insertion of nodes based on the evaluating criteria of the AVL. Which is - If the left side nodes imbalances the right side nodes, the rotation happens in a way that the tree balances itself.",1, 14910,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a binary tree in which the difference of the height of the left child and the right child is 1.,1, 14911,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is the modification of binary search tree in which balance of tree is also stored if their is any in-balance we do operations like l-r, r-r, l-l, r-l rotations depending on the situation.",1, 14912,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An AVL tree ,1, 14913,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"It is a kind of Binary Search Tree which is formed by comparing the balance factor and different operation like [LL ,RR ,RL and LR ]rotation are done depending upon the balance factor.",1, 14914,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),,0, 14915,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree), AVL tree is type of binary search tree in which whenever a new node is inserted at the end it checks with its parent it is at right position then no problem but if the element is not at right position then different rotations take place left or right to make the tree binary search tree in which all the elements less than parent are on left side and greater than are on the right side,2, 14916,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),type of BST (binary search tree)\nfour types of rotations can be performed depending on the balance factor:-\n1)LL or left-left\n2)RR or right-right\n3)RL or right-left\n4)LR or left-right,1, 14917,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),A pivot element is chosen from a group of elements. Other elements are placed on the right or left of the pivot element depending on whether they are larger or smaller than the pivot element.,1, 14918,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),it is a self balancing binary tree in which element which is greater than its parent is placed at right and element less than its parent is placed at left of the parent,1, 14919,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a self-balanced binary tree in which the elements greater than the root are placed in the right and less than it are placed on the left.,1, 14920,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),it is a type of self-balancing tree (data structure),2.5, 14921,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL trees are those in which all nodes are balanced. The element of lower weight should be on the left node of a tree and the greater one should be on the right.,1, 14922,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),The AVL tree is optimise verson of binary tree in which the difference between least and maximum level is not more the 2.\n,2, 14923,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),in the avl tree the upper node that is first node of the tree(parent) is larger than the left child and lesser than the right child.also it for the left chind as parent that it is grearter than of the left ching and lesser than the right child and so further for the right node and so on.,0, 14924,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"it is an example of balanced tree, it is balanced by appropriate rotations whenever a new element is inserted.",2.5, 14925,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL Tree is an binary tree, where each parent node has two children node. Also we create AVL tree such that left node is always smaller than the parent node and right node is always bigger than the parent node.",1, 14926,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL trees are height balanced Binary trees in which the difference of heights for each node is either +1, -1 or 0",2.5, 14927,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL Tree is the binary tree having smaller elements than root to left side and the elements on the right side are greater . If element is greater the the parent node the child gets attached to the left side if child node is smaller the the parent node its gets attached to right side.,1, 14928,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),It is a Balanced Binary tree ,2.5, 14929,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),,0, 14930,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),,0, 14931,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a type of tree in which left and right rotations are done whenver the condition of tree is not met. Condiions->right of root shoulod be greater and left of root should be smaller.,1, 14932,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),avl tree is a special tree in which the maximum element is on the right most part of the tree and the least element is on the left most part,0, 14933,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),it is a self balancing tree which balances its height at each level after operations such as insertion and deletion,2.5, 14934,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is an abbreviation for adelson velsky tree. it is a self balancing binary tree in which the difference of heights of left and right subtree cannot be more than 1.,2.5, 14935,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL Tree is a balanced Binary Tree. Whenever a new node is added to an AVL tree it utilizes the left height and right height of that particular node on which the new node is added. \nif the difference between the LH and RH is > 1 than 4 rotation are possible Left Right Rotation , Right Left Rotation, Left Left Rotation and Right Right Rotation. All these steps an AVL Tree balanced.",2.5, 14936,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),avl tree in which maximum ,0, 14937,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),Avl tree is a tree that uses rotation to self balance its height. ,2.5, 14938,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"avl is a weighted tree\nwhere weight is obtained and allowed weight is [-1,1] the tree is extended only in the direction where weight is maintained between -1 and 1\n",1, 14939,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),balanced binary tree in which each node is connected through balanced factor of subtracting or adding0,2.5, 14940,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),avl tree is used to sort the binary tree with child nodes less than the value of parent node on the left and greater on the right ,0, 14941,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"Such a tree , in which the value of left is smaller than the parent node and the value of right child is bigger than the parent node is called AVL Tree.",0, 14942,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a special type of tree in which it maintains balance between the left and the right subtrees. if the balance is greator than 1 then it perform swap operation to maintain the balance between them.,2.5, 14943,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL is the balanced binary tree which have divided its tree may be in symmetry or it is equal divide in level. it is perform the operations like traverse, add or delete. by left to right and right to left.",2.5, 14944,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),,0, 14945,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL Tree is a properly balanced binary tree where every node has 2 children except the leaf nodes and nodes are filled from left to right. To maintain the order rotations are also done in the tree.,2.5, 14946,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"avl tree are balanced binary tree in which we balance tree by performing certain rotation that are LL , RR , LR , RL",2.5, 14947,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree :- It is Balanced Binary Tree. ,2.5, 14948,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a avalanche,0, 14949,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),it is data structure that follows tree traversal or graph traversal algorithm,0, 14950,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL Tree is balancing tree in which Data is stored and then balanced by the rotations (LL, LR, RL, RR).",2.5, 14951,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"An AVL Tree is a type of Tree in which we use rotations to add an element. rotations are LL,RR,LR,RL",1, 14952,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"in avl tree first element is considered as root node then each elements are arranged according by the comparison made by the parent node, element smaller than the parent shifted to left and element greater to parent shifted to right, and we have to check correct insertion of each element by checking its height from the ground and make necessary rotations like right right rotations etc",0.5, 14953,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree is a balanced binary search tree in which the difference of the weight of left and right side the tree can be -1,0,1. if the weight of the tree is not equal to the previously mentioned weights then we perform rotations in order to make weight = -1,0,1.",2.5, 14954,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),An AVL Tree is a modification of the tree data structure such that the difference between the height of the left sub tree and right sub tree at each node is less than equal to one. This is done in order to ensure that the searching time for an element stays in O(logn) time and not become O(n) time in worst case.,2, 14955,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tress is a ,0, 14956,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),it is balanced tree in which right side is greater than parent and left is smaller than parent and if goes unbalanced then rotations are performed ,2.5, 14957,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),,0, 14958,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),AVL tree is a tree in which height of tree is maintained there are only 2 maximum child nodes which are distributed left and right.,0, 14959,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),avl is a part of binary tree in which time complexity is low ,0, 14960,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),"AVL tree follows property of a balance binary tree, with its all nodes arranged properly from left to right in a minimum or a maximum order.",2.5, 14961,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),avl tree is maintain height of the tree and distribute element left or right,2.5, 14962,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),self balanced binary search tree.,2.5, 14963,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),it is a self balancing binary search tree in which different rotations depending the different conditions \nthe following rotations can be done in a avl tree -\nrr\nll\nrl\nlr,2.5, 14964,What is an AVL Tree?,AVL trees are height balancing binary search tree. AVL tree checks the height of left and right sub-trees and assures that the difference is not more than 1. This difference is called Balance Factor. BalanceFactor = height(left-sutree) − height(right-sutree),avl tree is also known as avalanche tree and used in sorting.,0, 14965,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",,0, 14966,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",if there are total 6 edges in a graph then 6-1=5 spanning trees are possible i.e. vertices-1 are the total spanning trees possible,1, 14967,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",A graph can have if we have v vertices the number of spanning trees can be v-1\n,1, 14968,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",minimum: 1\nmaximum: No of edges - 1,1, 14969,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",Let V be the number of vertices inside a graph and E be the edges. Then maximum number of spanning trees is |E|-1 and minimum number will 1.,1, 14970,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",if there are V no. of vertices then there will be V-1 spanning tree,1, 14971,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",,0, 14972,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",No of spanning tree can be calculated by the formula |E|^C subscript |V-1|,1, 14973,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",|Edges| C |Vertices -1| - no of cycles\n\n{ edges! \\ [ ( edges-vertices-1 )! * (vertices-1)! ]} - no of cycles ,1, 14974,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",with n vertices\nspanning trees = n(n-2),1, 14975,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",A graph can has maximum of n of trees where n is the total no. of nodes in that tree.,1, 14976,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",It has many spanning tress and follows the formula :- [2n C ( v+ e ) ] -[ no. of cycles] .,1, 14977,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.","The spanning tree can have (E - 1) edges and all vertexes from the graph , (2^n-1) spanning tree can be form.",1, 14978,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",Spanning tree in a graph is when you remove all the extra edges forming a cycle in a graph. A graph can have multiple spanning trees.,1, 14979,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",a graph can have infinite number number of spanning trees.,1, 14980,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",There can be multiple spanning tree provided cost of each tree is minimum.,1, 14981,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",The maximum number of spanning trees in a graph is equal to the number of children of the root node,1, 14982,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",,0, 14983,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",a graph can have minimum spanning trees equals to its (vertex-1),1, 14984,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.","if a graph has V vertices and E edges, the number of spanning trees it can have is (Ec(V)) - 1.",1, 14985,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",A graph can have many spanning tree if no cycles are formed in any of them. There can be only one or no more than a total of \,1, 14986,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",A graph can have many spAnning trees till the moment there are no cycles formed . also there can be only be minimum spanning tree of a ,1, 14987,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.","The spanning trees depend upon the no of cycles present in the graph. it could have n-1 spanning trees.,",1, 14988,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.","AVL tree is a special type of tree which stores values in such a way that element having value less than root node is stored in its left child, and element greater than data in root node is stored in right child. ",1, 14989,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",a graph can have minimum spanning tree equal to number of edges.,1, 14990,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",No. of edges-1,1, 14991,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.","E(E-1)/2, where E is the number of edges.",1, 14992,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.","E(E-1)/2,\nwhere E is the no. of edges.",1, 14993,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",a graph can have same no of spanning tree as its edge count is.,1, 14994,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",A graph can have 2^n spanning trees where n is the number of nodes.,1, 14995,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",number of spanning trees that a graph can have is equal to the number of edges that a graph has,1, 14996,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",2 to the power of number of vertex.,1, 14997,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",if a graph has n edges it can have n-1 spanning trees where each tree has same no. of vertices.,1, 14998,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",Total number of spanning trees is equal to number of edges the graph has,1, 14999,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",A graph can has Many spanning trees depending upon the tree structure. But the graph has only one minimum spanning tree. ,1, 15000,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",A graph has n^(n-2) spanning trees. Where n represents number of nodes.,1, 15001,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",n^(n-2) spanning trees a graph can have.,1, 15002,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",A graph can have spanning trees equal to its vertices.\n,1, 15003,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",A tree traversal means displaying all the elements of a tree one by one in a particular order. We can traverse tree in 4 order:\n1. pre-order.\n2. in-order.\n3. post-order.\n4. level-order.,1, 15004,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",a graph can have multiple spanning trees but the maximum spanning trees can be equal to the number of vertices.,1, 15005,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.","A graph can have multiple spanning trees, but can only have Minimum Spanning Trees equal to the number of vertices in it.",1, 15006,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.","for n edges in the graph, there can be n factorial spanning trees.",1, 15007,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",A graph can have multiple spanning tree. The one with the less no of participants is called minimum spanning tree.,1, 15008,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.","In AVL tree the root node is the largest, with exactly to children>\nwhere the left child No. of spanning trees = n,0, 15195,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",a graph can have multiple spanning trees but only one mst.,1, 15196,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",spanning trees can have acco,0, 15197,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",Spanning trees a graph can have are :- 2^(n)\nwhere n = no. of edges in a graph,0, 15198,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",A graph can have multiple spanning trees,1, 15199,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",2^n - no of closed path ,0, 15200,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",no.of nodes -1,0, 15201,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.","in graph G , it has V vertices and E edges , so it can make V number of spanning trees",0, 15202,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",number of edges - 1,0, 15203,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",The no of spanning tree is depends on the no of vertex in the tree we can have the equal amount of spanning tree the no which we have in a graph ,0, 15204,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.","A graph can have many spanning trees, a generalized formula fo the total no of spanning trees a graph can have 2^(N-1), where N is no of edges.",0, 15205,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",one,0, 15206,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",Minimum spanning tree (Mst).,0, 15207,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",the number of spanning trees possiable is 2^n,0, 15208,How many spanning trees can a graph has?,"It depends on how connected the graph is. A complete undirected graph can have maximum nn-1 number of spanning trees, where n is number of nodes.",there would be no spanning tree in a graph,0, 15209,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",,0, 15210,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap stores the values dynamically i.e at the runtime ,2, 15211,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",in a heap data structure the elements can be represented from either max to min or min to max depending on the heap we use if we use min heap the minimum element is present in the root node if we use max heap the maximum element is present in the root node heap can be used as priority queue ,2, 15212,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap Data Structure has two types: minheap and maxheap. Heap arranges data in a state tree and then checks if any child is not smaller(minheap) or larger(maxheap)than its parent,2, 15213,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a data structure that stores data in min or max form. min heap has lowest data as root and each element follows this. Vice versa in maxheap where max is at root and else are smaller and same logic is applied to each node.,2, 15214,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a data structure used to store data in tree type format and using build heap and always parents value is greater than its child,2.5, 15215,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a tree based data structure in which all nodes of tree are in specific order .,2.5, 15216,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",,0, 15217,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is implemented using tree \nthere are two types of heap \nmin heap - parent node is always less than its child nodes\nmax heap - parent node is always greater than its child nodes,2, 15218,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly,1, 15219,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a non linear data structure which uses dynamic memory and whose size can be increased or decreased as per our choice and which stores the index of the value present in array.,2.5, 15220,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap is way of colleting the data one over another for the usage . We can store the data in two forms of the heap , that is min heap or max heap . \nIn min heap the data is stored in ascending order and descending order in max heap .",2.5, 15221,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap in data structures is a function which consist of two form one min heap and max heap. In min heap all the values are arranged which are minimum and then are read or store. And in max heap all the values which are large are store and read.,2, 15222,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap is a data structure similar to that of a tree but stores the data in two different kind of formats , either by using MAXIMUM values or MINIMUM values.",2.5, 15223,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",,0, 15224,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A tree where parent node is greater/smaller than the all children node. ,2.5, 15225,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",The heap data structure employs a condition where parent is either smaller or greater than all its children elements,2.5, 15226,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","A graph can have, n^(n-2) number of spanning trees.",0, 15227,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap data structure is used to sort the array in minimum complexity of 0(logn) it gives the minimum or maximum element on the top according to priority queue used ,2, 15228,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap data structure is a data structure which is used to extract the max element(max heap) and min element(min heap) easily.,1, 15229,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.", spanning trees for a graph with \,2.5, 15230,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","A heap data structure is very similar to the tree data swtructure , it has a root and it has nodes . ",1, 15231,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap data structure stores value in the form of tree and then the heap is sorted where increasing or decreasing order (max or min heap) and can be useful for traversing the particular element. ,0, 15232,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Spanning tree of a graph is a special tree where number of vertices are same as parent graph, but there should not be any cycles present. ",0, 15233,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","heap is data structure , like priority queue .\nwe have here max and min heap to solve our problem like max and min operation in an efficient way ",2.5, 15234,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Two types of heap Min-heap and Max-heap.\nIn min heap the data is sorted in ascending order in the form of a tree in which the minimum element is the root .\nIn max heap the data is sorted in descending order in the form of a tree in which the maximum element is the root .,2.5, 15235,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",It is a complete binary tree where every node has either 0 or 2 children. There are two types of heaps - minHeap where the minimum element is placed at the root and maxHeap where the maximum element is placed at the root.,2.5, 15236,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap data structure is a complete binary tree which has either 0 or 2 children and further heap is divided into two sub categories minheap and maxheap. Minheap has minimum element in the root node and maxheap has maximum element in the root node. The traversal goes down by comparing both the children and the one min is swapped with the parent node for that child.,2.5, 15237,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",if is the data structure used to store information in sorted order. If the Heap is Max heap then it will store data in such a manner that data of the child node is always less then the parent node. If it is min heap then it will store in such a manner that data of parent is always less then child. ,1, 15238,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a data structure that stores data in the form of a tree either in ascending order(min-heap) or descending order(max-heap).,2, 15239,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","heap is used when we have to store the elements which are already sorted. There are two types of heaps that is min heap and max heap. max heap is a heap in which the child node is always less than the parent node, whereas in min heap it makes sure that the parent node is less than the child node.",1, 15240,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is basically of two types:\n1) min heap: value of parent node is lesser then the its children\n2) max heap: value of parent node is greater then the its children,2, 15241,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a data structure which is basically a complete binary tree in which each node will be greater than its child nodes or smaller than its child nodes.,2, 15242,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is the data structure with time complexity of n log(n).\nInstead of sorting nodes one by one before placing in the tree. Heap helps us to sort them in the tree only there are 2 types of heap max heap and min heap.\nit select the minimum value in the heap and traverse it upwards by swapping from upper node one by one and then arrange if there is disturbance in other nodes this is known as min heap.,2, 15243,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",,0, 15244,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a data structure based on tree. A heap is a complete binary tree.,1, 15245,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a data structure that is made up of complete binary tree. It helps in extracting max or min element.,2, 15246,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a kind of data structure which help in arranging the data in a ascending or descending order . Heaps are of 2 types MIN-HEAP and MAX-HEAPS.,2, 15247,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","An AVL tree is the one which is a balanced binary tree i.e. every node has its (max left child length- max right child length)=1,0,-1.",0, 15248,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a complete binary tree in which we cant move to the next level without filling the current level. It can be made using priority queue.,2.5, 15249,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap is a data structure, which all the elements of a tree are stored in an array or linked list. If the parent node is at nth index in the array, then the first child is at 2n+1, second child at 2n+2 and so on. It is a representation of a tree in form of an array or linked list.",1, 15250,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap refers to the data structures where the root and intermediate nodes have right and left children which are 2n+1 and 2n+2 respectively for parent node located at n index. Heap can be implemented using arrays, linked list and trees. In case of max and min heap , parent node is greater or smaller than child nodes respectively and on any deletion or insertion of a value it rearranges to maintain the same conditions..",2, 15251,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a data structure that is based on the advanced version of queues that is priority queues. ,1, 15252,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A graph with n vertices can have n-1 spanning trees. As there can be multiple ways to join all vertices but not create a cycle.,0, 15253,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is another type of array of a data structure.,1, 15254,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap in data structure uses trees for implementation, there are two types of heaps a max heap where all the child nodes are smaller than the parent element and min heap where all the child nodes are greater than the parent node. ",2, 15255,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is Data Structure is a dynamic data structure that is used to store data either in ascending order(Min Heap) or Descending Order as Max Heap.,2.5, 15256,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a type of data structure to store the data ascendingly or in descending order i.e. 'min Heap' or 'max Heap'. ,1, 15257,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a kind of data structure to store the data ascending or in descending order.,1, 15258,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is used to store the data in increasing or non-increasing order.,1, 15259,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a data structure that stores data which have operations like heap sort and heapify. These are of two types: Min heap and Mex heap. Min heaps are formed by keeping the root node minimum and as data at the leaf as maximum whereas in case of max heap we have root as maximum and leaf as minimum.,2.5, 15260,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A data structure (array) which can be represented as the complete binary tree and having it parent node smaller than its children node(min heap) is called a heap.,2.5, 15261,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","A heap is a specialized tree-based data structure that is used to maintain a collection of elements where the highest (or lowest) priority element can be accessed quickly. It has two main variants: max-heap and min-heap. In a max-heap, the parent node is always greater than or equal to its children nodes, while in a min-heap, the parent node is always less than or equal to its children nodes. Heaps are commonly used in algorithms such as heap sort and priority queues.",2.5, 15262,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is an data structure in which the tree is a complete binary tree and is a special binary tree.,2, 15263,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a dynamic data structure that contains the address of values rather that storing them itself which makes it fast and efficient,1, 15264,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",It is the memory in which data is stored temporarily when operations are being carried out.,1, 15265,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",a heap is an optimized form of priority queue which is used to store the numbers in such a manner that it is easier to find the number and do the required operations,2, 15266,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap data structure is basically a binary tree. It can be of two types - min heap and max heap\nHeap in data structure is a binary tree.,2.5, 15267,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap is a data structure in which the parent node is lesser or greater than the children node\nMin heap has parent lesser than the children node\nMax heap has parent greater than the children node\nHeap is used for heap sort. Heap also has a lot of function like extract min, decrease key etc.",2.5, 15268,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is type of tree which is arranged in increasing or decreasing order in which leaf value is less than right value.,1, 15269,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",it is a binary tree in which root is compared with children it is of 2 types - max heap & min heap,2, 15270,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a tree based data structure in which the tree is completely binary tree,2, 15271,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly.\n\n,2, 15272,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",a heap is a type of data structure that stores the data similar to a tree and is usually when we need to remove the root node priority (highest or lowest) wise. It is also used to insert values which will be stored either in min heap ( lower value priority) or max heap (higher value priority),2, 15273,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is used to store in such a manner that either the minimum data stays on top and then bigger than it becomes its child and then again the child of it follows that its child are bigger than it or the maximum data stays on top and then its child are smaller than it and again there child are smaller then them.,2.5, 15274,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a data structure like stack and queue that stores values. Binary heap can store value accordingly and is a preferable method in many cases for searching and sorting \n,2, 15275,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a priority queue where we can decide the order of insertion and deletion based on our requirements.,2, 15276,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a specialized tree-based data structure which is essentially an almost complete binary tree that satisfies the heap property. Their are two types of max heap and min heap .,2, 15277,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",it a tree in which the tree is complete binary tree.it implements priority queue.in this tree the highest or the lowest element is thee root node.,1, 15278,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a data structure where the data is stored in the form of a sorted tree where the parent node can have multiple child nodes. A heap can either be a min heap or a max heap depending on the way it is sorted.,2, 15279,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heaps are tree like structures where the child element is always greater or smaller than the parent element. Examples are min heap, max heap, etc..",2.5, 15280,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",it is tree based data structure in which it is a complete binary tree. if the most effecient implementation of the data type priority queue,1, 15281,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",\nThere are three types of heaps\n1.Binomial heap\n2.Fibonacci heap\n3. Min heap/ max heap,1, 15282,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","a heap is a data structure used to arrange data in a sorted manner, we take the first data inputted as head of the heap and then keep on inserting data below it, data is then shifted and pushed down accordingly considering whether it is min heap or max heap.",2, 15283,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",,0, 15284,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is nothing but a special tree whose root node has a lesser left child and greater right child.,2, 15285,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a data structure which uses a tree to arrange the values given in an ascending or descending order.,2.5, 15286,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",a heap data structure is implemented by following the heap property when connecting the two nodes of the heap\nHeap property is when the root element is greater or smaller than as mentioned than the children nodes of the heap,2, 15287,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly.,2, 15288,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",it is a kind of tree,0, 15289,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is the data structure of arrangement which gives the max or min element from the set of element ,1, 15290,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap is a form of a tree, there are two types of heap, min heap and max heap\nIn a min heap, the parent node is smaller than that of its child nodes\nIn a max heap, the parent node is greater than that of its child notes",2.5, 15291,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",a heap is a tree only with few constraints ,2.5, 15292,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a special case of balanced binary tress data structure where the root node key is compared with its children and arranged accordingly.,2, 15293,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is data structure which has the maximum or minimum element at the root node,2, 15294,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a kind of tree which has the root node as either max element or min element .It can be of 2 types min heap(root=min) or max heap(root=max),2.5, 15295,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","a heap stores data according to a constraint in a tree in the form of binary heap,binomial heap,max heap,min heap fibonacci heap depending upon the operations neede to be performed.",2, 15296,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap is the balanced binary tree, which includes min heap and max heap.",1, 15297,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a special tree based data structure in which the tree is complete binary tree.,0, 15298,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a tree based data structure in which all nodes of a tree are in specific order.,1, 15299,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",a heap is a data structure used to store and sort data by assigning them to left and right child of the root node and so on. ,2.5, 15300,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a linear data structure which is implemented by queue,2, 15301,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap is a data structure that store a data in encoded form , if we want retrieve out we have to decode it by the type of heap we used to encode it.",1, 15302,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",a complete binary tree is heap,1, 15303,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",it is a efficient data structure that helps it has max heap and min heap it has max/min element at top\nit helps to find kth smallest or largest element ,2, 15304,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","A heap is a data structure which can be implemented using priority queues. A heap tree is a tree in which on deletion, the highest element (in case of maxHeap) or the lowest element (in case of minHeap) gets deleted first.\n",2.5, 15305,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap in data structure is arrangement of data by insertion of max elements first or by min elements an order of max elements first is maintained\nmax elements arranged are called max heap whereas elements arranged accord,2.5, 15306,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A graph has (|E|-1-no. of cycles) number of spanning trees spanning trees.,1, 15307,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",n^(n-2) where n has no. of nodes,1, 15308,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap data structure is a tree data structure and is in the form of min/max heap. In min heap the parent node is greater than both of its children and the element to be added is added to the last node.,2.5, 15309,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","heap gives us the largest or the smallest value that we want in any case\nlike max heap, min heap.\ndone using priority_queue\nin case of max heap we get maximum element at the top\nand in case of min heap we get the minimum element at the top.",1, 15310,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A Heap data Structure is type of Data Structure in which we used to store data in pilled up manner \nex. priority queue ,1, 15311,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",,, 15312,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap in a special tree based data structure in which the tree is a complete binary tree where all nodes of a tree are in a specific order.,2, 15313,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",data structure in which maximum and minimum values stores at the top of the tree it vcan be of 2 types max an min heap. max heap have maximu value on to. while min heap have mim value on top.,1, 15314,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a tree-based data structure in which all the nodes of the tree are in a specific order. ,1, 15315,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap refer to a large memory block. Heap is based upon LIFO- Last in first out principle. ,2, 15316,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a data structure to store elements in form of a tree. There are two types of heaps\n1) Min heap- the root node will contain the minimum value element\n2) Max heap - root node will hold the maximum value element.,1, 15317,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","heap is binary tree. it has two types- max and min heap. in max heap, the maximum element becomes the root node and in min heap, minimum element becomes the root node.",1, 15318,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","A heap is a binary tree that arranges data in order( ascending - min heap, descending - max heap)",2, 15319,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap data structure is basically a data structure in which the data is stored in the form of :\nMin Heap: every child node is greater than the parent node. (root node is minimum)\nMax Heap: every child is lesser than the parent node. (root is maximum).\nPriority Queue: The elements are retrieved according to the specified priority. (minimum or maximum, lesser then or greater than).",1, 15320,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",in this data structure the value of the parent node must be greater than or equal to (in case of max heap ) or less than or equal to (in case of minheap) to its child nodes.\n,2, 15321,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is like a tree which stores data in an ordered manner. Min heap accounting for ascending as the head node is the smallest value among them all and Max heap accounting for descending as it places the largest value as the head node. ,1, 15322,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",at maximum the graph can have (no of edges+1) spanning tress.,2, 15323,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap data structure stores values such that greater(maxheap) or lower(minheap) value is parent of lesser or greater values. Used to extract minimum of the values list.,2, 15324,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is type of data structure where the first element is either smallest or largest depending upon the heap and the parents of each element lie on 2N and 2N+1.,1, 15325,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",,, 15326,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",maximum number of spanning trees : n^(n-2),1, 15327,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a tree data structure where the elements are structured in a way such that the highest value element is on the top (max-heap) | or the minimum value element is on the top (min-heap). Heaps are used to implement priority queues.,2, 15328,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","A heap is a complete binary tree, and the binary tree is a tree in which the node can have utmost two children. ",2, 15329,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is like a tree data structure but it does not store elements in random order. It has two types - Min Heap and Max Heap. Mean heap stores the elements in increasing order and Max Heap stores in decreasing order.,2, 15330,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",there are two types of heap that are min heap and max heap. Min heap is a tree in which the node will have the minimum element.,1, 15331,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",It is similar to tree\ndata stored in ordered manner\nmin heap -> smallest e;lement in head node,2, 15332,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a data structure which contains either the maximum(max heap) or minimum (min heap) value on the top of the tree.,1, 15333,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","tree traversal is a way of traversing the binary trees in which we cover all the elements, It is of 3 types -> preorder, inorder, postorder",2, 15334,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a special case of balanced binary data structure where the root node key is compared with its children and arranged accordingly.,1, 15335,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heaps are the non linear data structures which stores the data hierarchially in form of trees. There are nodes and each node ,1, 15336,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a tree data structure in which value stored at each node is smaller than its children in case of min-heap or value stored at each node is greater than its children in case of max-heap.,1, 15337,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap data structure create two heap max heap or min heap .In min heap top element will be minimum and last element will be maximum and max heap will be opposite of it .,2, 15338,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap is a data structure in which the elements are placed in such a manner that all the elements before the root are smaller than the root and all the elements after the root are larger than the root. It is a flexible d.s, with applications :-\n1)Fibonacci heap\n2)Binary heap\n3)Heap sort",1, 15339,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",2 * Number of Edges,2, 15340,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","heap data structure is a process by which you can optimise the solution to less time complexity by using heap , in this we make heap of small sizes and then we perform the work , lie min heap concept is used in kruskal's algorithm for reducing the time of kruskal;s algo from N^2 to (nlogn)",2, 15341,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","a heap is a DATA structure which is a sorted tree and the min\\max element can be prioritised as the top node, \nthere are several types, binomial heap, min heap max heap etc",2, 15342,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a special balanced binary tree where root node ,2, 15343,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a type of data structure that helps us into the efficiency of the program and can use global variable in it,1, 15344,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","A heap is a binary tree which follows a certain heap property. Like a max-heap will follow max-heap property which means the in a max heap the topmost element of the heap will be always the largest element in the heap, whereas in a min heap the topmost element of the heap will be always the smallest element in the heap.",1, 15345,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is of two type min and max which allow us to make min heap or ma heap,2, 15346,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a data structure that is used to store information in tree like formation in minimum or maximum manner which is performed by heapify function\nTwo types of heap\na)Min heap\nb)Max heap,1, 15347,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","A heap is a data structure in which topmost element is minimum and its children are bigger than the node and so on. Or topmost element is maximum and its children are smaller than the node. It is used when less time is required because it can perform operations like insert, delete or search an element with less time complexity. ",1, 15348,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",there are three types of heap binomial heap fibonacci heap and binary heap,2, 15349,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",a graph can have spanning trees equal to the number of nodes of the graph.,2, 15350,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",a heap is a data structure which stores minimum element as root and then subsequent child nodes,2, 15351,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap in a data stucture is tree,2, 15352,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a data structure which is of two kinds a min heap or a max heap. In a min heap the parent element is always supposed to be smaller than its child nodes. ,2, 15353,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a useful data structure when its necessary to repeatedly remove the object with the highest (or lowest) priority or when insertions needs to be interspersed with removals of root node.,2, 15354,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","There are two types of heap one is min heap and the other is max heap, in min heap the sum of the child nodes is greater than the value at parent node and in max heap the sum of the child nodes is less than the value at parent node .",1, 15355,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a data structure in which we change the indexes of the elements of the array according the type of heap i.e min or max heap.\n,1, 15356,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",,, 15357,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a data structure wherein the parent is either always larger or always smaller than its child nodes.,1, 15358,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",There are two types of heaps . First min heap where the root node is less than the child nodes and the second max heap where the root node is greater than the child nodes.,1, 15359,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap arranges data in form of tree but the elements in this tree is based on the type of heap. if it is min heap the root or parent is always smaller then its children. And if max heap then root or parent is always greater than its children.,1, 15360,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","heap is a data structure which is a binary tree in which either we have the root the largest element and then the next smallest on level 1, or the smallest element on the root and then the just larger one on the level 1 and so on depending upon our requirements.",1, 15361,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","heap is a kind of tree whish is in sorted form called min heap or max heap. heap carries out operations like sorting, searching, insertion, deletion.",1, 15362,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap data structure is a type of data structure which stores the minimum or maximum element at the top. This data structure is generally used implemented using arary while the indexig is assigned in such a way that it behaves like a binary tree.,1, 15363,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",a heap is a data structure that stores the data in tree format either in increasing order where root element is smallest i.e minheap or it stores it in descending order (maxheap)where root is the greatest element.,1, 15364,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",,0, 15365,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","it is used to store data, we can create min and max heap which is arranges in the ascending/descending order",1, 15366,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Non linear data structure. ,1, 15367,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",edges-1,1, 15368,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap in a data structure is a non-linear data structure, in which n number of nodes can be linked to its parent node.",1, 15369,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a container like structure used to store array values or integers,1, 15370,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","A heap is a data structure in which elements are stored in form of a tree. it has two types - min heap and max heap. either the min or max element is maintained on the top and elements as we go down the tree follow the same property. While inserting, deleting, we need to maintain them. These are useful to store and access min and max elements when need be.",1, 15371,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a balanced binary tree whose root node is its key node and is compared with its children nodes.,1, 15372,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a balanced binary tree where root node key is compared to its children,1, 15373,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",It is the balanced binary tree data structure where the root node key is compared with its children and arranged accordingly.,1, 15374,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly.,1, 15375,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a data structure where we can traverse the complete binary tree as well as it is an area in computer for main storage of memory.,1, 15376,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",,0, 15377,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","heap is to maintain a large amount of data , heap can also is called a tree \nit stores the data ",1, 15378,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",It is a type of data structure which ,1, 15379,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A Heap is a special tree data structure in which the tree is a complete binary tree.,1, 15380,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a type of data structure in which a tree is the binary tree and it is use to store global variables.,1, 15381,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a tree based data structure which is a complete binary tree that satisfies the heap property.\nHere a root node is compared with its children and then it is placed accordingly depending on whether it is a min Heap or a max Heap. ,1, 15382,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",a non linear data structure in which the root node is always maximum or minimum value and is maintained throughout the data strucutre ,1, 15383,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap data structure is a tree based data structure either a maximum elements are at top and lowest at bottom or vice a versa.,1, 15384,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a tree which always have its minimum or maximum element at its root or a tree in which a parent node is always bigger/smaller(max heap/ min heap) than a given child node. It is a complete binary tree,1, 15385,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap data structure is a type of binary tree which follows either of the 2 rules. Either a child can not be greater than the parent . Heap formed in such a way is called Max Heap. or the parent cannot be greater than a child , such a heap is called Min Heap.",1, 15386,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is defined as special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly,1, 15387,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a tree based data structure where either the minimum elements are at the top and max at the bottom or vice versa,1, 15388,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a data structure which is a Binary tree and it also follows the complete binary tree property. There are teo kind of heaps:\n1. Min heap - It stores the minimum element at its root and follows CBT property.\n2. Max heap - It stores maximum element at its root and follows CBT property.,1, 15389,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a kind of data structure which stores the data. There are various types of heap one of them is binary heap.,1, 15390,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a data structure to store data in minheap form and maxheap form. eg in minheap every children is greater than its parent.,1, 15391,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","A Heap is a special Tree-based data structure in which the tree is a complete binary tree.\nThere are two kinds of heaps, minimum heap and maximum heap. ",1, 15392,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a data structure in which the value at a node is smaller than the values at its children and the smallest element is kept at the top of the tree and the tree can be represent using an array where the child of ith node are 2*i and 2*i+1,1, 15393,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap data structure is basically a tree having the root node is max or min element of the entire tree depending upon the heapify function\nIt is the special tree because every sub tree node is the max or min value of that tree that help us to find the kth largest or kth minimum element of that tree,1, 15394,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a special tree based data structure in which the tree in completely binary tree and it is of mainly 2 types \n1) min heap - min element is at the top \n2) max heap - largest element is at the top,1, 15395,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","AVL tree is a self balancing tree where in we implement the data structure i.e. the tree in such a way that whenever an element is inserted into an AVL tree, it balances itself before any other operation can be completed on it. ",1, 15396,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. If x has child node β then − key(x) ≥ key(y) As the value of parent is greater than that of child it is called Max Heap. Suppose parent is lesser than that of child it is called Min Heap.,1, 15397,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","A type of storing data structure that stores the data in two patterns - min Heap and max Heap. It is in our power to store data in the form of parent nodes, and children nodes. It is basically a tree that has been modified in a way that we make any parent node to have children that are only smaller/larger than the parent node. This storage is called a heap, also priority_queue.",1, 15398,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap is a data structure in which Array of elements represented as a complete binary tree. It is of two types Min-heap and Max-heap.\nIn min-heap the root node of the heap is the smallest element and all the parent elements are smaller than their children.\nIn Max-heap the root element is the largest element in the heap and the the parent nodes are greater from their children.,1, 15399,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap is a other name of priority queue in which element are store in form of a binary tree (implemented with use of array)with child nodes and parent with elements having their priority priority order for eg. min heap ,max heap.",1, 15400,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap in a data structure is used to represent elements\nIt is of two types:\nMin heap:In this type,the parent element is smaller than the child.\nMax heap:In this type,the parent element is bigger than the child.",1, 15401,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",It is a data structure in which the elements are stored in the form of binary tree.\nIt is of two type MIN Heap and MAX Heap.\nIn MIN Heap minimum element is present at the root .\nIn MAX Heap maximum element is present at the root .,1, 15402,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","A heap is a data structure that resembles a tree but infact, is multiple trees combined in a minimum/maximum fashion.\nA Minimum Heap (or a MinHeap) is a heap which has the minimum number/value at its root node, and arranges the rest of the values in increasing order towards the leaf nodes.\nA Maximum Heap (or a MaxHeap) is a heap which has the maximum number/value at its root node and arranges the rest of the values in decreasing order towards the leaf nodes.",1, 15403,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap data structure is build by using priority queue and is of two types-:\n1-min heap-in this heap minimum elements is placed at to top or root node it is build using priority queue.\n2-maxheap-in this heap max element is place at the top.,1, 15404,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","elements are arranged in the form of binary tree having two ways to do it, namely min heap and max heap. In max heap highest value element is placed on the root node and in min heap lowest value element is placed at the root node",1, 15405,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","AVL tree is a type of binary search tree. Rotations are performed on it, to sort the elements. The rotations involve-\n1. LL - left left\n2. RR- right right\n3. LR- left right\n4. RL- right left",1, 15406,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a data structure in which we use array to store data . it is a complete binary tree and it is of two type max heap and min heap.,1, 15407,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is data structure that stores element in the form of an array but we visualize it as a complete binary tree. There are two types of heap in general i.e. min heap and max heap.,1, 15408,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","heap is a type of data structure in which we can construct various types of heaps like min-heap,max-heap,etc. The min heap provides a data sorted in decreasing fashion and max heap provides a solution in ascending order.",2, 15409,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","heap is a data structure used to store information on top of the given information. in max heap, the maximum element will be the parent node and in min heap, minimum element will be parent node.",2, 15410,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",In head the data is stored in position which is determined by a formula there are two types of head-\nmin head\nmax head,1, 15411,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is dynamic structure it has two variant min heap and max heap it can be transferred in an array.,1, 15412,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a binary tree where the value stored at parent node is always greater than the value at child node,2.5, 15413,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is similar to tree but it contains information in two formats - \n1. Max Heapify - In this case root node should hold the maximum value and every parent node should be greater than its children node.\n2. Min Heapify - In this case root node should hold the minimum value and every children node should be greater than their parent's node.,2.5, 15414,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a tree like data structure in which node are arranged in either decreasing order or in increasing order based on which heaps are named as minheap and maxheap respectively. if we do the level order traversal of a minheap or maxheap we get values arranged in ascending or descending order respectively,2, 15415,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a dynamic data structure it has 2 variants minheap and maxheap it can be traversed in form of array.,1, 15416,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a Data structure which stores memory value of the variable it can be used for pointers There are two types of Heap Data Structure first one is MIn Heap and the other one is Max Heap.In Min Heap our Root value of the tree must be of minimum value and in Max Heap root value of the Tree must be maximum ,2, 15417,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",,0, 15418,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap tree holds data such that values to greater than parent node goes to the right node and values smaller goes to the left of the parent node.,0, 15419,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap data structure is used to store data in such a way that left of root shoulld always be smaller and right of root should always be greater. In Heap Root should always be the smallest element.,0, 15420,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a data structure in which max/min element is on top and then accordingly a tree is then formed,1, 15421,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","it is different type of data structure made up by using trees and can be considered and extension to trees. it is of many types such as binary heap , binomial heap etc. ",0, 15422,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly. Heap in data structure can be of two types min heap and max heap.,1, 15423,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap data structures can be visualized as a binary tree where the top most node value can be maximum or minimum among all decided by the type of heap. Heap can be of two types Min-Heap and Max-Heap. In Min-Heap min element is at the top and vice-versa in Max-Heap.,2, 15424,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",,0, 15425,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap in data structure always stores the least or greatest element at its top, so its used when we need to extract minimum or maximum element.",2.5, 15426,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a non linear data structure,1, 15427,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",a heap is data structure is which remove the object when it is on higher or lower priority ,1, 15428,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap data structure consists of parent node and child nodes forming a heap like structure ,1, 15429,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap in data structure means that the value of parent node is bigger than its left and right child. We can create two types of heap :- Max heap and Min heap . This data structure is more useful in deletion , insertion etc.",2.5, 15430,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a type of data structure in which elements are arranged in such a way that it follows min-heap or max-heap property according to the requirement of the problem.,2, 15431,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is non linear data structure . which is working in both form array or linked list. ,1, 15432,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",in heap every element is stored in a form of reference each element has a reference to it to get identified ,0, 15433,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Heap is a form of data structure where data is arranged in smaller heaps and grouped to form the bigger heaps. There are two types of heaps, Min-Heaps and Max-Heaps, Min-Heap being in the form such that root is the smallest of the whole heap and same rule is followed throughout the heap while Max-Heap is just opposite.",1, 15434,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heaps are non linear data structure used to store the data,1, 15435,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",there are the two type of heap :\n--> MinHeap(minimum element on a root node)\n--> MaxHeap(maximum element on root node),1, 15436,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a data structure which stores the data of given information or array,0, 15437,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap or priority queue is a data structure can be used under hoffman encoding algorithm,1, 15438,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",Heap is a non-linear data structure used for storing data. There are two types of heaps: i) MinHeap & ii) MaxHeap\nWe can perform 3 operations on heap: a) Heapify (build heap) b) Insert c) Delete ,2, 15439,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","a heap is a data structure in which we have data in for of a heap, we use min heap and max heap using heap data structure. ",1, 15440,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",one element added in accordance to its parent and left child and right child then operations are performed respectively if one has to perform minimum heap serch then smallest node is present at the top and if max heap perform large element present at top ,1, 15441,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is type of dynamic data structure ,0.5, 15442,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",A heap data structure is a modification of the tree data structure in which the children of each node are either larger than their parent node or smaller than their parent node.,2.5, 15443,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a type of data structure use to minimize the size of tree. For example Heap Sort. ,0, 15444,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is tree like structure used to store data in tree manner having nodes.,0, 15445,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",,0, 15446,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",there are two types of heaps: min heap and max heap.\nit is a binomial tree which follows heap properties.\nwe create a priority queue and heapify it.,1, 15447,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is a method to store data in data structure it is optimizer and has less time complexity ,0, 15448,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","Its a special type of binomial tree, which follows heap order properties.\nA heap can be - min heap or a max heap ",0.5, 15449,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is min element or max element provide top or bottoms it depend on which type of heap is ,2.5, 15450,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.","basically, heap is a binary search tree.",0, 15451,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is type of data structure which is dynamically created and properties of a binary search tree \nit is of two types \n1)min heap\n2)max heap ,0, 15452,What is a heap in data structure?,"Heap is a special balanced binary tree data structure where root-node key is compared with its children and arranged accordingly. A min-heap, a parent node has key value less than its childs and a max-heap parent node has value greater than its childs.",heap is basically a data structure where we stores the value or data in a given problem.,0, 15453,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is one which calls upon itself till the base condition is satisfied.,2, 15454,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","recursive function is the function which calls itself again and again multiple number of times for example in fibonacci we call a recursive function fib(n,n-1);",2.5, 15455,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function can be defined as a routine that calls itself directly or indirectly when needed in a program ,2, 15456,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","Recursive function instead of using loops to move forward to next subproblem, calls itself again with same or different arguments",2.5, 15457,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function that calls itself until a certain base condition is met. When the base condition is met it returns a value which goes back to the previous function call. ,2.5, 15458,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive Functions are used to reduce time complexity and easy to use when we have to call same function again and again for its subproblems.\nRecursive functions are used to memorize value for its subproblems. ,2.5, 15459,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",it is a concept or property of one or more variables which is specified by a procedure that yields value or instant of that function by repeatedly applying given relation .,2.5, 15460,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is an function which can call itself .,2, 15461,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is the those function which calls themselves repeatedly to solve the problem\nthey have a base condition to stop the recursion\n\nalgo recursion(int n)\n{\n base condition\n if(n>-1){\n sum=sum+n;\n recursion(n-1);\n }\n return sum;\n}\n,2, 15462,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function can be defined as a routine that calls itself directly or indirectly.,0, 15463,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is basically a function which works on divide and conqueror. In this divide the problem until we could find the solution of the same smaller problem and hence we try to find the solution for the big problem.\nEx- to find factorial of a number ,2.5, 15464,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function that calls the function itself to get the solution of the problem and returns the value .,1, 15465,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function in which it compares the given loop or function again and again till it get the perfect outcome.,1, 15466,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is the one that calls itself again and again to solve the given problem.,1.5, 15467,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",the function which depending upon a certain condition calls itself is called recursive function.,2.5, 15468,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",It is function which call itself until the exit condition satisfy.,2.5, 15469,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",any function that calls itself repeatedly only till the point a certain condition is true is called a recursive function,2.5, 15470,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",,0, 15471,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is the function which calls the function again until a required value is obtained .it is combination of three steps determining the base cases forming the recursive relation and returning the solution .it is backbone of dynamic programming,1, 15472,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function which repeatedly used a set of lines to get a certain output.,1, 15473,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.", nodes .,0, 15474,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A recursive function in any coding language is a function that can call itself again and again , it could be directly or indirectly until the program satisfies a specific condition.",1, 15475,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Function which call itself within their own function is called as recursive functions. It find the minimum value of that function which can be used to solve the whole function .\nIt could be a decreasing function or a dividing function which can used to find out the minimum value that function can hold.It can be done by making state space trees or using masters theorems. ,2.5, 15476,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Heap is a data structure which is similar to a complete tree. It is usually used to store data in a particular order. It is useful when a set of variables are not fixed and is changing with each step in an algorithm. There are two types of heaps:\ni) minheap (root node has the minimum element)\nii) maxheap (root node has the maximum element)\nExtracting elements from these heaps gives elements in sorted manner (ascending or descending depending on type of heap). ,2.5, 15477,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","recursive function is a function with call itself many time, it needs extra stack size while running recursion.\ncontinues call , ",2.5, 15478,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function which is called again and again each time on smaller part of the array or list or tree nad each time it waits for the answer from the smaller function is recursive function.,2.5, 15479,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function which calls itself in a loop is called a recursive function.,2.5, 15480,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","When a function calls itself within a loop to find a solution, it is called a recursive function.",2.5, 15481,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is a function which is called inside itself with smaller parameter. it is a function which find the solution to a given problem by dividing it into several sorter problem. If always contain base case which is always used to find solution.,2.5, 15482,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function that calls itself and terminates when a base condition is met.,2.5, 15483,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A recursive function is a function that can be called number of times that is again and again within the same program, instead of writing the function again and again we call that function many times as per our requirements. Such functions have a specific function which is required to perform on several number of elements which can be taken as input in the array such as each element of the array can be checked whether it is prime or odd or even etc.",2.5, 15484,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function means calling the same function multiple times until we don't gate the desired output.\n,2.5, 15485,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is a function which calls itself more than once . calling can be outside function or inside function (direct or indirect).\nthe main components of recursive functions are :-\n1-base case where the function gets terminated.\n2-recurrence relation \nand then some optional operations .,1, 15486,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","Recursive function is a function to be called again and again infinite number of times to execute until u get the desire output. so instead of calling function again and again implementation of recursive function can be of help examples-to find odd number ,to find prime numbers etc.",2, 15487,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is one in which we just make a formula for one case and rest other cases are automatically implemented by that one formula by making a function. \n,1, 15488,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a call to a user built function inside the function itself. This is used to make a loop of the given steps inside the function until a desired output is returned.,2, 15489,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function which has has base terminating condition else it keeps calling itself again and again till the terminating condition is satisfied.,2.5, 15490,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Its a kind of function which calls itself in the function. It helps us to solve the huge problems through shorter methods. A recursive function is a kind of function which helps the us to code the program in shorter length. ,2.5, 15491,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A graph can have a maximum number of spanning trees equal to its vertices.,2.5, 15492,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is as function which includes a call to itself. It comes out of the loop using the base conditions provided.,2.5, 15493,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A function calling itself is known as recursion.\nIf there is a call to a function, within the function itself, then it is known as recursion. It can either pass different values or same values as well (but passing same values will be of of no benefit and it will stuck in an infinite loop).\n\n// Recursive call for this question: If uou didn't understand recursion, read the answer again",2.5, 15494,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A function which comprises of a base condition, code and a call for itself with increment or decrement in its values to recur and finally reach the base condition and return the desired value is called a recursive function.",1.5, 15495,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a function that runs recursively till all the possible solution of a given problem are found. Recursive function is really beneficial as you don't have to write multiple a line of codes. consists of for loops.,2.5, 15496,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Heap Data Structure is of two types-\n- MINHEAP: The parent node is the smallest and the next smallest element is inserted as the left child. \n- MAXHEAP: The parent node is the largest and the next largest element is inserted as the left child. ,1.5, 15497,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function which can call itself again and again in a program is known as a recursive function . ,2, 15498,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is used in the problems where a bigger problem can be divided into similar sub problems so that we can construct a similar function for that problem and break the inputs in smaller form. Recursive functions improve the reusability of the code .,2.5, 15499,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive Function is a function that calls itself in the body of function until the base condition is not executed.,2.5, 15500,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function which calls it recursively till the given required condition is fulfilled.\n,2, 15501,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function which calls upon itself repeatedly in order to perform a certain task.,2, 15502,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",The function use repeatedly in the program or the function which again called itself are known as recursive functions.,2, 15503,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","Recursive function is defined as a kind of function written in the program that calls itself again and again without user inputting the value each and every time. It is also shown as function calling function. Ex:binarySearch(arr,arr[mid-1],key) and binarySearch(arr,arr[mid+1],key)",1.5, 15504,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function which is calls itself which some bases cases to terminate it.,2.5, 15505,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A recursive function is a function that calls itself repeatedly until a base case is met. It involves breaking down a problem into smaller sub-problems that are identical in nature, and applying the same function to those sub-problems until the base case is reached. Once the base case is met, the function stops calling itself and returns a value. ",2.5, 15506,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function that calls into itself.,2.5, 15507,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function that calls itself repeatedly until we have reached the end of list to find the desired output.,2.5, 15508,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is one which calls itself when certain mentioned conditions are met.,2.5, 15509,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is a function which calls itself within its own function,2.5, 15510,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function which calls upon itself. ,1, 15511,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is one that calls itself. It occupies internal stack space,2.5, 15512,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function which calls itself to reduce the space complexity and duplication for solving any question.,2.5, 15513,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a function that calls itself ,1, 15514,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",It is a function in which the function calls itself in it \n,2.5, 15515,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",The function which call its itself multiple time till the base is true.\nThere is base,2.5, 15516,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Suppose a program has a specific set of code that need to be repeated more than once. in such a case we make a separate function for this code and call it recursively whenever needed. basically we are dividing the code into smaller parts and solving the problem,2.5, 15517,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function that we made for the purpose of repetition since we found out it solved problem for one of the cases effectively and it could be used for all of them repeatedly.,2.5, 15518,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is a function that can be called multiple times throughout the code,2.5, 15519,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function that keeps on calling itself repeatedly is called a recursive function.,2.5, 15520,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is that a recursive call itself whenever the conditions in not satify . But the complexity of the recursivce algorithm is higher than the other algorithm .SO that less use of recursive algorithm compare to the other algorithm.,2.5, 15521,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",it function that calls itself in its return value ,1, 15522,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is one that calls itself again and again while a certain condition is fulfilled. It is often used in divide and search algorithms. ,1, 15523,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function which calls itself is called recursive function.,2.5, 15524,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is function that keep on calling itself until it reaches the termination condition.,2.5, 15525,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function which calls itself is called a recursive function.\nEg.\nint fact(int n)\n{\nif(n==1||n==0)\nreturn 1;\nelse \nreturn n*fact(n-1); // here function is calling itself\n},2.5, 15526,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","a recursive function are a set of operations that we want to be repeated untill and unless the break case is met.\nit consists of the function body,the function arguements through which the iterative procedure will take place and a break case that will end the iteration.",2, 15527,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",When we call the same function inside a function it is called a recursive function.,2.5, 15528,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function which calls itself i.e it has a call with in its body,2.5, 15529,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a self calling function that takes its previously generated value in itself until the termination condition is reached.,2.5, 15530,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.", A recursive function is a function which calls itself again and again till it reaches a terminating base condition after which it backtracks to give the result \ntwo parts\n1 base condition\n2 recursive call statement,2.5, 15531,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","When a function calls itself and uses its previous function to define itself, it is called a recursive function. ",2.5, 15532,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a function that calls itself is called a recursive function ,2.5, 15533,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",which all the function again and again until the condition is satisfied to come out from the loop,2.5, 15534,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function which calls itself is a recursive function,2.5, 15535,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is a function which has a base case which is a pre defined case and a recursive case which calls the function in it self.it is an example of divide and conquer only.,2.5, 15536,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is a function that calls itself repeatedly until the given base condition if fulfilled.,2.5, 15537,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function calls again n again itself until the function reaches the base condition,1.5, 15538,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is a function that calls itself,2.5, 15539,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is one that calls itself.,1, 15540,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is the call to itself i.e. if we call a function with same name and parameters inside a same function that is the recursive call of that function.,2.5, 15541,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function which calls by itself.,1, 15542,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Any function that calls itself again and again is called recursive function.,1, 15543,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is the function which calls itself using different inputs until result is returned.,2.5, 15544,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function which calls itself from within itself,2.5, 15545,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function are the operation in which we made a function and we call that function in the function which we made.,1, 15546,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",its a type of function which call itself within the function for example merge sort,1, 15547,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a function that calls itself repeatedly is called recursive function,2.5, 15548,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function that calls itself is called a recursive function.\n,2.5, 15549,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive functions are basically those functions which can be repeatedly called.,1, 15550,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","Heap is a Binary tree in which the parent node always contains greater or lesser values than their child nodes, if it contains greater values than the child nodes then it is max heap and if contains less values then it is min heap.",2, 15551,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",There are two types of heaps Minheap and Maxheap,2.5, 15552,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function which calls itself whenever it is executed as if in a loop. To break out of a recursive function we define a base condition. Example:\nfunc1(){\nfunc1();\n},2.5, 15553,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",calling of a function inside a function refers to a recursive function\nwe reduce the code written by us and call that function with some parameters\naccording to our need.,1, 15554,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is a type a function in which function call itself\nvoid func(int n){\n// code\n \n func(n-1);\n\n//code\n},1, 15555,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","recursive function calls back the same function which reduces the code complexity and increases understandability of the code.\n\nfor ex - \nvoid dfg(char c , int n)\n{\nn= n/2;\ndfg(c , n-1);\n}",2, 15556,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function which is used to solve a given problem by repeatedly by applying a given relation to known values of the function.,2, 15557,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",function which can repeat itself on the basis of base case arrival.,2, 15558,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",when it call it self again and again until it base case is achieved.\n,2, 15559,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function that calls itself multiple times. The function gets called in a program many times until the base case gets hit. This stops recursion.,2, 15560,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","Recursive function is a function which calls itself again and again untill the base condition is satisfied. It uses the stack data structure to store the previous operation and first performs the next recursive call, and keeps on doing the same thing till it reaches the base condition and then performs the operation stored in the stack.",2, 15561,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function are functions in which the function is called within that function again and again until some base case is reached.,1, 15562,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is defined as calling the function again and again inside itself until the base case is reached.,1, 15563,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","Recursive function is a function called in itself and a smaller input is passed after every call. A base condition is specified . When the base condition is reached, the function returns a value which is used in the previous recursive call.",2, 15564,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",it is a function inside a function .\nit keeps on executing or unwinding until the base case is achieved.,2, 15565,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A recursive function is a function that after a certain block of code, and with a newly calculated data set runs the same function inside the function. This is used when we calculate something, but now wish to repeat that same process for the final calculation on the newly derived data.",1, 15566,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Heap is a data structure in which data is stored in tree form such that it follow the properties of binary search tree and elements are always filled from left to right.,1, 15567,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function that calls for itself repeatedly till the base condition is reached.,1, 15568,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",it is a type of function where each problem is further solved by solving subproblem. ,1, 15569,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function which keeps calling itself within itself till it reaches a base case and hence forth compute the value that was primarily required.,1, 15570,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Heap is a data structure in which ,1, 15571,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function that calls upon itself to solve a smaller part of the same problem and stops calling itself when the base condition is met.\n\n3 parts to a recursive function:\n1. Base case\n2. Recursive call\n3. Small Calculation \n,1, 15572,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",It is a type of function which calls itself in a function,2, 15573,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","Recursive function is a function that calls it every time till the base case condition is reached. In recursion technique, we only need to solve one case and other cases are solved by recursion itself.",1, 15574,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is a function which calls itself unless base condition is achieved.,2, 15575,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.", recursive function is the function which call itself in the function itself to solve smaller piece of information repetedly\nit is used for to make algorithm run faster and space efficient,2, 15576,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is one which is called by itself in its definition again and again until the base condition is reached. ,2, 15577,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","avl tree is a balanced binary tree in which left node is less than the parent node and right node in greater than the parent node, and then rule applies to the whole data structure.",1, 15578,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function that calls itself within itself is called a recursive function. ,1, 15579,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is used when the problem has repetitve type of problem which requires changing the parameter,2, 15580,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function which calls itself for performing a task it consists of atleast two things:\n1. limiting condition\n2. recursive calls,2, 15581,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",function that are continuously calling itself until base condition is reached is called recursive function.,1, 15582,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function which keeps on calling itself with different values till the solution for the function is found.\n\nEx Fibonacci(2) = Fibonacci(1) + Fibonacci(0)\n Fibonacci(1) = Fibonacci(0)\nFibonacci(0) = 1 ,1, 15583,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Heap Data Structure ensures that the element present as the root element is the smallest (in case of min-heap) or greatest (in case of max-heap).,2, 15584,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","recursive function is very important and used in so many function call , \nbasically in this we create a recursive function , recursive means that it is calling the same function again and again until all condition is not checked ",1, 15585,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function uses recall to divide a problem into parts and is stored in the form of a stack as the fisrt output is released at the last. \nit is a great problem solves instead of using loops and saves time .,2, 15586,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",defined calls directly and indirectly.,2, 15587,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is a function made by us that calling again again until it did not break or return zero that function is called recursive function,1, 15588,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A recursive function is a function which calls itself inside itself, that is the function will keep calling it in the recursive case, until it reaches the base case when it terminates.",1, 15589,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is a function which calls itself means calling the function in the same function.,1, 15590,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function which calls itself again and again till the base case has reached and the solution of the base case is known,2, 15591,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is the function that calls itself.,2, 15592,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is a function which keeps calling itself for a repeated number of times,2, 15593,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a heap is a type of graph in which elements are arranged in such a way that either each root element is greater than its children(max heap) or is less than its children(min heap).,1, 15594,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a function which is called within itself.,2, 15595,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function which calls itself .,2, 15596,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function in a function calling itself in its body till a particular condition is met. This is often used to replace loops. ,2, 15597,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is calling the same function inside the function. Its very effective in solving the problems which otherwise are very difficult to solve iteratively.,2, 15598,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive functions are the functions which call themselves repeatedly .,1, 15599,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function that calls its ,2, 15600,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Heap is a data structure which is used to store elements.,2, 15601,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is one which calls itself based on the need of the code including a base case for its termination. recursive function usually are used to reduce the problems from a large problem into a short problem,1, 15602,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A recursive function is a function which finds the solution recursively , by defining a base case. The function is called again and again. ",2, 15603,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",It is a function in which we declare termination conditions and then call the same function again and again until we get our result.,2, 15604,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is a function where we solve a particular problem using the function itself.,2, 15605,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","a recursive function is a function which is called again and again and it carries out the operations defined in it, until some specified condition is achieved.",2, 15606,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A recursive function is a function which calls either self or another function inside itself. This creates a loop and hence we need to create a base case to stop the recursion,",2, 15607,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is a function variables and constants used the the represent the time complexity of the recursive algorithm\neg T(n)=2T(n) + C,2, 15608,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","In recursive function ,we call our original function within the function by changing the values of original arguments so that we obtain an optimized solution\nWe can say we divide the problem into subparts and then obtain the final result .",2, 15609,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",it is a function which calls itself inside the function until it reach its base condition.,2, 15610,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function which calls itself repeatedly to execute a particular task. ,2, 15611,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",,0, 15612,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A recursive function is a one which calls it itself again and again until a condition is not satisfied. It uses the stack technique for the function call, and accordingly gives the output.",2, 15613,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is a function used when a same procedure is to be followed again and again for a large number of times so it recalls itself again to find the sollution ,2, 15614,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function takes the input and reduces it to generate the output in each iteration. It is used to perform repetitive functions. Example to calculate Fibonacci we have to again and again add the previous numbers sum so we can create a recursive function that would keep doing it for us until a base case is reached which leads to termination of the function. ,2, 15615,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function that calls itself within its own function body is called a recursive function.,2, 15616,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function are function that call itself.\nafter each call the problem is reduced until a base value is found.,2, 15617,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",The function that calls itself in a programme is called recursive function.,2, 15618,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","When a function calls itself and uses its own previous terms to define its subsequent terms, it is called a recursive function",2, 15619,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",In recursive function we create a base case and functions are created in such a manner that using them in code recursively calls the function and performs the operation mentioned in the function recursively,2, 15620,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is a pre defined function that can be used in a program when we use a particular library that already specifies its uses and functionality ,2, 15621,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive nature function is function which is used to minimize the time complexity by calling the function once rather than calculating the formulas again and again.\nMostly the recursive function are used in dynamic programming to provide the best optimal solution for the question\n We create a function which we know that is to be used very much so rather to provide a good complexity we create a recursive function according to the question,2, 15622,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",When a function can be use and can be called recuursively(i.e again and again) in a program we called it reccursive function.,2, 15623,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.", a recursive function can be comprehended as a system that calls itself directly or indirectly.,2, 15624,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function in which function call itself again and again. and it is also use to reduce time complexity and memory.,2, 15625,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is a function which call itself to perform an operation. It can also be said that recursive function and stack are analogue to each other.,2, 15626,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a function that calls itself until a terminating condition called base case is reached is called recursive function,2, 15627,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function calls itself while the condition given in the main function or in it is true.,2, 15628,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function that calls itself somewhere in its a algorithm is called a recursive function.\n,2, 15629,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is function which is called in itself . A recursive function has a base case condition and call of same function to solve a smaller problem . Eg\n factorialofnumrecursive(int n) {\nif (n==0) \n{\nreturn 1;}\nelse \n{return n* factorialofnumrecursive(n-1);}\n,2, 15630,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is if any function is called multiple times in a particular algorithm the we called it a recursive function which is called recursively.,2, 15631,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is a type of function which we use when we know that we have to do a type of operation many times.\nit is a function which checks the statement and calls itself repeatedly accordingly,2, 15632,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A recursive function is a kind of function which calls itself to evaluate the answer, its calls are stored in stack , it also generally contains a base case to avoid infinite calls.",2, 15633,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function helps the user not to write the same piece of code again and again. It saves much time .\nUser only have to do a recursive call to the function and it executes till the condition is true.,2, 15634,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","recursive function is a function which calls itself again and again untill it reaches the base condtion,",2, 15635,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function in which the same function is called again for a smaller sub-problem of the same kind.,2, 15636,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a function that keeps calling itself and is terminated by a base condition,2, 15637,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is that function that call itself again in it \nsome examples are merge sort and quick sort,2, 15638,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is manily made by calling the function itself in the funnction to make the possible recusion calls to make the algorithm and in this we make the base case also to stop it from the infinity call and to get the anwser,2, 15639,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A graph can have multiple spanning trees, the most number i.e. possible for a graph having N nodes is N spanning trees. ",2, 15640,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is function in which it calls itself until a base case condition satisfies.,2, 15641,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A recursive function - If a function is calling itself to perform the same repetitive operations only until it reaches the base case, when it can stop the recursive call and return back to the initial recursions. This is known as recursion. We can get a recurrence relation based on the calls and how the function is behaving.",2, 15642,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function which is called again and again in itself. It has a terminating condition in it which stops/return a value on satisfy a particular condition.,2, 15643,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function refers to a function which call itself again and again till the base case is satisfied.,2, 15644,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","A function that calls itself is a recursive function.The function may call itself a no. of times depending the base case.Base case indicates when a recursive function has to stop calling itself,otherwise,it undergoes an infinite loop.Usually base case is defined and has a definite value.Recursive functions are used to solve big problems by solving similar smaller problems first and then combining these solutions to get the required solution to the bigger problem.",2, 15645,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",It is a function in which the function calls itself for a specific number of times until a base condition is satisfied.,2, 15646,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function that keeps calling and recalling itself until the problem is solved. Used to reduce repetitions in code.\nMay make the code less or more complex depending upon the Data Structure and approach used to implement etc.,2, 15647,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursion is use when we have repetitive type of sub problems\nrecursive function is a type of function in which we define a base case edge case(if any) and work on smaller sub problem of that problem and call recursion for rest of the problem,2, 15648,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",it is a function which call upon itself until the base condition is achieved,2, 15649,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",,0, 15650,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is a function which calls itself. it has a base case at which the recursive calls terminates. it works like a stack. the problem is divide into subproblems and the recursive function is called on that subproblems.,2, 15651,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function which calls itself for other cases and forms a stack and calculates solution accordingly. It breaks problem into sub problems and solves the smallest sub problem with the help of base case provided in order to solve the main problem.,2, 15652,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is a type of function used when we have a problem which can be solved by calling itself.basically a function which calls itself until a desired condition is met is known as a recursive function.,2.5, 15653,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function which calls itself multiple times within itself,2.5, 15654,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",In recursive function a function call itself and it will stop after meeting stopping condition.,2.5, 15655,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is that they call itself and calling till the given condition if not fulfilled.,2.5, 15656,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","a function that calls itself, when the base condition becomes true. it can be used to make iterative tasks easy.",2.5, 15657,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function in which we identify a base case and calls the same function again and again is called recursive function.,2.5, 15658,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive functions are those in which a function calls itself again and again till it reaches a base condition and from there it starts backtracking.,2.5, 15659,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function make calls to itself until an edge case is reached and then returns the final answer by retreating back by calculating the answer in whatever form.,2.5, 15660,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recusive function are used in Dynamic Programming these are the type of functions which call itself ,2, 15661,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is a type of function which is call repeatedly in a program when program stuck at a point it goes back to function and call it again,1, 15662,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function that calls itself.,2.5, 15663,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive functions are the functions which call it self again within it's own function in order toi repeat the same procedure again and again untill a specific base condition is met which breaks the recursive call.,2.5, 15664,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is a function in which the function is called within a function but with diff para meters,2, 15665,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",it is a function where there is an call to the function in the function itself.,2.5, 15666,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A Recursive function is a function that calls itself again and again to give the final output. A recursive function is a function that uses itself to breakdown a more complex problem to give final result.,2.5, 15667,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.","Same Function call within the given function.\nA recursive function has three components the base case, Inductive Hypothesis and the output. ",2.5, 15668,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",function who call itself ,2.5, 15669,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function that calls itself again and again with smaller inpus until it hits a base condition is a recursive function.,2.5, 15670,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is which keeps calling itself over and over again repeatedly.,2.5, 15671,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a function that call itself with smaller value and return itself with large value,2.5, 15672,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is one of the way to make your solution more efficient and is used to make your problem approach in a minimal lines and reducing the time complexity ,2, 15673,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function which calls its itself again during program execution is called recursive function . ,2.5, 15674,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function is a function that calls itself repeatedly untill we reach the end.,2.5, 15675,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursion is defined as the function which is depend on call by reference.,0, 15676,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",for general code we use a loop but for bigger statements we use a recursive function to perform the problem in recursive function we specify the operation and provide a number of iteration and provide a break point. ,0, 15677,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function that calls itself is called a recursive function. It is provided with condition statement such that it ends as soon as the condition is fulfilled.,2.5, 15678,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a function call without main function is known as recursive function,0, 15679,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",,0, 15680,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",In a recursive function is function in which a function call itself inside a function,2.5, 15681,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",function which calls itself in a same program or block repeatedly,2.5, 15682,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function calls itself until base case comes.,2.5, 15683,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function that calls itself.,2.5, 15684,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",functions which are made by using return function is called recursive function,0, 15685,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",,0, 15686,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A recursive function is a function that calls itself,2.5, 15687,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",Recursive function are those function which is define to perform recursive operations.,2.5, 15688,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is a function that calls itself repeatedly.,2.5, 15689,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",the recursion of elements in function known as recursive function ,0.5, 15690,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",a recursive function is a function that has its own self in its structure.\nIt paradoxically calls itself again when the recursive function is called.,2.5, 15691,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is a technique which is used to call a data form data base recursively or we can say reverse ,2.5, 15692,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",A function that calls itself wherever it is mentioned in the main function.,2.5, 15693,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is call self again and again when base condition satisfied the return the answer,2.5, 15694,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",t(n)=t(n-1)+c(n),0, 15695,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",the function which calls itself is called as recursive function ,2.5, 15696,What is a recursive function?,"A recursive function is one which calls itself, directly or calls a function that in turn calls it. Every recursive function follows the recursive properties − base criteria where functions stops calling itself and progressive approach where the functions tries to meet the base criteria in each iteration.",recursive function is a function where we call the one part of the code after sometime or recursively one and after.,0, 15697,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15698,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique we take the lower bound and upper bound of the elements and upper-lower=height of the elements. a formula is already declared for interpolation search which is hi+(hi-lo)/2+li we execute this and search either in the first half of array or in the next half,2.5, 15699,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15700,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation search is a modified binary search, but instead of taking the middle element for division it uses a formula for better and efficient solution",2.5, 15701,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is a searching method that is used to find a given element on the basis of a formula that calculates the approximate location of the element inside the array. It then checks whether the element is present at that location. If not then it checks the left and right of that index depending on the element to find else it returns the index.,2.5, 15702,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,pos=x-(arr[high]-arr[low])/high-low\nand then we first check that elemnt if its is smaller than arr[pos] then we will check in left part or otherwise in right subpart of the pos element.,2.5, 15703,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15704,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15705,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15706,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15707,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"It is a search technique which is used to search a element, basically it is a formula that gives the index value of the searched elememt.",2, 15708,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation search technique that is used to search the element in an array , it gives the position of the array where the element can be present using the formula.",2.5, 15709,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,It is a searching techniques which compare every key with the given element to be searched.,2.5, 15710,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15711,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique has a time complexity of O(log n ).,2.5, 15712,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,We use this technique when array is sorted and their is a uniform gap so that we can compute the index of required element.\nind = low + (arr[high] - key)*arr[low]/(high - low),2.5, 15713,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation search is a modified version of and similar to binary search that inputs an increasingly sorted array, applies its formula and tries to find the desired element",2, 15714,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"A recursive function is a function which needs to be called once and then it calls itself again and again with the proceeded values until the base condition become true.\nOnce the base/ground condition hits, all the recursive functions will start retuning the values and start coming back to the previous function one by one and in this way it will come out of all the recursive calls and return the final value.",2.5, 15715,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search is searching technique in which maximum and minimum elements of the array are defined and then used to compute sorting.,2.5, 15716,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation Search technique is a searching technique where the elements are searched one by one using interpolation.,2, 15717,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,A heap data structure is similar to a tree that it has a root and the nodes. It is arranged according to max heap or min heap way.,2, 15718,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys.,2.5, 15719,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15720,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"When a particular function calls itself repeatedly, it is called recursion. recursion is an easy way to solve larger problems and is extensively used in various approaches like divide and conquer. However, one drawback of recursion is that it takes a lot of time to implement. ",2.5, 15721,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search a best technique to search an element in o(n) time ,2.5, 15722,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,The element is searched on basis of ASCII values.,2, 15723,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15724,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is used for searching an element in an array with a formula in log (n) time complexity.,2.5, 15725,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15726,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search is similar to binary search where the array is divided into 2 halves and formula is used to find the next element to be compared.,1, 15727,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15728,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,we pick an element and form that index we divide the given array in two parts and we placed all smaller element in left side and larger element in right side. and we search the particular index for a given element.,2.5, 15729,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search is advanced version of binary search technique.\nsearching is done using a formulae.,2.5, 15730,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15731,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique is a type of binary search technique. \nThis technique can be solved by using a particular formulae.,2, 15732,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation Search is a technique obtained by enhancing binary search technique. Unlike binary search, in interpolation search we use a sorted array which is uniformly distributed.",2, 15733,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,It is a search technique that uses a formula to find an element with which key element is compared and then recursively this function is re-called to find the key element.,2.5, 15734,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15735,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"A heap is a way to form to represent data. A heap has its own functions like heapify , heapsort to display and sort the data.",1, 15736,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation search is a more statistical approach to binary search in which instead of soughting after the mid element, we choose the element on the basis of a formula.",2.5, 15737,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"In interpolation technique, we choose an element using a formula and then divide the array into two subarrays of index 0 to x and x+1 to n and the recur to follow the same process until the element being search is found.",2.5, 15738,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"In interpolation technique we choose an element using a formula say x, and then divide the array into two subarrays of index 0 to x and x+1 to n and then recur to the first subarray if element to be found is smaller than x else recur to the other subarray and follow the same process until the element been searched for is found.",2.5, 15739,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,in interpolation search technique you search a particular required desired value in the given data structure.,2.5, 15740,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,A function which is called several times is known as a recursive function.\nRather than defining the function again and again it is just called several times with required parameters.,2.5, 15741,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"In this search technique, the elements which are smaller than the pivot element are shifted to the left of the array while the elements larger than the pivot are shifted to the right side of the pivot.",1, 15742,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,In interpolation search technique we use the concept similar to binary search difference being that we do not pick the middle element but assign G variable which can be any of the element from the given data. The time complexity remains same as logn.,1, 15743,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation Search is similar to Binary Search technique., the difference is that in interpolation search the element by which all other elements are compared is calculated by a formulae instead of choosing middle element like in binary search.",2.5, 15744,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Somewhat similar to binary searching technique, interpolation search technique has only one difference that the element to searched is found using a given formula.",2.5, 15745,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Somewhat similar to binary search, interpolation search technique ",2, 15746,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is somewhat similar to binary search.,2, 15747,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is a type of technique used to search data from the stored values. It uses a formula as (arr[hi]-arr[lo])(arr[lo])/(hi-lo).,2.5, 15748,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique is a technique in which we determine the approximate position of the element from array and search for that element on that position,2.5, 15749,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"\n\nInterpolation search is a search algorithm used to find the position of a target value within a sorted array of values. It works by using a linear interpolation to estimate the position of the target value within the array, then narrowing the search range iteratively until the target value is found or determined to be not present in the array. This technique is particularly useful when the values in the array are uniformly distributed, allowing for a more accurate estimate of the target value's position.",2.5, 15750,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"interpolation search technique is a searching algorithm which involves using a formula to calculate the approximate value for supposed position of the element to be searched for, it works better when elements are spaced more equally.",2.5, 15751,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is used to search the element that other searching techniques cant find easily. It has a formula that can be used to find elements by interpolation or extending the list. ,2.5, 15752,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"It is a search technique similar to binary search. But in this ,instead of the middle element , we choose the index using a specified formula.",2, 15753,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,it is a kind of searching technique which is like binary search but is more optimized n nature,2, 15754,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search helps you to search an element from the array. ,1, 15755,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is used for sorted array to search for a key,2.5, 15756,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is a technique in which searching done using polynomial equation.,2.5, 15757,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,search key in array ordered by numerical values,2.5, 15758,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,it is an improvement of binary search to numeric vales assigned by keys,1, 15759,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,when collision occur then its called interpolation ,2.5, 15760,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique is a modified version of binary search,2.5, 15761,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"it needs sorted and equally distributed collection of dat, it works on probing position of the required value.",1, 15762,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search is seaching in multiple groups at the same time ,2.5, 15763,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,An interpolation search technique is a technique of searching the information bidirectionally.,1, 15764,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys. in the searching is done in less complexity to the linear searvh.,2.5, 15765,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,it a better version of binary search where values are distributed equally in a sorted array ,2.5, 15766,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,The interpolation search techniques is a modified version of quick sort and is best suited for sorted arrays. It uses a formula to find the hinge element and then sorts the array using the formula.,2.5, 15767,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation search technique is a search technique in which a pivot is selected using a formula and three arrays are created, one of elements smaller than pivot, one with the pivot and one of elements larger than the pivot. ",2.5, 15768,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,it is an searching technique to search for keys that are ordered in the values given to them,2, 15769,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is a type of search technique like binary search which uses divide and conquer technique.,2.5, 15770,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation search is a type by which people search a telephone number for a name. The Interpolation Search is an improvement over the binary search for instances, where the values in a sorted array are uniformly distributed. Binary Search always goes to the middle element to check. while interpolation search always looks out for the links.",2.5, 15771,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15772,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Insterpolation search is nothing but a special binary seach tree with a formula,2.5, 15773,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique finds of the value of the required data with the help of the help of the given data and the database.,2.5, 15774,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,in interpolation search technique we divide the array by finding the value of a variable by dividing the array according to the weight of the elements by its size and then finding the element by finding its relative position according to the weight it carries.,2.5, 15775,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys. It is basically improvement of binary search.\n\n,2.5, 15776,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search allows us to ,2.5, 15777,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,in this we use the formula for finding the element for any case. and this is the improvement of binary search ,2.5, 15778,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation Search Technique is an enhanced version of the binary search technique,1, 15779,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation is a search technique with O(1) time complexity.It is like binary search bu7t better it searches the required answer from the formula.the formula calculated the index and gives the answer.,2.5, 15780,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation searching technique is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys.,1, 15781,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique is the extended version of binary search where lowest and highest index id generally used through a formula to search a element,2.5, 15782,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation is a searching technique that uses a formula which intakes indexes and array and returns the index of the required element.It is very quick and takes O(1) COMPLEXITY,2.5, 15783,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search is used in case of sorted data.It uses a pivot element and has approach similar to median search.,2.5, 15784,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is based on the formula where we find the left most and right most number in the array and place them in the formula to find out the output.,2.5, 15785,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,INTERPOLATION Search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys. ,2.5, 15786,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,It is an improved variant of binary search work on probing position of required value. ,2.5, 15787,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"in interpolation search technique , we search the given element using given function.",2.5, 15788,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,It is a better version of Binary Search as it reduces the time complexity,2, 15789,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is a formula based search technique.,1, 15790,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"its an improved version of binary search ,it searches a key that has been ordered by numeric values assigned to the key.",2, 15791,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15792,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,It is a search technique to find the Kth smallest or largest element in an array.\n,2.5, 15793,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search is an improvement of a binary search where the values are uniformly distributed and works with a formula,2.5, 15794,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,A recursive function is a function that calls itself. ,2.5, 15795,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Recursive functions are functions which are used to call itself recursively untill the base condition is true.,2.5, 15796,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15797,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,where parts of the array are taken and make the smaller one at the first and comparing it with other elements,1, 15798,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation Search is advance form of search in which we have formula to calculate the search space and get the element,2, 15799,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,, 15800,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search is an improved varient of binary seacrh. This seach works on the probing position of the required value.,1, 15801,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,, 15802,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,it is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys ,1, 15803,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Median Search, we use pivot to search. Then the key is compared with pivot. Array before pivot is taken if key < pivot. If its greater array after pivot is taken and further processed. ",2, 15804,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation search technique uses a particular formula to calculate the middle element in the array and then uses recursion to solve the problem in different parts, first recursion works from 0th element to the middle element and second recursive call works from (middle+1)th element to the last element.",1, 15805,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"interpolation search technique is same as median search, only there is a different formula for element picking.",2, 15806,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation search is an modified version of binary search which has the formula of mid element that consists of start, end and key unlike binary search that has mid formula consisting of only start and end in it.",1, 15807,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation Search technique uses a formula to find out the answer. It calculates the index from last. ,1, 15808,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,it is used to find an element in a sorted array.it is an improvement over binary search.it makes the guess of the position of the target element by the formula that takes first and last element and the key in it.,1, 15809,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation Search technique is the main algorithm which is utilized by the median search in finding out the desired value using a primarily calculated pivot point.,2, 15810,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,A function in which the function is calling itself is called a recursive function,2, 15811,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search looks for a very particular value of pivot and can be used in median search. Earlier we used to choose random values. More efficient that normal median search.,2, 15812,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,This is an enhanced form for binary seach where the element is not divided exactly from the middle but an improved probability element is taken by the formula.this technique is called interpolation search technique.,1, 15813,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,The Interpolation Search is an improvement over Binary Search for situation in which where the values in a sorted array are uniformly distributed.,2, 15814,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Recursive function is a function which calls itself inside its own function body .,2, 15815,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search is an advanced form of binary search where instead of dividing the array from the middle we divide the array from the element whose value is close to the value we are looking for.,1, 15816,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of the required value. For this algorithm to work properly, the data collection should be in a sorted form and equally distributed.",1, 15817,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"In interpolation search, we define a searching formula, store it in a variable, let's say x and then we compare the target element with x, whether it's greater or smaller than x. If it is equal to x then we directly return it but if not then we change our start and end index.",1, 15818,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search ,1, 15819,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search is used in median search\n it takes very precise value of the pivot\nit is more efficient,1, 15820,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,The method in which the element is searched by dividing the array into two parts on the basis of power of 2.,1, 15821,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"n(n-2) ,where n is number of vertices",1, 15822,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,, 15823,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search is for searching for a key in an array that has been ordered by numerical values assigned to the keys.,2, 15824,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique is a more advanced and upgraded version of binary search in which we instead dividing array from the middle try to divide it in such a way that the element chosen to divide is close to the element we are searching with the help of a formula.,2, 15825,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value., In this technique we divide the find a point use formula low+(arr[high]-arr[low])+1/(high-low).Then check the value is greater than or less than then according that recursive function is called.,1, 15826,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation Search is a divide and conquer searching algo in which an element (x) is searched in a sorted array.\nAn element (y) is chosen then if x > y then the array(y,end) is chosen and if x < y then the array (start, y-1) is chosen. This is repeated till x is not found.",2, 15827,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,A recursive function is the function in which the function calls itself in the definition of the current function,1, 15828,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"interpolation search technique refers to finding the elements form middle of the array or string by calculating the size od array and finding key , as we find the key we start to search from their ",1, 15829,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation is a searching technique used by applying recursion and it divides the problem in parts to the smallest elements and then compares them each by each\nuntil the desried element is found.\n,2, 15830,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,binary search implementation search ,2, 15831,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique is a searching a key in an array ,1, 15832,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search is a lot like median search,2, 15833,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique is a search technique which helps to find the maximum or minimum element in the array .with less time .it uses a formula which helps to find the element ,2, 15834,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is a technique which is same like median search in this technique we assume a formulae that gives the nearest neighbors of the elements to be searched ,1, 15835,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is a type of modified median search.,2, 15836,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,, 15837,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"a recursive function is made to solve a big problem by breaking it into smaller parts thus it consist of a base condition, the main operation that has to be performed on the smaller problem and then another call to the same function(recursive call).",2, 15838,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,searching through a formula for middle element.,2, 15839,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"interpolation search technique is applied on sorted array . as we do in median search using middle index we find the index by averaging out the array , then applying interpolation search on right part if the element we are searching is bigger than the element at that index or left if smaller and return the index if the value matches . ",1, 15840,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is the one in which we have a formula to find the most probable index where the search result can be present. It works a bit like the binary search but instead of going to the middle always it uses a formula. ,1, 15841,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation is an improvement over binary search where values in a sorted array are uniformly distributed. It created new data points within the range of a discrete set of known data points.,1, 15842,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search is the version of binary search in which we use a different formula to search any element.,2, 15843,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Modification of binary search. we use a different formula to find the mid or the point from where we have to divide the array.,1, 15844,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Function calling itself is what called a recursive function.,1, 15845,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique is a modification of the binary search technique which does not aim for the middle element and starts it comparison but instead calculates its own element which is greater than the smallest one and greater than the larger one and goes on finding that approximation index and searches the element accordingly.,2, 15846,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique is similar to binary search where we first finds the middle element and then searches in the half half parts of the array. ,1, 15847,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"In this search technique, we find middle element from array based on an expression and then divide the array in two parts one from first element till middle and second from middle to last element and try to find our element using recursion.",1, 15848,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search is somewhat similar to binary search just the difference is that instead of taking mid we take another value using a formula.,1, 15849,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search is a search that uses a certain formula to find a kind of partition then ,0, 15850,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation seach technique is a divide and conquer algorithm, which is the modified version of binary search which provide a formula to reach the correct location of the element fastly.",1, 15851,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,in interpolation search,1, 15852,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation Search technique helps in finding the desired elements by a specific formula\n//index i = x(arr[hi]-arr[lo])/hi-lo,1, 15853,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"it is a technique to find an element in which works in a sorted array, find the median then work accordingly , on the basis of it moves accordingly left or right.",1, 15854,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique is a searching technique in,0, 15855,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"A recursive function is a function which calls itself again and again until the base condition is reached, then it terminates.",1, 15856,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search technique searches using the formula of sum of a arithmetic progression.,1, 15857,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique is an improved alternative of binary search where value is stored in a sorted array in a sorted manner.,1, 15858,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Based on divide and conquer. Randomly divide and pick a subpart and search for the key. We take the middle element and then recursively search the other halves. ,1, 15859,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Follows divide and conquer technique.\nIt uses the formula pos=(h-l)*(a[h]-a[l])\nwher h =last index, l = first index",1, 15860,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,it is like median search ,0, 15861,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,This technique uses divide and conquer approach where the values are in a sorted array are uniformly distributed. Interpolation constructs new data points within the range of a discrete set of known data points. ,1, 15862,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,the interpolation is type of median search,0, 15863,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,in interpolation search technique we use the formula of high and low by searching the key for an array .,1, 15864,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15865,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation is search technique to find search the data in,1, 15866,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15867,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search is algorithm for searching for a key in an array that is of numerical values.,1, 15868,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,It is use to searching a key in an array that has been ordered by numerical value assigned to the keys.,1, 15869,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"In a interpolation search technique, it uses an already sorted array to search an element in an array with the help of its formula.\nIt is similar to binary search technique where we first compare the element ",1, 15870,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search is similar to binary search but more accurate rather than verifying the middle element we find a better pos ,1, 15871,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,In the interpolation search technique it uses an already sorted array of integers to find a particular element in an array.\nIt uses a formula and does a binary search on the array. ,1, 15872,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"We use this technique to search for an element in already sorted array, it uses a predefined formula. ",1, 15873,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15874,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"The Interpolation Search is an improvement over Binary Search for instances, where the values in a sorted array are uniformly distributed.",1, 15875,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search is a search which starts from the middle element of the array and searches for the element by everytime taking the middle of array starting fom the firstly selected middle element to its left or right accordingly,1, 15876,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,It is search technique and to apply it elements of array need to be sorted. It follows a general formula which find out the index to be checked by using middle element and range of array --> ind = mid - (arr[high] - arr[low])/(high-low)*element to be searched.,1, 15877,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15878,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,uniform type search.,1, 15879,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"The Interpolation Search is an improvement over Binary Search for instances, where the values in a sorted array are uniformly distributed. Interpolation constructs new data points within the range of a discrete set of known data points. Binary Search always goes to the middle element to check. On the other hand, interpolation search may go to different locations according to the value of the key being searched. For example, if the value of the key is closer to the last element, interpolation search is likely to start search toward the end side.\n",1, 15880,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,when data is distributed uniformly we apply interpolation search\nit relies on mathematical formula to search for an element in the array,1, 15881,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,It is the search technique that search the data in constant time but only in one condition that data is uniformly distributed ,1, 15882,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,it is improved version of binary search it works on probining and postion of the required value,1, 15883,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Heap is a special type of data structure which functions in the way of tree as a method to balance or sort the elements present in any data structure. There are two types of sub heaps that can be implemented i.e. min heap and max heap. Min heap keeps the minimum element on top, and max element does vice versa",1, 15884,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys .,1, 15885,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,When we have the available data in the uniform pattern. And we search for the data at an index according to the specially devised formula which is something like the binary search but instead of index we find the half of the values at the two ends of the problem space that we are analyzing. Then we further reduce the problem space until we either find the data or declare that its not present. \nIn the best solution it can give the answer in const time only.,1, 15886,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,It is a technique in which we determine the appropriate position of the element from the array and search for that element on that position.,1, 15887,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation search is a searching method for sorted array/linked list which use a formula to find specific element (Generated through research) which needed to be check if it is the required element or not ,if not then again generate element using that formula till the element is found else return not found.",1, 15888,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,It is a searching technique wherein ,1, 15889,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,It is a type of searching technique in which the element is searched on the basis of certain formula.,1, 15890,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation Search is an algorithm for searching for a key in an array that has been ordered by numerical values assigned to the keys.,1, 15891,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search is a searching technique in which searching of the element is done using a specific formula ,1, 15892,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15893,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"In a heap elements are arranged in the form of a binary tree by 2 methods - min heap , max heap. In min heap the minimum element is placed at the parents node. In max heap the maximum element is placed at parent node.",1, 15894,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,it works on divide and conquer approach . it is similar to binary search but instead of find the middle element we find the element by using the formula .,1, 15895,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,It is a type of search technique in which we find an element expected position according to a formula and then divide the elements in three parts . One contains elements less than other contains that same element and last contains elements greater than. This is performed recursively and solution is obtained. In median search we take middle element for this purpose.,1, 15896,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"it is a type of searching performed on a sorted data/array in which we want to find K th largest/ K th smallest element ,i.e. element at a particular position using a special formula.",0, 15897,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15898,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15899,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search involves a target value k it has a formula whose idea is to,0, 15900,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,it is a variation of binary search where the index to be searched is given by a certain formula,2.5, 15901,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,A searching technique where we hook on a middle element and move the iterator in right and left direction.,0, 15902,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15903,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search involves a target value K .It has a formula whose idea is to return higher value of position .,2, 15904,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15905,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15906,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation search searches for the element in the middle then looks for the element to its left or right depending upon weather its smaller or larger to given element.,2, 15907,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15908,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,in this search we use arithmatic formulas to calculate the mid element and then compare the other elements with it recursively,1, 15909,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,it is a extension to binary search technique in the index to replace mid is calculated by a given formula,2.5, 15910,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15911,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,Interpolation Search technique algorithm utilizes the idea of Arithmetic Progression to search a particular element . While using IP search it is considered that consecutive elements have a constant or defined common difference. It makes search a lot easier and we can get the result of search in 2 to 3 search.,2.5, 15912,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15913,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"It is like binary seach, but makes use of mathematical formulas to improve the functioning of binary seach.",2.5, 15914,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search is an inplace searching algo,0, 15915,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15916,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15917,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"In Interpolation search , we use aithmetic progression formulae to calculate the mid element . We first find the mid element using that formulae and then compare the element to be searched whether it lies on the right side or left side of array.",2.5, 15918,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15919,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search is defined as the median search problem by creating the comparison.,0, 15920,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15921,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"In this search technique, poles of the data structures are decided and the desired element or pattern is searched accordingly.",0, 15922,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15923,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15924,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15925,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,it reffers to the merge sort which follows divide an conquer approch,0, 15926,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15927,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search is search is,0, 15928,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,median search technique used,0, 15929,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15930,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"Interpolation search is applied on sorted arrays. Interpolation search technique is a method to find an element via a formula, then if the target element is less than the element selected then we choose the left part of the array assuming the array is sorted in increasing order, else we choose to search in the right part of the array and the process continues on until the search space becomes null or we find the target element.",2.5, 15931,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15932,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,"it is median search technique, in which we divide array into two equal halves and look for the element seperately in two different halves , basically reducing time.",1, 15933,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15934,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,in interpolation search the values are first traversed and stored in a table and their occurrence is also stored beside them.\n and then sorted as per the number's that are repeated.,0, 15935,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique is work on the database to search a function in the potation manner ,0, 15936,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,searching technique in which parts of the data structures are pre decided by the user earlier.,0, 15937,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,interpolation search technique is ,0, 15938,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,find out polar form.,0, 15939,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,na ,0, 15940,What is interpolation search technique?,Interpolation search is an improved variant of binary search. This search algorithm works on the probing position of required value.,,0, 15941,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15942,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,postfix- ab+cd+*\nprefix- *+ab+cd\n,0, 15943,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15944,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix: *+ab+cd\npostfix: ab+cd+*,2.5, 15945,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,postfix: ab+cd+*\nprefix: *+ab+cd,0, 15946,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Postfix: ab+cd+*\nPrefix:*+ab+cd,0, 15947,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15948,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix - *+ab+cd\npostfix- ab+cd+*,2.5, 15949,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix- *+ab+cd\npostfix- ab+cd+*,2.5, 15950,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15951,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix- *+ab+cd\npostfix- ab+cd+*,2.5, 15952,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix :- *+ ab + cd\npostfix :- ( a b + ) * ( c d +),2.5, 15953,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,"Prefix:- (,),+,*\nPostfix:- *,+,(,)",0, 15954,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,pre *(+ab)(+cd)\npost (cd+)(ab+)*,2.5, 15955,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix : *+ab+cd\npostfix : ab+cd+*,2.5, 15956,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix : ab+cd+*\nPostfix : +ab*cd+,0, 15957,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix: *+ab+cd\nPostfix: ab+cd+*,2.5, 15958,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,This is a new kind of search technique in which an increasingly input data is entered ,0, 15959,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,*+ab+cd \nab+cd+*,2.5, 15960,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15961,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,In a recursive function we repeat the recursive function multiple times according to the instruction written and we move backwards forming a recursive tree to get our result.\nIt has a base condition so that by moving backwards we get a way to solve the problem by moving forward once more,",", 15962,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15963,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix notation: *\npostfix notation: +,0, 15964,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,interpolation search technique is a search technique which uses ,0, 15965,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,postfix : (ab)(cd)++* or (ab)(cd)*++\nprefix : *++(ab)(cd) or ++*(ab)(cd),0, 15966,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix is ab(+)*cd(+)\npostfix ab(+)*cd(+),0, 15967,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix: ab(+)*cd(+)\npostfix: ,0, 15968,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix : ab+*cd+\npostfix : ,0, 15969,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15970,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix: *+ab+cd\nPostfix: ab+cd++*,2.5, 15971,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15972,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15973,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15974,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15975,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15976,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15977,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15978,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefic ac postfix ad.,0, 15979,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,A function is a recursive function if it calls itself in the function.,0, 15980,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix: *+ab+cd\npostfix: dc+ba+*,2.5, 15981,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix: *+ab+cd\nPostfix: dc+ba+*,2.5, 15982,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,*+ab+cd - prefix\ndc+ba+* - postfix,2.5, 15983,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,*ab+cd=prefix\ndc+ba*,2.5, 15984,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 15985,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix:- (a+b) * (c+d)\nPostfix:- (b*c)+a+d,0, 15986,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix: *+abcd\nPostfix: abcd*+,0, 15987,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Postfix : *+ab + cd\nPrefix : ab + cd+*,2.5, 15988,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix: ab + cd+*\nPostfix: *+ab + cd,0, 15989,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix: ab+cd+*\npostfix: *+ab+cd,0, 15990,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix= ab+cd+*()\nPostfix= *+ab+cd,0, 15991,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix Notation: ab+cd+*\nPostfix: +ab*+cd,0, 15992,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,POSTFIX - ab+cd+*\n\nPREFIX - *+ab+cd,0, 15993,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,\n\nThe prefix notation of the expression (a + b) * (c + d) is: * + a b + c d\n\nThe postfix notation of the expression (a + b) * (c + d) is: a b + c d + *,0, 15994,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix is (*+ab+cd)\nPostfix is (ab+cd+*),2.5, 15995,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix -> *+ab+cd\npostfix -> ab+cd+*,2.5, 15996,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,(ab)(cd)*++,0, 15997,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix- ac\npostfix- bd,0, 15998,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix - ab+cd+*\nPostfix - *+ab+cd,0, 15999,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix notation: * + a b + c d\nPostfix notation: a b + c d + *,0, 16000,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix : * + a b + c d\nPostfix : a b + c d + *,2.5, 16001,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,-,0, 16002,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,+\n*,0, 16003,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix-(a+b)\npostfix-(c+d),0, 16004,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16005,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,PREFIX NOTATION--AC\nPOST FIX NOTATION-- BD,0, 16006,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16007,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16008,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,((A + (B * C)) + D),0, 16009,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16010,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16011,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16012,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16013,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix notation : ab+*cd*\n\nPostfix notation :\n,0, 16014,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix- *+ab+cd\nPostfix- ab+cd+*,2.5, 16015,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix notation -++*abcd\npostfix notation - abcd*++ ,0, 16016,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix: abcd*+()\npostfix: ()+*dcba,0, 16017,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,the prefix value is a+b while the post fix value is c and d.,0, 16018,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix form *+ab+cd\npostfix form ab+cd+*,2.5, 16019,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16020,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16021,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16022,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Postfix - a(b+*)c(d+)\nPrefix - ()*ab()cd,0, 16023,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix=*+ab+cd\npostfix=ab+cd+*,2.5, 16024,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16025,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16026,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix -ab postfix-ab ,0, 16027,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16028,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix- *(+ab)(+cd)\npostfix- (ab+)(cd+)*,2.5, 16029,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16030,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16031,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix notation= ac+bc\npostfix notation= bc+bd,0, 16032,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Postfix - ab+cd+*\nPrefix- *+ab+cd,0, 16033,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16034,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,pre : *+ab+cd post: ab+cd+*,2.5, 16035,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16036,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix notation: +*+abcd\nPostfix notation: abcd+*+,0, 16037,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16038,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16039,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,In Interpolation search first we find the position pos then we check if element lies to the left or right of the position if it is in the left side then we do search till the left half and if it lies in right then we do the search the right half untill we get the element equal to the arr[pos].,0, 16040,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,*(+ab)(+cd)\n(ab+)(cd+)*,2.5, 16041,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,"a(c+d), b(c+d)",1, 16042,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,(a+c)*(b+d),1, 16043,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,, 16044,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix notations are : ++a*bcd\nPostfix notations are : abc*+d+,1, 16045,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,*(+ab)(+cd)-prefix\n(ab+)(cd+)* - post fix,1, 16046,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *, prefix == + + A * B C D\npostfix == \tA B C * + D +,2, 16047,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,, 16048,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,, 16049,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,*(+ab)(+cd)(ab+)(cd+)*,1, 16050,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,, 16051,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix: *(+ab)(+cd)\npostfix: (ab+)(cd+)*,2, 16052,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,, 16053,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,, 16054,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Interpolation search is a form of binary search technique in which dont calculate mid instead we divide the array at some other index.,1, 16055,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix - *+ab+cd\npostfix - ab+cd+*,2, 16056,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix : + + A * B C D \nPost Fix:\tA B C * + D +,2, 16057,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix- * + ab + cd\t\npostfix- ab +cd + *,1, 16058,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Interpolation search is an algorithm for searching for a particular key in an array that has been ordered by numerical values assigned to the keys.,2, 16059,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix: *+ab+cd\nPostfix: ab+cd+*,1, 16060,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,"The expression a + b * c + d can be rewritten as ((a + (b * c)) + d) to show that the multiplication happens first, followed by the leftmost addition. a + b + c + d can be written as (((a + b) + c) + d) since the addition operations associate from left to right",2, 16061,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16062,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix notation : * +a b + c d\nPostfix notation : a b + c d + *,1, 16063,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16064,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix-*((+ab)(+cd))\nPostfix-((ab+)(cd+))*,1, 16065,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,heap is a binary tree which is balanced by compairing the root node key with it's childrens and arranged accordingly.,2, 16066,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix Notation : *(+ab)(+cd)\nPostfix Notation : (ab+)(cd+)*,1, 16067,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16068,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix notation: *+ab+cd\npostfix notation: ab+cd+*,2, 16069,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16070,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix :- *+ab+cd\nPostfix :- ab+cd+*,2, 16071,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,"In Interpolation search, we need a sorted array and the element is searched using the function such as - (i=2*i) if the value at 'i' is greater than the value to be searched, then the element is searched in that range using binary or linear search.",1, 16072,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,, 16073,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix : ab+cd*+\npostfix: *ab+cd+,2, 16074,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,"prefix = a,b\npost fix = c,d",2, 16075,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix is * and post fix is +,1, 16076,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,*(+ab)(+cd)\n(ab+)(cd+)*,2, 16077,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix a\npostfix d,2, 16078,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix - : *+ab+cd\npostfix- ab + cd +*,1, 16079,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,post fix: ab+cd+*\nprefix: *+ab+cd,2, 16080,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,+ab*+cd prefix notation\nab+cd+* postfix notation,2, 16081,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,interpolation search technique is almost similar to binary search but has definite formula to find the middle element.,1, 16082,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,postfix=ab+cd+*\nprefix=*+ab+cd,1, 16083,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,"prefix :- *+ab+cd , postfix: - ab+cd+* ",2, 16084,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,*+ab+cd\nab+*cd+\n,2, 16085,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,, 16086,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix - * +ab +cd\nPostfix- ab+ cd+ *,2, 16087,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix : ++*abcd\npostfix : ab*cd++,2, 16088,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,, 16089,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix : *+ab+cd\npostfix : ab+cd+*,2, 16090,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix - ,0, 16091,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix: *+ab+cd\nPostfix: ab*+cd+,2, 16092,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix: *+ab+cd\npostfix: ab+cd+*,2, 16093,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix (+ab)(+cd)\npostfix ab+*cd+,2, 16094,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix-\n+ab*+cd\nPostfix-\nab+*cd+,2, 16095,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix = abcd+*+()()\npostfix = ()()+*+abcd,2, 16096,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Postfix: ab+c*d+\nPrefix: +ab*c+d,2, 16097,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix: ++*abcd postfix: a*b+cd,2, 16098,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,postfix= ab+cd+*\nprefix=*ab+cd,2, 16099,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16100,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,postfix- ab+cd+*\nprefix- *+ab+cd,2, 16101,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16102,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix - *(+ab)(+cd)\nPostfix- (ab+)(cd+)*,2, 16103,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix = *+ab+cd\nPostfix = ab+cd+*,2, 16104,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,*(+ab)(+cd)(ab+)(cd+)*,2, 16105,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix: *ab+cd\npostfix: ab+cd+*,2, 16106,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,*(+ab)(+cd)\n(ab+)(cd+)*,2, 16107,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *, prefix: + + a * b c d post fix: a b c * + d +,2, 16108,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix: *+ab+cd\npostfix: ab+ccd+*,2, 16109,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prfix:a+b\npost fix:*c+d,2, 16110,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix notations :- \,0, 16111,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix notation : * + A B + C D\npost fix notation : A B + C D + *,0, 16112,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16113,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16114,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16115,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16116,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix- (ab)+(cd)+*,0, 16117,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,a+b*c+*d,0, 16118,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,"int a,b,c,d;\ncout<<((a+b)*(c+d))< +*ab+cd\npostfix -> ab+*cd+,2, 16121,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix - *ab+cd;\nPostfix - ab*cd;,2, 16122,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,*+a b c prefix\n + + a b c post,2, 16123,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,"The expression A + B * C + D can be rewritten as ((A + (B * C)) + D) to show that the multiplication happens first, followed by the leftmost addition. A + B + C + D can be written as (((A + B) + C) + D) since the addition operations associate from left to right.\n",0, 16124,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix notation-> * +ab +cd\npostfix notation-> ab+ cd+ *,0, 16125,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,ab+cd+*\n*+cd+ab,2, 16126,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,*+ab+cd\nab+cd+*,2, 16127,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,"recursive function is a function calling itself, it usually also has a base case to get out of the recursive loop",0, 16128,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,\tPrefix notation: * + A B + C D and\tPostfix notation: A B + C D + *,0, 16129,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Post-Fix\nab+cd+*\n\nPre-Fix\n*+ab+cd,0, 16130,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix : *+abcd\nPostFix : ab+cd*,2, 16131,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix: *()+ab()+cd\npostfix: ab+()cd+()*,2, 16132,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Postfix:\nPrefix:,0, 16133,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix= *()+ab()+cd\npostfix= ab+()cd+()*,1, 16134,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16135,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix-> *+ab+cd\npostfix->ab+cd+*,2, 16136,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,postfix=ab+()cd+()*\nprefix=*()+ab()+cd,1, 16137,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,In recursion the same function is called inside a function with different arguments. \n\nsteps involved to write a recursive function-\n1. base case\n2. n-1 th case - obtained from principle of mathematical induction\n3. return solution,0, 16138,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix->+ab*+cd\npostfix->ab+cd+*,1, 16139,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix +ab*+cd\npostfix ab+cb+*,1, 16140,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix-*a+*b\npost,0, 16141,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix a+b,0, 16142,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix *(+ab)(+cd)\npostfix (ab+)(cd+),2, 16143,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix notating is this (a + b) * (c + d) \npostfix notation is (ac + ad + bc + bd),0, 16144,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix- *+ab+cd\npostfix- ab+cd+*,2.5, 16145,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16146,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,postfix: (ab+)(cd+)*\nprefix: *(+ab)(+cd),2.5, 16147,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16148,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix notation of (a+b)*(c+_d)\nis dc*ba++\npostfix notation of (a+b)*(c+d)\nis ab*cd++,0, 16149,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,+*(ab)(cd) prefix\n(a+b)(c+d)* postfix,2.5, 16150,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix: *+ab+cd\n\npostfix: ab+cd+*,2.5, 16151,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16152,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16153,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,postfix is ab+cd+*\nprefix is *+ab+cd,2.5, 16154,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16155,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix: dc*ba++\nPostfix: ,0, 16156,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16157,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16158,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,ab+cd+*,0, 16159,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16160,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix= (*)\npostfix=(+),0, 16161,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix ;- *+ab+cd\npostfix :- abcd==*,0, 16162,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16163,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix (a +b)\n(a +b)*\n(a +b)*(c +d),0, 16164,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16165,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix: *+ab+cd\n\nPostfix: ab+cd+*,0, 16166,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *, pre fix => ac + ad\npost fix => bc + bd,0, 16167,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix notation:- ac + ad\npost fix notation:- bc + bd,0, 16168,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,postfix notation = ab+cd+*\nprefix notation = ++*abcd,1, 16169,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,ac + ad,0, 16170,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix notation: ac + ad\npost fix notation: bc + bd,0, 16171,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix *+ab+cd\npostfix ab+cd+*,2.5, 16172,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix *+ab+cd\npostfix ab+cd+*,2.5, 16173,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix notation :- a\nPostfix notation :- d,0, 16174,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,Prefix Notation: *(+ab)(+cd)\nPostfix Notation: (ab+)(cd+)*,2.5, 16175,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,,0, 16176,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix: +*ab+cd\npostfix : ab+cd+*,1, 16177,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix is a and postfix is d,0, 16178,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix -> (a+b).(c+d)\npostfix -> (a+b) + (c+d),0, 16179,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix a+b+c+d\npost fix (ab)*(cd),0, 16180,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix - *+ab+cd\n\npostfix - ab+cd+*,2.5, 16181,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,"prefix is a+b ,c+d\npost fix sum to both",0, 16182,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,a,0, 16183,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix a and postfix d ,0, 16184,What is the prefix and post fix notation of (a + b) * (c + d) ?,(1)Prefix Notation − * + a b + c d (2)Postfix Notation − a b + c d + *,prefix notation=(a+b) (c+d)*\npost fix notation= * (a+b)(c+d),0, 16185,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16186,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,it stores the element in a sequence pattern\nit stores element in a sorted manner\nit assign a address to the element where it has stored,1, 16187,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,its features are public and predefined funciton ,1, 16188,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT stands for Abstract data type. It can create an abstract class but it cannot be used to create an object of the class. ,1, 16189,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Abstract Data Type allows data structure to be implemented without actually showcasing the working of the data structure.,1, 16190,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT is a abstract data type.,1, 16191,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,it exports a type .\nit export set of operation called interface.\nADT is reusable.\n,2, 16192,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,.it is reusable.,2, 16193,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16194,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16195,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16196,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"It helps to store the memory of the RAM as we make the array dynamically and we can delete the rest over array if not in use, whereas in a normally array it acquire the size and if there is empty array the size will remain occupied there .",2, 16197,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"The features of ADT are to insert , delete, store data in RAM.",1, 16198,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16199,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,features of ADT are :\n- easy traversal\n- easy deletion \n- easy insertion\n\n,1, 16200,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,1, 16201,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,1. it is a linear data structure\n2. the data is stored in contiguous blocks of memory,1, 16202,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,*+ab+cd\n\nab+cd+*,2.5, 16203,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,1 helps in storing data\n,1, 16204,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16205,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,In interpolation search technique we select an element according to the formula element1 = (left - right)/array[right]-array[left] + right - left\nand then follow the pattern of binary search by checking whether the required element to search is greater than element1 or smaller then we divide the array according\nto the result and repeat the process until we get our required element.,1, 16206,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16207,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16208,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16209,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT - is abstract data type. \ndynamic array creation using pointers \n\n\n\n\n\n\n\n,1.5, 16210,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT stands for Abstract Data Type in which the space is allocated virtually and not in a static way. example: malloc in C and virtual classes in C++.,2, 16211,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"Abstract data type(ADT), the elements are stored virtually so there is no need for static memory allocation so it takes LESS SPACE for storage. For example, malloc.",2, 16212,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"The elements are stored virtually, there is no need for static memory allocation so it takes less space for storage. ",2, 16213,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16214,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16215,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16216,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16217,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"abstract data types are made using basic data types such as int ,float ,etc.\ncommon example of abstract data types are struct(structure),class,etc.\nfeatures are :\nin ADT we get some more features like storing different data types in one data type. performing some extra operations as well\n ",2, 16218,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16219,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16220,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,The main feature of ADT list is that we can specify the domains and operations independently.,2, 16221,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,its features are domain and operations are specified seperatly.,1, 16222,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16223,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Interpolation search technique is very similar to binary search. In interpolation. we divide the array by using a particular formula till it reaches a point where it can't be divided further and then sort it.\n ,1, 16224,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16225,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16226,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16227,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16228,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,abcd is the notation,1, 16229,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16230,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"Features of ADT:\nADT stands for Abstract data types which means that the construction of that data type is abstracted from the rest of the code.\nThese data types store the address pointer to their successive and previous node, so they improve the retrieval of data from the program. Also, they do not require to store the data together, so they do not require a continuous space in computer memory.",2, 16231,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT is abstract data type is data type.\ndefine in some other class and used in some other class.\nused to Override the the working of one function .,2, 16232,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT also known as abstract data type is used to store data using different data types.,2, 16233,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16234,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,The features of ADT are that the data can be divided discretely.,2, 16235,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT have the following features:\nThese stores data linearly.\n,2, 16236,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,it is used to store data linearly,2, 16237,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"Abstract Data Type (ADT) is a programming concept that allows the definition of a data type, its behavior, and its properties without specifying its implementation details. The features of ADT are:\n\n1. Encapsulation\n2. Abstraction\n3. Modularity\n\n4. Data Independence: ADTs allow the data type to be defined independently of any particular programming language or hardware architecture, making them more flexible and portable.\n\n5. Reusability: ADTs can be reused in different parts of a program or in different programs altogether, which can save time and effort in programming.\n",2.5, 16238,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,they are pre defined data types given in the standard template library of the cpp.,1, 16239,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Data is stored in non continuous manner so it can be used to store data which is not yet organized or can be sequentially added in data structures like array,1, 16240,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16241,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,it is optimized in nature\n,2, 16242,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"Features - Less time consuming, complete",1, 16243,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT has variables and methods(functions) ,2, 16244,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16245,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"abstract data types , they are user defined",1, 16246,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"It behaviour is designed by set of values\nLike vectors ,list",2, 16247,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16248,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,adt means abstract data type. Some of its features are:\n1. encapsulation\n,",", 16249,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,IT IS REUSABLE AND ROBUST.\nIT REDUCES CODING EFFORTS\nBASED ON OBJECT ORIENTED PROGRAMMING,",", 16250,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16251,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16252,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation," ADT is let us consider in-built data types that are provided to .The features are addition, subtraction, division, multiplication.",2, 16253,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16254,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT is used to implement encapsulation in a program.,2, 16255,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16256,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16257,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16258,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,the features of ADT are :\nIt exports a type.\nIt exports a set of operations. This set is called interface.\nOperations of the interface are the one and only access mechanism to the type's data structure.,2, 16259,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,1. It is fast.\n2. it is super easy to implement.,2, 16260,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16261,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Some features of ADT are:\n1) It reduces space consumption by the data structure.\n2) It reduces the system time hence making the system faster.\n,2, 16262,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16263,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16264,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation, ,0, 16265,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,interacive securitiues \naccess control;\nvarious pannel\n,1, 16266,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,-,0, 16267,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,adjacency matric and list stores the information about the adjacent vertecies such as if it is connected adjacently or not and might even store the weight of the adjacent vertex,1, 16268,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,features of ADT(abstract data type) are:\n1. it exports a type.\n2. it exports a set of operations.\n3. Operations of the interface are the one and only access mechanism to the type's data structure.,1, 16269,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16270,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16271,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,\n,0, 16272,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16273,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,it exports a type . it exports a set of opeartions . ,1, 16274,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16275,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,it is efficient and gives optimal solution.,1, 16276,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,It represents different data types through which we can implement the given code.,1, 16277,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16278,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"it allows creation of instrances of data with well defined properties,elements do not need to be unique",1, 16279,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16280,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,It is faster\nUses less space,2, 16281,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,adt can be an integer type it can be list of integers list of characters and even the list of list,1, 16282,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16283,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16284,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,The features of an ADT is that it is an abstract data structure,1, 16285,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,public and protected function,2, 16286,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"ADT \nabstarct data type\nnon triaval data type\n\nmap,set",2, 16287,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16288,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,The features of ADT are that:\n1-it exports a type\n2-it exports a set of operations. this set is called interference.,1, 16289,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16290,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,It exports a set of operations known as interface.\nOperations of the interface are the one mechanism of this type of data structure.,2, 16291,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"Abstract data type can change data type that is intended for other purpose. Example in char int, here integer is being treated as character for future references.",1, 16292,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16293,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16294,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"Encapsulation, polymorphism",1, 16295,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"Abstract data type are the data types we form using class. Or the ones in the STL library. eg: vector, list, queue etc. The operations on these abstract data types are predefined in the STL library.",2, 16296,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,encapsulation-binding data with functions\ndata abstraction \npolymorphism-allows multiple information of adts,1, 16297,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,These are the prime features of ADT:,1, 16298,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16299,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16300,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"Abstract data types are essential for big scale programming. They package data structures and operations on them, hiding internal details for eg. an ADT table provides insertion and lookup operations to users while keeping the underlying structure, whether an array, list, or binary tree or other.",1, 16301,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Abstract data types encapsulate data and their functions in a single unit,1, 16302,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,prefix : ()()*+ab+cd\n,2, 16303,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"ADT or abstract data type can be used to implement data structures of different kind of values stored basically using a template for all the types of structures.\nexample: pair, pair",2, 16304,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16305,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16306,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16307,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16308,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,The ADT is a data type which is defined by the user only.\nThe user can initialize the data type in any way it wants.\n,1, 16309,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"recursive function is way of calling the same function inside of it, by using which we can create a loop of running a particular process a number of times according to our need.",2, 16310,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16311,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,It exports a type.\nIt exports a set of operations. This set is called interface.\nOperations of the interface are the one and only access mechanism to the type's data structure.,2, 16312,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16313,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,feature of ADT are that we can create our own datatypes example like struct.,2, 16314,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,The examples of Abstract Data Type (ADT) are structures and classes.\nIts features are that the programmer can implement his own data types other than the existing/predefined to work more efficiently.,1, 16315,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ab+cd+*\n*+ab+cd,1, 16316,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16317,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16318,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"public function, proception function ",2, 16319,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16320,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"Abstract Data Type short form being ADT is very useful as the data type of a structure is abstract, it can be char, int, long etc. hence making the data structure usable for every type of data, all the operations and functions will work for any system-defined data type",2, 16321,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT helps to under stand the program easily,1, 16322,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16323,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16324,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,it can be used to define a data structure as per our own convenience,2, 16325,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,prefix - ++*abcd\npostfix- abcd*++,1, 16326,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,each set of data is kept independent of other without knowing about the data in other set in adt.,2, 16327,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,features the ADT :-\nFind element in faster way,2, 16328,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16329,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,1.It exports a type.\n2. It exports a set of operations.\n3. Operations of the interface are the one and only access mechanism to the type's data structure.,1, 16330,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT stands for Abstract data type . In ADT we store the elements as per their data types.,2, 16331,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,abstract data structure defined by the user .,2, 16332,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16333,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,, 16334,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16335,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16336,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16337,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16338,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,The features of ADT(Abstract data type are)-\nThe node of such data types are defined by using any structure or class and it uses the built in data types to get it's implementation.\nIn a simpler manner we can say that ADT is the implementation of the new data type where the user will not be aware about it's internal implementation.,2, 16339,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16340,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16341,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,the main feature of abstract data structure is to extract previous as well as next element in the list. ,1, 16342,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16343,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Prefix: *\nPostfix: b,0, 16344,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16345,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16346,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"Features of abstract data types - easier insertions and deletions, more storage available for data storing as memory need not be continuous. faster traversals. more ways to store data like trees, hierarchies can be introduced. ",2, 16347,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Abstract Data type includes \nabstraction\nencapsulation\nrobust\nbetter conceptualization,2, 16348,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"abstract data type are char, int . these data type are in- built data type into compiler for quick and easy use.",2, 16349,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Abstraction and encapsulation,2, 16350,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"The features of Abstract Data Type such as int, float, double, long, etc. are considered to be in-built data types and we can perform basic operations with them such as addition, subtraction, division, multiplication, etc. ",2, 16351,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16352,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16353,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,The features are:\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n,2, 16354,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,\npostfix notations:- \,0, 16355,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16356,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16357,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT is an act of representing essential features without including the background details.\nfeatures of abstract data types:\n1) it is robust and reusable\n2)It is based on the principle of object oriented programming(OOP)\n3)It can be reused at several places and it reduces the coding efforst\n,2, 16358,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16359,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"Its reusable, uses object oriented programming.\n",2, 16360,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Abstract Data type- ,2, 16361,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16362,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Abstract Data type (ADT) is a type (or class) for objects whose behavior is defined by a set of values and a set of operations. The definition of ADT only mentions what operations are to be performed but not how these operations will be implemented. It does not specify how data will be organized in memory and what algorithms will be used for implementing the operations,2, 16363,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,1. list of integers\n2. list of payrolls\n3. list of prices,2, 16364,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT are used to implement private functions.,2, 16365,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Its full form is Abstract Data Type. ,2, 16366,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,it helps in exports various operations and files.,2, 16367,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,It exports a type.\nIt exports a set of operations. this set is called interface.,1, 16368,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,abstract data type such as array list map queue\nthey are used to store data in different manner\nthey support insertion deletion of elements\nsome are used to tell the frequency of elements such as map\n,2, 16369,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16370,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,it export a time or it export a set of operation,2, 16371,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"Uniform data structure can be searched through in constant time via interpolation , i.e. taking mid part and manipulating it accordingly",2, 16372,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,1)It exports a type.\n2)It exports a set of operations. This set is called interface.\n3)Operations of the interface are the one and only access mechanism to the type's data structure.,2, 16373,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,It is a list type data structure that is used for storing values.\n,2, 16374,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16375,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT:\nThese are faster then linear data types.\nThese are ,0, 16376,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16377,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,They can be used to solve bigger problems and reduce the time by not writing the smaller part.,1, 16378,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,I am going to assume here that ADT refers to ABSTRACT DATA TYPE.\nThe main feature (or can I say the only feature I KNOW) is encapsulating data and operations into a single page.,1, 16379,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16380,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16381,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16382,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16383,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT is useful for storing large data.,2, 16384,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16385,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16386,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16387,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,adt stands for abstract data type .,2.5, 16388,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,they can be made according to the requirements of the programmer in order to ease their task.,0, 16389,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,It is an auto defining tool.,0, 16390,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16391,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT stands for abstract data types . Object whose behaviour is defined by values. ADT's have memory allotted to them by system memory.,2.5, 16392,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Features of ADT are:\ninsertion\ndeletion ,0, 16393,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16394,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16395,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16396,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16397,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,it is memory effecient and doesn't use consecutive memory blocks. operations also have less time complexity,0, 16398,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16399,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16400,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16401,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,1. Its node is defined using class.\n,0, 16402,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,abstract data type features are :\nused to create virtual class\n,2, 16403,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,data structure in data is stored in uncontinous form,0, 16404,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16405,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16406,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16407,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Not known,0, 16408,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16409,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16410,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,1) It exports a type\n2) It exports a set of operations,0, 16411,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16412,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16413,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"we can perform several functions like insertion , deletion , extract min function etc...",1, 16414,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Abstract Data Type : User defined data type \nImplement set of operations defined by the user.,2.5, 16415,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,ADT is user defined in which we use pre existing data structures,0, 16416,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,"less time interval, efficient performance",0, 16417,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,insertion and deletion are the features of ADT.,0, 16418,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,Implementation is hidden\nWe are given some functions which we can invoke on the Abstract Data Structure,0, 16419,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16420,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,time interval is low,0, 16421,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16422,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,we can move from one location to another in short time of O(1),0, 16423,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,it move location in the live time so that's the main feature of ADT,0, 16424,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,,0, 16425,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,we move location in content time like o(1)\n,0, 16426,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,3,0, 16427,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,abstract data type : ex-array\n1)insertion \n2)deletion ,0, 16428,Mention the features of ADT.,a. Modularity ([i.] Divide program into small functions [ii.] Easy to debug and maintain [iii.] Easy to modify) b. Reuse ( [i.] Define some operations only once and reuse them in future) c. Easy to change the implementation,features of adt is:\nit tells the exact pattern from the text with the same text but not the values;,0, 16429,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16430,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",list ADT is the form to store the elements in the form of a list in a continous manner in the form of a list and in a sorted order,2.5, 16431,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,",", 16432,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",A list ADT refers to list abstract data type. it works similar to abstract class but instead of a class it is defined as a linked list,2.5, 16433,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","List ADT is essentially an array with insertion, deletion and updation methods defined. In a normal array there is no provision to increase the size of array but in ADT list we can do that.",2.5, 16434,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is used to store data in abstract form ,1, 16435,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","a list is an abstract data type that describes a linear collection of data items in some order , in that each element occupies a specific location in it.",2.5, 16436,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",It makes the list dynamically.,1, 16437,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16438,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16439,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16440,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is similar to array ADT but the only difference is that list attach the nodes to the next node and created the list dynamically .,2.5, 16441,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is a list which perform above operation.,2.5, 16442,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16443,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","Array Data Structure , ADT is a linear data structure that covers a space of n bits where n is the number of elements stored in it.",1.5, 16444,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",Linked List is a collection of linearly connected node where each node stores the address of the next node.,1.5, 16445,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",A linked List implemented using array is called a List ADT,1.5, 16446,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",It's one of the main feature is that it stores the data in contiguous blocks of memory.,1.5, 16447,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",list is data structure which is used as array to store elements effciently.,1.5, 16448,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16449,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16450,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",Abstract data type is a mathematicaL MODEL. abstract data type is defined by its behaviour from the point of view of the user,1.5, 16451,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",ADT is Abstract Data Type with list data structure to perform normal basic operations on a particular program,1.5, 16452,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16453,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","ADT - is abstract data type \nprobably a double pointers \nor dynamic array creation \nmalloc() , calloc() in c and new and delete in cpp",1.5, 16454,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",Linked List is an example of ADT. In liked list each element has the address of the next element and so on. So the list is not allocated statically and we need to traverse each element from the start or end to find an element.,1.5, 16455,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",Linked list is a form of ADT because the elements are not static and all of them have a pointer which points to the next element. ,1.5, 16456,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","Abstract Data Type ( ADT) is a form of linked list as elements are stored virtually, using pointers which point to the desired element. No static memory allocation is required.",1.5, 16457,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16458,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16459,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16460,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16461,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16462,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16463,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16464,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",ADT list stands for Abstract Data Type List.,1, 16465,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is Abstract Datatype list.,1, 16466,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",Its Abstracted Dynamic List.,1, 16467,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",Prefix-*+ab+cd\nPostfix-ab+*cd+,0, 16468,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16469,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16470,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List adt is formed by linearing connecting linkedlist nodes.,1, 16471,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16472,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16473,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16474,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is a type of data structure similar to the list we use in python where a key has a corresponding value to it.,1.5, 16475,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16476,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is defined as the list of different abstract data types used to store the data.,1.5, 16477,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16478,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",ADT list are a type of data structures in which data is stored in the non continuous order.,1.5, 16479,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is used to store data one after the other just like array but with in a pair. Example: Dictionary in python stores data in key value pair.,1.5, 16480,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",It stores data same as array but in a pair.,1.5, 16481,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","List ADT (Abstract Data Type) is a collection of data elements that are arranged in a sequential order, and each element can be accessed by its position or index within the list. The List ADT supports operations such as inserting, deleting, and accessing elements in the list. Lists can be implemented using arrays or linked lists, and they can be used to represent various types of data, such as strings, integers, or complex objects. ",1.5, 16482,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",The list adt is where we can store multiple heterogenous sequence of elements in a array like form,1.5, 16483,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",Linear data structure in which the data is stored in non continuous manner.,1.5, 16484,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16485,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16486,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT helps you to store data in a list which uses linked list and hashing.,1.5, 16487,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","List ADT would have insert, delete, update, display functions",1.5, 16488,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16489,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",they are user defined list data structures like linked lists,1.5, 16490,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",list is an abstract data type in which data is stored in ordered way so that we can do efficient retreival,1.5, 16491,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16492,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16493,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","IT IS UESD TO DESCRIBES A LINEAR COLLECTION OF DATA IN SOME ORDER , SUCH THAT EACH ELEMENT HAS A SPECIFIC POSITION.",",", 16494,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16495,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16496,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element"," ADT is let us consider different in-built data types that are provided to us. Data types such as int, float, double, long, etc. are considered to be in-built data types and we can perform basic operations with them such as addition, subtraction, division, multiplication. ",1.5, 16497,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16498,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16499,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16500,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",linear data structure in which the data is stored in a non continuous manner,1.5, 16501,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16502,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","list ADT is defined as List defines the member functions that any list implementation inheriting from it must support, along with their parameters and return types.",1.5, 16503,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16504,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16505,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is a method of storing and compressing list to avoid overuse of system space by the list.,1.5, 16506,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16507,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16508,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element", ,0, 16509,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",IN ADT in this the properties are assign to each element ,1.5, 16510,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",-,0, 16511,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",adjacency list is an array whose each index is connected to a linked list which stores the information about the adjacent vertecies,2, 16512,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16513,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16514,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16515,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",adt stands for abstract data type that stores collection of data linearly.,1.5, 16516,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16517,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16518,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16519,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","in ADT, ",1, 16520,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","ADT stands for Abstract Data Types. It is a list of different data types like - long, int, float, double, char, bool",2, 16521,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16522,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","Absract data type, it allows creation of instrances of data with well defined properties,",1, 16523,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16524,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16525,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",list adt refers to list of any integer type where the properties are independently implemented,2, 16526,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16527,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16528,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","A list is a data structure in which may be having multiple or a large number of nodes and the nodes may itself be a list or a linked list, or a simple element such that the value at the node points to the unique element.",2.5, 16529,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","data types such as stack, queues and linked list",2, 16530,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","mapmp;",1, 16531,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16532,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is the linear collection of data items in some porder in that each element occupies a specific positions in the list.,2, 16533,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16534,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","A list is an abstract data type that has a linear collection of data items in some order, in this each element occupies a specific position in the list. The order could be alphabetic or numeric or it could be the order in which we have added the list.",2, 16535,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List Abstract Data Type,1, 16536,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16537,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16538,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List adt or list abstract data type is the one with collection of data in orderly fashion where each data is positioned within the list,2, 16539,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List is like an array. the data is stored in contiguous memory locations and retrieved in that manner too. ,2, 16540,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",list abstract data structure that represents the ordered collection of elements where each element is identified by its position or index.,1, 16541,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",ADT ,1, 16542,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16543,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",reperesnts elements in the form of list of elements. ,2, 16544,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","In ADT ,each list element must have some data type. In the simple list implementations, all elements of the list are usually assumed to have the same data type, although there is no conceptual objection to lists whose elements have differing data types if the application requires it. The operations defined as part of the list in ADT.",2, 16545,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is a dynamic array which means that it's size need not be pre defined and data entry could go being done,2, 16546,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","Abstract data types are mainly used for large-scale programming. They package data structures and operations on them, hiding internal details. ADT table provides insertion and lookup operations to users while keeping the underlying structure, whether an array, list, or binary tree.",2, 16547,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16548,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element"," A linear relationship means that, except for the first one, each element on the list has a unique successor. Also lists have a property intuitively called size, which is simply the number of elements on the list. Know that every list has a size.",2, 16549,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16550,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16551,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16552,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is a user defined lit which is solely initialized by the user itself. ,1, 16553,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",median search is also know as interpolation search technique,1, 16554,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16555,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","A list is an abstract data type that describes a linear collection of data items in some order, in that each element occupies a specific position.",1, 16556,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16557,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","list adt contain data variable, pointer to next node .",1, 16558,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",Basic List ADT contains a node and a pointer to its next node. The last node's next pointer points to NULL.,1, 16559,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16560,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16561,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",using list in place of nodes which helps in connecting several nodes of the ADT among eachother whcih make sit more efficient andmore useful via better traversal.,2, 16562,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","link list, queue, stack, data structer in c",2, 16563,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",a datatype whose properties are specified independent of any particular implementation,1, 16564,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List is a linear data structure in which there are multiple nodes which have an element in them and a next pointer which points to the next element in the list after them. There is one head in list before which there is no element and then there is one tail pointer after which there is no element.,2, 16565,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16566,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16567,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16568,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",list adt stands for list abstract data type,2, 16569,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16570,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",list adt is basically a chained linked list.,2, 16571,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16572,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16573,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","List ADT is an abstract data type that describes a linear collection of data items in some order, in that each element occupies a specific position in the list.",1, 16574,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",In list ADT we store the abstract data type in a list of elements. ,1, 16575,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",linked list in which user can can any type of input.,2, 16576,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","ADT refers to abstract data type, Class is one of classic example of abstract data type features of it are we can make its obj and make inbuilt functions.",1, 16577,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,, 16578,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16579,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16580,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16581,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16582,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is a data type which store the elements on different location and stores a pointer to correct the location.l,1.5, 16583,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16584,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16585,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","it is a type of abstract data structure which is in the form of list , like linked list.",1, 16586,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16587,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16588,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16589,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","data is stored in a list which has head structure consisting of a count,pointer and address",1, 16590,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is linked list. Linked list is a linear data structure in which data is stored in fragments in the memory but can be accessed as they are linked using a pointer. this is more realistic as a continuous block of memory for storage may not be available. Especially if size needed is large. \n,2, 16591,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","The data is stored in key sequence in a list which has a head structure consisting of count, pointers and address of compare function needed to compare the data in the list is called List ADT.",2, 16592,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16593,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",It stands for Abstract Data Type.\n,1, 16594,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16595,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16596,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16597,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16598,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16599,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16600,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16601,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16602,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16603,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16604,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16605,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16606,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16607,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",list adt is a abstract data type where the format of data items follow linear fashion,1, 16608,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",ADT include static int.,1, 16609,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",Its full form is Abstract Data Type. ,1, 16610,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",it is abstract data structure in which data is not stored in continuous way.,1, 16611,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","ADT stands for abstract data type. The data is generally stored in key sequence in a list which has a head structure consisting of count, pointers and address of compare function needed to compare the data in the list.\nThe data node contains the pointer to a data structure and a self-referential pointer which points to the next node in the list.\n",2, 16612,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",list is an dynamic array whose size varies according to the number of times user enter data in it\nwe dont need to define its size at the time of its creation,2, 16613,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16614,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",a abstract data type whose properties (domains and operational )are specified independently of any particular implementation.\nlist ADT are linear structure on which data is stored in a non continous fasion,2, 16615,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",*+ab+cd and ab+cd+*,0, 16616,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element"," A list is an abstract data type that describes a linear collection of data items in some order, in that each element occupies a specific position .Here the data is stored in a non - continuous fashion.\n",2, 16617,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16618,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16619,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","Abstract data types are the data types which are abstracted for primitive data type\nfor eg: trees , graph etc.",2, 16620,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16621,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",These are derived from primitive data types.\neg: graph,1, 16622,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","Using the same assumption of ADT = ABSTRACT DATA TYPE...\nUsing that analogy or conclusion, we can say that: \nAn abstract data type is defined by its behavior from the point of view of a user, of the data, specifically in terms of possible values, possible operations on data of this type, and the behavior of these operations.",1, 16623,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16624,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",obtained from primitive data type,0, 16625,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",ab+0cd+0* - postfix\n*0+ab() - prefix,0, 16626,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16627,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is a data structure used to store data in list form,1, 16628,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16629,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",a list is a data structure in which one element points towards the next element,1, 16630,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16631,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",list of adt is,0, 16632,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","it is a user defined data structure, made using already existing data structure.",, 16633,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element","ADT- Stands for Auto Defining Tool, it defines the further list on its own.",0, 16634,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16635,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT's have data stored in non-continious form . These contain nodes and nodes are connected to each other and nodes contain the address of other node.,2.5, 16636,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16637,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",data stored in list ,1, 16638,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16639,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16640,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16641,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",it is an abstract data structure which is a user defined data structure made using existing data structure to fit the requirements of the user.,1, 16642,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16643,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16644,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16645,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",List ADT is an ADT in which all elements have pointer to first element.,0, 16646,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16647,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",linear data structure in which data is stored in uncontinous fashion,1, 16648,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16649,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16650,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16651,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",Not known,0, 16652,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16653,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16654,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",An abstract data type which is defined by its behavior from the point of view of a user of the data,1, 16655,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16656,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16657,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",list in adt is a queue in which all element s are stored,0, 16658,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",An ADT List can be defined by an user by giving set of operations can be dynamic.,0, 16659,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",user defined data structure in which we use lists,0, 16660,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16661,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16662,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",A List ADT or List Abstract Data Structure is an implementation of the List data structure which only provides the developer with the necessary functions and attributes to use the list but the developer is unaware about how the list is implemented internally,2.5, 16663,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16664,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16665,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16666,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",lists which have values and names\neg. classes,0, 16667,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",the list of adt is like contain the roll no name etc,0, 16668,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16669,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",list is having name and value\nlike \,0, 16670,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",,0, 16671,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",list is data structure in which memory is stored in a node and connected from another node .and their is starting node and an ending node ,1, 16672,Define List ADT,"A list is a sequence of zero or more elements of a giventype. The list is represented assequence of elements separated by comma. A1, A2, A3…..AN Where N>0 and A is of type element",automata daste theorem,0, 16673, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,The type of linked list in which the tail of the last node is linked to the first node(head) is referred to as a circular lionked list.,2.5, 16674, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,when the head of a linked list is connected with the tail of it it is called as circular linked list,2.5, 16675, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,in circular linked list the head of the first node is conencted to the tail of the last node ,2.5, 16676, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is like a normal linked list but the the tail of the last element is connected with the head of the first element,2.5, 16677, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular Linked List is a LL in which the last node of the list instead of pointing to null points to the head of the LL. ,2.5, 16678, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular Linked List is a linked list data structure where its head is connected to its tail part.,2.5, 16679, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a circular linked list is the variation of linked list in which first element points to the last element and the last element points to the right element. Both singly linked list and doubly linked list can be made into a circular linked list.,2.5, 16680, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,In circular linked list the right of the last element of the linked list is the first element of the linked list,2.5, 16681, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular link is a link list whose end node is linked with the starting node means there is no start or end of the circular link list.,2.5, 16682, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"the circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle.",2.5, 16683, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A list in which the first and last node are also connected with each other is called the circular linked list. ,2.5, 16684, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular list is the list that is connected in a way that the last node address is stored in the first node.,2.5, 16685, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is the data structure which stores the information in nodes form which are connected to each other and in this the last node is connected to its parent node forming a CIRCLE.,2.5, 16686, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"A circular linked list is the one in with the initial node (head) carries the details of both previous and next node...the last and first node are also connected , as in we can traverse this format of linked list from both the sides which is different from a doubly or singly linked list where final and initial point are not connected and only way to reach initial node from final node is to traverse the entire length again.",2.5, 16687, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a linked list whose head and tail are interconnected to each other is called a circular linked list.,2.5, 16688, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Special type of linked list where last/tail node stores the address of the head node,2.5, 16689, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a linked list which has the last node of the linked list connected to the first node of the linked list...this way forming a circular loop and hence called circular data structure,2.5, 16690, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,0, 16691, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is link list which connects last element to the first element .here the element can be inserted in between or back of any element.\n,2.5, 16692, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a linked list which connects that node of the last element to the head of the first element.,2.5, 16693, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,0, 16694, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a linear data structure whose first and last node is the same. In other words in a circular linked list the tail element of the list is connected to the head element forming a circle.,2.5, 16695, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a linked list in which the node of last element is connected to the node of first element. that is the last element node is not null and after traversing through the last element it will again start pointing towards the first element. it forms like the close chain.,2.5, 16696, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,0, 16697, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list tail pointer and it does not have a head pointer or consider it does not have any end as its end index have address of first node in linked list .\n,2.5, 16698, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is when the last element of the list is connected to the first element of the list so we keep traversing in a circle.,2.5, 16699, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"When the leaf node of a linked list points to the root node of the linked list, it is known as a circular linked list.",2.5, 16700, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"When the lead node is of a linked list points to the root node, this is known as a circular linked list.",2.5, 16701, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is a type of linked list whose tail always point to the head of it which is the reason for creation of circular loop.,2.5, 16702, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"In a circular linked list, the last node does not have a null next pointer. It points to the head of the linked list.",2.5, 16703, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,it is a special type of linked list in which the last element is connected to the first element forming a loop that is why it is known as circular linked list,2.5, 16704, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is where the last node store the address of first node. \nexample:\n1-2-3-5-1,2.5, 16705, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is a linear data structure which is same as linked list the only difference is that the tail of linked list connected to the head of linked list which results in circular linked list . ,2.5, 16706, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,The circular linked list is a special case of linked list in which last node of the list is connected to the first node again forms a complete loop and from last node we go back to 1st node is called circular linked list.,2.5, 16707, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked is type of data structure in which last element points to the first element . \nit uses pointer approach . ,2.5, 16708, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"A circular linked list is a modified single linked list in which the last node points to the first node. So, if we traverse a circular linked list then the next element to the last node will be the first element and the linked list will continue again.",2.5, 16709, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is the one in which starting and last element of linked list are linked to each other.,2.5, 16710, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular Linked list is a kind of linked list in which the head and the tail of the linked linked are connected .,2.5, 16711, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,0, 16712, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"A circular linked list is a linked list in which the next pointer points to the first element or the head node, instead of end.",2.5, 16713, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"A linked list, in which the last element has a pointer which points towards the first element making the complete linked list as a circle is known as circular linked list.",2.5, 16714, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Linked list is the kind of data structure where each node has a pointer pointing to its next node or previous node along with its own data. Those linked list where the end node is connected with the root or starting node of to form a complete cycle is called a circular linked list. ,2.5, 16715, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"circular linked list is kind of linked list in which first and last value of the array are same, in other words head and tails of the linked list array are same then the given linked list is called as circular linked list.",2.5, 16716, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,0, 16717, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A connected array where each of the successive array nodes are connected to the next array pointer .This is known as circular linked list.,2.5, 16718, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"A circular linked list is a linked list having a last node whose tail points towards the head of the first node, so as to obtain a linked list which is has its last node linked to the first node.",2.5, 16719, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A Circular Linked List is a type of Linked list where the last node or the tail node is connected to first node or head node.,2.5, 16720, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A linked list in which the tail pointer points the head pointer of the linked list is called a circular linked list.,2.5, 16721, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a linked list in which the first and last nodes are connected.,2.5, 16722, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is a type of linked list in which first and last node of the linked list are connected to each other.,2.5, 16723, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Linked List is a data structure used to store information and is connected using next or tail pointers. Circular Linked List is a type of linked list that is connected like linked list using tail or next pointer but that last node of circular linked list stores the pointer to the first or head node. In this way it forms a loop which is circular. Circular linked list can be single or doubly in terms of connections.,2.5, 16724, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is a type of linked list in which last node of linked list stores the address of the first node of linked list.,2.5, 16725, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"A circular linked list is a type of linked list data structure where the last node points back to the first node, forming a circular loop. This means that the elements of the list are connected in a circular manner rather than in a linear manner, allowing for more efficient traversal and manipulation of the list. Additionally, circular linked lists can be used to implement circular buffers and queues.",2.5, 16726, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circularly linked list is the one where the last element of the linked list instead of being connected to none is connected to the first element of the linked list hence forming a circle.,2.5, 16727, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,It is a linked list in which the last node points to the first node . It is a data structure that can help access the first element after the end of list,2.5, 16728, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is one with the last node points back to the first node resulting in a loop.,2.5, 16729, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,it is a kind of doubly linked list where the head and tail of the lined list is connected and forms a loop like structure.,2.5, 16730, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"Circular linked list is a linked list whose tail is connected to the head. \nAfter traversing the whole linked list, when we get to the tail and then traverse tail->next, we'll get head. ",2.5, 16731, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is a linked list in which the last node points to the first node,2.5, 16732, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is the lined list in which first node is connected with the last node.,2.5, 16733, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,the last node is connected to first node,2.5, 16734, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,It is a linked list in which the terminating node is connected to the begin node too also the neighbors are connected to each other creating it circular linked list,2.5, 16735, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,linked list which end and start are connected with each other is called linked list,2.5, 16736, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a circular linked list is a type of linked list where the last node points to the head of the linked list.,2.5, 16737, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"In a circular linked list each data element points towards both its left and right element , even the leftmost points towards the rightmost as its left present element, and the rightmost points towards the leftmost as its right present element.",2.5, 16738, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,linked list whose first element is linked back to the last,2.5, 16739, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is a type of data structure where the head node of a linked list is connected to the tail of another linked list.,2.5, 16740, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,In the circular linked list the first element of the array is connected to the next element also wth the last element of the array .Hence we can travel last node to the first node .And we can assume the circular linked list is like a circle . ,2.5, 16741, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,it is linked list which is circular in nature in which the first and the last element are connected ,2.5, 16742, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"A circular linked list is a type of linked list where every node in the list can access its previous and next node. Also, the last node in the list points to the first node in the list, hence forming a complete chain, or circle. ",2.5, 16743, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a type of linked list in which the last element of the list is linked to the first element of the list. There is no end to this list.,2.5, 16744, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,linked list in which the first and last element are also linked.\n,2.5, 16745, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a type of linked list in which the tail of the linked list points to the head of the node.,2.5, 16746, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a circular linked list is a list in which the tail of the last element of the list bpoints towards the head of the first element of the list,2.5, 16747, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Linked list where its last element is connected to the first element is called circular linked list.,2.5, 16748, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,In a circular linked list the last element i.e tail/end points to the first element of the list i.e head/start.,2.5, 16749, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a linked list with each of its pointers pointing towards its next node the end node points back to the start node in a circular fashion.,2.5, 16750, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a circular linked list is a list in which the last node of the list in connected to first node of the list to form a circle\nthis is done by pointing the next of the last node to the first node in the list,2.5, 16751, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"The circular linked list is a linked list where all nodes are connected to form a circle. In a circular linked list, the first node and the last node are connected to each other which forms a circle. There is no NULL at the end. ",2.5, 16752, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"a circular linked list is where the head of the list and the tail(last node) are connected with each other, forming a circle. \nit can be of 2 types: \n- singly circular LL (tail points to head)\n- doubly circular LL (tail points to head and head points to tail)",2.5, 16753, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,in the circular linklist ther is head and tail the staring node iscall head and the end node id call tail if they both are connected using the linklist then this is called circular linklist \n,2.5, 16754, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"In a circular linked list, the first node contains the memory of the last node and the last node contains the memory of the first node, so it forms a cycle/loop",2.5, 16755, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,in a circular linked list the last node points to the head node creating a circular list.,2.5, 16756, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"Circular Linked list is a type of linked list in which the last element of the list points back to the first element and the first element points to the last element as well, forming a cycle.",2.5, 16757, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is when tail of the list is connected to the head of the list,2.5, 16758, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a circular linked list is a linked list where the last element is connected to the first element thus last element does not point to NULL.,2.5, 16759, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list has it's end node connected to it's start node providing option for the whole list to be traversed starting from any node. ,2.5, 16760, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular Linked List is the data structure that has ending node connected to the head node of the linked list.,2.5, 16761, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is the linked list where last root node points to the data first node. ,2.5, 16762, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,It is a linked list where first element points to the last element and last element points to the first.,2.5, 16763, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is the doubly linked list in which last and first element are connected.,2.5, 16764, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular Linked List is a link list in which the last node of the link list points to the first element of the link list,2.5, 16765, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"Circular linked list are the linked list in which the next node of last node of our list is the first node our linked list , by which they make a circular linked list. ",2.5, 16766, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,it is a type of double link list where tail's next is head and head's previous is tails.,2.5, 16767, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is a list that circularly moves and that do not have an end point its last node is connect to the first node of the linked list\nit uses in music players,2.5, 16768, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is the one whose last element points to the first element.,2.5, 16769, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circularly linked list is that list where all the list are attached to one another and even the last list is connected to the first list\nend list node is connected to the first node,2.5, 16770, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,0, 16771, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,0, 16772, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a linked list whose last element points to the start element its next element.,2.5, 16773, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,where end of the linked list is connected to the head of linked list.\nin this way while reaching an end of the linked list we move to the first element again as it connected.,1, 16774, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked List is a linked list in which last and start node is connected ,1, 16775, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,when last index of linked list contains the address of the first index then the last value and first value is connected and hence a circular linked list .,1, 16776, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is a linked list where all nodes are connected to form a circle. In circular linked list first node and last node are same.,2, 16777, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,linked list in which last node has the address of the first node or root node.,1, 16778, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,it is type of link list in which end node next represent first node(end->next=head-start) it form in circular \nend node point toward first node,2, 16779, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,The tail of the previous element in double linked list is connected to head of the next element.,2, 16780, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"Circular linked list is a type of linked list which does not have any head or tail, we can start from any position and traverse in the whole linked list. Every node is connected with its next and previous node.",1, 16781, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,the linked list in which the tail of last node of the list is connected to head of some other node.,2, 16782, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is just a singly/doubly linked list with its head and tail being connected with each other.,2, 16783, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is the list in which the last element stores the location of the first element. Basically there is no start or end point in a circular linked list.,2, 16784, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,it is a singly or doubly linked list in which head and tail are joined with each other.,1, 16785, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"Circular linked list have two pointers. i.e. Head and Tail pointer. And the tail is directly connected to the head, creating a circular manner of flow.",2, 16786, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,, 16787, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,last element's next element is the first element.,1, 16788, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,It is a type of linked list where the end of the list is connected to the start of the linked list.,1, 16789, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a non linear data structure having its frond and rear node connected,1, 16790, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,, 16791, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a type of linked list where the next of the terminal node is connected to root node.,1, 16792, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,when the ending node of a linked list points to the first node of the same linked list that is called a circular linked list,1, 16793, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is a type of list in which the last node (tail) is linked to the first node (head) and it is in a form of circle (when we visualize it). ,1, 16794, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a circular linked list is a linked list whose last node's next pointer points to the head of the list.,2, 16795, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is a type of linked list in which we have 2 pointers connected to each i.e one head and one tail ,2, 16796, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A linked list in which starting node and ending node are connected thus giving it a circular behaviour.,1, 16797, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,, 16798, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a type of linked list in which the first and the last nodes are also connected to each other to form a circle.,1, 16799, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a linked list whose front node and last node is also linked by a pointer like all other interconnected nodes and when you reach the end node and try to access the next element you will reach at first node. So it can be a representation of a circle since first and last end is connected or tied together and there is a loop.\n,2, 16800, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,in circular linked list the next pointer of the last node is connected to the starting node so that we can avoid out of bound condition while traversing.,2, 16801, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,we the last element's next node contain the pointer value of first node in a linked list is called circular linked list,2, 16802, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,In circular linked list the last node's next pointer points to the head node making the traversal seem like a circle.,2, 16803, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,, 16804, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,, 16805, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a linked list where the first element has the address of the last element in it's PREVious POINTER and the last element of the list has the address of the first element in it's\nNEXT pointer. It has no ending and is circular in nature.,1, 16806, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"travelrseler, insertion, introduction",1, 16807, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,the linked list in which the elements are arranged in a circular way that are called circular linked list,2, 16808, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is a list which has the tail of the list connected to the head of the list that is the next of the tail is the head of the list.,1, 16809, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is a type of linked list in which the first element of the list is connected to the last element of the same list.,1, 16810, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a list in which the last node of the list has the address of the starting node,1, 16811, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A linked list in which the last element's next pointer points to first element of the list.,1, 16812, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,it is a linked list which is circular in nature as 1 2 3 4 5 1 2 3 4 5(example),1, 16813, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,, 16814, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,in circular linked list the pointer of last node points again back to the first node forming loop.,2, 16815, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is special case of linked list in which the last node points to the starting node.,1, 16816, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is the one in which the last node is connected to the first node thus making it a circle. ,2, 16817, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is a singly/doubly linked list where the next node of the tail node is pointing towards the head node of the Linked List.,2, 16818, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,The last node point to the first node and thus makes the linked list circular.,1, 16819, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a linked list in which its tail and head are same or the tail is pointing to the head.,1, 16820, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Abstract data type LIst is used to store data in form a list.,2, 16821, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is the data structure wherein the last node holds the reference of the first node.,2, 16822, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a type of data structure where the first node is also connected to the last node. That is all the elements are connected in a circular manner. ,1, 16823, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"In circular linked list, the last element points again to the first element instead of pointing to NULL.",1, 16824, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is a linked list where the last node of the list has the address of the first node of the list.,1, 16825, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a circular linked list is a list where the last element is connected to the first element.,1, 16826, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,The circular linked list is the link list whose end node is corrected with its first node and hence we can traverse the entire link list by starting from any node.,1, 16827, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,in a circular linked the last element(tail) of the linked point to first element(head) of the linked list.,1, 16828, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a linked list where the last element of list points to first element as next making a circle like connection.\n,1, 16829, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"it is a type of linked list which has no end ,its last node points to the head of the linked list hence its circular in nature.",1, 16830, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular flow is created as the tail pointer points to the address of the head. ,1, 16831, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,0, 16832, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is a linear data structure in which the tail pointer points to the address of the head. hence creating a circular loop.,1, 16833, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked listis a linked list in which when traverse through linked last and when it ends it starts with the same beggining again,1, 16834, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is in which the last node points to the first. In linked list there are two pointers. One pointing to the address of the data and the other to the address in the memory where the next element is stored. So the Tail pointer will point to the head node. ,2, 16835, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A linked list in which the rear of the last node points to the front of the first node is called circular linked list.,1, 16836, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,in circular linked list the end element of the list is connected to the first element of the list.,1, 16837, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,It is the type of linked list in which the data and address of the last inserted element is connected to the head of first element.,1, 16838, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list are the linked list whose head element is connected with the tail element of the data,1, 16839, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,In circular linked list the first node and the last node are connected to each other forming a circle where from last node ponter ponts to the first node of the linked list. ,1, 16840, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a linked list whose start and end nodes are connected is called a circular linked list,1, 16841, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is a linked list which is also aa doubly linked list the. In doubly linked list the tail of the previous box is connected to the the head of the next box of we can say that tail of previous box is equal to head of the next box. But in circular linked list on thing is extra that makes it more special that is the tail of the last box of the linked list is connected to the head of the first box of the linked list,2, 16842, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,0, 16843, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a list where the end of the list is connected to the start of the linked list.\n,1, 16844, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,The circular linked list is a type of data structure in which the tail node and head node of first and last linklist are connected to each other,1, 16845, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is the linked list which has no specific starting or end nodes and here the last node is connected to the first node.,1, 16846, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a linked list in which the tail node is connected to the head node in a circular fashion it is called a circular linked list,1, 16847, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is the one in which the next of the end node is connected to the first node.,1, 16848, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A linked list which connects last element with the first element is called circular linked list,1, 16849, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list a doubly linked list in which the a cycle is formed between the nodes . That is the next pointer of the last node is linked to the 1 st node and the previous pointer of the 1 st node is linked to the last.,2, 16850, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,linked list in which nodes are connected in a circular manner. in which starting node and final node are connected.,1, 16851, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a linked list where the last node is connected to the head or the starting node forming a circle is called as a circular linked list. it can be single as well as double,1, 16852, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is a kind of list in which the last element contains the pointer to its head element.,1, 16853, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list have no head nor tail. It is visits each node in the circular manner and it never ends.,1, 16854, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linkedlist a linkedlist in which every node is connected to its cosecutive one and also last node is connect to its first node.,1, 16855, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a regular linked list except that the last element is also connected to the first element.,1, 16856, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a linked list in which the pointer of tail node points to the head node\nno node in circular linkedlist points to null,1, 16857, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular Linked list is the Linked list in which last node is connected to root node of linked list ,1, 16858, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is based on the concept of linked list only and main difference is that in this last node is connected to the first node and the whole concept of linked list is same that every node is connected to other node,2, 16859, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,It is a type of data structure that is used to store values in a list based form which was developed very early on Ada lovelace,1, 16860, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular Linked List is a type of Linked list in which the first element points to the last element and the last element points to the first element. Both singly Linked List and doubly Linked List can be made into a circular linked list.,2, 16861, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"The Linked List data structure in which the ending point has the pointer address to the starting point. So when we try to traverse, it develops a circular pattern.",1, 16862, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a data structure similar as linked list in which the next pointer of the last node pointing to the head of the linked list.,1, 16863, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is a modification of linked list in which last element is connected to starting node and each node have two pointers which points previous and next element of linked list.,1, 16864, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,The linked list wherein the first and the last elements are connected is called a circular linked list.,1, 16865, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,It is a type of linked list in which the last node is connected to the starting node forming a circle.,1, 16866, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular Linked-list can be defined in two ways:\nA singly linked linked-list whose \,1, 16867, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is a linked list in which the last node is having the address of the first node instead of null in its next pointer.,1, 16868, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,when the end node is linked to the first node forming a circle it is known as circular linked list,1, 16869, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,0, 16870, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,in circular linked list the last node is connected to the starting or first node.,1, 16871, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a type of linked list in which the end node is connected to the first node i.e. last node stores the address of the first node.,1, 16872, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"it a type of data structure ,modified linked list which stores the address of both the previous element as well as the next element.What makes it circular is the fact that the last element/node /link stores the address of the first element in next element's address and the first element/node /link stores the address of the last element in the previous element's address.",2.5, 16873, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"In circular linked list, the last node of a linked list points towards the first element of that linked list. ",2.5, 16874, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,In circular linked list the last element of linear linked list is connected to the head of the linear linked list.,2.5, 16875, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,In circular linked list the last node of the linked list is connect with the head of the linked list that means no permanent head for the circular linked list.,2.5, 16876, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a linked list where the last node's next points to the head node's previous pointer.,2.5, 16877, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A linked list where last node points towards the first node.,2.5, 16878, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"circular linked list is the linked list in which the element after the last element is the first element, like a loop",2.5, 16879, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular Linked list has its last pointer pointing the to the head of the linked list . Due to which on iteration of linked list it forms loop.,2.5, 16880, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,there are 3 types of linked list circular linked list is one of them in which we can traverse through nodes in a circular path ,2, 16881, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,0, 16882, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Linked list whose head points to the tail node instead of NULL.,1, 16883, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is one of a type of linked lists whose next pointer of the last node is connected to the head pointer. It is a totally connected linked list in which all the nodes are mutually connected to each other.,2.5, 16884, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a circular linked list is a linked list in which the last node has the next index of first node,2, 16885, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,it is a linked list in which tail nodes next is head node,2.5, 16886, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list a type of linked list data structure in which a cycle gets formed due to the connection between the pointers of first and the last node of a linear linked list.,2.5, 16887, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular Linked List is one of the type of Linked List where the tail-node next pointer is linked with the head of the linked list. It can also be of two types Singly-Linked List or Doubly Linked list.,2, 16888, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,linked list in which head pointer to null pointer null is the head pointer of the other ,0, 16889, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,It is a linked list in which the address pointer of the last node stores the address of first node.,2.5, 16890, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,in a circular linked list the node of the last is pointing to the data of the first,2.5, 16891, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is collection of nodes in circular manner ,0, 16892, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,linked list in which last node is linked to the first node of the list ,2, 16893, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is such a linked list in which the tail of the last node points to head of the first node and it moves circularly.,2.5, 16894, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular Linked List is a type of Linear Data Structure in which pointer from the leaf node is connected to the root node and vice versa.,2.5, 16895, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list is defined as the linked list where our linked list moved in circular ring ,2, 16896, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list a normal linked list but starting node can be accessed from the last node and vice versa,2.5, 16897, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Linked list where all the nodes are connected to left as well as their right counterparts and the first node's left node would be the last node and the last node's right node would be the left node is called circular linked list.,1, 16898, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is list in which the last pointer of linked list is pointing the first element of linked list,2.5, 16899, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,,0, 16900, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list., A circular linked list is linked in which the ending point(null node is co0nnected to the starting point(head node),2, 16901, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,linked list in which all child nodes are connected ,0, 16902, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"In a circular linked list, its last pointer will point towards its first node.",2.5, 16903, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A linked list in which there is no end pointer and every pointer is connected to a list,0, 16904, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,first pointer of element connected to last pointer of element in list is called circular linked list,2, 16905, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is a type of list which have the same starting and ending point.,2, 16906, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,A circular linked list is a set of nodes pointing to each other and the last node points to the first node .,2.5, 16907, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,Circular linked list are connected linked list from head and body by other linked list,0, 16908, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,it is the one in which address of last node of single linked list is again connected to the previous address of first node and a ;loop is made .,2.5, 16909, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"the linked list in (which it has 2 nodes first to store data of elements and second is to store address the next elements ) in a circular way , in which last elemnt can be first or first can be last",2, 16910, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,"In a circular linked list, the pointer of the last node points at the address of the first node.",2.5, 16911, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular liked list is the method of interesting a data in the form of LinkedList into a database ,0, 16912, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,a linked list which is connected end to end toi its start and end points,0, 16913, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list., =122;,0, 16914, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is the implementation of data.,0, 16915, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,the linked list in which ending node is connected to starting node and which creates a loop ,2, 16916, What is a circular linked list?,A circular linked list is a special type of linked list thatsupports traversing from the endof the list to the beginning by making the last node point back tothe head of the list.,circular linked list is the linked list in which the last node is again connected to the first node and it make a loop eventualy.,2.5, 16917,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16918,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,we can define structure for implementing stack in C\nBy list we can implement stack\nby linked list we can implement stack\n,2.5, 16919,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16920,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Stack can be implemented using two data structures: \n1) Array\n2) Linked List,2.5, 16921,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"we can use array, Linked List.",2.5, 16922,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"Stacks can be implement using array , linked list or many more",2.5, 16923,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16924,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Methods to implement stack in C are :-\n.Through array \n.Through linked list,2.5, 16925,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Stack can be implemented through array as well as link list.,2.5, 16926,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16927,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,methods are as follows-\n1. push() to push the value in stack\n2. pop() to pop out the value from the stack\n3. is empty () to check stack is empty or not \n4. is full () to check stack is full or not \n,2, 16928,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,we can use linked list to get the implementation of stack . \nBy making the function that make have the properties of stack using linked list.,2.5, 16929,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"In stack we store the store the data in FIFO form , so if we have put a data first it will be last to come out.",2.5, 16930,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16931,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,methods to implement stack in c are :\n- through array\n- through linked lists\n,2.5, 16932,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"- create array[capacity]\n- maintain variable like size = 0, front = 0;\n- insert at front position and then size++, front++;\n- deletion can be done at one front position, then size--, front--;",2.5, 16933,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16934,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"It is a kind of Linked list in which the head and the tail of the linked is same. There is no different head and tail of it.\nHence, it is known as circular linked list.",2.5, 16935,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"stack can b implemented using a queue, vector ,array values are first stored in the array, queue than push/pull operation is done.",2.5, 16936,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16937,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16938,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"Stack can be implemented in C by using the malloc() function , this will be donr by dynamically using an array. AnD A top pointer will be used for directing to the top element of the stack. The size of the stack can be same as the size of an array. We can enter the elements of the stack by using push() function and a stack follows the LIFO behaviour that is last in and first out.",2.5, 16939,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16940,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"Circular linked list is a special linked list in which the tail of the last node of list points to the head of the same list, forming a closed chain. ",2.5, 16941,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stack can be implemented using functions and array data structure.\nmethods: \n,2.5, 16942,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"We can implement stack using array or linked list. We will have to make the functions to add, pop and find the top element in the stack.",2, 16943,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Stack can be implemented using arrays or linked lists.,2.5, 16944,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,We can use STL using vector to implement stacks in C/C++.\nWe can also use arrays and linked lists and implement stacks with the help of different friend functions.,2.5, 16945,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16946,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"pop(), insert(), top(): built-in methods.\nWithout STL, an array can be used where elements are inserted from the front and the rest are shifted to the right, elements are deleted from the front and the rest are shifted to left.\n",2, 16947,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16948,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,1) we make an array.\n2) we start placing the element in it that is start taking the initial index of an array.\n3) the first inserted element will come out of the stack in last.\n,2.5, 16949,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"methods to implement stack in C are:-\nimplement stack using array, and its functions such as s.top(),s.push,etc can be perfomed using array by defining different functions .",2.5, 16950,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,To implement stacks in the ,1, 16951,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16952,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16953,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,methods to implement stack are:\n,1, 16954,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,First we have to implement a header file #include\nthem can iteratively implement stack or through STL we can.\nStack performs LIFO operation . LAST IN FIRST OUT.\nWe can make the stack and then insert the elements in order.,1, 16955,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16956,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"Stacks can be implemented using array or linked lists. We can construct our own functions for performing the various operations on them like insertion, deletion, etc.\nor we can also use the built in functions using stl libraries by including them.",2.5, 16957,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"In C, stack can be implemented using a class. We can make a class which stores data in form of array or linked list. We can make our own functions for the insertion, deletion and searching in the class. Insertion with take place at the end node. Deletion will take place by removing the first element and then shifting others. And searching can be done by using any of the relevant search algorithms.",2.5, 16958,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"To implement a stack in c we can use an array or linked list and define insertion ,view and delete operations. we can store the index of the latest entry and upon insertion insert value at index+1 , or while retrieval access the maximum index element as it would be the latest or while deletion free the space occupied by the latest index.",2.5, 16959,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,by using the appropriate declaration.,2.5, 16960,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,A circular linked list is one in which the last element is linked to the first element (like a snake biting its own tail),2.5, 16961,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,There are different methods to implement stacks in C like;\n(i)Using STL\n(ii)Using Vectors,1, 16962,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Methods to implement stack in C is by using the inbuilt stack library of STL called as the header file and then use the inbuilt functions called push pop and top.,1, 16963,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Methods to implement stack in C are:\n1) Array\n2) Built in STL library ,2.5, 16964,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,One of the method to implement stack in C is by using a double dimension array (2D - array).,2.5, 16965,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,We can use an array to implement stack in C.,2, 16966,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Stack can be implemented using arrays.,2, 16967,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Stack can be implemented using push and pop operations in C. Push is used to add elements in the stack whereas pop is used to remove or delete elements from stack. Ex: push(4) etc,2.5, 16968,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,There are two methods to implement stack in c:\n1. using array\n2. using linked list,2.5, 16969,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"There are several ways to implement a stack in C, including:\n\n1. Using an array\n\n2. Using a linked list\n\n3. Using a dynamic array\n\n4. Using the standard library",2.5, 16970,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,We can use struct for implementing stack in c or simply use and array the same as in cpp and enforce the functions for the array throughout the code to follow the functions for the stack.,2.5, 16971,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Stack can be implement in C using two queues and STL,2.5, 16972,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,WE can use an array and assign function to it such that in takes and deletes data in a manner similar to stack.,2, 16973,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,we can use stack function or it can be implemented with the help of 2 queues an many more,2, 16974,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"To implement stack in C, we can form a struct and then implementing each operation to it.",1, 16975,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"Arrays, vectors, linked list can be used to implement stack. It would have insert/push, delete/pop, top functions",2.5, 16976,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,1)Linked list\n2)array,2.5, 16977,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,using array or using linked list \n,2.5, 16978,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Vector \n,1, 16979,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,by creating function to implement stack in c.,2.5, 16980,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,a stack can be implemented either by using a array or by using a linked list,2.5, 16981,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"push, pop, isempty, top",1, 16982,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"stack in C can be implemented in many ways, using arrays is the easiest one",2.5, 16983,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,LIFO(Last in first out),1, 16984,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,lLIFO METHOD IS USED TO IMPLEMENT THE STACK IN C AND THEE OPERATIONS IS INSERTION UPDATION AND DELETION.,2.5, 16985,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,it can be implemented using array or linked list.,2.5, 16986,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"Stacks can be implemented using arrays, linked list or STL in C.",2.5, 16987,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Stack can be implemented in C using STL as well as array.,2.5, 16988,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 16989,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Stack can be implemented using \n1.array\n2. linked list \n,2.5, 16990,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,push : Adds an element to the top of the stack.\npop : Removes the topmost element from the stack.\nisEmpty : Checks whether the stack is empty.\nisFull : Checks whether the stack is full.\ntop : Displays the topmost element of the stack.,2.5, 16991,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,we can implement stack using arrays and can push values in the array.,2.5, 16992,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Linked list and vectors help to implement stack in C.,2.5, 16993,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,there is a stack header available in std library otherwise a simple stack can also be implemented using an array.,2.5, 16994,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"methods to implement stack in c is by\n1 importing the stack class from the package \n2, defining the stack functionality by array and making methods to perform the operations each time maintaining the stack LIFO property",2.5, 16995,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Methods are:\n1. Push(): Insert a new element into the stack i.e just insert a new element at the beginning of the linked list.\n2. Pop(): Return the top element of the Stack i.e simply delete the first element from the linked list.\n3. Peek(): Return the top element.\n4. Display(): Print all elements in Stack.,2.5, 16996,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"we can implement stacks using queue,",2.5, 16997,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,FOR implementing the stack we use last in first out so that we can searchg out with depth wise way ,2.5, 16998,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,1. Use the Standard Template Library\n2. To create a Class in which the methods perform the functions of the stack,1, 16999,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"#include\npush(),pop(),top(),",2.5, 17000,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Methods to implement stack in C are:\n,1, 17001,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,methods to implement stack are array and linked list,2.5, 17002,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,s.push() s. pop() ,2.5, 17003,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,1)using arrays\n2)using linked lists,2.5, 17004,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Array,2.5, 17005,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"Push , Pop, are the methods to implement stack in C .",2.5, 17006,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,push- Add an element to the top of stack.\npop- Remove the topmost element from stack.\ntop- display the topmost element.,2.5, 17007,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,we can implement stack using STL and array.,2.5, 17008,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Array \nSTL,2, 17009,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,The way we can implement stack in C are by using vectors and by implementing each function for Stack to be performed. ,1, 17010,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"array, STL",2, 17011,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17012,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Stack can be implemented using:-\n1. Arrays\n2. Linked lists,2.5, 17013,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stack can be implemented using linked list,2.5, 17014,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Circular list is a list in which the last node contains the address of the first node or head node. ,2.5, 17015,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,In circular linked list last node is connected with start node,2.5, 17016,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17017,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"using linked list we can implement stacks, creating a structured class and make node calling parameters\nto implement stacks",1, 17018,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,->by array\n->by Stack,1, 17019,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,, 17020,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,The methods to implement stack in C are:\n1- push\n2- pop\n3- isEmpty\n4- isFull\n5- top,2, 17021,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,, 17022,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,push\npop\nisEmpty\nisFull \ntop ,2, 17023,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Inbuilt libraries can be used to implement stack. \n#include\nCreate array where you empty out first index element of array.\n,1, 17024,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,, 17025,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stack can be implemented in C using array,1, 17026,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,1)Using array\n2)Using node,2, 17027,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"Methods to implement stack in C are: make a structure and define the functions which we want to implement on the stack. eg sort, push, pop etc. and then use them.",2, 17028,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,, 17029,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Using inbuilt libraries is one of the efficient ways to implement stack in C. Linked List/Arrays can be another efficient means to create stacks if we don't wish to use inbuilt libraries.,1, 17030,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Linked list in which the last node is refering to its first node,2, 17031,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,an array can be declared with capacity C. we maintain top variable to look for the top element. limit is checked if number of the elements in the array crosses C.,1, 17032,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"stack can be implemented by array or linked list. the operations used will be push, pop, search etc.",1, 17033,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stack can be implemented using-\narrays\nlinked lists\nheader file of stack class,1, 17034,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,In circular linked list the first node is connected to the tail node due to which each node is connected to its next node which forms a circle.,2, 17035,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Using STL or creating your own class.,1, 17036,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,push() \npop() \ntop()\nisEmpty()\nsize(),2, 17037,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"Stack can be implemented by three methods:\n\n1. Using STL\n2. Using an array - We make a class 'node' and initialize an array, data and a top element index which is initially -1. Then using constructor, we take values in data and dynamically make an array. Then we write functions for finding the top element, popping out the element, finding the size etc.\n3. Using Linked List - Same procedure as above but rather an array we make a linked list.",2, 17038,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stack can be implemented by making a class of it or can directly use the library # include,2, 17039,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Using 2-D Array\n,2, 17040,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,, 17041,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"we can perform basic mathematical operations directly on ADT, like + - * /\nalso they act as a basic building block for the advanced data structures.",2, 17042,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,, 17043,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,, 17044,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,we can use STL or define struct or our own class and write our own code for generating and implementing a stack.,1, 17045,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"To implement stack we need to create function like top ,insert, delete and create array on which we can apply these functions",1, 17046,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,There are two methods to implement stack by array :-\n1) FILO - First element is the the last to be popped out\n2) LIFO - Last element is the first to be popped out,1, 17047,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,A circular linked list is the data structure in which the tail of the list contains the address of the head or there is no head or tail.,2, 17048,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,\n,1, 17049,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"stacks can be implemented using stl vectors or arrays and also linked lists and using the functions like top,pop, push ton store and input data in them.",1, 17050,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"recursive function, infinix to postfix",1, 17051,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,, 17052,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Stack can be implemented in C using an array where the first empty index of the array is stored and elements are inserted at that index and then the index is incremented. When popping we can decrement that stored index so that the value to be deleted will be overwritten by the next pushed element.,2, 17053,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,push and pop,1, 17054,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,The method to implement stack are \npush()\npop()\nisEmpty(),1, 17055,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Stack is implemented using array or linked list in C.,2, 17056,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,, 17057,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,in circular linked list the first element is connected to the last element as well thus making a circle or a ring.,1, 17058,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stl that is standard template libraries,1, 17059,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"using arrays , vectors or linked list stack can be implemented in C . \n",1, 17060,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"We can use an struct, create an array and define all the functions that we will be needing like push, pop, etc",2, 17061,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,, 17062,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,We push and pull elements in stack to create a stack like the name of stack is s then s.push() and s.pull()..,2, 17063,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,1. linked list\n2. array\n3. STL(standard template library),2, 17064,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,circular linked list refers to linked list whose last node's address is stored in first node.,2, 17065,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,two methods can be used: \none -> array\ntwo-> list,2, 17066,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Stack can be implemented using arrays. ,2, 17067,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17068,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,recursion can be used as it uses stack. \nAlso array can be used just we have to keep in mind that only the top of it can be accessed at any point.,1, 17069,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stack can be implemented to carry out arthimatic operations or to decide the order of certain things.,1, 17070,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"We can implement the stack by creating different function for push, pop, insert, delete, top using the aray or linked list data structure.",2, 17071,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,1) Linked List\n2) Vectors,1, 17072,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"To implement stack in C , we can use struct and implement stack ourselves by defining its functions\nor we can use inbuilt STL and include stack.",1, 17073,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,we can implement stack in c by pop or push function in the stack.,1, 17074,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Methods to implement stack in C,1, 17075,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,A circular linked list is a linked list in which the \,1, 17076,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"To implement stack in C, we can use stuck or class to create Stack class and have two data members one to store data and the other to point at the next data value.",1, 17077,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stack in c is implemented with LIFO (LAST IN FIRST OUT) method ,1, 17078,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"Methods to implement stack are using arrays, using queue, and double ended queue. ",1, 17079,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,To implement stack we can either use stl and use stack<> vector \nor we can create a pop function with the following method\nvoid pop(int x)\n{\nif(p== st.length()-1)\nreturn;\nelse\nst[p]=x;\n},1, 17080,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stack can be implemented in c using array where the first empty index of the array is stored and element are inserted at their indexes ,2, 17081,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Stack follows last in first out rule so first we push element into it and on the retrieval we pop the element and that element which was added in the end gets retrieve first.,1, 17082,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"There are no predefined library for Stacks in C, that's why there are some ways by which can be implemented using array, by linked list",1, 17083,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,By using push function we can implement stack in c,1, 17084,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,we can implement stack in C using arrays and pointers ,1, 17085,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,methods to implement stack in c are:\na) by creating and using library\nb)by creating array and then storing it in the form of stack\nc)by using vectors ,1, 17086,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17087,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17088,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17089,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"methods to implement stack are:\ninsertion,deletion,isEmpty,size,etc.",1, 17090,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,you can implement a stack using and linked list ,1, 17091,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"inserion, deletion, sorting.",0, 17092,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Linked list\nusing two queues \nusing predefined libraries\n\n,1, 17093,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,There are 2 ways to implement stack.\n1) Using Vector or An array with the condition that the first input in should be the last input out.\n2) Using linked list . ,1, 17094,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,using array or by using linked list,1, 17095,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17096,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"we Can implement stack in C using arrays , linked list etc.",1, 17097,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17098,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,array and linkedlist.,1, 17099,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Method 1: (Stack Implementation in C using Array) .\nMethod 2: (Stack Implementation using Linked List). \n,1, 17100,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"using array,linkedlist,or using queue",1, 17101,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Mainly Two methods are used two implement stack in c that is\narray implementation\nLinked list implementation\n,1, 17102,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"methods of implement stack in C is array ,linked list, queue",1, 17103,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,List ADT is type of structure which stores data in a linear way such that bits can be accessed accordingly ,1, 17104,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"push,pop,top,isEmpty are the methods",0, 17105,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"1. Declare a stack with the correct syntax and name.\n2. push the data into the stack.\n3. perform the required operation.\n4. when complete, you can delete the stack. ",1, 17106,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Methods to implement the stack in C: \n1) Using linked list\n2) Using Array,1, 17107,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,1.Making structure for stack;\n2.Uisng array and fixing insertion and deletion operations.,1, 17108,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Methods to implement stack in C:\nUsing linked list\nUsing array,1, 17109,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Define a structure for stack and use array to make it.,1, 17110,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based, pointer of the last node does connects to the first node instead of connecting to NULL.\nA doubly linked list whose \,1, 17111,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,in c stack can be implemented using linked list,1, 17112,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,methods:-\nSTL\npop and push,1, 17113,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,obtained from primitive data type.,0, 17114,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,it can be implemented using linked list in which when we push the element it is connected to the end and when we pop the element the end element is deleted.\nit can also be implemented by using dynamic array.,1, 17115,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,A stack in C can be implemented by creating a linked list where the first node is the top node of the stack. It stores address of the next node.,1, 17116,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"we can implement stack using a linked list using a pointer which stores the address of the data inserted most recently, which will help to use it to perform all the operations like insertion/deletion must be done on that element(element inserted most recently). or we can implement stack using a array using a pointer which stores the address of the data inserted most recently.",2, 17117,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17118,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,To implement stack in c first we have to make a dynamic array and make a integer variable .In between filling array add one in variable .if we have to remove an element then we will remove the element on location of variable and minus one in variable.,2, 17119,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17120,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"we can use STL, or an array to work as a stack by assigning value to a variable referring the top of the stack and changing it accordingly",1, 17121,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,We store data in the stack and pops out its element according to our need.,0, 17122,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stack can be implemented either through array or through linked list,2.5, 17123,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17124,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,methods to implement stack in c:,0, 17125,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17126,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,Using STL: stackst;\n\nOr doing it manualy by creating a push (a function to insert a data) pop (function to remove data) function for an array.,1, 17127,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"The methods to implement stack in c are by making a push function that can push data , pop function which can remove a data, is full function whicjh can check whether the stack is full or not and is empty which can check whetger the stack is empty or not.",1, 17128,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17129,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,array \nlinked list,2.5, 17130,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17131,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,We maintain a next-Index pointer over the array(stack) to insert or delete elements. Whenever next-Index moves out of range it moves back to start or end if some position are left to fill in the array to optimize space. These extra spaces are left due to pop operation performed.,1, 17132,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17133,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,1. Linked list\n2.Arrays,2.5, 17134,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stack can be implemented using a list ,2, 17135,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17136,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,make a stack like we used to make class \nto insert the element write push( )\nand to remove the element pop( ),0, 17137,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,1;- Using array.\n2:- Using linked list\n3;- Using Queue,2.5, 17138,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,to implement stack in C language first we need to push the elements into the stack and then pop the elements one by one until the stack is empty.,1, 17139,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,method to implement stack by linked list by top to bottom approach.,2, 17140,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17141,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,We can implement stack in C in the form of array and linked list both.,2.5, 17142,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stack is implemented by FIFO method that is first in first out which means that element is which is inserted first will be coming out first,1, 17143,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17144,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17145,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,either using stack [ ] or intstack_name intstack_name,1, 17146,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17147,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,we first import required libraries for stack command and then create an array and ,0, 17148,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,element added by first come basis then push pop functioins are implemented accordingly,0, 17149,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17150,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,We can implement stack in C using Arrays and structs in C,0, 17151,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,,0, 17152,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,push pop\nis empty\nis full,0, 17153,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,insertion \ndeletion ,0, 17154,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,#include \nstack q;\npush(q) = 1;,0, 17155,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,for implementation of stack in c we have to import the library and then create a valuable for the stack and give that a valid and then out stack is implement in c,0, 17156,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,In the form of \n1) array and \n2) linked list,2.5, 17157,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stating of linked list connect to end of linked list it form like circular,0, 17158,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,queue.,0, 17159,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,stack could be used for many applications like in deletion and insertion in linked list ,0, 17160,What are the methods to implement stack in C?,The methods to implement stacks are: (1) Array based (2) Linked list based,"methods to implement stack in c is bucket sort, ",0, 17161, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Queue in which insertion and deletion can be done from both ends.,2.5, 17162, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,when the insertion and deletion can takes place from either side of the queue it is called as double ended queue ,2.5, 17163, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,it allows insertion and deletion on both side of the queue ,2.5, 17164, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is a structure in which insertion and deletion can be done using any end but it still follows FIFO methodology of a queue,2.5, 17165, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,It is a type of queue in which elements can dequeue from both sides of the queue.,2.5, 17166, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is a queue where we can traverse from both sides like front to end and end to front.,2.5, 17167, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A dequeue or double ended queue is a type of queue in which insertion and removal of elements can either be performed from the front or the rear. Thus it does not follow FIFO rule. ,2.5, 17168, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,In double ended queue we can insert or delete any element from the front as well as from the end of the queue.,2.5, 17169, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue can insert or delete elements from both the sides that is start and end .,2.5, 17170, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends.,2.5, 17171, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17172, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is the form of queue that has the property to get the elements from both the sides of the queue.,2.5, 17173, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is a which performs the queue operation twice and forms a chain .,2.5, 17174, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue is the data structure of queue format in which we can push and pop data from either ends given that it follows FIFO.,2.5, 17175, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,queues where the element can be inserted and deleted from both the ends are called double ended queues\nthat is the first and the last element entered both can be deleted as per the choice similarly for insertion the element can be inserted at the first as well as the last index.,2.5, 17176, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17177, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue has two nodes: one points to the previous node and other points to the next code\n\nThis way we can traverse the queue,2.5, 17178, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17179, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,doubly ended queue is the queue in which elements can be inserted and extracted from starting as well as end.,2.5, 17180, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is a linear data structure(a type of queue) in which the element can be popped out from both ends.,2.5, 17181, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,In a circular linked list the tail element of a linked list is connected to the head element forming a circle so instead of a linear linked list we get a circular linked list,2.5, 17182, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,it is an abstract data type that generalizes a queue for which elements can be added or removed from either the front or the back. it is also called haid-tail linked list. ,2.5, 17183, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17184, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"stack can be implemented using different data structures in C. It can be implemented with array, linked lists, disjoint sets and also by STL. ",1, 17185, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queues are also known as,1, 17186, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is when we can traverse the queue from both the ends.,2, 17187, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,When the queue's elements can be pushed or poped from both the directions is called a double ended queue.,2, 17188, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Queues in which data can be pushed and popped in both the directions ( in back and forward directions).,2, 17189, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue are those queue in which data can be pushed and popped from both direction from front as well as back.,2, 17190, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue means the queues that have two ends. Elements can be inserted from 2 ends.,2, 17191, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,doubled ended queue are the queue in which data can be pushed or popped from both the directions that is from front as well as back,2, 17192, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17193, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17194, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue are the queues in which data can be popped and pushed from top as well as bottom depending on the situation.,2, 17195, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17196, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue is a version of queue in which we can add or remove nodes from either start or end.,2, 17197, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,In double ended queue elements can be added and removed from both the sides.,2, 17198, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,The kind of queue which can be able to perform operation from both start or end is called double ended queue.,2, 17199, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A circular linked list is a linked list in which the last element is connected to the head of the list instead of NULL.,2.5, 17200, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"a double ended queue can be accessed from both the sides i.e, front and back.",2, 17201, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"A queue which can be traversed from both the ends, front and back is known as a double ended queue. All the operations can be performed on the either side.",2, 17202, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"Double ended queue refers to those queue data structure that can perform (FIFO) first in first out operation from both sides, that is for left side as latest element it will retrieve the rightmost element considering it to be the first and vice versa.",2, 17203, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"In double ended queue, you can perform actions like push and pop from both the sides of the queue making it more flexible and less complex to perform the sorting methods.",2, 17204, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Methods to implement stack in C:\n-FIFO\n-\n,2, 17205, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A queue where the last element of one array can be made the first element of another array is known as double ended queue.,2, 17206, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is a data structure where the first and last pointer nodes are pointing to the null.,1, 17207, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A queue in which value can be inserted and extracted from the first or from the last.,2, 17208, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"A double ended queue is a type of queue data structure which has two ends, unlike the one with just one end.\n",2, 17209, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is a queue in which you can access elements from both sides of the queue.,2, 17210, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,The type of queue in which we can access the elements from both the sides are known as double ended queue.,2, 17211, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queues are defined as queues that can store and delete data from both the ends of the queue.,2, 17212, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,It is a type of queue in which there are to sides to remove an element ,2, 17213, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"A double-ended queue, also known as a deque, is an abstract data type that allows insertion and deletion of elements at both ends. It can be visualized as a linear structure with front and rear pointers, enabling efficient operations such as push, pop, inject, and eject. Deques can be implemented using arrays or linked lists.",2, 17214, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,In a double ended queue is where we have each element being linked to the previous as well as the next element instead of being linked to only next element as in linked list.,2, 17215, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,In double ended queue the values can be accessed both backwards and forwards it contains pointers pointing in both directions.,2, 17216, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue is one in which insertion and deletion can be done from both ends,2, 17217, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,it is a kind of queue where the values can be inputted or obtained from both ends unlike the normal queue where single side is used to input the value and the other to get or print the value,2, 17218, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is a queue which helps you to insert an element from one side and delete from another and vice versa.\n,2, 17219, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,In double ended queue elements can be accessed from both the front and the back,2.5, 17220, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue is a queue in which elements can come out from either first or last node.,2.5, 17221, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,elements can be add/remove from front/back,2.5, 17222, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,it is where insertion and deletion can be done from both ends,2.5, 17223, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue where we can insert and pop from front and back side of queue ,2.5, 17224, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,queue in which we can insert and remove from both sides ,2, 17225, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A data structure in which insertion or deletion can be done either from the front or rear of it.,2, 17226, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,a queue which can input values from both ends,2, 17227, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17228, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Qeque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends.,2.5, 17229, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17230, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue is one in which deletion and insertion can be performed from both ends of the queue.,2.5, 17231, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17232, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queues are basically quequ in which we can insert from front and back.\n,2.5, 17233, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue is a type of queue on which we can perform FIFO operations on either side.,2.5, 17234, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"The deque stands for Double Ended Queue. Deque is a linear data structure where the insertion and deletion operations are performed from both ends that is we can insert or delete data from both ways,either the tail or the head.",2.5, 17235, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17236, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is a special queue where insertion and deletion is possible over both ends of a queue.,2.5, 17237, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"A double ended queue is a queue that has two different methods to be traversed either from the start pointer to the end or the end pointer to the start, either way it is an implementation of a queue following FIFO ( first in first out ).",2.5, 17238, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,the double ended queue is a queue in which we can access the queue elements from the front and the back of the queue.\nthere are two ends to take the elements from \ncontrasting from normal queue where elements can be accessed from the front only hence double ended queue,2.5, 17239, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double Ended Queue is a Queue data structure in which the insertion and deletion operations are performed at both the ends (front and rear). We can insert at both front and rear positions and can delete from both front and rear positions.,2.5, 17240, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,it is a type of queue which allows us to add and delete data from both ends of the queue.,2.5, 17241, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17242, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,-,0, 17243, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A 2-d queue,2.5, 17244, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"a double ended queue is an abstract data type that generalizes a queue, for which elements can be added or removed from either the front or the back of the queue.",2.5, 17245, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue is we can traverse the queue from the head or tail n we find the queue,2.5, 17246, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,a double ended queue has insertion deletion from both ends,2.5, 17247, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue provides option to perform first in first out operation from both ends of queue start or end.,2.5, 17248, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17249, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,insertion and deletion of an element performed from front and near. ,2.5, 17250, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Queue where insertion and removal of element can either be performed from front or rear.,2.5, 17251, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue is the queue in which element can be taken out from both ends.,2.5, 17252, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is a queue in which the insertions and deletions take place from both the ends of the queue,2.5, 17253, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17254, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,a queue in which insersion and deletion can occur from both side.,2.5, 17255, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,it is queue in which we can insert either from beginning or from LAST,2.5, 17256, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A queue with two ends is a doubled ended queue.,2.5, 17257, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue is that queue where element can be removed from both side eider from the top or from the bottom,2.5, 17258, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,We can implement stack in C using array and pointers.,2.5, 17259, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Stack can be implemented by using array,2.5, 17260, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue is a type of queue in which elements can be inserted and popped out of both the starting or the end of the given queue.,2.5, 17261, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,where we can access the elements on BOTH THE SIDES using some operations,1, 17262, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"It is type of queue in which we have access to both the ends of list to do operations like insertion ,deletion , updating\nthe data ",1, 17263, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,possible to operate from both ends of the queue,2, 17264, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue are the basically the dequeue. Dequeue is a linear data structure where insertion and deletions are performed from both ends.,1, 17265, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,queue which can start or end from from single space.,2, 17266, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end, in this insertion and removal of elements can either be performed from the front or the rear. it does not follow FIFO (First In First Out).,1, 17267, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Elements can be pushed and popped from both ends of the queue.,2, 17268, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,In double ended queue we can insert and retrieve element from both sides (front and rear).,2, 17269, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue are those in which the element can be both pushed and popped from both ends of queue.,2, 17270, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"In doubly ended queue, the insertion and deletion can be done from both the sides",2, 17271, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"Double ended queue is a data structure in which the first and last , both the elements can be accessed. ",2, 17272, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,, 17273, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queues allow operation on data from both ends including insertion and deletion.,2, 17274, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Queue can be operated from both end for all operations,2.5, 17275, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"has both directions i.e,, prev node is connected to next as well as next is connected to prev.",2, 17276, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,In this type of queue the operations of input and output can occur from both sides of the queue.one can input from start as well as end and the same for removing element.,1, 17277, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,a liner data structure in which data can be entered and retrieved from both ends ,1, 17278, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"Stacks can be implemented by creating a struct in C which has functions to push the data and remove the data .And a top element in the struct which has a bool variable which is true for the last element otherwise false , and we can only remove the element which has the top variable as true.",2, 17279, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"A double ended queue is a kind of queue where we can access the elements both at the start and the end, unlike a regular queue where only the first element is accessible.",2, 17280, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is a form of queue which allows to remove and insert data from both the sides i.e. from front and back.\n\n,2, 17281, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17282, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,In double ended queue we can add or pop elements form both ends.,2, 17283, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17284, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,The queue which starts and ends from both sides is a double ended queue.,2, 17285, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"int, char, float, double, long ",2, 17286, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"Deque or Double Ended Queue is a type of queue in which insertion and removal of elements can either be performed from the front or the rear. Thus, it does not follow FIFO rule (First In First Out).",2, 17287, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queues are like normal queues but the extraction or popping out of the first element can be from both sides. ,1, 17288, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,, 17289, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,the queue in which any side can be used for taking out the element is called double ended queue,1, 17290, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"A queue which can be traversed both ways, up and down.",2, 17291, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Stack could be implemented in C using an array inside a structure and define push and pop functions inside the structure.\nstruct stack{\nprivate:\nint *arr;\npublic:\nvoid push(int ele);\nvoid pop();\n};\n,0, 17292, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17293, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A queue which can input data from both ends and all the functions of a queue can apply from front or at the last position of the queue. ,2, 17294, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,two side objection in evry side,1, 17295, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17296, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is a queue in which elements can be popped from both the ends of the queue and the elements can also be inserted at both the ends of the queue.,2, 17297, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"double ended queue is a queue in we can insert (enqueue) and remove (dequeue ) the element from both side ,also we can start the from any side from where we want .",2.5, 17298, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue are the queue in which push and pop operations can be performed from both front as well as rear part of the queue,2.5, 17299, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17300, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,it has two pointers front and rear,2, 17301, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,implement stack using arrays ,1, 17302, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,in double ended queue the front and rear node can be interchanged.,1, 17303, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue can be used as a queue from both sides from starting or from ending . ,2, 17304, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue is the one in which the data can be inserted not only from one direction but from both. ,1, 17305, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Its an abstract data type that generalizes a queue for which elements can be added or removed both from front and back.,1, 17306, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,in double ended queue we enqueue the elements from the top as well as the bottom.,1, 17307, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A queue in we can insert and remove an element from both the sides i.e front and end.,2, 17308, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"Methods of implementing stacks in CPP are- first to use the header file and using the inbuilt function such as push() ,pop() etc.\nThe second method is to implement stack by yourself using array and applying certain restrictions on it. ",2, 17309, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue is basically where the operations can be performed from both the ends of the queue that is insertions and deletions can happens from the front and the rear both the ends.,2, 17310, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Doubly ended queue is where the insertion operation take place from both the ends.,1, 17311, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"In double ended queue, we basically utilize the space left (after deleting elements) by adding elements according to the expression: (i++)%size;\nwhere i is the index of element.",2, 17312, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17313, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,queue follows the first in first out property. so double ended queue is where the elements can be removed from both the sides i.e. the first in and the last in the elements both can be poped.,2, 17314, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue is the queue which allows the push and pop operations from both of it's ends.,1, 17315, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,in a double ended queue both insertion and deletion is possible from both the ends of the queue;,1, 17316, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17317, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,it is a type of queue in which we can extract the elements from top and last as well. ,2, 17318, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue help us to build a matrix,1, 17319, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end, of the last node of the list points towards the firsts node of the chain. ,1, 17320, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17321, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,it is a type of queue which allows insertion and deletion from both the end either starting or ending ,2, 17322, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"Double ended queue is a data structure in which elements can be accessed from both front and back. Insertion, Deletion can also be done from both sides. It can be used to act as a stack, queue, linked list and more. ",2, 17323, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is a linear data structure in which insertion and deletion can take place from both the ends- the front and the rear.,2, 17324, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,doubled ended queue is queue in which element can be poped from both end of the queue,2, 17325, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,In double ended queue both insertion and deletion can takes place from both the ends .,2, 17326, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double Ended Queue is is a type of queue where both head and tail of a list act as a queue push or pop.\n,2, 17327, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,In the double ended queue the common operations like insertion and deletion are applied on both ends of the element in the queue.,2, 17328, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17329, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,a double ended queue refers to the queue which has ,2, 17330, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"Circular linked list is the way to store the data , which is in form of arrrays , with the same starting and end point of the array.",2, 17331, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double Ended Queue is also called deque. It is a linear data structure where the insertion and deletion operations are performed from both ends.,1, 17332, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17333, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue is a queue in which an element can be inserted or deleted from either ends(i.e front or back) of a queue.,2, 17334, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,a double ended queue is a data structure in which you can push element from front and rear and retrieve from both front and rear ,2, 17335, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue is the on in which we can do insert and pop operations from both sides of the queue.,2, 17336, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,It is a generalised form of queue in which elements can be added or removed from front and from back,2, 17337, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue is in which the a data is accessed from both side . So both the sides can act as end or front.,2, 17338, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,The queue in which we we can add from the last and remove from the first also.,2, 17339, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,it is a type of queue where we can perform both insertion and pop operations from both end,2, 17340, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double ended queue is a type of queue in which we can pop from its front and also from its back.,2, 17341, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Queue are needed to insert and pop the data which it does in constant time complexity. It follows the FIFO(First first out) fashion.\nInsertion and deletion of the data is very simple in case of queues. There are various other operations that a user can perform by using Queues.,2, 17342, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue is queue in which we can perform insertion and deletion from both the direction.,2, 17343, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"In a double ended queue, insertion and deletion can be performed from both ends of the queue\n",2, 17344, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,it can insert from both front and back\nand also it can pop from both front and back,2, 17345, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"Double ended queue is that queue in which we can perform basic operations on both the side i.e. front and back\nthat means \npush_front ,push_back,pop_front and pop_back are the some operations of double ended queue",2, 17346, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,in double ended queue we make insertion and deletion from both sides,2, 17347, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,circular linked list is a linked list in which the end node and the staring node are connected to each other so that traversal between them can take place,2, 17348, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,It is also called as deque in which insertion and deletion can be done from the both ends in a queue.,2, 17349, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,When we can extract out data from the starting as well as the ending of the queue. Queue with the mechanisms of a stack as well.,2, 17350, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue have 2 ends through which data element can be popped out.,2, 17351, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue is a modification of queue in which there are two top positions of a queue and insertion and deletion can be done from start and end;,2, 17352, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue is a queue having two ends from where an element can be popped out or removed.,2, 17353, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,It is a queue which is accessible from both the ends.,2, 17354, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end, pointer of the last node does connects to the first node instead of connecting to NULL and the \,2, 17355, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue is a type of queue in which we can perform operations from both side either from start or end. ,2, 17356, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,in double ended queue elements can be accessed from both ends of the queue,2, 17357, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,The pointer of each node points to the data of the next node. The pointer and data together are called a Node. . The pointer of the last node points to the data of the first node hence forming a circle. ,2, 17358, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,in double ended queue operation can be performed form both sides of the queue.,2, 17359, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue is a type of queue in which we can perform operation like pop() from both the ends.,2, 17360, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"it is a type of data structure in which we can perform insertion and deletion from both ends(at the beginning as well as at the end),i.e. obeying both lifo and fifo.This type can be used in a bunch of different problems, last element's next element pointer points to null and first element's previous element pointer points to null.",0, 17361, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,queues which can end from both sides,2, 17362, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17363, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17364, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue can push and pop data from both ends,1.5, 17365, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17366, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17367, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,It is an abstract data type it is often called head tail linked list.,0, 17368, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue: queue in which we can insert or delete elements from both ends it is also known as Dequeue,2.5, 17369, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17370, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A queue in with insertion and deletion can take place from both ends.,2, 17371, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,In double ended queue we can push elements and pop elements from both sides it is different from a normal queue as in queue element is inserted from one one end and popped from other end.,2, 17372, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,in this we can delete and insert elements from both the ends,2.5, 17373, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,in which data can be retrieved by both sides,1.5, 17374, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,It is a queue in which insertion and deletion operation is done at both the ends of it. that is at both the extreme ends.,2.5, 17375, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Double Ended queue or Deque is a queue where we are free to insert element either from the start or from the rear and same goes with the deletion. It has designated function to do it.,2, 17376, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,insertion and deletion are perform from both ends .,2.5, 17377, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Queue in which elements can be inserted and deleted from both first and last index.,2.5, 17378, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,a double ended queue is in which insertion and deletion can happen on both top and bottom of the queue ,2.5, 17379, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,in double ended queue insertion and deletion are present in both ends ,2.5, 17380, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue means queue implemented from both the ends of a linked list \ni.e you can perform the various queue functions from both the ends of the list,2.5, 17381, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,"In a double ended queue , we can insert and delete in queue from both front and rear side.",2.5, 17382, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17383, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue is defined as their is two queue array which performed dequeue and enqueue simultaneously.,2, 17384, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17385, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A queue where both the ends could be used to insert and delete the data is called double ended queue,2.5, 17386, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,the queue in which we can enqueue or dequeue element from both sides is known as double ended queue,2.5, 17387, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17388, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue is a queue which have two end point in it,1.5, 17389, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,queue in which element can be deleted or traversed from beginning as well as end ,2, 17390, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,In double ended queue we can perform operations of enque and deque from the both starting as wells as ending.,2.5, 17391, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,a queue which has 2 ends,1, 17392, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,a queue which has two end is called double ended queue,1, 17393, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,a queue having two ending points,1, 17394, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,A double ended queue is a queue in which we can apply the enqueue and dequeue operations at either side,2.5, 17395, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17396, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,which has no element in its previous and after it,0, 17397, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,it follows FIFO or LILO,2, 17398, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,in double ended queues the values can be inserted from both on top of it and below it.,2, 17399, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0, 17400, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,Queue in which both the end can be used to insert or delete.,2.5, 17401, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,we having stack library\n#include\n\nexample stack st;\nst.push(3);,0, 17402, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,dequeue.,1, 17403, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,queue in which their is end and start is present from both side of the queue ,1.5, 17404, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,double ended queue is the queue in which two queues work simultaneously together.,1, 17405,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17406,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,elements are arranged in sorted order in threaded binary tree so it is easy to access the elements in a threaded binary tree,2, 17407,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,traversal can be done easily through recursion ,2, 17408,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The main advantage of threaded Binary tree is traversal as instead of checking for null child it directly goes back to parent using another pointer that points from child to parent making it easy for traversing,2, 17409,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,in a normal binary tree when we reach the leaf nodes then we have to go back to root node and then go to other children. in threaded Binary tree we can directly follow a thread to another node which helps save time.,2, 17410,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,We can easily find predecessor and successor of a particular node in a Threaded binary tree.\n,2, 17411,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,advantages of threaded binary tree are:\n,1.5, 17412,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,In the threaded binary tree every node is connected to its parent node.,1.5, 17413,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantage of threaded binary tree is that each node is connected to its parent node.,2, 17414,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"In this Tree it enables linear traversal of elements.\nIt eliminates the use of stack as it perform linear traversal, so save memory.\nEnables to find parent node without explicit use of parent pointer",2.5, 17415,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Its advantage is that we can visit the next and the previous node of the present node directly since they are connected using threads .,1.5, 17416,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree is used to connect every node of the tree to its previous or the next one . It helps to easily traverse the tress and helps in the searching of the element as well.,2.5, 17417,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantages of threaded binary tree is that it is more efficient then binary and AVL tree as it's time complexity is lesser than those two.,2.5, 17418,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The traversal of data becomes easier in a treaded binary tree as it is combination of tree and linked list.,2, 17419,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,advantages of threaded binary tree are :\n- faster traversal\n- better time complexity,2.5, 17420,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Every Leaf node stores the address of parent node therefore no need to start from root node again and again. ,2, 17421,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,1. A threaded binary tree has threads connecting the leaf node to the next node which helps while traversing the graph,2.5, 17422,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,A queue in which we can add or remove item or entries from both the ends of the queue.,2, 17423,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,threaded binary tree elements are connected in the tree using thread pointed structure that has some connection between them.\nit helps in easy traversal in the graph also. they have less complexities,2.5, 17424,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,1)The time and space complexity is less.\n2)Threaded binary tree helps in easy traversal of the graph.\n3)Solution can be obtained smoothly and provides optimal solution.,2, 17425,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,1. We can dynamically use an array by using malloc() function and a top pointer for denoting the top element of the stack. The size of the stack can be set as the size of the array\nand pushing and popping can be done according to the the criteria.\n2. We can also use a linked list to store the elements of the stack and then perform the popping and pushing according to the basic operations in a linked list such as insertion and deletion at tail or head and the top pointer can be updated as the new nodes adding in the linked list.,2, 17426,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The advantages of a threaded binary tree ,2, 17427,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,",", 17428,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"Double ended queue is a special queue where an element can be popped from the left most as well as the rightmost part of queue, i.e. the first inserted and last inserted elements can be popped instead of the generic queue in which only first inserted element can be popped. ",1, 17429,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,threaded binary tree can be used in communication channels .,2, 17430,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,We know the addresses for the next element so it makes traversal easier.,2, 17431,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"In threaded binary tree, a pointer points to the previous INORDER element which helps in connecting the nodes, hence helps in the traversal of the tree.",2, 17432,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"In a threaded binary tree, the pointer points to the previous Node in INORDER traversal which helps in determining the previous nodes and connect the nodes easily. ",2, 17433,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17434,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantages of threaded binary tree:\n1. Faster traversals\n2. Faster searching ,2, 17435,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17436,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,we will find a desired value in lesser time that the others tree.,2, 17437,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17438,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17439,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17440,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree allows faster efficiency in traversal of a tree. Faster efficiency is achieved by eliminating the need of recursion or stack.,2, 17441,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,advantage of threaded binary tree is it eliminates the use of stack and recursion.,2.5, 17442,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The advantages of threaded binary tree is that it can remove the null character easily.,2, 17443,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,1. array.\n2. linked list.,2.5, 17444,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17445,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree helps in traversal as we don't have to go back to root once reaching the end. The element will be storing the pointer to its next element and the traversal continues without going back.,2, 17446,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"The threaded binary tree helps in traversal of the tree data structure efficiently as it points to the next element in traversal technique( inorder, postorder, preorder) for the leaf nodes.",2, 17447,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,threaded binary tree have lots of advantages. few of them are:-\n1. more efficient\n2. works on basic logic like small value on left and greater value on right,2, 17448,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17449,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"In a threaded binary queue, we can directly remove the leaf nodes without any disturbance of other nodes like root node or other successive nodes.",1, 17450,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantages of a threaded binary tree:\n- the nodes are linked to their successive nodes\n- the nodes also have a thread or pointer to their previous node/parent node.\n- the chronological retrieval of data is possible.,2, 17451,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantages of Threaded Binary Tree are:-\n1) It has a threads which are pointers attached from nodes to its successive nodes and predecessor nodes\n2) the last node or last leaf node is attached to its parents thereby increasing efficiency in data retrieval.,2, 17452,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,One of the main advantage is :\nThreaded binary tree has threads to store the nodes of the next or successive pointers.,2, 17453,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,In a threaded binary tree all the nodes are connected and hence are easy to access.,2, 17454,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantages of threaded binary tree is that all nodes can easily be accessed as all the nodes are connected.,2, 17455,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree is a type of binary tree that stores the data along with a pointer to both the left and right children of the node. It is very useful for searching and deletion operations performed on the tree. It helps in keeping the tracks of nodes by keeping the pointers.,2, 17456,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,In threaded binary tree empty spaces are used store the address of successive nodes. ,2, 17457,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"Threaded binary trees have several advantages over traditional binary trees, including improved traversal performance, reduced memory requirements, and simplified code. They eliminate the need for recursive algorithms, enable efficient in-order traversal, and support bi-directional traversal. Threaded binary trees are also faster than non-threaded trees for some operations, such as finding the successor or predecessor of a node.",2, 17458,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,A threaded binary tree has the parent with no child as the next value for the the required traversal of the tree following ldr traversal as instead of none data type the next child is linked to next value.,1.5, 17459,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree points to the predecessor or successor of the node in tree. It can be beneficial in tree traversal while finding the desired node as it can save time of going back to the root node again.,2, 17460,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,It makes traversal easier and thus reduces the time complexity of overall function.,2, 17461,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,travelling between 2 points in the graph is easier and the tree obtained is a balanced tree,1.5, 17462,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree is useful for postorder and preorder traversing of the tree. ,2, 17463,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"Threaded binary tree reduces the number of null nodes\nWith threaded binary tree, u can know the successor and predecessor of a node in ",2, 17464,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,1)do not have to traverse whole tree\n2)provides inoder solution\n3)removes repeation,2, 17465,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,it is a tree that has pointers called threads due to which we can traverse in different orders ,2, 17466,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The traversal becomes more efficient,2, 17467,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,searching of element is faster because every nodes is interconnected which each other,2, 17468,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,in a threaded binary tree the last child node is connected to the next node so we do not have to traverse the entire tree again and can directly head to the next connected node,2, 17469,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,faster traversal \nreduced memory usage\nimproved efficieincy,1.5, 17470,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,threaded binary tree can rearrange itself according to new values ,2, 17471,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantages of threaded binary tree is we can retraced from the leaf node to the parent node,2, 17472,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,traversal is easily ,2, 17473,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,it provides a faster traversal hence a lower time complexity and hence a better efficiency of the program ,1.5, 17474,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"A regular binary tree uses two pointers, a left child and a right child. However, that results in a large amount of null pointers in a large binary tree. In a threaded binary tree, a null left child pointer points to its predecessor in LDR Search while a null right child pointer points to its successor. Thus, in a threaded binary tree, the number of null pointers is greatly reduced and traversal is much easier. These are the advantages of a threaded binary tree.",2, 17475,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17476,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,it is faster.,2, 17477,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"In threaded binary tree , number of pointer to nodes is less .\nTraversal is easier in threaded binary tree.",2, 17478,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"The advantages of a threaded binary tree are: \nImproved Efficiency: Threaded binary trees allow for faster traversal of the tree by eliminating the need for recursion or a stack. \nReduced Memory Usage: Since there is no need for a stack or recursion, less memory is required to traverse a threaded binary tree.",1.5, 17479,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree is fast and easy to implement. ,2, 17480,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion., The advantages of threaded binary tree is that it ease the traversal and other basic operations ,2, 17481,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree takes less time and helps in easier traversal of the nodes where we don't have to go back to the root node every time we want to visit another branch of a tree.,2, 17482,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,the advantage of threaded binary tree is that the elements of the can be easily accessed in preorder traversal technique as there are pointers connected to the elements in this fashion,1.5, 17483,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The first advantage of using a Threaded Binary Tree is that the traversal operation is much faster than that of the Non-Threaded Binary Tree.\nThe second advantage of using the Threaded Binary Tree is that we can efficiently determine the predecessor and successor nodes beginning from any node. \nThe third advantage of a Threaded Binary Tree is that one can access any node from another. ,2, 17484,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,traversal is easier. it is easier to find leaf nodes,2, 17485,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17486,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,-,0, 17487,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,searching becomes easer as the nodes are connected to their sibblings.,2, 17488,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The main advantage of a Threaded Binary Tree is that is that it allows for faster traversal of the tree by eliminating the need for recursion or a stack.,1.5, 17489,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,it takes less time to search as each right child is connected to its successor,2, 17490,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,quickly searches the element,1.5, 17491,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,you can traverse from any leaf node to it's successor node directly\nit makes traversal to find sorted data directly easier\ndouble threaded binary tree can make tree traversal in both directions possible.,2, 17492,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,In threaded binary tree we can find out the lefty and right most nodes of the present node.,2, 17493,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"improved efficiency, faster traversal of tree ",2, 17494,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Improved efficiency\nFaster traversal of tree.,2, 17495,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,advantages of threaded binary tree are it helps in searching and traversing easily by connecting the leaf nodes.,1.5, 17496,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Traversing becomes an easy task,2, 17497,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The advantages of threaded binary tree are we can perform operation like going to next and previous node from the current node of our tree.,2, 17498,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,we can easily move to adjacent branch from the leaf node and we can go to the head node aswell.,1.5, 17499,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,it has a good time complexity of nlogn,2, 17500,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,In a threaded binary tree the leaf node points to the next element rather than pointing to null. This reduces the number of null pointers which saves space.,2, 17501,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,threaded binary trees allows the faster traversal and takes less time for the ouput,2, 17502,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17503,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17504,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"In a threaded binary tree the traversal operations is much easier it is a tree where instead of just moving thought the parent or the child nodes, the nodes may be pointing to other nodes which may be far away from the current node. In this way travelling to that far away node may be made simpler instead of taking the long route.",2, 17505,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,to reduce the traversal of trees in shorter way we tend to reduce our complexity\nwhere the last node is threaded to one of its node to directly reach that node \nwith the help of the thread,2, 17506,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,A binary Tree in which last(leaf) node get connected to starting node,2, 17507,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,advantages of threaded binary tree are majorly it utilizes the space of the nodes by connecting them to upper branches .,2, 17508,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantages of threaded binary tree are that it assists faster tree traversal and dosen't need a stack or recursion.,2, 17509,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,we can find parent node from the spaces which left empty in leaf as threads are attached to its parent and root node as well.,1, 17510,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.," advantages are: \nImproved Efficiency- it allow for faster traversal of the tree by eliminating the need for recursion or a stack.\n Reduced Memory Usage:- as there is no need for a stack or recursion, less memory is required.",1, 17511,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"Traversing tree gets faster, insertion and deletion in threaded binary tree is better. ",1, 17512,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantages of a threaded binary tree is that we can travel from leaf node directly to some other node with which it is connected in place of back tracking to the nodes till a new unvisited node is reached.,1, 17513,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,traversal becomes much faster through threaded binary tree ,2, 17514,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"In threaded binary tree, traversal is easier as the leaves are connected to nodes",2, 17515,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree makes accessing the data easier. it follows the in order approach . ,1, 17516,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,, 17517,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary trees have pointers pointing towards the parent node. This is really helpful while traversing or performing operations.,1, 17518,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Queue which has two address part. one for referring the previos node and the other one for referring the successive node.,2, 17519,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"leaf nodes are connected to their preorder, inorder or postorder neighbour. that's why traversa; becomes easy and efficient. ",2, 17520,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"this type of tree can be useful for enhancing the searching capabilities threaded binary trees remove the requirement for recursion or a stack, allowing for a faster traversal of the tree mainly.\nA Reduced Memory Usage: Since a stack and recursion are not necessary, traversing a threaded binary tree uses less memory.\n\n",2, 17521,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Faster traversal\nBetter efficiency\nLow memory usage,2, 17522,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,In double ended queue data can be pushed from both the ends.,2, 17523,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,it makes in-order traversal easier.,2, 17524,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"1) The first advantage of using a Threaded Binary Tree is that the traversal operation is much faster than that of the Non-Threaded Binary Tree.\n2) The second advantage of using the Threaded Binary Tree is that we can efficiently determine the predecessor and successor nodes beginning from any node. However, this activity is much more time-consuming and tedious in the case of a Non-Threaded Binary Tree, as it uses the stack to provide upward-pointing information in the tree. The same can be done with the help of threads instead of using a stack mechanism in the Threaded Binary Tree.\n3) Another advantage of a Threaded Binary Tree is that one can access any node from another. Threads are generally more upward, whereas the links are downward. Therefore, one can move in their direction in a threaded tree, and its nodes are circularly linked. This is impossible in Non-Threaded Binary Tree because we can only move in a downward direction beginning from the root.",2, 17525,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,In which every leaf node is connected to the root node in the form of threads.,1, 17526,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree is more efficient as children are also pointing to the elements of the previous level that reduces the time complexity.,2, 17527,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,traversal becomes much more easier in threaded binary tree\ndata is stored in more ordered manner ,1, 17528,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,, 17529,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,circular linked list is a linked list whose tail is connect to it's head creating a circle of data buckets.,2, 17530,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,, 17531,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"The advantages of a threaded binary tree are: Improved Efficiency: Threaded binary trees allow for faster traversal of the tree by eliminating the need for recursion or a stack. Reduced Memory Usage: Since there is no need for a stack or recursion, less memory is required to traverse a threaded binary tree.",2, 17532,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,threaded binary tree can help us in generating in-order traversal of a tree like if left child of a node is not present pointer will point to previous in-order node of the tree and if right child of a node is not present pointer will point to next in-order node of the tree,1, 17533,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantage of threaded binary tree is traversal of element becomes easier .,1, 17534,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The advantages of threaded binary tree are that it makes the traversal faster by making a thread between the child node and its inorder successor.,1, 17535,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,In double Ended queue the element can enter or exit by any side of the queue,2, 17536,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,advantages :\nwe have threaded binary tree and by this we can use this for finding and locate the location easily ,2, 17537,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,threaded binary trees are firstly arranged and sorted and also they have links from nodes to the uncle or parents which forms a better traversal and connected data structure.,2, 17538,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,rest traveleser time ver slow.,2, 17539,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,the advantage of threaded binary tree is to increase efficiency of the binary tree ,1, 17540,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"In a threaded binary tree, tree traversal is very easy as the leaf nodes are connected to the next element in the traversal hence saving time and making our approaches efficient.",1, 17541,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,In threaded binary tree the last child node is connected to other child node .Using threaded binary tree we can quickly search the element and the time complexity will be less .,1, 17542,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantages of threaded binary tree are that in order to calculate inorder postorder and preorder can be performed iteratively in a linear time,1, 17543,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"In a threaded binary tree , leaf nodes' child pointers point to postfix predecesor and postfix successor, so the time complexity is reduced for each traversal. So it is faster to add , remove or seacrh for an element.",1, 17544,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,all vertices of a tree are interconnected with each other,2, 17545,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,queue in which insertion of elements can take from start or end.,1, 17546,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,the various branches of the tree are connected so their data can be related and changed accordingly.,1, 17547,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,advantages of threaded binary tree :- \nimproves searching and deletion time compllexity,2, 17548,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,A threaded binary tree make the traversal of the binary tree easier because when we reach a node that is a leaf node it is already connected to the next node we should be on during the traversal. ,1, 17549,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,1. Improved efficiency\n2. Faster trsversal\n3. Reduced memory usage\n,1, 17550,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,In threaded binary tree we have a thread or connection of each node to the some parent node and it will make them easy to access.,1, 17551,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,the traversal is easy in the threaded binary tree,1, 17552,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,, 17553,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"threaded binary trees help in tree traversal(prefix, postfix, infix) as the leaf nodes hold the data of the parent nodes which reduces the the fact of traversing to the depth in one direction and then going backwards, instead threaded binary trees make you travel in the depth once and then the connections guide the traversal further ahead.",1, 17554,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantages of threaded binary tree are that all the nodes are connected to each other.,2, 17555,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"In this, we can excess the root node from leaf node.",1, 17556,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,advantages of a threaded binary tree is that we can easily traverse the tree as we dont have the go to the previous node instead we can just go to the address stored in the leaf node which would take us to the next node we have to traverse.,2, 17557,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,the advantages of threaded binary tree is that the rightmost leafnode is connected to the next rootnode element so it is easy to trace elements in an order usinf a threaded binary tree,2, 17558,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree are advantages for doing the different types of traversal by conncting the leaf node to the other node. This helps to do fast operations on binary tree.,2, 17559,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,the threaded binary tree helps in traversal as it increases the speed by going from one leaf node to other node,2, 17560,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantage of threaded binary tree is that when theres no left child or right child for a node it points it to its next node. It can help in traversal of tree easily.,2, 17561,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,it provides a more easy and efficient method to traverse a binary tree.,2, 17562,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The advantages of threaded binary tree are more efficient than AVL and red and black trees. ,2, 17563,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,1. We can implement stack using the library of stack under the name \,2, 17564,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,A threaded binary tree is advantageous as it helps us to move directly from left child to right child without going to the parent child as it is threaded to each other.,2, 17565,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,it makes inorder traversal faster than any other type of tree,2, 17566,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantages is fast traversal as more linkage. Easier search. Traversal in both directions. ,2, 17567,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,It is used to sort data and return the prefix of a tree.,2, 17568,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,in threaded binary tree traversal becomes fast,2, 17569,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"A threaded binary tree is a type of binary tree data structure where the empty left and right child pointers in a binary tree are replaced with threads that link nodes directly to their in-order predecessor or successor, thereby providing a way to traverse the tree without using recursion or a stack.",2, 17570,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17571,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion., Threaded binary trees have higher efficiency and allows faster traversal by avoiding for removing the need for recursion or a stack in the traversal of the binary tree therefore they are time efficient.,1, 17572,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17573,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,a)it reduces time complexity \nb)it is more optimal to use\n,1, 17574,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17575,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,the advantages of threaded is that it uses less memory and has improved efficiency.,1, 17576,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The advantages of threaded binary tree is to Improved efficiency and it is also allow to fast traversal of tree\nby eliminating the need of recursion or stack.,1, 17577,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17578,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,you can traverse a threaded binary tree easily as compared to a normal binary tree,1, 17579,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"If we want to delete a data from the tree, it would be easy to replace the data with the predecessor.",1, 17580,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17581,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,THE ADVANTAGE OF THREADED BINARY TREE IS THAT THE DATA STRUCTURE IS LINKED IN MUCH MORE EFEFECTIVE WAY . LIKE A THREADED BINARY TREE CAN A NODE CAN BE LINKED TO ITS POSTORDER SUCCESSOR.,1, 17582,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17583,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,1. improved efficiency\n2. minimum usage of memory,1, 17584,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree is a tree in which leaf node points the element which comes next to it in preorder traversal of the tree. It makes traversal even more faster.,1, 17585,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Its time complexity is less and the lead node points to the parent node from the other child of the tree.,1, 17586,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,traversing is faster than non threaded one.,1, 17587,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,it increases efficiency and reduces memory usage.,1, 17588,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,it saves time when performing traversal in tree compared to normal binary tree,1, 17589,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,\nadvantage of threaded binary tree is that \nwe can directly access the root of any subtree from its leaf node present in that sub tree,1, 17590,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,traversal is fast in threaded binary tree as compared to others,1, 17591,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The two methods to implement stack are array method and linked list method in c ,1, 17592,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,1)It improves the efficiency as it allows faster traversal\n2)Reduced memory usage as there is no need for stack or recursion,1, 17593,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,We can easily move from the leaf nodes to the node that would have been next to most initial node that lead to this leaf node. In this way we can avoid many unnecessary traversals.,1, 17594,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"In threaded binary tree, empty spaces are used to store the address of the successive nodes in the tree.",1, 17595,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary trees are used to reduce time complexity of traversals like pre-order. post-order etc. by connecting predecessor and successor of nodes of binary tree by pointers. ,1, 17596,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17597,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,It reduces the time by connecting the predecessors and successor nodes with the help of pointer so that it can be easily accessible.,1, 17598,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion., pointer of the first node connects to the last node.,1, 17599,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,searching is easy in threaded binary tree,1, 17600,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,previous and next nodes are connected with the help of a pointer which helps in reducing the time,1, 17601,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"First we create 2 functions - pop and push. A variable top is declared. First, elements are put into the stack using push function. Stack follows Last in First out. The top element is then popped. Top element changes to the second last element in stack. The new value of top is popped. This continues till stack is empty or according to requirement of user. If stack is empty top = -1.\nWe can also use STL to implement stack in C.",1, 17602,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,in threaded binary tree the child in the binary tree is connected to its parent node . the makes the tree traversal easy and efficient.,1, 17603,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree is a type of binary tree which contains a link to it's parent node and makes the tree traversal easy an time efficient in many cases.,1, 17604,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.," advantages of threaded binary tree is that ,since it is connected we need not to go the starting node and then traverse,rather we can jump to our desired data snce it is a threaded binary tree,which is connected .",, 17605,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"A threaded binary tree is made in such a way that the last element points towards something instead of empty space , hence saving space",2, 17606,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,In threaded binary tree we have the advantage to jump to the least element vertical.,2, 17607,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,advantages of threaded binary tree is the node will be changing the position by rotation and make it easily sorted in the tree as an array if we printed.,0, 17608,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,traversal becomes easy as there is no need to backtrack.,2.5, 17609,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"In threaded binary tree we don't have to travel the tree we can just look at the leaf nodes as leaf node contains all the information also, leaf nodes contain pointers that makes it easy to traverse and search for any element.",1, 17610,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,inorder traversal becomes easy,1, 17611,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,It is more space efficient as compared to normal binary tree it has no empty pointers excluding the leaf nodes.,2, 17612,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,it makes inorder and preorder traversal easier.,1, 17613,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,it make trraversal faster than in any other tree,1.5, 17614,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,We do not have to traverse back to an already visited node.,1, 17615,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The advantage of threaded binary tree is that in threaded binary tree every node is connected to every other node which makes the comparison within nodes much more easier.,0, 17616,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,we have the address of the root node on every leaf node and we can traverse back easily,1, 17617,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,in this traversal is easy,1, 17618,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"In this Tree it enables linear traversal of elements. It eliminates the use of stack as it perform linear traversal, so save memory. Enables the user to work efficiently and less clumsily.",1, 17619,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,A threaded binary tree makes preorder traversal and in-order traversal a lot easier.,1, 17620,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,in threaded binary tree we traversse back and also known as which leaf node we traverse ,1, 17621,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree is very useful is traversals as leaf node connected to every node.,0, 17622,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,1 .threaded binary tree makes it easy to access any node\n2. reduces the time of traversal,2, 17623,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,easy of insertion of node in binary tree \nthe more threaded the binary tree the more nodes it contain ,0, 17624,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,1) number of nodes increase in an increasing order and in a particular pattern\n2) it is sorted ,0, 17625,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,"using a threaded binary tree , insertion and deletion can be performed much faster and easily than normal binary tree.",1, 17626,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17627,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree is defined as the tree where it traverse by the order of their ascendents or descendants. it is of two types singly threaded binary tree or circular threaded tree.,1, 17628,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17629,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary tree makes it easy to traverse back from the last correct element or can be used to display the available options regarding the data entered till then. Thus you need not to go back till the root again and again.,1, 17630,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,in threaded binary tree every child is pointing to its parent node,0, 17631,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantage of Threaded binary tree ,0, 17632,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,the advantages of threaded binary tree,0, 17633,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,all nodes forms threaded structure such that reduces data latency,1, 17634,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,The main advantage of Threaded Binary Tree is that every child node is pointing towards its parent node.\n,0, 17635,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,threaded binary tree has keys which are connected to other elements making traversal easy.,1, 17636,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,one element connected to other element in tree is called threaded binary tree,0, 17637,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantages of threaded binary tree :-,0, 17638,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Threaded binary trees help us in performing the desired operations faster than a regular tree,1, 17639,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Advantages of threaded binary tree are to minimize the time to search any element,0, 17640,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,all the sorted comes in last line,0, 17641,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,,0, 17642,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,threaded binary tree is used to sort strings and make dictionaries.,0, 17643,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,it help in searching a data and it help data to not be more clitter ,0, 17644,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,Its easier to delete or insert the preorder or postorder values in the tree.,1, 17645,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,double ended queue when be push element the showing in front and when push element front the showing in end,, 17646,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,find the height & length of the tree.,, 17647,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,1)we can easily replace the deleted element form its inorder sucessor or inorder predecessor \n,, 17648,Write the advantages of threaded binary tree.,The difference between a binary tree and the threaded binary tree is that in the binary trees the nodes are null if there is no child associated with it and so there is no way to traverse back.But in a threaded binary tree we have threads associated with the nodes i.e they either are linked to the predecessor or successor in the in order traversal of the nodes.This helps us to traverse further or backward in the in ordertraversal fashion.,advantage of threaded binary tree is ,, 17649,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17650,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heap can be used to represent a priority queue like in heap we set a priority of the element to runtime likewise in priority queue we set the priority of the elements ,2, 17651,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heap can be used as priority queue as min element higher priority and large element low priority,2, 17652,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A priority queue's major advantage is that it sorts the elements as they are inserted. Using a heap we can minheapify and maxheapify at every insertion to maintain the properties of a priority queue,1, 17653,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","we can use max heap to implement priority queue. Each time we enter the element with a certain priority, if it is low then it goes to last else if it is greater priority then it remains at the top of the max heap.,",2, 17654,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Priority queue is a type of min heap or max heap.\nBy using heap we can sort the data in queue according to our priority.\nHeap operation like heapify , decrease key , or build heap can be easily used in priority queue",2, 17655,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17656,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17657,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17658,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17659,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17660,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Building of minimum heap can be used to represent the priority queue.,2, 17661,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",The work of the priority queue is to arrange the given sequence in the form which is smallest and the arranging the bigger values. So with the help of min heap and max heap all the values can be arranged accordingly.,2, 17662,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Priority queue is a data structure in with we give importance to the value of data stored based on it being smaller or greater. Using a heap which is either of the form max heap or min heap can get this task of prioritizing and storing data for easy traversal of ascending or descending order easily.,2, 17663,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17664,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Min heap / Max heap can be use to represent priority queue. After deletion of root node heapify function can be called to place to high priority element in the root node.,2, 17665,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Max heap can be used to represent a priority queue where a larger value element represents higher priority\nMax heap stores data in such a way that all the children of a node have data value less than the parent node\n\nMin heap can be used to represent a priority queue where a smaller value element represents a higher priority\nMin heap store data in such a way that parent node has the least value among the parent and all its children,2, 17666,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",threaded binary tree has threads connecting the leaf nodes all together to give better track of all the nodes which helps in reading the values from the tree.,2, 17667,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","mean heap and max heap can be used to represent the priority queue because they helps to extract the min/max element from the queue,",2, 17668,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap can be used to represent a priority queue as it can provide the optimal solution and can extract the required element.,2, 17669,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",In a double ended queue we can enqueue or dequeue from both the front and back unlike normal queues where enqueueing can be done only on back and dequeuing only on the front.,2, 17670,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17671,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17672,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",threaded binary tree has an advantage that traversal in it becomes easier due to the threads that are connecting. ,1, 17673,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","heap has two types , max heap and min head , we use heapify function to sort heap . priority queue is a type o heap which provide values according to our priority. ",2, 17674,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",As heaps are sorted in min or max heap they can be used to implement priority queues in which the the functions work based on priorities.,2, 17675,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heaps can be used to represent priority queue has the minimum/maximum element is present at the root node so ExtractMin() function can be used to extract the minimum/maximum element in the heap.,2, 17676,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Heaps can be used to represent priority queue using Extract Min , because heaps have min or max element at the root node.",2, 17677,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",as we know that heap is a data structure which is used to store data in sorted order. If it is max heap it store data in descending order and if it is min heap it store data in ascending order.\npriority queues also store data in sorted order .max heap can be used to represent priority queues storing data in descending order and min heap can be used to represent priority queues storing data in ascending order.,2, 17678,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A heap can be used to represent a priority queue by implementing min-heap (stores smallest element in the root) or max-heap (stores largest element in the root) accordingly.,2.5, 17679,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",if it is a max heap then it can store the sorted elements in descending order and if it is a min heap then it stores in ascending order.\npriority queue is also like heap which stores the values already sorted.,1, 17680,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",The min heap will represent a priority queue. in min heap the value of parent node is smaller than the its children value. ,2, 17681,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17682,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Yes, heap can be used as a priority queue as it can help us to sort on the basis of user min heap store element in (ascending order) or max heap store element in (descending order) we can select any element and arrange according to it same as works in priority queues. priority queues also store value already stored.",2, 17683,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","the first element of priority queue in heap is max element by default. \nin heap we have the elements in either decreasing order or increasing order, basically in sorted manner. ",2, 17684,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17685,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17686,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Through priority queue we can heap by giving the priority to the element the element which have the first priority should be inserted first in the heap and the least priority element should be inserted at the last in the heap. It can be implement in the min-heap or max-heap.,",", 17687,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",It is a queue which can be accessed from both front and back.,2.5, 17688,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","yes, using priority queue we can implement heap. When we add an element it performs the heapify automatically for taking it to its rightful place.",1.5, 17689,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Priority queue can be represented by using max of min heap.,1, 17690,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A min or max heap can be use to make priority queue as it will always rearrange to have the minimum or maximum node respectively as the most priority node on every retrieval which is the function of priority queue.,1, 17691,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heapify algorithm can be used to represent the priority queues.,2, 17692,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17693,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A heap can be used in the Pre Order or Post Order or In Order traversal for representation of priority queues.,1, 17694,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A min heap or max heap can be used to store data in the form of priority queue. ,2, 17695,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A priority Queue is a type of Queue that is used to store elements either in ascending or descending.\nIts implementation can be done as a heap because heap is a dynamic tree data structure that is stores data in ascending or descending form.\nIts internal working is such that is a new element is inserted and it violates the condition of min heap or max heap its puts the element to its correct position.\nThis is what priority queue does so it can be represented by Heap data structure.,1, 17696,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Heap can be used to represent queue because, heap stores data either in ascending order or descending order which fulfils the condition of priority queue. ",2, 17697,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Heap can be used to represent queue, because heap store data either in ascending or descending order which is suitable for a priority queue.",2, 17698,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","As heap store the data in increasing or non increasing order, hence it can prioritize the data in the queue.",2, 17699,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap can be used to represent a priority queue by performing insertion based on the priority order given be the user. It can use operations like union set etc.,2, 17700,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Heap always return the minimum or maximum element, so Max heap can be used as a priority queue to return element which is having maximum priority.",2, 17701,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","A heap data structure can be used to implement a priority queue efficiently. A priority queue is a type of abstract data type that stores elements with associated priorities and allows the elements with the highest priority to be accessed first. \nIn a heap-based priority queue, the heap is implemented as a binary tree with the property that each parent node has a priority higher than its child nodes. \nThe heap-based priority queue has a time complexity of O(log n) for both insertion and removal of element.",2.5, 17702,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heap can be used to represent a priority queue as priority queue contains vip members and heap has ability to follow queue like sequence but remove any element if element is to be removed without disturbing much of the other data values in the heap.,2, 17703,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap can be used to represent a priority queue as we have max or min heap in which the element are placed in the tree in increasing or decreasing order. Similarly in priority queue we chose a large or small element and then perform operations giving priority to smaller or larger numbers first .This can be done by flattening the heap,2.5, 17704,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17705,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heap is a structure which contains the sorted values of the input values and when the value is taken out it follows the properties of queue just like the value in the queue is removed and added near similar procedure is seen in heaps thus it is known as the representation of priority queue,2, 17706,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Min heap has the minimum element on the root of the tree and similarly Max heap has the maximum element at the root of the tree. The node is compared to its children and the minimum\\maximum of it is swapped to the root every time. So, this can be used in a priority queue to show the min\\max priority. On insertion into a priority queue, the heap will sort sort the data and put the max\\min to the root which can be extracted by the priority queue.\nThis is how heap can be used to implement priority queue.",2.5, 17707,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","If the priority of an element is determined by its numerical value, then min heap can be used to represent a priority queue. The root will always contain the element with the least priority",1, 17708,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Using preorder searching heap can be used to represent a priority queue.,1, 17709,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",by making largest element root of tree,2, 17710,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",It can be used to represent priority queue by using heapify ,2, 17711,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.", when we have sort the data in ascending or descending order then we can used heap to represent a priority queue.\n,1, 17712,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",a heap can be used to represent a priority queue b implementing a min heap or a max heap. In a min heap the lower values are given a priority and the root node would be the smallest value present in the heap. Whereas in a max heap the higher vales are given priority and the root node has the highest value,2, 17713,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",All the elements of priority queue could be inserted in a heap and then the one which needed utmost priority stays at the top and then its child is next highest priority one and thus they could be easily extracted from the heap by find max(accordingly).,1, 17714,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heap can be used as a priority queue when when you use tqo heaps and divide the data accordingly,2, 17715,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17716,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",MIN HEAP CAN BE REPERESENT WITH THE PRIORITY QUEUE.,2, 17717,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",it can be implemented as the highest or lowest element is stored in the root node ,2, 17718,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A heap stores data in the form of a sorted tree and the top element is called the min element. We can use a heap to represent a priority queue as insertion can be performed and then heap function can be called. Using the Extract-Min function we can get the top element of the priority queue. ,1, 17719,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17720,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17721,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17722,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A heap is a concrete implementation of the priority queue using an array (it can conceptually be represented as a particular kind of binary tree) to hold elements and specific algorithms to enforce invariants. Invariants are internal properties that always hold true throughout the life of the data structure.,2, 17723,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17724,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17725,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","The data can be stored in a heap. A heap has a specific order of traversal i.e., in ascending or descending order that helps in determining the priority of the data. ",2, 17726,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",the heap can be used to represent the priority queue as in heap property the root element should be greater than its node so we can easily get the element of the highest priority at the top of the heap (root) always. ,2, 17727,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap can be used to represent priority queue because max heap have largest element as its root element and min heap has minimum element as its root element. ,2, 17728,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",min or max heaps can be used to represent priority queues,2, 17729,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",max and min heap to get max or min element for amny element,2, 17730,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Using a min heap, the root node will be the smallest element \nUsing a max heap, the root node will be the largest element",2, 17731,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",there are various heaps such as binomial heaps etc and they can be used to represent a priority queue too by just adding few constraints of a priority queue,2.5, 17732,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we can use heap to implement priority queue. it will rake O(logN) time to insert and delete each element in the priority queue.,2, 17733,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",min heap can be used to represent a priority queue,1, 17734,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",a min heap can be used to represent a priority queue as min element will be gives priority,1, 17735,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","a heap can be used to represent priority queue by applying constraints to it .it is implemented using heap's operations like make heap,sort heap etc.",2, 17736,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17737,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heapify can be used to represent a priority queue. ,2, 17738,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Using an array , a linked list.",1, 17739,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heap can be used to represent a priority queue by sorting the nodes according to priorities.,2, 17740,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Min Heap is used to represent a priority queue,1, 17741,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17742,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we can make a min heap and by using DLR transversal ,1, 17743,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",yes heap can be used in priority queue,1, 17744,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A heap tree (minHeap or maxHeap) can be used to represent a priority queue,2, 17745,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17746,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",The advantage of threaded Binary tree is that it reduces the wastage of space by storing the address of parent node in the child node which was previously storing null value.,2, 17747,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Tree traversal become easier than normal binary tree as each and every node is connected,1, 17748,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A heap can be used as a priority queue by heapifying to a min heap. The we pull out the root element which represents the min position/value of the heap. Then we again min heapify the remaining elements and again pull out the root which represents the minimum index. We keep repeating the steps and then the elements which keep on coming represent a queue in which the first index comes out first.,2, 17749,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","max heap can be represented by -> priority_queue pq;\nmin heap can be represented by -> priority_queue> pq;",1, 17750,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","priority_queue>pq;",1, 17751,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",using vector we can represent priority queue using heap.,2, 17752,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap can it be used to represent a priority queue when we give more priority to smallest or the largest node in the tree as we can extract these nodes very efficiently using heaps.,2, 17753,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",most priority data stored on the top of the tree using heap data structure,1, 17754,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17755,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap works on LIFO principle. Vector q.queue can be usde to represent priority queue. Heapify can be used on queue to generate min heap or max heap.,1, 17756,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Heap can be used to represent priority queue by making an min heap or a max heap. Min heap contains the minimum element at the root node which is needed in priority queue. Insertion , deletion and updation operations can easily be performed in it.",1, 17757,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17758,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Priority queue can be represented using min heap as the elements are arranged in ascending order.,1, 17759,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","In a heap the data is stored in min Heap or max Heap, i.e. in a specific order. In a priority Queue , we retrieve the data based on the priority condition mentioned. if the priority queue retrieves the minimum element , it means Min Heap is being used. ",1, 17760,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",priority queue is actually a minheap where the parent node is smaller than its child nodes.,2, 17761,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Priority Queue can be represented using heaps.,2, 17762,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17763,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap can used as priority queue by storing smaller / larger values as parent of larger/smaller values.,1, 17764,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",in heap we have the first element as the smallest or largest which is the same for priority queue. and it automatically arranged to use Heapify as we push element into it.,2, 17765,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17766,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees."," Threaded binary trees allow for faster traversal of the tree by eliminating the need for recursion or a stack. Since there is no need for a stack or recursion, less memory is required to traverse a threaded binary tree.",2, 17767,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17768,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heaps are great for implementing a priority queue because of the largest and smallest element at the root of the tree for a max-heap and a min-heap respectively. We use a max-heap for a max-priority queue and a min-heap for a min-priority queue.,2, 17769,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap has two types - Min Heap and Max Heap. Suppose we have to make a queue in which all elements are sorted. Then we can make a min heap and push the elements in the queue.,2, 17770,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A min heap is used to represent a priority queue.,2, 17771,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Min heap is used to represent a priority queue as min heap is designed in such a way that it conations minimum elements in the head nodes .,2, 17772,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A priority Queue can used to implement heap to store the highest priority data on the top of the table.,2, 17773,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","C is a raw language, we don't have any predefined library for stacks, so there are some ways by which we can implement stack are by using array, by using linked list, by using doubly linked list.",2, 17774,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17775,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17776,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17777,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","by creating a min heap we can represent heap as priority queue,",2, 17778,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17779,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",In threaded binary tree the next element at the root node can be visited without visiting the parent of the next node,2, 17780,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we create a heap pointer and define the variables and by making the function call in priority queue we access heap ,2, 17781,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heap can be used as the set priority asscending\\descending is stored with bthe heap and the heap is used as a min\\max heap to run as a queue.,1, 17782,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","minimum heap, maximum heap. ",2, 17783,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17784,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A heap can be used as a priority queue by heaping it to make a min heap priority queue or max heap priority queue i.e. by applying the heapify and getting our desired priority queue,1, 17785,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we can use min heap and max heap to represent it as priority queue .as in min heap .smallest element represents the parent node and every node connected to it called as child node and we can easily find the minimum element from that heap and vice versa in ma heap.,2, 17786,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heap can be used to represent priority queue as priority queue stores data in ascending or descending way which can be done by using max heap and min heap,1, 17787,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","A minheap has minimum element on its top, so it can be used to implement priority queue which wants smallest element on the top.",2, 17788,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",by using max heap min heap,2, 17789,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",root elements are directly connected to the left and right most child of the tree,1, 17790,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",by using min heap.,2, 17791,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",yes heap can be used to represent priority queue,2, 17792,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A heap can be of two kinds min heap and max heap. Therefore it can be used to represent a priority queue because whenever we access the root of the heap we will be accessing the minimum or the maximum element based on the type. Therefore making it a priority queue.,2, 17793,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17794,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",In heap if we store the elements according to the priority first come first serves (as per the FIFO principle of queue) then it will represent a priority queue.,1, 17795,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we can make an min or max heap according to the given priority and heapify it after every extraction of the top element\nso the highest priority element is always at the top and extracted first.,1, 17796,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Advantage of threaded binary tree is the ,2, 17797,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heaps always use the technique wherein we either keep the larger element on the top of the child nodes or the smaller one hence it uses a priority that either the maximum element remains at the top or the smallest elements remains at the top.,1, 17798,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A heap can be used to represent a priority queue as a min heap or max heap.,1, 17799,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","priority_queue(pair,vector>);\nThis is max heap.",1, 17800,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","priority queue is basically a queue but the elements are sorted in according to their priorities be it their weight, value etc. if we sort the heap in such a way that its traversal gives a sorted array then we can use it as a priority queue",2, 17801,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heap can be used to represent priority queue as both give sorted form of an array and perform operations like insertion and deletion,1, 17802,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",As priority queue means that it will give the element on the bases of a priority and which property is implemnted by the heap and hence we use it,1, 17803,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",by using stl priority_queuepq\nin this we just use min heap or max heap but consider the priorities of the elements,1, 17804,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17805,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we can make min heap or max heap by setting the priority .,1, 17806,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17807,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","\n2. We can implement stack using an array , by creating functions of stack like \",1, 17808,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A Heap data structure can be used to represent a priority queue,1, 17809,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",every item has its priority associated with it \nelement with high priority is selected to be dequeued rather than low priority element,1, 17810,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap can be used to represent a priority queue by introducing the heap sort function. it can be modified and conditions be set to make the priority queue min or max type. ,1, 17811,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",By forming a heap data structure and adding the elements in a sorted manner a priority queue can be represented.,1, 17812,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17813,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17814,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","An element with high priority is dequeued before an element with low priority. If two elements have the same priority, they are served according to their order in the queue",1, 17815,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17816,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17817,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heap can be used to represent a priority queue . There can two types of heap according to there descends :a)min heap b)max heap\nMin heap sorts the array by ascending order and max heap sorts by descending order,2, 17818,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A type of queue which has double enda like the data can be inserted and extracted from both the side there is no single direction to do that.,1, 17819,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17820,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17821,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",min heap and max heap can be used to represent a priority queue because with the help of min or max heap we can get the minimum element or maximum element from an array.,1, 17822,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17823,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we can build a minheap in which the least element are at the bottom and the maximum ones are at the top,1, 17824,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Max heap can be used to represent a priority queue as it always return the max element from the list,1, 17825,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",The main aim of a priority que is to make sure that the element that has the most priority should be accessed first . For eg if we require the next smallest element in every iteration every time we can represent priority que by making min heap . In min heap the parent is always smaller than the child. And we can easily access he data.,2, 17826,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17827,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we can buid a minheap where the least element are at the bottom and the minimum ones are at the top,1, 17828,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heaps are used to implement priority queue as we need to access element according to their priority such as min first then second min and so on . So min heap is used in that case to find min first then second min as it contains min at root and if we want second min we delete min and call heapify function to get second min.,2, 17829,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17830,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",min heap used when elements in priority queue arranged in ascending order and maxheap used when elements in priority queue arranged in descending order.,1, 17831,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","a heap can be used to implement priority queue. priority queue means to remove elements on the basis of priority. Using a min heap, a min priority queue is implemented and the minimum element can be consequently deleted from the first index without having to find it in the entire structure.",2, 17832,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we can use a heap and it will keep the min element in the top and pop it if needed\nand these are the functions need in priority queue,1, 17833,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we implement Priority queue using Heap data structure as priority queue is the stl version of heap\npriority queue is also used to find the kth largest and kth smallest of any data ,1, 17834,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17835,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",double ended queue is a data structure in which the traversal and accessing of data can take place from both the ends of the queue,1, 17836,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","We can use heaps to implement the priority queue. It will take O(log N) time to insert and delete each element in the priority queue. Based on heap structure, priority queue also has two types max- priority queue and min - priority queue.",2, 17837,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Queue - FIFO, when we give special priority while storing - FIFO of the prioritized data. \nAs explained above, Heap can store data in a way that the next data is always either smaller/larger than the previous data. Thus we are prioritizing the extraction of one value over the other. This is how heap can be used to represent a priority queue.",2, 17838,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",A priority queue has an special characteristic where the 1st element of the priority queue is the minimum element in the queue.\nPriority queue uses Min-heap property of the Heap where the root element is minimum element.,1, 17839,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap is used to represent a priority queue by arranging queue elements on basis of there maximum or minimum priority and then it can be easily implemented to access requires element according to their priority.,1, 17840,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17841,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap can be used to represent a priority queue by arranging the elements on the basis of their max or min priority.,1, 17842,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,0, 17843,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",priority queue is of 2 type min priority que and max priority que so we use min and max heap to build priority queue,1, 17844,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",by arranging the elements according to the maximum and minimum priority,1, 17845,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",elements can be entered from both ends of the queue ,1, 17846,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we can use min or max heap to store the data in priority queue to store it in increasing or decreasing order.,1, 17847,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",In a heap the elements are placed according to the criteria that root node is minimum . In a priority queue we just follow a fixed criteria for each node where the node greater is placed left/right and vice versa. The heap is formed using heapify.,1, 17848,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","priority queue can be implemented by using a heap data structure in which data is stored in ascending order .i.e. when we call heapify function ,we apply a condition such that the heap is constructed in an scending order fashion.",, 17849,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17850,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17851,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heap is also like a queue so it represent as a priority queue,, 17852,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Using STL, or arrays.",, 17853,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",In priority queue we pop out elements according to the user's wish hence we can create a heapify function accordingly and can create a tree on the basis of priority queue.,, 17854,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",priority queue is basically minheap or maxheap,, 17855,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17856,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap is used to insert an array in a priority queue ,, 17857,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17858,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heaps can represent priority queue as higher priority or greater valued data goes to the right and low valued data goes to the left. Just like in a priority queue.,, 17859,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap can be used to represent a priority queue when all the elements in queue are arranged in a sorted manner using heap sort. Such that root node contains the smallest element and left node contains the smaller and right node contains the greater element.,, 17860,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we cna use max heap to represent a priority queue because after deletion the whole max heap is updated acc to new max element and exactly this is used in priority queue,, 17861,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",as heaps have root node as max or min element they can be used .,, 17862,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17863,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Heap actually utilizes a simple array to represent a priority queue, a particular element at i-th index can have 2 children at 2i+1 and 2i.",, 17864,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we use max heap to represent the priority queue ,, 17865,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",because it also extracts minimum or max element like heap.,, 17866,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",by extracting values from heap,, 17867,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17868,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",in priority queue elements are sorted in increasing order \nheap can be used as it contains smaller to parent node element in left and larger on the right side ,, 17869,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",We can create a max heap according to the prirority of the element and by deletion we can insert that element in priroity queue.,, 17870,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",just like priority queue min-heap also compares the element with ,, 17871,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heap is based on the performing of index And in priority queue all the data structures are classified int priority.,, 17872,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17873,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",Heap can be used to represent the priority queue when heap could be arranged according to the priority of the data/elements rather than minimum or maximum.\nThereby we can access the data according to the priority of them.,, 17874,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",It will take O(log N) time to insert and delete each element in the priority queue.,, 17875,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17876,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17877,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",heap can be used as priority queue as by forming min heap or max heap as per your choice and then storing it in a queue in this way all elements can be traversed,, 17878,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","By using Heap, insertion and deletion it will take place in O(log N) time.",, 17879,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",when we delete element from a heap we store it in the priority queue giving us the heap in priority queue.,, 17880,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",to delete elemet and and in que is called priority queue,, 17881,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",min heap can be used.,, 17882,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","Yes, Heap can be used to represent a priority queue.\nAssuming that the value contained by the node is it's priority\nWhen we enter the element or remove the element in the heap, we can use the heapify method or basic head add and remove methods to show and add the new elements, and as all the elements would be sorted in the heap according to the priority , when we see the top most node of the heap , we can find the node with maximum priority or the node with minimum priority depending on the heap",, 17883,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17884,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",a queue which is empty and in that we add elements one by one by deleting from heap one by one.,, 17885,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17886,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",we use the heap data structure to maintain a priority queue\n,, 17887,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",,, 17888,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",We use heap data structure to maintain priority queue with the root node starting with the most prior value or input continuing with the heirarchy to it sub nodes.\n,, 17889,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",faster access or insertion and delete,, 17890,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",compression of data.,, 17891,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.",min heap could be used to represent priority queue ,, 17892,How heap can it be used to represent a priority queue?,"A priority queue is a different kind of queue, in which the next element to be removed is defined by (possibly) some other criterion. The most common way to implement a priority queue is to use a different kind of binary tree, called a heap. A heap avoids the long paths that can arise with binary search trees.","whatever we add the values in the heap, and take them out one by one from heap, we can add them the queue.",, 17893,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0, 17894,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,when the graph is connected in two ways i.e we can travel either way it is biconnected graph,2.5, 17895,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,when two different graphs connected to each other to make traversal easy from both direction ,2.5, 17896,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected Graph is a graph in which node and destination traverse from their own links thus reducing time complexity by half,2.5, 17897,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph is a type of graph in which the nodes are interlinked where there is an edge. So we can access both of the elements in an edge.,2.5, 17898,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,The graph where if we can go one node to another then we also return back to the first one like a bidirectional graph ,2.5, 17899,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is connected graph having no particular vertices. ,2.5, 17900,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,its a connected graph which does not have any vertices.,2.5, 17901,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,graph which don't have any vertices is called biconnected graph,2.5, 17902,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is an undirected graph that has two vertex-disjoint paths between any two vertices,2.5, 17903,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"If the two graph are connected to each other by a single edge such that on removing the edge they split into two graph , these graphs are known as bidirected graph.",2.5, 17904,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is a graph in which a single node is common and on the removal of that bode we get the two different graphs separately. ,2.5, 17905,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graphs are those which connects two graphs with single edges forming a bridge like structure.,2.5, 17906,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconneced graph is a graphical structure in which removing an edge could lead to the creation of two separate graphs. ,2.5, 17907,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph., a graph interconnected to itself from two different nodes is called biconnected graph .\na biconnected graph can be broken into two separate graphs.,2.5, 17908,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0, 17909,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is one where one edge acts a bridge between two graphs which would become two disconnected graphs if we were to remove the edge from there.,2.5, 17910,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0, 17911,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is the graph in which their is a edge or bridge between two vertex. all the connected graph are complete in themselves.,2.5, 17912,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph is the graph in which atleast two vertices of the graph have 2 multiple edges. The number of edges between any two vertices cannot exceed 2 in the case.,2.5, 17913,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0, 17914,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"When Two separate connected cyclic graphs , are connected together via an edge then it is called a biconnected graph.",2.5, 17915,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,bi connected graph is basically two complete graphs with a complete cycles connected with each other through edges making it a complete graph.,2.5, 17916,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Heap can be used to represent a priority queue by doing the extraction operation on it. extraction of elements from heap results in priority queue. ,2.5, 17917,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is a graph where every edges have a connection with every other edges,2.5, 17918,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A graph which has two edges at each vertex is biconnected graph.,2.5, 17919,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"A graph in which any two nodes are connected in both the directions is called a biconnected graph. For example in a graph of three nodes, 1->2 and 2->1, 1->3 and 3->1, 2->3 and 3->2. ",2.5, 17920,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A graph which is connected in both the directions is called a biconnected graph. A vertex is connected to the edges on both neighboring vertices. .,2.5, 17921,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A graph that is connected in two the direction is called biconnected graph.,2.5, 17922,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is one which has double edges only.,2.5, 17923,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,the graph which is connected from both the directions ,2.5, 17924,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,two different graph having one common vertex.,2.5, 17925,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,two cyclic graph when connected by an edge are called as biconnected graph,2.5, 17926,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph are the graph connected from both the directions.,2.5, 17927,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is one which is connected to other graph by an edge is known as biconnected graph. ,2.5, 17928,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is a graph which cannot be separated. The graph will still remain connected even if we remove any vertex.,2.5, 17929,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is the one in which even if we a vertex is removed it remains connected.,2.5, 17930,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A king of graph in which every vertex has two edges is called biconnected graph.,2.5, 17931,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0, 17932,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is a graph in which every vertex is connected to only 2 neighboring vertices using only 2 edges.,2.5, 17933,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"A biconnected graph, is a graph in which every element is connected to any two of the elements in the graph.",2.5, 17934,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"A graph that comprises of nodes, where each node is connected with any two or more other nodes in the graph is called a biconnected graph. ",2.5, 17935,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,when two graphs are connected with each other then they are known as biconnected graph.,2.5, 17936,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A heap can be implemented as a priority queue when we want to extract elements in increasing/decreasing priority by using minheap and maxheap respectively.\nThen if we want to extract the shortest element from a min heap we can do so easily using extractmin function.\n,2, 17937,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Two different graphs having the same root node but different sub nodes is known as a biconnected graph.,2.5, 17938,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Bi connected graph is a component graph where the graph having two components are connected by a joining edge.,2.5, 17939,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a graph that is connected at two points to a parent graph is called biconnected graph.,2.5, 17940,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is a type of graph in which a graph is connected to the parent graph at two points.,2.5, 17941,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is a graph which has two sub-graphs connected to each other.,2.5, 17942,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,The graph which has two subgraphs and are connected to each other are known as biconnected graphs.,2.5, 17943,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph is a data structure where we connect two individual graphs with a single edge. ,2, 17944,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,It is a graph in which two subgraphs are connected with each other using a single edge.,2, 17945,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"A biconnected graph is a connected graph that remains connected even after the removal of any single vertex (along with its incident edges). In other words, a biconnected graph has no \",2.5, 17946,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,two graphs connected by a simple singular node is called a biconnected graph,1, 17947,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"Biconnected graph has its nodes connected both ways , so we can access the nodes either way and they can have different weights. This can also be done to create shorter path from source to destination.",2.5, 17948,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graphs can also be called bidirectional graph as they have two separate paths to go between two sets of points and both in opposite direction.,2.5, 17949,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a graph which is connected via its head and tail is known as biconnected graph usually it is also referred as the connection of 2 disjoint graphs,2.5, 17950,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph are the graphs whose edges are bidirectional.,1, 17951,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"Biconnected graphs are directed graphs in which 2 nodes have bidirectional edges between them. \nfor eg. if A is connected to B, then B is connected to A as well",1, 17952,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Two different graphs connected with a single edge is called biconnected graph.,2.5, 17953,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a graph that remains connected after a node is removed ,2.5, 17954,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Bi connected graph is the graph ,2.5, 17955,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,The graph which connect with two graphs is called biconnected graph,2.5, 17956,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a biconnected graph is a graph where if any vertex is removed the graph will remain intact.,2, 17957,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A graph which remains connected even when any one of its edged are removed is known as biconnected graph i.e. it has no articulation edges.,2, 17958,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"a biconnected graph is a graph with 2 sided arrows, back and forth ways",2, 17959,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A graph whose root node and leaf nodes are connected bidirectionally.,",", 17960,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,IS HAVE ONE TO ONE OPERATIONS THOSE CALLED A biconnected graph.,1, 17961,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,when two graph are connected it it called biconnected graph,2, 17962,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"A graph having two-way connection, where the parent node points to its child nodes and the child nodes also point to its parent node are called biconnected graphs.",2, 17963,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graphs are the graphs in which all the elements are connected in such a way that one can traverse between the elements in both directions.,2, 17964,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph means if even if any one vertices were to be removed the graph will still remain connected,2, 17965,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0, 17966,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected undirected graph is a connected graph that is not broken into disconnected pieces by deleting any single vertex (and its incident edges). A biconnected directed graph is one such that for any two vertices v and w there are two directed paths from v to w which have no vertices in common other than v and w.,2.5, 17967,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Bi connected graph is a graph where 2 graphs are connected with each other.,2.5, 17968,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Two graphs connected to a same edge,2.5, 17969,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"A biconnected graph is a graph that has a bidirectional flow i.e., the start node can visit the end node and vice versa. It still follows the",2.5, 17970,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,In a biconnected graph each node is connected to only two of the other vertices of the graph ,2.5, 17971,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,An undirected graph is called Biconnected. A graph is said to be Biconnected if it is connected and it is possible to reach every vertex from every other vertex by a simple path. \n,2.5, 17972,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"non separable graphs are known as biconnected.\neven if 1 vertex is removed, the graph stays connected",2, 17973,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,this is the graph in which two graph are connected using the link in between,2, 17974,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Two graphs which are connected with vertex of each graph,2, 17975,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a biconnected graph is a bidirectional graph. the left vertex is connected to right and the right to the life traversal in both the directions is possible,2.5, 17976,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a biconnected graph is a connected and non-seperable graph meaning if any one of the vertex were to be removed the graph will still remain connected.,2.5, 17977,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is when two graphs are connected through one edge that is between two vertices of both the graph,2.5, 17978,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a biconnected graph has all vertices connected no vertex is left every vertex has 2 arrows ingoing outgoing,2.5, 17979,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a biconnected graph has connections in both the directions.,2.5, 17980,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Two graphs which are being connected with a common edge are called biconnected graph.,2, 17981,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is a connected graph having no articulation vertices.,2.5, 17982,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Graph that does not broken into disconnected pieces by deleting any single vertex.,2.5, 17983,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a biconnected graph is a graph in which two graph are connected.,2.5, 17984,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is a simple graph in which each node is connected to 2 other nodes,2.5, 17985,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0, 17986,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,it is graph in which if any vertices is removed the graph will be still connected,2, 17987,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,graph that is connected with same element in both directions,2, 17988,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A graph biconnected graph is the one in which every element is connected to every other element.,2.5, 17989,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph refers to that graph whereas the the two or many graphs can be connected with each other can be a double loop on one side,2, 17990,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Heap can be used to represent priority queue by making use of 'min heap' or 'max heap' .,2, 17991,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,In minheap or maxheap when we pop any element then this element is minimum or maximum element and in priority queue also we have given priority to minimum and maximum element,2, 17992,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is a graph in which which there may be loops or double edges in the elements of the graph.,2, 17993,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,here two different graphs are made to be connected to reduce the same traversal again and again to reduce the time complexity\nand to reach that graph in single traversal.,2, 17994,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Graph formed by joining Two Big Graphs,1, 17995,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,, 17996,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph is a connected and nonseparable meaning that if any one vertex were to be removed the graph will remain connected.,2, 17997,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,graph connected with single edge,1, 17998,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,if there are two vertex-disjoint paths between any two vertices are present or we can also say that there is a cycle between any two vertices then it is known as biconnected graph,1, 17999,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Two sets of graphs are connected by an edge between them. If that edge is removed two disjoint graphs would be generated.,2, 18000,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,, 18001,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,, 18002,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a biconnected graph is formed when even after removing one edge it still remains connected.,2, 18003,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph is the graph where each node is connected to one or more nodes by at least two edges.,1, 18004,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,it is a graph that remains connected even after the removal of an edge.,1, 18005,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graphs are two separate graphs (Mostly cycles) which are adjoined to each other using a bridge edge. ,1, 18006,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Heap can be implemented in the form of an array/queue.\nHeapify function can used to convert a normal queue to priority queue.,2, 18007,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,graphs that are connected to in both directions.,1, 18008,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,In this type of graph each node is connected to two other nodes of the graph .,2, 18009,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,It is an undirected and non-seperable graph,1, 18010,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Heap can be used to represent a priority queue by taking a minimum element as the root node or a maximum element as the root node . And ensure that this process is followed throughout the heap.,2, 18011,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"A biconnected graph is type of graph where the edges are connected from both the directions to the nodes, unlike a simple graph where they are connected on from a single direction.",2, 18012,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"a biconnected graph is that if any one vertex were to be removed, the graph will remain connected. Therefore a biconnected graph has no articulation vertices .",2, 18013,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A graph which is connected in both directions is bi connected graph. Like if 0 is connected to 2 then 2 is also connected to 0.,2, 18014,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is a graph in which every vertex has more than two edges connected.,1, 18015,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,two cyclic graph connected by a bridge edge.,2, 18016,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Two graphs are connected by a single edge.,2, 18017,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,double ended queue is a type of queue in which both head and tail of a list can act a queue push or pop for required conditions.,2, 18018,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"A graph is which every node has 2 edges, one forward and one backward edge. ",2, 18019,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"Ia biconnected graph is a connected and nonseparable graph, meaning that if any one vertex were to be removed, the graph will remain connected. Therefore a biconnected graph has no articulation vertices.",2, 18020,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,in biconnected graph a node is connected to other node in both the directions,2, 18021,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,path between two node has both inward and outward path between each other is called biconnected graph,2, 18022,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph are two graphs which are connected by a path. ,1, 18023,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"In a priority queue, every element has its priority according to the given criteria. So, if this criteria is smallest or greatest element, then we can use min-heap or max-heap as it ensures the smallest or greatest element as the root of the priority queue.",2, 18024,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,in bi connected graph we start from starting as well as from goal and comes to middle of the graph as ,1, 18025,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"a graph whose vertices have both forward connections and reverse. bidirectional links between verices.,",1, 18026,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,connected graph no articulation vercites.,2, 18027,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is graph in which two pair of graph interconnected with each other ,1, 18028,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"Biconnected graph is a graph in which two components are joined by an edge making it a connected graph, if that edge is removed the graph will become disconnected and it will have 2 components.",1, 18029,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph are the type of graph in which the node of one graph is connected with the node of other graphs ,1, 18030,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph are the graph in which each vertices is connected with two edges ,1, 18031,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is a graph in which 2 different graphs are connected by a single connection.,2, 18032,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a graph in which two graphs are connected by a common node is a biconnected graph,1, 18033,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,priority queue are same as min heap in which each root element is less than its child.,1, 18034,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,2 graphs are biconnected if they don't have any common edge or vertices.,1, 18035,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is a graph in which nodes point to each other,2, 18036,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is the one in which we can travel in both the directions i.e. we can go from one node to the other and then come back as well.,1, 18037,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"Its a connected and non separable graph ,if any one vertex is removed ,the graph remains unconnected.",1, 18038,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is a graph in which a graph is connected to two other graphs via a single node.,1, 18039,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,the graph in which every node is connected to two nodes,1, 18040,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Applying certain restrictions oh ,1, 18041,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,graph where every edge is connected in both the direction like in a graph if a to b exists then b to a is present as well,1, 18042,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is a graph which is connected by a common node. ,1, 18043,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph is a graph in which edges are non-directional means if there is an edge between A and b then we can move in both directions that is From A to band from b to a as well.,2, 18044,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"biconnected graph is when a we can traverse back and forth between two nodes in the graph. Example if we can go from A to B , then we should also be able to go from B to A.",1, 18045,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is graph where one vertex has 2 edges connecting to 2 different vertices.,1, 18046,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is bidirectional graph in which we can traverse in both direction.,1, 18047,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a biconnected graph has every vertex connected with every other vertex ,1, 18048,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0, 18049,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"it is a type of graph which gets divided into two graph if one common node is removed from the graph, basically it has a internal node which connects two sub graphs. ",1, 18050,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph is a graph which is all the vertices are connected to one another. ,1, 18051,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,", \",0, 18052,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"A biconnected graph is a one in which all the vertices are connected to each other, that is the edges are bi-directional.",1, 18053,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is when two graphs are connected to each other through a common vertex,1, 18054,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is which has two sub components. ,1, 18055,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph is a graph which is formed by the combination of two disconnected graphs connected by a singe endge.,1, 18056,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,in bi connected graph two element are joined by an edge making it a connected graph,1, 18057,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0, 18058,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,The biconnected graphs are two way directional graph at each node which can be weighted same or different,1, 18059,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,two vertex disjoint path in a graph ,0, 18060,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0, 18061,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Two graphs connected together is known as biconnected graph,1, 18062,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0, 18063,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected is a undirected graph if there are two vertex disjoint paths between any two vertices.,1, 18064,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"Biconnected graph is the type of graph if one vertex is to be removed then the graph will remain connected therefore, biconnected graph \nhas not any articulation vertex. ",1, 18065,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a biconnected graph is a graph where we can ,1, 18066,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,if a graph will remain connected if any end is removed that graph is called biconnected graph,1, 18067,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A graph in which a node A can be reached from node B and vice A versa. ,1, 18068,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a graph in which every element is connected to every other element is called biconnected graph,1, 18069,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,IT IS A GRAPH WHICH HAS AN EDGE THAT CONNECTS TO DIFFERENT GRAPHS ,0, 18070,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,the two graph connected by a simple singular node.,1, 18071,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,it is a type of graph that is not broken into pieces upon deleting any of its vertex,1, 18072,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph is a graph in which each vertex has exactly two edges connection the other vertex.,1, 18073,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"The graph in which each of its vertex are connected with exactly two edges are known as biconnected graph.\nExample: -a-b-c-\nIn this example, all the vertices have exactly two edges.",1, 18074,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,it is a undirected graph in which there are two disjoint vertices.,1, 18075,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"in a bi connected graph, when a vertex from the graph, the graph doesn't split into parts.",1, 18076,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a graph in which even if one edge were to be removed even then it will remain connected,1, 18077,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph is that graph in which every vertex has two edges ,1, 18078,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a graph is binconnected if it has no articulation points . an articulation point is a vertex whose removal increases the number of connected components in a graph ,1, 18079,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"Threaded binary tree has the advantage that ends nodes i.e. the child nodes, are connected to the root nodes the ones towards the left being on left and the ones on right towards the right such that at the end when we are traversing it, the data can be accessed without going back and traversing it back from the bottom. ",1, 18080,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,BIconnected graph is a connected graph having no articulation vertices.,1, 18081,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,When two nodes are connected in a way that we can reach from either of the nodes to either of the other nodes. ,1, 18082,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph is a graph which is made by connecting two graph using a common edge.,1, 18083,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,It is a type of graph in which two graph are connected with a single edge. ,1, 18084,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Two different graphs connected by an edge is a biconnected graph.,1, 18085,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,When two different graphs are connected by a single edge then they are known as bidirectional graph.,1, 18086,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A Queue which is bidirectional - values can be pushed (inserted) or popped (deleted) from any end.,1, 18087,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is a type of directed graph in which we have direction to move on both sides of a edge,1, 18088,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,two vertices are connected by a single edge,1, 18089,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Threaded binary show the steps involved to place an element at a particular node. ,1, 18090,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,in this graph the connection between the vertices are in both direction (bidirectional).,1, 18091,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A graph in which there is bidirectional connectivity between each pair of vertices.,1, 18092,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a biconnected graph is a graph which is connected in a way that we can go back and fro from a node to the next noe or go back from that node to previous node.,, 18093,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,graphs in which edges are directed in both directions.,, 18094,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,, 18095,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,, 18096,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a graph which has bi directional edges. ,, 18097,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Graph which is connected bi directionally.,, 18098,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,nondirectional graph are known as biconnected graphs,, 18099,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph has 2 edges between 2 vertices.,, 18100,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graphs are the graph in which there are two graphs connected to each other through a bridge ,, 18101,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,when to graphs are connected to each other are called bioconnected graph,, 18102,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Graph in which we can travel forward as well as backwords.,, 18103,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is graph in which a node is connected to other node in both directions.,, 18104,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,in biconnected graph we can traverse on both sides of the node at once,, 18105,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,when there is no connecting edges between two sets of graphs ,, 18106,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A biconnected graph is a graph where two vertices can be used to visit each other through a same common edge.,, 18107,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,When any two sets of consecutive nodes in a graph are connected bidirectionally we say that graph as a biconnected graph.,, 18108,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,graph in which we can perform forward and backward ,, 18109,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A graph that allows traversal in both directions.,, 18110,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,in which two subgraphs are connected to each other through an edge,, 18111,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph., if any of vertices of the graph will be remove it remain same.,, 18112,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph means each vertex if connected to some other vertex and vice versa ,, 18113,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph is such a graph in which the the rightmost leaf node serves as a root node for other graph.,, 18114,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,The graphs which are connected to each other simultaneously are know as biconnected graphs.,, 18115,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Biconnected graph is defined as to connect the two graph though through the connection of one between two vertices of two graphs.,, 18116,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,, 18117,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,Two graphs which are connected together are called biconnected graphs. They can be connected by anything rather it be a single vertex or edge!,, 18118,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a connected graph that is not disconnected into pieces after deleting elements ,, 18119,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,, 18120,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph in which a two graphs aur connect with a single point,, 18121,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,it is a data structure in which two different graphs are connected with each other using single node,, 18122,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,A graph is called biconnected when its not getting disconnect from deleting elements.\n,, 18123,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graphs have bidirectional edges.,, 18124,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"one graph connected to other graph, has bidirectional edegs",, 18125,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is a type of graph which is connected from two different graphs at the same time.,, 18126,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,"Biconnected graph refers to a graph in which we can go to the next node via any side of the edge. The edges are undirected in nature and if the node is connected to another node via an edge , then our pointer could travel to the other node irrespective of the direction of the other node",, 18127,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph are those which are connected on both the sides.,, 18128,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,the graphs that are connected to each other ,, 18129,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,the graph which has elements connected to each other by directions also ,, 18130,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,a biconnected graph is a graph in which two graphs are connect through one vertex.,, 18131,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph connect the closes node of the graphic node a graph and perform well ,, 18132,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,2 graphs which are connected by the vertex is called a biconnected graph.,, 18133,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,because heap provide sorting that way is and other reason as well,, 18134,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,this graph show direction.,, 18135,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,when two graphs is connected from two points of each graphs is called a biconnected graph ,, 18136,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,biconnected graph is the graph where two graphs are connected through an edge .,, 18137,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18138,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete is the order of probabilistic values which are arranged deterministically ,0, 18139,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18140,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete problems are the problems that are NP-Hard but have a non deterministic solution that can solve the problem in polynomial time,2.5, 18141,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Np complete problems are the problems which can be solved in exactly polynomial time.,2.5, 18142,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,The problems which can be solved in exactly polynomial time are called NP -complete problems.,2.5, 18143,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"A problem is a NP problem ,if its solution can be guessed and verified in polynomial times. nondeterministic means that no particular is followed to make guess. if a problem is NP and all others NP problems are polynomial time reducible to it. ",2.5, 18144,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Np complete uses non-deterministic approach to reduce time complexity to its polynomial time.,2.5, 18145,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete algorithms are algorithms which uses non-deterministic approach to get reduce its time complexity to polynomial time,2.5, 18146,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18147,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,The problem that uses deterministic approach to solve the problem ,2, 18148,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP- complete is the problems that has non polynomial time complexity or we can say it follows the exponential approach and can be solved in a deterministic manner. Means we can write each and steps easily although it has exponential time. ,2.5, 18149,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Non polynomial complete means the given data structurer problem does not gives the time complexity in polynomial form rather it gives in exponential form.,2.5, 18150,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP is negative polynomial that does not have polynomial time complexity,2.5, 18151,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,a problem which has exponential time complexity that can be written non deterministically is called NP-Complete .,2.5, 18152,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP- complete are those problem which have time complexity in terms of exponential but they can be written into non-deterministic method which have time complexity of polynomial order .,2.5, 18153,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Problems that can be solved in polynomial time in a non-deterministic way are NP complete problems.\nNP complete problems are a subset of NP hard problems,2.5, 18154,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"We have a biconnected graph in which one of the edge acts as a bridge between the graphs nodes, which will convert into the two disjoint graphs if we removed that edge (one, which is acting as a bridge)",2.5, 18155,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Np problem is positioning all element efficiently such that the required time is polynomial. If a problem is np hard is can be used to detect whether other problem is np hard . ex -Cleque algorithm,2.5, 18156,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete is a problem which gets solved in polynomial time using non deterministic approach.,2.5, 18157,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18158,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Np complete problem is a problem for which no efficient solution algorithm has been found,2.5, 18159,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,A NP hard problem is basically a exponential problem or the problems taking more time. A NP Hard problem which has undeterministic algorithm and can be solved in polynomial time is termed as NP complete problem ,2.5, 18160,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,biconnected graphs are those graphs who have two subgraphs that are completely connected individually but not completely connected with eachother.,2.5, 18161,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Np complete problem can have a solution in exponential form and can't be reduce to the polynomial one .,2.5, 18162,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP- Complete are those Non-Polynomial-hard problems which can be solved in a non-deterministic way in Polynomial time.,2.5, 18163,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,It is a kind of NP problem which is non-deterministic solution in polynomial time.,2.5, 18164,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,It is a type of NP problem which is non deterministic in nature. These have polynomial time complexity.,2.5, 18165,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Np - complete problem are those problem which are changed from having exponential time complexity to polynomial time complexity.,2.5, 18166,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"NP means non-polynomial problem (Eg: problems that have exponential time complexity and not polynomial). NP - complete means the non-polynomial problems that are complete, i.e. they check all the possible options to find the solution.",2.5, 18167,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete are the ,0, 18168,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,taking polynomial time and we have the proposed algorithm that is taking lesser time than the existing algorithm.,2.5, 18169,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,when a problem is a np-hard problem but we get a non- deterministic solution of np hard problem then the problem becomes np-complete problem.\nit is a intersection of np and np-hard problems.,2.5, 18170,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18171,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18172,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18173,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP - Complete is ,2.5, 18174,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18175,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Heap can be used to represent priority queue as in priority ques elements when added automatically sort them in increasing and decreasing order(by default increasing). we use heap to sort the elements to construct a priority queue. ,2, 18176,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Non polynomial - complete,2.5, 18177,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18178,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Those Np hard problems that can be solved through a polynomial time taking algorithm are referred as NP-complete problems.,2.5, 18179,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,np complete are the problems that can be solved using polynomial time taking algo,2.5, 18180,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18181,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,An algorithm where the evaluation is minimized is called NP- Complete.,2.5, 18182,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP- Complete stand for Non polynomial complete is said to be the problem which do not have polynomial time to be solved. These problems cannot be solved using greedy or dynamic approaches but can be solved by modifying satisfiability.,2.5, 18183,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP - Complete problems are those problems which can be computed an non-polynomial time ,2.5, 18184,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Problems which require an non - polynomial time to execute are termed as NP - Complete problems.,2.5, 18185,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP-Complete problem is a problem which can be solved in non polynomial time.,2.5, 18186,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,The problems which can be solved in non-polynomial time are known as NP-Complete problems.,2.5, 18187,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP Complete is has same degree throughout.,2.5, 18188,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Np - complete has the same degree throughout.,2.5, 18189,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution., which are vertices whose removal would disconnect the graph.,2.5, 18190,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP - Complete refers to the automata problem in which we check for the given input to follow a certain set of rules which make it NP complete.,2.5, 18191,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18192,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18193,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18194,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP is the algorithm which have non-polynomial time or space complexity.,2.5, 18195,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,whose solution can't be found in algebraic time,0, 18196,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,A graph in which each node have either zero or two children is called NP-Complete.,2.5, 18197,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,-,0, 18198,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Np is a set of decision problems that can be verified in polynomial time,2.5, 18199,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18200,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18201,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"If a problems solution can be guessed in polynomial time and no as such rule is followed to make the guess . if a problem is NP and other problems are reducible to polynomial time of it , the problem is NP complete.",2.5, 18202,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete problem (non deterministic polynomial if it's solution can be guessed in polynomial time ,2.5, 18203,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Np complete problem is a type of problem which can be done only in non-polynomial time or exponentially time,2, 18204,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,I,0, 18205,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18206,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18207,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18208,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,a problem is called np(nondeterministic polynomial) complete when its can give deterministic solution in polynomial time,2.5, 18209,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete problems are the problems that can be completed in exponential time.,2.5, 18210,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"NP is a set of decision problems that can be solved by a Non-deterministic Turing Machine in Polynomial-time. P is a subset of NP (any problem that can be solved by a deterministic machine in polynomial time can also be solved by a non-deterministic machine in polynomial time). \nInformally, NP is a set of decision problems that can be solved by a polynomial-time via a “Lucky Algorithm”, a magical algorithm that always makes a right guess among the given set of choices",2.5, 18211,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18212,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18213,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,An NP complete data structure can stores the value of the user so that it cannot be over written and hence is permanently stored in the created structure.,2.5, 18214,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18215,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution., NP is a set of decision problems that can be solved by a polynomial-time.,2.5, 18216,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution., ,0, 18217,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,it is non deterministic polynomial complexity equation which convert into determinoistic polynomical equation,2.5, 18218,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,-,0, 18219,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,non-polynomial,2.5, 18220,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP- Complete problem is a computational problem for which no efficient solution algorithm has been found.,2.5, 18221,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,np complete are the problems that can be converted from non polynomial to polynomial time,2.5, 18222,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP - Complete means it is either true or false,2.5, 18223,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,in these problems any input to the problem has answer either in form of yes or no.,2.5, 18224,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"NP Complete should be NP-Hard,, whose result is either true or false.",2.5, 18225,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,IF a problem is NP AND ALL other NP problems are polynomial time reducible to it the problem is NP complete.,2.5, 18226,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18227,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP - complete is informed search which includes best first search and A* search. ,2.5, 18228,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP is a particular condition in an algorithm which has no solution.,2.5, 18229,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18230,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,any of a class where no solution is found is called NP,2.5, 18231,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,non polynomial complete problems in which they have many no. of states to solve\nit has high same and time complexity but informed search can solve easily,2.5, 18232,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP stands for non-polynomial. The problems that can be completed in non-polynomial time are called np-complete problems.,2.5, 18233,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,np refers to the non deterministic polynomial to change the polynomials,2.5, 18234,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18235,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,if Graph remain connected if any end is removed then it is called biconnected graph,2.5, 18236,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,An np complete problem represents the problem in which the time complexity is represented as n^n or n^p which is the largest time complexity. For example going through a Fibonacci sequence without using dynamic programming.,2.5, 18237,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,randomized algorithm where we reduce the complexity to polynomial from exponential,2, 18238,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,These Type of Problem does not definite polynomial solution \nthese problem are based on randomized algorithm \nthese have probalistic solution whether they pass or not,2, 18239,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18240,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Np complete means no efficient solution algorithm has been found.,2, 18241,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18242,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18243,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete means the solution the problem is achieved when the Not Pick condition gets true. Time complexity goe sto O(n^n),2, 18244,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18245,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18246,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP(non deterministic polynomial time ) is defined when no solution can be found,2, 18247,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Non Polynomial are the data structures which store characters like sting data type or char data type.,1, 18248,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,it is non deterministic polynomial time complete is a class of computational problem .\nit suggests that there is no known efficient algorithm to solve that problem ,2, 18249,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP stands for Non Polynomial. ,1, 18250,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Graph in which two cyclic grah are connected by a line,2, 18251,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP problems that has a solution,1, 18252,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP is a set of decision problems that can be solved by a Non-deterministic Turing Machine in Polynomial-time. P is a subset of NP (any problem that can be solved by a deterministic machine in polynomial time can also be solved by a non-deterministic machine in polynomial time).,1, 18253,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.," If a problem is NP(nondeterministic polynomial) and all other NP(nondeterministic polynomial) problems are polynomial-time reducible to it, the problem is NP-complete.",2, 18254,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Each node is connected to two different nodes of the graph.,2, 18255,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18256,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution., NP-Complete is a complexity class which represents the set of all problems X in NP for which it is possible to reduce any other NP problem Y to X in polynomial time.,2, 18257,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18258,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18259,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18260,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution., ,, 18261,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,in threaded binary tree we can directly jump from end of one branch to end of other branch because the are connected by a thread.,2, 18262,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,when time complexity is n to the power n.\n(n^n),1, 18263,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.," a problem is NP-complete when: It is a decision problem, meaning that for any input to the problem, the output is either \",2, 18264,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP- complete problems are the problems which can be solved using standard algorithms by doing a small modification in them or combining more than one algorithms,2, 18265,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,The problem that can be solved by using algorithm is called NP - complete ,2, 18266,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP-Complete problem is a problem whose solution is known.,1, 18267,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"The biconnected graph or undirected graph is a graph in which every edge could be traversed by both of the sides.\nConsider A--B, then it means B can be visited by A and A can be visited by B.",2, 18268,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"NP refers to the Non Polynomial problem , NP is very important as we can see it is used for comparing the string matching , In AI algorithms like knapth and rabin , by using NP we solve, In Np we use algo such like we compare the require pattern from text >\nWe use NP problem in graph and in pattern for finding the pattern and reaching the Goal state ",2, 18269,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18270,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18271,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,any class of computational problems for which no efficient solution algorithm has been founda ,1, 18272,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP- Complete are the problems where the time complexity is n to the power n. n being the size of problem set.,1, 18273,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP -complete is a problem solving technique,1, 18274,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete algorithms are the algorithms that have been completed in a polynomial time ,2, 18275,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18276,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete is a problem which has non deterministic solution,2, 18277,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,when two graphs are connected by 2 edge they are said to be biconnected graph.,1, 18278,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete is basically the intersection of non deterministic function and hard non deterministic function of problem.,1, 18279,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP are the algorithms that are completed ion polynomial time ,2, 18280,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete problems are the problem that belong to the NP hard criteria but a solution has been create for it. ,2, 18281,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"Its a decision problem ,meaning that for any input to the problem ,the output is either yes or no,when the answer is yes,can be demonstrated through short evaluation.",1, 18282,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18283,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,the problems that are non deterministic and their solution exists.,1, 18284,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18285,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP stands for Non deterministic polynomial. it is an approach wherein the code segments are left with function references for future scope so that its time complexity can be reduced from a higher one to a polynomial expression.,1, 18286,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,it is a problem which has non deterministic values.,1, 18287,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP Complete are the set of problems which are non-deterministic exponential in nature.,1, 18288,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,np complete is when we have a non deterministic polynomial solution for a np hard problem,1, 18289,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete is a problem which is NP hard and when the exponential time complexity can be done in polynomial time,1, 18290,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP Complete are the non deterministic problems.,1, 18291,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,these problems are solvable as to find the most optimal path ,1, 18292,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP Complete is an NP hard problem which have a non deterministic solution.,1, 18293,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,These are the problems whose solution exist but they are non deterministic.,1, 18294,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18295,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.," etc\n3, We can implement stack using a linked list.\n",0, 18296,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18297,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18298,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP Problems are research based problems in which research is still going on for optimization and the solution hasn't been discovered. NP Complete problems have some solutions but there aren't optimal ones yet. ,2, 18299,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete problem is non placing problem .,1, 18300,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,in np complete problems have time complexity of n to the power n\nn-size of set,1, 18301,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18302,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"NP Complete are the problems where the time complexity is n to the power of n, where n is the size of the set",1, 18303,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18304,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18305,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18306,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18307,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18308,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18309,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,any class of computational problems for which no efficient solution algorithm has been found,1, 18310,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,the problems whose answer is either true or false for any input is called an np complete problem,1, 18311,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"In np complete problems, The algorithm has a polynomial time. If an algo is in np and every algo is reducible to np it is np complete.",1, 18312,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18313,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18314,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,The name \,0, 18315,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,a problem is called NP complete if it can be completed in polynomial time.,1, 18316,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP-complete are algos which has polynomial time complexity and their recurrence may be deterministic.,1, 18317,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,these are hard problem which can solve in polynomial time interval,1, 18318,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,np is the algorithms which takes non polymnomial time. mainly recursive function in which we have to try all the possible path to reach to the final solution is NP . it follows exponenetial time complexity.,1, 18319,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,solution can be guessed and verified in polynomial time.,1, 18320,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,non polynomial problems ,1, 18321,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Np complete are the np hard problems which can be solved in polynomial time complexity,1, 18322,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,a problem is called NP(nondeterministic polynomial)if its solution can be guessed and verified in polynomial time.\nif a problem is NP and all other NP problems are polynomial time reduicble to it,1, 18323,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Heap can be used to be represent a PQ via keeping the root node on top and the data insertion on via the leaf nodes or vice versa. Then it can be manipulated accordingly to act as a priority queue ,1, 18324,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"A problem is called NP if its solution can be guessed and verified in polynomial time; nondeterministic means that no particular rule is followed to make the guess. If a problem is NP and all other NP problems are polynomial-time reducible to it, the problem is NP-complete.",1, 18325,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP - Complete are NP Hard problems which have a solution in the polynomial form but in the Non - determinate way. ,1, 18326,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete has the same degree throughout .,1, 18327,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,Np complete is the subset of Np-Hard problems these refers to the Np- Hard problem whose non-deterministic solution/algorithm in polynomial time exists;\nFor eg. No of Cliques in a graph problem.,1, 18328,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,It is,0, 18329,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,All NP-Complete problems are a part of NP-Hard problems in which the non-deterministic solution is present in polynomial time.,1, 18330,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"Faster execution, Faster Searching and faster insertion.",1, 18331,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,non polynomial complete problem is a type of problem which can be solved in polynomial time and we have all the information like heuristic value to perform informed search,1, 18332,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,it is a part of np-hard problem in polynomial time complexity getting a non deterministic solution,1, 18333,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,min heap and max heap. ,0, 18334,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,it is a problem which can be solved in polynomial time. its solution is non-deterministic.,1, 18335,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP-Complete is a type of problem which can be solved in polynomial time. It has non-deterministic type solution.,1.5, 18336,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete or non-deterministic polynomial complete problem is a type of problem having non-deterministic polynomial complete complexity.,2.5, 18337,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,solution can be guessed and verified in polynomial time.,2.5, 18338,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete problems are intersaction of NP and NP hard ,2, 18339,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,A problem is NP-complete if it is both NP and NP-hard. NP-complete problems are the hard problems in NP.,2.5, 18340,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP-complete is when the algorithm is not available to solve a problem in whatever time complexity possible.,0, 18341,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"The NP - Complete is used in Machine learning. It is a similar module like NLTK and Tensorflow, it is used to naturally train the program.",0, 18342,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP-complete are those for which the solution exist for each type of problem,0, 18343,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,It is the collection of decision problems that can be solved by a non-deterministic machine in polynomial time. ,2.5, 18344,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,In NP-complete we know the complete solution ,0, 18345,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18346,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution., A NP complete language can be used for Machine Learning models,0, 18347,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18348,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,np complete is the intersection area of n and np incomplete,v, 18349,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,it is a problem which cannot be solved in effecient time complexity and no effecient algo can be given,0, 18350,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution., A problem is NP-complete if it is both NP and NP-hard. ,0.5, 18351,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18352,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,0, 18353,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,deterministic problems are np complete,, 18354,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,it means that the problem has an effective solution that can be found ,, 18355,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18356,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18357,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP - complete are such problems which comes under NP hard problems and whose solution exists and we have deterministic answer,2.5, 18358,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,"NP Complete is a non-distinctive type of problems for which a solution could be find in the future , basically it is the intersection of NP and NP Hard type of problems. ",2, 18359,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP complete is defined as the problem which are non deterministic NP hard problems.,2.5, 18360,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18361,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP means an algorithm which causes no problems in executing.,0, 18362,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,a NP-hard problem having a non deterministic solution ,1, 18363,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,A NP- hard problem with a non determine solution.,1, 18364,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18365,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,it reffers to the class of problem under automata whose solution is to be find it can be hard as well as easy if its solution is known then it is called deterministic np otherwise non deterministic np.,, 18366,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,A NP Hard problem with a Non deterministic solution ,, 18367,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18368,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18369,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP = hard problem with non determined solution,, 18370,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP - Complete or Non Polynomial Complete problems are problems which are exponential in nature,, 18371,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP- Complete is an intersection of an NP and an NP Hard problems.,, 18372,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18373,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18374,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,NP is defined as a non deterministic problem in which there is no prior knowledge of any kind when executing a program or the output is unknown.,, 18375,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,it determine the un known protocol it the between batcher a hard way so it is complete solution ,, 18376,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18377,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18378,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,in under NP hard. knapsack etc.,0, 18379,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,np complete - is hard problem with a non determistic solution ,2, 18380,Define NP - Complete,NP is the class of decision problems for which a given proposed solution for a given input can be checked quickly to see if it is really a solution.,,, 18381,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",biconnected graph is neighbors node connected each other ,0, 18382,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",when nodes are connected with each other and we can access the nodes in a random order in either direction it is a simple graph,2.5, 18383,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph can be called simple graph if it has two vertices that are connected to each other which is not connected to other graph,2.5, 18384,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph in which there is no cycle present and no vertex is disconnected,2.5, 18385,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","Simple graph is a graph which does not have any edge weights, no edge directions. ",2.5, 18386,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is a graph where there is no more cycles in a graph.\nThe graph where we can go from one node to another,2.5, 18387,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph with no loops and no parallel edges. \nit is an unweighted graph. ,2.5, 18388,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph is a graph which doesnot have any loops.,2.5, 18389,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is a graph which does not have any cycles or self loops.,2.5, 18390,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph that does not contain more than one edge between the pair of vertices,2.5, 18391,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","A simple graph is a graph which is undirected , each node is connected to at least one node.",2.5, 18392,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is a graph that has finite nodes and have only one edge between the two nodes of a graph .,2.5, 18393,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is which contains all its edges and vertexes connected to each other.,2.5, 18394,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is a data structure in which all edges and vertices are connected.,2.5, 18395,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is just a tree in which all the nodes are interconnected and there are no leaf nodes .,2.5, 18396,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Graph have each and every connected to one another.,2.5, 18397,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",any non-directed graph is a simple graph,2.5, 18398,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","A simple graph consist of a root node which has children either 1 or 2. And continuing this way, the last node, which has no children nodes becomes the leaf node.",2.5, 18399,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","A simple graph is the graph made from vertex ,edges and is complete in itself .It is a closed loop .",2.5, 18400,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is graph:\n1)which has no multiple edges between 2 vertices. \n2)which has no self loops.,2.5, 18401,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,0, 18402,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",It is a directed graph with any number of elements.,2.5, 18403,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is a complete graph having starting and ending vertices are connected to each other forming a cycle and are connected to each other ,2.5, 18404,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",NP - Complete are those set of problems which have non deterministic solution which are solved in polynomial time. ,2.5, 18405,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","simple graph have undirected , non labeled edges .",2.5, 18406,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",When some vertices are joined together by some edges it makes a simple graph.,2.5, 18407,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A non-directed graph with no weightage is called as a simple graph.,2.5, 18408,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is the one which is not directed and has no weightage.,2.5, 18409,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph having same no of edges and vertices are called simple graph.,2.5, 18410,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph that has only single edges and no loops in it.,2.5, 18411,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",all nodes and edges are linked in a simple graph.,2.5, 18412,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",graph which does not contain any cycle.,2.5, 18413,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",it is a non-linear data structure and is collection of nodes and edges is a graph where each node is connected to any other node by an edge.,2.5, 18414,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph help user to store data of a defined variable whichever datatype u want to relate with that variable. In which all edges and nodes are linked.,2.5, 18415,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is one which has same starting and ending point but no other vertices except for starting vertex should repeat. ,2.5, 18416,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is undirected. A simple graph does not have multiple edges. It does not have loops.,2.5, 18417,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph that does not have self loop and multiple edges and is undirected is called simple graph.,2.5, 18418,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.", A simple graph is a kind of graph which has all the vertices and edges connected or can be disconnected. ,2.5, 18419,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A biconnected graph is a graph in which every vertex had only 2 edges.,2.5, 18420,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is a primitive graph in which there are no necessary connections between all vertices.,2.5, 18421,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","Simple graph is graph in which there are random vertices and they might or might not be connected it each other, without any restriction or constraint.",2.5, 18422,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple Graph refers to a graph that is not disconnected at any point .,2.5, 18423,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",graph that we get while solving problem using algorithm is what we called simple graph. In a graph you have vertices connected to each other but they should not be cyclic.,2.5, 18424,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",NP complete is one in which we get a solution in polynomial complexity.,2.5, 18425,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph which has one cliques or more cliques is known as a simple graph.,2.5, 18426,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph can be defined as a graph having V vertices and E edges joining all the vertices.,2.5, 18427,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is type of data structure that has edges E and vertices V attached like a tree data structure.,2.5, 18428,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","A simple graph is a type of data structure that has data stored in nodes, and nodes are interconnected within themselves following a given methodology or given formula.",2.5, 18429,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph in which all the nodes are connected to only 2 nodes.,2.5, 18430,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a type of graph in which all the nodes are connected.,2.5, 18431,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple Graph is composed of nodes called vertices and connected or joined with each other through lines or edges. It is not necessary to have vertices connected through edges. It can have just vertex as well. \nEx: Graph having one vertex is a simple graph.\nGraph having 2 or more vertices but not connected with each other is also a simple graph.,2.5, 18432,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph in having node and all nodes are connected to each other.,2.5, 18433,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","the problems which can be solved but with time complexity in nondeterministic polynomial-time complete\nIn this name, \",2.5, 18434,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","A simple graph is a graph which forms a polygon like shape, that is each edge has a input node and an output node all connected forming a simple sequence.",2.5, 18435,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A Simple graph is a data structure with nodes and edges connected together to store data. The nodes are connected in one way and are not weighted. ,2.5, 18436,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph which is undirected and has no loops.,2.5, 18437,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","a graph is a simple structure which defines the relations and the weight between the 2 designated points. it can be further used to implement various path finding algorithms like shortest distance, dikstras algorithm and more",2.5, 18438,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph which contains only vertices and edges. This does not include weighted graph.,2.5, 18439,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is one which contains no self loops or multi edges,2.5, 18440,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph in which each node is connected with one or other graph.,2.5, 18441,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph that has two vertices ,2.5, 18442,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph which is not directed and has no loops,2.5, 18443,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",The graph which is not connected with others graph and there is complete in nature ,2.5, 18444,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is the one where there are no intersections and all vertex are connected to other vetex by a single edge,2.5, 18445,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph without loops and multiple edges between two vertex,2.5, 18446,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph is a graph that has no overlapping values ,2.5, 18447,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph where nodes are connected with two other nodes only,2.5, 18448,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A GRAPH WHICH IS CONNECTED TO THE OTHER NODES AND TRAVERSE THE .,2.5, 18449,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",it a graph which is undirected and does not consist of any loops.,2.5, 18450,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a data structure where a parent node can have any number of child nodes and the nodes can be inserted in any way or form.,2.5, 18451,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,0, 18452,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is a graph that do not have more than one edge between two vertices,2.5, 18453,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a type of graph in which each vertex has at least 2 edges.,2.5, 18454,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",it is a non linear data structure defined with definite number of vertices and edges.,2.5, 18455,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is graph which only has one graph and and have some nodes connected to each other.,2.5, 18456,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","A simple graph is a graph with no weights , no cycle and non-directed.",2.5, 18457,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a path made up of nodes interconnected to each other where each connection forms a closed loop and visits every node while only visiting it once.,2.5, 18458,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is a graph is which each vertex is connected to only one other vertex.,2.5, 18459,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","A simple graph is an unweighted, undirected graph containing no loops or multiple edges. It can either be connected or disconnected.",2.5, 18460,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph is a collection of nodes which are joined together by edges. a simple graph does not have more than one edge between 2 nodes and there are no cycles.,2.5, 18461,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph is the graph which is connected to each ,1, 18462,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",An undirected/ non-weighted graph with no self loops is a simple graph,2.5, 18463,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph with different vertices connected to other vertices through edges.Not necesarrily it may be a complete graph and it is not a disconnected graph,2.5, 18464,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is a graph that is undirected and does not have any loops or multiple edges.,2.5, 18465,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph is non weighted graph and non directional graph such that it forms a cycle and one vertex is connected to only edge ,2.5, 18466,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is a graph where each vertex is connected to one vertex .it is a connected graph,2.5, 18467,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph has no bidirectional edges or self loops.,2.5, 18468,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is the graph in which each vertices is connected to only one edge.,2.5, 18469,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph is undirected and does not have any loops or multiple edges,2.5, 18470,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is graph which does not consist of self-loops and no parallel edges.,2.5, 18471,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is a graph which can have as many cycles and every node is connected to any other node(one or many).,2.5, 18472,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a set of nodes in which the nodes are pointing to any other node or each other,2.5, 18473,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph are the graph in which there are no restriction against anything if we add new node to the tree it will added to the tree in left to right form.,2.5, 18474,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",graph with only one edge between 2 vertices,2.5, 18475,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,0, 18476,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph in which each node does not have multiple vertices and it does not have self loops.,2.5, 18477,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph refers to that graph where all the vertices are connected without forming any circular loops ,2.5, 18478,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,0, 18479,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Which has non polynomial time complexity problem and whose answer is either true or false,2.5, 18480,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph in which there is no looping or double edges.,2.5, 18481,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph in which two of its vertices and connected is called a simple graph.,1, 18482,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple Graph is basically a graph which in which all nodes are connected at most which with two different nodes\n\n,1, 18483,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","simple graph contains edges which may be directed non directed , weighted , non weighted connecting vertices to each other.",1, 18484,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is a graph that is undirected and does not have any loops or multiple edges.,1, 18485,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",graph which do not have any cycle,1, 18486,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph that is undirected and does not have any loops or multiple edges. ,2, 18487,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is collection of group of edges without any loops.,2, 18488,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is a combination of nodes and edges connected it any fashion. ,2, 18489,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",graph which has no loops and double edges are called simple graph.,1, 18490,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is the one with vertices and edges that doesnt has self loops and mutiple edges,2, 18491,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a data structure which stores the data in a hierarchy. ,1, 18492,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",it is a type of graph that consists a set of vertices connected by edges.in it there are no self loops or multiple edges from the same vertex.,2, 18493,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph contains no self pointing or parallel edges and without any self loops/cycles within the graph.,2, 18494,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,, 18495,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph does not have multiple parts. It does not have \n1. disconnected graphs\n2. no vertex has an edge on itself. ,1, 18496,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",in a simple graph is like a tree but the nodes can be connected randomly to each and every element of the node there is no level wise necessary division as in the tree.,2, 18497,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex,2, 18498,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Set of decision problem that can be solved by non deterministic turing machine.,1, 18499,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","A simple graph is type of graph where the edges are connected from a single direction to the node, unlike a bi-directional graph where they are connected from both the directions.",2, 18500,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph consists of edges and vertices,2, 18501,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is like a normal graph which is unidirectional and without any rules.,2, 18502,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple Graph is a non weighted graph ,2, 18503,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",it is a set of points connected together making edges,1, 18504,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is one which does not contain any cycles.,1, 18505,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",by using min heapify or max heapify technique a heap can be represented as priority queue.,2, 18506,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph with no loops and no double edges.,2, 18507,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.", or \,, 18508,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",in simple graph a node is connected to other node in both the directions or basically without any arrows and there are no cycles in the graph,1, 18509,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",connection b/w different node is called simple graph ,1, 18510,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph that does not contain any self loop or parallel paths.,2, 18511,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",NP-complete problems are the problems which can be solved by the previously found algorithms and they dont contain any specific test-run case.,2, 18512,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","simple graph refers o the the graph coloring problem , in this we can find out minimum number of color require for coloring such that no two consecutive are of same color.",1, 18513,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","a simple graph contains vertices and edges between any two vertices taken at a time. it is a useful datastructure used for applying algorithms like djiktras for shortest path, and also DYNAMIC PROGRAMMING.",1, 18514,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",graph does not contain more one than edge between pair of vertices.,2, 18515,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",the simple graph is a graph in which it should not contain one or more than one edge,2, 18516,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is a graph which has no loops and double edges.,1, 18517,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","A graph is collection and connection of different nodes with each other .it can be in 2D consisting (x,y) coordinates or 3D consisting (x,y,z) coordinates.",2, 18518,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph has vertices and edges in which each vertices can be ,2, 18519,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,, 18520,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph in which all vertices are connected ,1, 18521,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,, 18522,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is basically a graph having certain number of edges and vertices with no internal edges.,2, 18523,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a type of graph that ,1, 18524,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is the one in which we have a lot of nodes and connections between then showing which nodes can be travelled from one another. ,2, 18525,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph that is undirected and does not have loops and multiple edges.,2, 18526,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph with no cycles is called simple graph.,2, 18527,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph without any cycles .,2, 18528,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,, 18529,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graphs are the ones which do not contain any self loops or multiple edges between two nodes.,1, 18530,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is where all the nodes are connected using edges forms a cycle and is not disconnected. ,2, 18531,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph means graph of nodes and edges.,0, 18532,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph is a data structure with an edge and a node.,0, 18533,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph is a graph with some vertices and edges and each vertex is connected with atleast one vertex.,2, 18534,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is the bidirectional graph in which multiple edges are not connected to a single node.,1, 18535,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple Graph doesn't has weighted edges and also is non directional,2, 18536,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,0, 18537,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph that does not contain a cycle within the graph.,2, 18538,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph and vectors goes hand in hand. Graph helps us to build a matrix. ,0, 18539,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,0, 18540,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph consists of edges and vertices .,2, 18541,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is a type of graph in which the vertices are connected to each other having n-1 number of edges and in a closed shape,2, 18542,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph has nodes/vertices connected with edges. it may also be just one vertex. ,2, 18543,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph in which all the vertices are connected to at least one vertex. ,2, 18544,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph is a graph which has no loop and double edges.,2, 18545,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",If every node of tree is connected to atleast one node.,2, 18546,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple Graph is a graph which has no loops or double edges,2, 18547,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",that do not have more than one edge between the two vertices and with no edge starting and ending on the same vertex is termed as a simple graph,2, 18548,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,0, 18549,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","simple graph is a graph which is simply connected with one edges from one vertices, they vey less complicated graph.\nit builds the base for many types of graphs",2, 18550,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,0, 18551,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph which has no direction and no weight irrespective of no of vertex. ,2, 18552,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph that does not have more than one edge between two vertices and no edge starts and end at the same vertex.,2, 18553,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph which do not has any loop or parallel edges.,2, 18554,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph that does not have more than one edge between any two vertices,2, 18555,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph which do not have any loop or parallel edges.,2, 18556,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph in which each vertex is connected to only one other edge,2, 18557,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",It is a graph in which the number of vertices is equal to the number of edges.,2, 18558,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.", is short for \,0, 18559,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",if a graph does not have any self loop or any parallel edges it is called a simple graph,2, 18560,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph which don't contains cycles and every vertex is connected by any other vertex. ,2, 18561,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a connection of edges and vertices.\nEach node in the graph is known as a Vertex and the line between any two vertex is known as edge.,2, 18562,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is a graph in which there is no self loop and no cycle.,2, 18563,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph has no self loops and no parallel edges.,2, 18564,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph in which all the nodes are connected to each other directly on indirectly through a path and it has no cycles and no of the edges is 1 less than the vertices,2, 18565,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is number of nodes of vertex connected to each other \ngraph is of 2 types \ndirected graph \nundirected graph ,2, 18566,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is if a graph has no self loop and no parallel edges ,2, 18567,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Biconnected graph is a graph in which two disjoint graphs are connected via single edge,2, 18568,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is graph that is undirected and does not have any loops or multiple edges.,2, 18569,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph - nodes that are connected to other nodes with the help of edges. There need not be any fixed number of edges or nodes or any special pattern.,2, 18570,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph have some vertices/nodes and have edges which connects the vertices of the graph.,2, 18571,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",It is a type of graph in which each vertices have a vertex connected to it with an edge.,2, 18572,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","A simple graph is a set of edges and vertices,wherein two vertices are connected by an edge.",2, 18573,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",In this every vertices has an edge connected to it and is a part of graph.,2, 18574,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","We can use heaps to implement the priority queue. Such kind of heap will take O(log N) time to insert and delete each element in the priority queue. Based on heap structure, priority queue also has two types max- priority queue and min - priority queue which need to be used along with min-heap and max-heap.\n",2, 18575,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","simple graph is a graph in which we have no directions or weight or anything just edges connected to one another , no disconnected edges.",2, 18576,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",each vertex has an edge connected to it,0, 18577,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A biconnected graph is a graph in which 2 graphs are connected by 1 edge.,2, 18578,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",in simple graph there are no disconnected edges. all the vertices of the graph are connected.,2, 18579,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is a graph which contains a link between each vertices i.e. path exists between each pair of vertices.,2, 18580,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","a simple graph is a graph having atleast 1 link in each pair.,i.e. the graph is connected in atleast 1 way.",, 18581,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",graphs in which nodes are connected only once in only one direction,, 18582,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph which is make up of array.,, 18583,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",The graph is represent the nodes with connectivity to each other and helping to finding the shortest path with minimum costing.,, 18584,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph with no directional edges.,, 18585,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","A simple graph is like a tree , where each and every nodes are connected without following any conditions.",, 18586,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph is a graph with a set of vertices and edges,, 18587,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Graph is representation of cost of visiting one from the other node it is a connection of nodes which represents various paths connecting multiple edges to each other via nodes.,, 18588,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph in which there is a root node and every parent has 2 child nodes associated to it,, 18589,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is a type of data strucutre represented in a graph form which consists of m no. of trees,, 18590,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A type of tree in which nodes are conected to other nodes . ,, 18591,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a collection of nodes that contain a particular data. In which every node is conncted to some or the other node.,, 18592,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph is a graph in which a node can have any no. of child nodes,, 18593,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",it is a graph without any loops and parallel edges,, 18594,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph which is not bidirectional and just directed or even non directed.,, 18595,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Graph that is bidirectional and has no weights attached to the edges is known as a simple graph.,, 18596,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,, 18597,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A graph in which only a single edge at max can be connected between two nodes is a simple graph.,, 18598,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph which is not weighted and has edges and vertices ,, 18599,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph."," unidirected, does not have any loops and multiple edges",, 18600,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph means the closed graph with each vertex having a single edge passing to the other vertex ,, 18601,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is such a graph in which a parent has its both child,, 18602,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple graph is a type of graph in which edge between the 2 vertices is not associated with any weight.,, 18603,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph are the graph which are represent in form vertices are connected by the edges.,, 18604,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",,, 18605,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is any data structure which is denoted in the form of tree rather is not in an up-to-down or one way flow. It has vertex and edges where vertex are the elements of the structure while edges are the connections between them.,, 18606,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph having e edges and v vertices is known as simple graph,, 18607,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",the garph have 'e' edges and 'v' vertex is call simple graph.,, 18608,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a graph is and linear data structure which is used to represent the data and plot points ,, 18609,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","a simple graph or graph is a collection of elements which can be either arranged in a sorted , reversed sorted or distorted manner.",, 18610,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph has Vertices (V) and Edges (E).,, 18611,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph is a graph which does not have any directional edges.,, 18612,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",does not have bidiectional edges,, 18613,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph is a type of graph which is having \,, 18614,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",A simple graph is a graph in which all nodes are connected and the edges are bi-directional,, 18615,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",Simple Graph is a undirected graph .It does not have any direction .,, 18616,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",a simple graph is basically a directed graph that point one node to other in specific direction,, 18617,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",the graph which has elements connected to each other by direcctions also ,, 18618,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",graph in which there are\nNo loops\nNo cycles\n,, 18619,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph is having node and edge and connect the node ,, 18620,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.", A simple graph is -\n1) with all its nodes connected.\n2) with no pendant vertex or any abandoned vertex.\n3) with no looping.,, 18621,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",non deterministic problem that not determine problem in which there is no prior knowledge of any kind when executing a program or the output in unknown,, 18622,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.","G(V,E).",, 18623,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph is set of vertices and edges which have no parallel edges and self loops ,, 18624,What is a simple graph?,"A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.",simple graph consist of a graph where there are equal number of vertices and edges.,,