Answer Posted / sirsendu chakraborty

The data structure is said to be a Linear data structure if
its elements are in sequence and form a linear list.
Ex. Arrays, Stacks, Queues,Linked Lists.

If the elements of data structure do not form a sequence or a
linear list then that type of data structure is called as Non-
Linear data structure.
Ex. Trees, BST(Binary Search Trees) etc.

How does max heap work?

858

---

Does treemap preserve order?

801

---

Which collection is fail safe?

817

---

What is red black tree in data structure?

857

---

We know that Arrays are objects so why cannot we write strArray.length()?

1550

---

How will you check the validity of an expression containing nested parentheses?

884

---

How many null values are allowed in hashmap?

873

---

What do u mean by data type?

832

---

Tell us the difference between merge and quick sort. Which one would you prefer and why?

964

---

What is a Stack? Explain with example?

915

---

What are the advantages and disadvantages of linked list over array?

975

---

What is the difference between set and unordered_set?

816

---

an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).

872

---

If you are using c language to implement the heterogeneous linked list, what pointer type should be used?

1016

---

What is the space complexity of selection sort?

900

---