Answer / Poorva

Non-linear data structures are those that do not follow a straightforward path of traversal like trees (binary tree, BST), graphs, or queues. Examples include heaps, hash tables, and graphs.n

Write any two principles of gradation of structures.

1 Answers   Mahatma Gandhi University,

---

Which interface treemap implements?

1 Answers  

---

What is difference between static and dynamic array?

1 Answers  

---

What is the difference between arraylist and linkedlist?

1 Answers  

---

Can you provide some implementation of a dictionary having large number of words?

1 Answers  

---

Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree (b) Complete Binary Tree.

1 Answers  

---

Is file a data structure?

1 Answers  

---

Can we define the size of arraylist?

1 Answers  

---

Can treemap key null?

1 Answers  

---

What is the advantage of circular linked list?

1 Answers  

---

What is application of data structure?

1 Answers  

---

Which language is best for learning data structures and algorithms?

1 Answers  

---