Answer Posted / arnoldindia

Evaluation of postfix or prefix notations are done with the
help of stacks. So there is no need for brackets.

In other words, infix notation is human-readable format,
which need brackets based on BODMAS rule to understand the
order of execution. The postfix or prefix are
machine-readable format. The conversion and evaluation of
postfix and prefix are applications of stack model.

A lot of data structures related programs related to only trees and graphs, like the diameter of a tree, removing the loops in a graph etc.

978

---

List the differences between comparable and comparator interface?

873

---

What is the Role of push() and pop() method?

959

---

why boundary tag representation is used?

862

---

Can arraylist contain duplicates?

807

---

What is the time complexity of hashmap get () and put () method?

825

---

What is data structure in programming language?

854

---

Is copyonwritearraylist thread safe?

816

---

Is hashmap synchronized?

948

---

List some applications of tree-data structure?

835

---

Is char array null terminated?

829

---

How would you use qsort() function to sort the name stored in an array of pointers to string?

885

---

How efficient is binary search?

827

---

Define an abstract data type (adt)?

919

---

What is mean by merge sort?

829

---