Which of the following data structure can’t store the non-homogeneous data elements?

Related Questions

• Which of the following data structure can’t store the non-homogeneous data elements?
• Which data structure allows deleting data elements from and inserting at rear?
• Which data structure allows deleting data elements from front and inserting at rear?
• Which of the following data structure is not linear data structure?
• To represent hierarchical relationship between elements, Which data structure is suitable?
• To represent hierarchical relationship between elements, which data structure is suitable?
• A data structure where elements can be added or removed at either end but not in the middle is called …
• A data structure where elements can be added or removed at either end but not in the middle is called …
• Each Node contain minimum two fields one field called data field to store data. Another field is of type _________.
• Suppose a circular queue of capacity (n – 1) elements is implemented with an array of n elements. Assume that the insertion and deletion operation are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are