Unnamed: 0,Question,Sample ANS,Student ANS,Score
5857, 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
5858, 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
5859, 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
5860, 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
5861, 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
5862, 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
5863, 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
5864, 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
5865, 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
5866, 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
5867, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5868, 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
5869, 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
5870, 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
5871, 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
5872, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5873, 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
5874, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5875, 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
5876, 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
5877, 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
5878, 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
5879, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5880, 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.0
5881, 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.0
5882, 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.0
5883, 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.0
5884, 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.0
5885, 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.0
5886, 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.0
5887, 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.0
5888, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5889, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5890, 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.0
5891, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5892, 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.0
5893, 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.0
5894, 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.0
5895, 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
5896, 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.0
5897, 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.0
5898, 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.0
5899, 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.0
5900, 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.0
5901, 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.0
5902, 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.0
5903, 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.0
5904, 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.0
5905, 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.0
5906, 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.0
5907, 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.0
5908, 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.0
5909, 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.0
5910, 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.0
5911, 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.0
5912, 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.0
5913, 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.0
5914, 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.0
5915, 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
5916, 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
5917, 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
5918, 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
5919, 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
5920, 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.0
5921, 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.0
5922, 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.0
5923, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5924, 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
5925, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5926, 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
5927, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5928, 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
5929, 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
5930, 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
5931, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5932, 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
5933, 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
5934, 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
5935, 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
5936, 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
5937, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5938, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,-,0.0
5939, 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
5940, 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
5941, 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
5942, 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
5943, 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
5944, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5945, 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
5946, 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
5947, 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
5948, 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
5949, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5950, 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
5951, 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
5952, 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
5953, 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
5954, 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
5955, 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
5956, 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
5957, 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.0
5958, 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.0
5959, 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.0
5960, 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.0
5961, 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.0
5962, 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.0
5963, 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.0
5964, 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.0
5965, 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.0
5966, 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.0
5967, 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.0
5968, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,
5969, 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.0
5970, 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
5971, 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.0
5972, 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.0
5973, 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.0
5974, 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.0
5975, 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.0
5976, 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.0
5977, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5978, 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.0
5979, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5980, 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.0
5981, 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.0
5982, 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.0
5983, 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.0
5984, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,
5985, 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.0
5986, 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.0
5987, 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.0
5988, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5989, 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.0
5990, 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.0
5991, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5992, 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.0
5993, 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
5994, 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
5995, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
5996, 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.0
5997, 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.0
5998, 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.0
5999, 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.0
6000, 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.0
6001, 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.0
6002, 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.0
6003, 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.0
6004, 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.0
6005, 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.0
6006, 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.0
6007, 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.0
6008, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6009, 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.0
6010, 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.0
6011, 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.0
6012, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6013, 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.0
6014, 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.0
6015, 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.0
6016, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6017, 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.0
6018, 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.0
6019, 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.0
6020, 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.0
6021, 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.0
6022, 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.0
6023, 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.0
6024, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6025, 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.0
6026, 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.0
6027, 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.0
6028, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6029, 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.0
6030, 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.0
6031, 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.0
6032, 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.0
6033, 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.0
6034, 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.0
6035, 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.0
6036, 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.0
6037, 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.0
6038, 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.0
6039, 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.0
6040, 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.0
6041, 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.0
6042, 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.0
6043, 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.0
6044, 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.0
6045, 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.0
6046, 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.0
6047, 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.0
6048, 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.0
6049, 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.0
6050, 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.0
6051, 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.0
6052, 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.0
6053, 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.0
6054, 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.0
6055, 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.0
6056, 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.0
6057, 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.0
6058, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6059, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6060, 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
6061, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6062, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6063, 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.0
6064, 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
6065, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6066, 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.0
6067, 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.0
6068, 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
6069, 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
6070, 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
6071, 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.0
6072, 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
6073, 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
6074, 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
6075, 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
6076, 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
6077, 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
6078, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6079, 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.0
6080, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6081, 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
6082, 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
6083, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6084, 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
6085, 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.0
6086, 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
6087, 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.0
6088, 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.0
6089, 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.0
6090, 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
6091, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6092, 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.0
6093, 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.0
6094, 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.0
6095, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,,0.0
6096, 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
6097, 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<stack>\n\nexample stack<int > st;\nst.push(3);,0.0
6098, Define double ended queue,It is a special type of queue that allows insertion anddeletion of elements at both end,dequeue.,1.0
6099, 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
6100, 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.0
6101,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.0
6102,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.0
6103,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.0
6104,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.0
6105,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.0
6106,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.0
6107,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
6108,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
6109,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.0
6110,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
6111,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
6112,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
6113,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
6114,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.0
6115,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
6116,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.0
6117,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
6118,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.0
6119,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
6120,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.0
6121,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.0
6122,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.0
6123,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.0
6124,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.0
6125,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.0
6126,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.0
6127,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.0
6128,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.0
6129,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.0
6130,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.0
6131,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.0
6132,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.0
6133,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.0
6134,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.0
6135,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.0
6136,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.0
6137,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
6138,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.0
6139,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
6140,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.0
6141,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.0
6142,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.0
6143,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.0
6144,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.0
6145,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.0
6146,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.0
6147,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.0
6148,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.0
6149,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.0
6150,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.0
6151,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.0
6152,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.0
6153,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.0
6154,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
6155,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.0
6156,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.0
6157,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
6158,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.0
6159,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.0
6160,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.0
6161,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.0
6162,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.0
6163,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.0
6164,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.0
6165,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
6166,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.0
6167,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.0
6168,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.0
6169,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
6170,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.0
6171,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.0
6172,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.0
6173,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.0
6174,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
6175,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.0
6176,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.0
6177,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.0
6178,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
6179,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.0
6180,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.0
6181,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.0
6182,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.0
6183,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.0
6184,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
6185,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.0
6186,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
6187,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.0
6188,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.0
6189,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.0
6190,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.0
6191,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
6192,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.0
6193,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.0
6194,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
6195,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.0
6196,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.0
6197,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.0
6198,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.0
6199,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.0
6200,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.0
6201,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.0
6202,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.0
6203,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.0
6204,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.0
6205,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.0
6206,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.0
6207,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.0
6208,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.0
6209,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.0
6210,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.0
6211,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.0
6212,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.,,
6213,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.0
6214,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.0
6215,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.0
6216,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.0
6217,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.0
6218,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.0
6219,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.0
6220,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.0
6221,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.0
6222,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.0
6223,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.0
6224,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.,,
6225,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.0
6226,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.,,
6227,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.0
6228,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.0
6229,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.0
6230,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.0
6231,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.0
6232,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.0
6233,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.0
6234,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.0
6235,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.0
6236,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.0
6237,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.0
6238,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.0
6239,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.0
6240,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.0
6241,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.0
6242,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.0
6243,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.0
6244,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.0
6245,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.0
6246,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.0
6247,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.0
6248,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.,,
6249,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.0
6250,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.0
6251,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.0
6252,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.0
6253,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.0
6254,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.0
6255,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.0
6256,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.0
6257,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.0
6258,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.0
6259,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.0
6260,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.0
6261,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.0
6262,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.0
6263,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.0
6264,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.0
6265,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.0
6266,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.0
6267,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.0
6268,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.0
6269,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.0
6270,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.0
6271,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.0
6272,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.0
6273,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.0
6274,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.0
6275,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.0
6276,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.0
6277,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.0
6278,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.0
6279,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.0
6280,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.0
6281,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.0
6282,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.0
6283,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.0
6284,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.0
6285,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.0
6286,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.0
6287,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.0
6288,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.0
6289,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.0
6290,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.0
6291,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.0
6292,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.0
6293,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.0
6294,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.0
6295,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.0
6296,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.0
6297,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.0
6298,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.0
6299,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.0
6300,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 .",
6301,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.0
6302,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.0
6303,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.0
6304,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
6305,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.0
6306,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.0
6307,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.0
6308,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.0
6309,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
6310,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.0
6311,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.0
6312,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.0
6313,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.0
6314,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.0
6315,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.0
6316,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.0
6317,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.0
6318,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.0
6319,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.0
6320,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.0
6321,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.0
6322,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.0
6323,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.0
6324,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.0
6325,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.0
6326,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.0
6327,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.0
6328,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.0
6329,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.0
6330,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.0
6331,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.0
6332,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.0
6333,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.0
6334,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.0
6335,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.0
6336,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.0
6337,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.0
6338,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.0
6339,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.0
6340,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.0
6341,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,
6342,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.,
6343,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,
6344,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 ,
6345,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.0
6346,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.0
6347,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.0
6348,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.0
6349,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.0
6350,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.0
6351,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.0
6352,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.0
6353,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.0
6354,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.0
6355,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.0
6356,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.0
6357,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.0
6358,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.0
6359,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.0
6360,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.0
6361,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.0
6362,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.0
6363,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.0
6364,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.0
6365,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.0
6366,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.0
6367,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.0
6368,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.0
6369,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.0
6370,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.0
6371,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.0
6372,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.0
6373,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.0
6374,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
6375,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.0
6376,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.0
6377,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.0
6378,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.0
6379,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.0
6380,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.0
6381,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.0
6382,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.,0.0
6383,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
6384,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
6385,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.0
6386,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.0
6387,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.0
6388,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.0
6389,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.0
6390,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.0
6391,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.0
6392,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.0
6393,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.0
6394,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.0
6395,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.0
6396,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.0
6397,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
6398,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.0
6399,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
6400,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.0
6401,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.0
6402,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
6403,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.0
6404,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.0
6405,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.0
6406,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.0
6407,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.0
6408,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.0
6409,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.0
6410,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.0
6411,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.0
6412,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.0
6413,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.0
6414,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.0
6415,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.0
6416,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.0
6417,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.0
6418,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.0
6419,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.0
6420,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.0
6421,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.0
6422,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.0
6423,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.0
6424,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.0
6425,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.0
6426,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.0
6427,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
6428,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.0
6429,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.0
6430,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.0
6431,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.0
6432,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.0
6433,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.0
6434,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.0
6435,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.0
6436,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.0
6437,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.0
6438,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.0
6439,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.0
6440,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.0
6441,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.0
6442,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.0
6443,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.0
6444,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.0
6445,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<int> pq;\nmin heap can be represented by -> priority_queue<int, greater<int, int>> pq;",1.0
6446,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<int,greater<int>>pq;",1.0
6447,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.0
6448,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.0
6449,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.0
6450,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.",,
6451,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.0
6452,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.0
6453,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.",,
6454,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.0
6455,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.0
6456,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.0
6457,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.0
6458,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.",,
6459,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.0
6460,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.0
6461,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.",,
6462,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.0
6463,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.",,
6464,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.0
6465,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.0
6466,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.0
6467,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.0
6468,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.0
6469,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.0
6470,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.",,
6471,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.",,
6472,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.",,
6473,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.0
6474,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.",,
6475,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.0
6476,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.0
6477,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.0
6478,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.0
6479,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.",,
6480,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.0
6481,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.0
6482,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.0
6483,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.0
6484,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.0
6485,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.0
6486,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.0
6487,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.0
6488,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.0
6489,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.",,
6490,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.0
6491,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.0
6492,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.0
6493,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.0
6494,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.0
6495,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<int,int>,vector<pair<int,int>>);\nThis is max heap.",1.0
6496,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.0
6497,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.0
6498,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.0
6499,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_queue<int*>pq\nin this we just use min heap or max heap but consider the priorities of the elements,1.0
6500,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.0
6501,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.0
6502,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.0
6503,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.0
6504,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.0
6505,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.0
6506,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.0
6507,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.0
6508,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.0
6509,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.0
6510,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.0
6511,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.0
6512,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.0
6513,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.0
6514,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.0
6515,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.0
6516,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.0
6517,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.0
6518,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.0
6519,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.0
6520,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.0
6521,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.0
6522,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.0
6523,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.0
6524,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.0
6525,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.0
6526,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.0
6527,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.0
6528,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.0
6529,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.0
6530,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.0
6531,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.0
6532,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.0
6533,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.0
6534,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.0
6535,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.0
6536,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.0
6537,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.0
6538,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.0
6539,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.0
6540,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.0
6541,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.0
6542,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.0
6543,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.0
6544,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.",
6545,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.",,
6546,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.",,
6547,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,
6548,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.",
6549,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.,
6550,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,
6551,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.",,
6552,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 ,
6553,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.",,
6554,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.,
6555,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.,
6556,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,
6557,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 .,
6558,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.",,
6559,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.",
6560,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 ,
6561,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.,
6562,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,
6563,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.",,
6564,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 ,
6565,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.,
6566,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 ,
6567,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.,
6568,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.",,
6569,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.,
6570,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.,
6571,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.",,
6572,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.",,
6573,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,
6574,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.",
6575,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.,
6576,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,
6577,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.,
6578,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",
6579,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.",,
6580,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.,
6581,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.",,
6582,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,
6583,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.",,
6584,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,
6585,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,
6586,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.,
6587,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 ,
6588,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.",
6589,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0.0
6590,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
6591,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
6592,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
6593,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
6594,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
6595,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
6596,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
6597,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
6598,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
6599,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
6600,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
6601,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
6602,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
6603,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
6604,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0.0
6605,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
6606,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0.0
6607,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
6608,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
6609,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0.0
6610,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
6611,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
6612,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
6613,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
6614,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
6615,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
6616,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
6617,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
6618,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
6619,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
6620,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
6621,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
6622,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
6623,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
6624,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
6625,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
6626,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
6627,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0.0
6628,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
6629,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
6630,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
6631,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
6632,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.0
6633,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
6634,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
6635,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
6636,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
6637,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
6638,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
6639,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.0
6640,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.0
6641,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
6642,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.0
6643,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
6644,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
6645,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
6646,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.0
6647,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.0
6648,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
6649,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
6650,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
6651,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
6652,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.0
6653,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.0
6654,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.0
6655,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.,0.0
6656,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.0
6657,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.0
6658,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.0
6659,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.0
6660,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.0
6661,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0.0
6662,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
6663,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
6664,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
6665,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
6666,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
6667,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
6668,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.0
6669,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.0
6670,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.0
6671,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
6672,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
6673,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
6674,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
6675,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
6676,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.0
6677,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
6678,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
6679,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
6680,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
6681,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0.0
6682,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.0
6683,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.0
6684,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
6685,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.0
6686,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.0
6687,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.0
6688,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.0
6689,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.0
6690,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.0
6691,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,
6692,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.0
6693,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.0
6694,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.0
6695,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.0
6696,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,
6697,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,
6698,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.0
6699,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.0
6700,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.0
6701,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.0
6702,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.0
6703,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.0
6704,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.0
6705,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.0
6706,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.0
6707,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.0
6708,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.0
6709,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.0
6710,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.0
6711,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.0
6712,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.0
6713,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.0
6714,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.0
6715,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.0
6716,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.0
6717,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.0
6718,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.0
6719,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.0
6720,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.0
6721,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.0
6722,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.0
6723,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.0
6724,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.0
6725,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.0
6726,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.0
6727,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.0
6728,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.0
6729,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.0
6730,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.0
6731,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.0
6732,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.0
6733,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.0
6734,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.0
6735,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.0
6736,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.0
6737,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.0
6738,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.0
6739,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.0
6740,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.0
6741,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.0
6742,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.0
6743,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.0
6744,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0.0
6745,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.0
6746,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.0
6747,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,", \",0.0
6748,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.0
6749,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.0
6750,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.0
6751,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.0
6752,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.0
6753,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0.0
6754,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.0
6755,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.0
6756,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0.0
6757,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.0
6758,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,0.0
6759,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.0
6760,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.0
6761,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.0
6762,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.0
6763,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.0
6764,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.0
6765,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.0
6766,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.0
6767,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.0
6768,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.0
6769,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.0
6770,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.0
6771,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.0
6772,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.0
6773,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.0
6774,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.0
6775,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.0
6776,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.0
6777,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.0
6778,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.0
6779,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.0
6780,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.0
6781,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.0
6782,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.0
6783,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.0
6784,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.0
6785,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.0
6786,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.0
6787,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.0
6788,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.,
6789,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.,
6790,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,
6791,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,
6792,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. ,
6793,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.,
6794,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,
6795,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.,
6796,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 ,
6797,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,
6798,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.,
6799,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.,
6800,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,
6801,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 ,
6802,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.,
6803,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.,
6804,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 ,
6805,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.,
6806,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,
6807,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.,
6808,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 ,
6809,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.,
6810,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.,
6811,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.,
6812,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,
6813,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!,
6814,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 ,
6815,Define biconnected graph.,A connected undirected graph is biconnected if there are no vertices whose removal disconnects the rest of the graph.,,
6816,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,
6817,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,
6818,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,
6819,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.,
6820,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",
6821,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.,
6822,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",
6823,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.,
6824,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 ,
6825,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 ,
6826,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.,
6827,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 ,
6828,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.,
6829,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,
6830,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.,
6831,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 ,
6832,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 .,
6833,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.0
6834,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.0
6835,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.0
6836,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
6837,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
6838,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
6839,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
6840,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
6841,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
6842,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.0
6843,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.0
6844,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
6845,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
6846,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
6847,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
6848,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
6849,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
6850,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
6851,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
6852,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
6853,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.0
6854,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
6855,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
6856,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
6857,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
6858,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
6859,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
6860,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
6861,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
6862,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
6863,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.0
6864,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
6865,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
6866,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.0
6867,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.0
6868,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.0
6869,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
6870,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.0
6871,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.0
6872,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
6873,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.0
6874,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
6875,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
6876,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.0
6877,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
6878,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
6879,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
6880,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
6881,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
6882,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
6883,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
6884,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
6885,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
6886,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
6887,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.0
6888,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.0
6889,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.0
6890,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
6891,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.0
6892,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
6893,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.0
6894,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
6895,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.0
6896,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.0
6897,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
6898,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
6899,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.0
6900,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.0
6901,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.0
6902,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.0
6903,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.0
6904,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
6905,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
6906,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
6907,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.0
6908,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.0
6909,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
6910,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.0
6911,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
6912,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.0
6913,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
6914,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.0
6915,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
6916,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
6917,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
6918,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
6919,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
6920,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
6921,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
6922,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.0
6923,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
6924,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
6925,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.0
6926,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
6927,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
6928,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
6929,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
6930,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.0
6931,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
6932,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
6933,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.0
6934,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.0
6935,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.,,
6936,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.0
6937,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.,,
6938,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.,,
6939,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.0
6940,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.,,
6941,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.,,
6942,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.0
6943,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.0
6944,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.0
6945,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.0
6946,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.0
6947,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.0
6948,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.0
6949,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.0
6950,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.0
6951,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.,,
6952,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.0
6953,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.,,
6954,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.,,
6955,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.,,
6956,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., ,
6957,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.0
6958,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.0
6959,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.0
6960,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.0
6961,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.0
6962,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.0
6963,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.0
6964,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.0
6965,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.,,
6966,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.,,
6967,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.0
6968,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.0
6969,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.0
6970,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.0
6971,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.,,
6972,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.0
6973,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.0
6974,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.0
6975,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.0
6976,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.0
6977,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.0
6978,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.,,
6979,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.0
6980,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.,,
6981,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.0
6982,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.0
6983,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.0
6984,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.0
6985,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.0
6986,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.0
6987,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.0
6988,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.0
6989,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.0
6990,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.0
6991,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.0
6992,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.0
6993,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.0
6994,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.0
6995,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.0
6996,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.0
6997,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.0
6998,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.0
6999,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.0
7000,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.0
7001,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.0
7002,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.0
7003,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.0
7004,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.0
7005,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.0
7006,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.0
7007,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.0
7008,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.0
7009,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.0
7010,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.0
7011,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.0
7012,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.0
7013,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.0
7014,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.0
7015,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.0
7016,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.0
7017,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.0
7018,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.0
7019,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.0
7020,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.0
7021,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.0
7022,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.0
7023,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.0
7024,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.0
7025,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.0
7026,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.0
7027,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.0
7028,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.0
7029,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.0
7030,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.0
7031,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
7032,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
7033,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
7034,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.0
7035,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
7036,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.0
7037,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.0
7038,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.0
7039,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
7040,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.0
7041,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.0
7042,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.0
7043,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.0
7044,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,0.0
7045,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.0
7046,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
7047,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.0
7048,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.0
7049,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,
7050,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 ,
7051,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.,,
7052,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.,,
7053,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
7054,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.0
7055,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
7056,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.,,
7057,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.0
7058,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.0
7059,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.0
7060,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.,,
7061,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.,
7062,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 ,
7063,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.,,
7064,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.,,
7065,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,
7066,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,
7067,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.,
7068,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.,,
7069,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.,,
7070,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.,
7071,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 ,
7072,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.,,
7073,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.,,
7074,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.0
7075,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.0
7076,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.,,
7077,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.0
7078,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
7079,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
7080,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
7081,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
7082,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
7083,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
7084,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
7085,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
7086,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
7087,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
7088,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
7089,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
7090,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
7091,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
7092,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
7093,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
7094,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
7095,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
7096,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
7097,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.0
7098,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
7099,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
7100,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
7101,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
7102,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
7103,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
7104,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
7105,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
7106,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
7107,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
7108,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
7109,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
7110,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
7111,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
7112,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
7113,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
7114,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
7115,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
7116,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
7117,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
7118,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
7119,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
7120,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
7121,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
7122,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
7123,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
7124,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
7125,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
7126,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
7127,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
7128,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
7129,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
7130,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
7131,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
7132,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
7133,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
7134,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
7135,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
7136,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
7137,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
7138,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
7139,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
7140,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
7141,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
7142,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
7143,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
7144,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  grapgh,1.0
7145,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
7146,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
7147,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.0
7148,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
7149,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
7150,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.,1.0
7151,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
7152,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
7153,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
7154,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
7155,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
7156,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
7157,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.0
7158,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
7159,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
7160,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
7161,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
7162,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
7163,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
7164,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
7165,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
7166,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
7167,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
7168,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
7169,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
7170,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
7171,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 multiple edge between 2 vertices,0.0
7172,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
7173,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
7174,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 with forming any circular  loops ,0.0
7175,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
7176,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
7177,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.0
7178,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.0
7179,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.0
7180,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.0
7181,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.0
7182,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.0
7183,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.0
7184,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.0
7185,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.0
7186,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.0
7187,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.0
7188,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.0
7189,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.5
7190,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.",no edge is disconnected,1.0
7191,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. ,2.0
7192,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.0
7193,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.0
7194,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.0
7195,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.0
7196,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.0
7197,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.0
7198,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.0
7199,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.0
7200,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.0
7201,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.0
7202,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.0
7203,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.",Diectional Graph is a simple graph,0.0
7204,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.0
7205,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.0
7206,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.0
7207,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.0
7208,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.0
7209,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.0
7210,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.0
7211,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.0
7212,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.0
7213,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.",1.0
7214,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 visited,1.0
7215,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.",no loop present,2.0
7216,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.0
7217,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 and has no loop,2.5
7218,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.0
7219,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.0
7220,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.0
7221,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.0
7222,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.0
7223,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.0
7224,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.5
7225,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.0
7226,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.0
7227,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.0
7228,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.0
7229,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.0
7230,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.0
7231,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.0
7232,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.0
7233,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.0
7234,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.0
7235,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.0
7236,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.0
7237,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.0
7238,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.0
7239,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.0
7240,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.0
7241,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.0
7242,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.0
7243,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.0
7244,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.0
7245,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.0
7246,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.0
7247,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.0
7248,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.0
7249,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.0
7250,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.0
7251,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.0
7252,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.0
7253,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.0
7254,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.0
7255,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.0
7256,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.0
7257,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.0
7258,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.0
7259,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.0
7260,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.0
7261,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.0
7262,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.0
7263,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.0
7264,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.0
7265,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.0
7266,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.0
7267,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.0
7268,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.0
7269,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.0
7270,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.0
7271,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.0
7272,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.0
7273,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.0
7274,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.0
7275,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.0
7276,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.",1.0
7277,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,0.0
7278,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.,0.0
7279,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.,1.0
7280,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.,0.0
7281,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.",0.0
7282,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,0.5
7283,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.,1.0
7284,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,0.0
7285,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,0.0
7286,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 . ,0.0
7287,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.,0.0
7288,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,0.0
7289,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,2.5
7290,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.,0.0
7291,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.,0.0
7292,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.",contains no loop,2.5
7293,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.,2.0
7294,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 ,0.0
7295,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",2.5
7296,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 ,1.0
7297,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,0.0
7298,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.,0.0
7299,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.,0.0
7300,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.",no loop present,2.5
7301,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.,0.0
7302,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,0.0
7303,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.,0.0
7304,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 ,0.0
7305,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.",0.0
7306,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).,0.0
7307,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.,0.0
7308,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,0.0
7309,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 no loop,2.5
7310,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,0.0
7311,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 .,0.0
7312,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,0.0
7313,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 ,0.0
7314,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,2.5
7315,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 ,1.0
7316,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.,2.5
7317,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,0.0
7318,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).",0.0
7319,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 ,2.5
7320,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.,0.0