Answer Posted / sudipto ghosh

yes it is possible to insert different types of element in a
stack.
insted of defining the member as int or float or so on. we
will define each element as a union which will be consisting
of all types of data type and only one can be used at a
time. in order to determine which type of element is being
pushed or poped we will define a flag with in union which
keeps the track of data type being used.

Define non linear data structure.

971

---

What is the difference between hashset and treeset?

997

---

Is list a data type?

908

---

Explain the sorting algorithm that is most suitable to be used with single linked list?

843

---

Given M x N matrix with sorted elements row wise and column wise, find elements?

981

---

What is difference between data type and data structure?

816

---

What is definition list?

939

---

What are the pre-requisite for the collection to perform binary search?

885

---

Is treeset synchronized?

842

---

What is the method to find the complexity of an algorithm?

1103

---

What is binary search in data structure?

903

---

Is radix sort faster than quicksort?

864

---

Can a binary tree be empty?

929

---

What is hashing with example?

931

---

Why you need a data structure?

1088

---