Question

If you are hired by this company to develop this application and you are provided with two options of data structures to choose from:

- AVL Tree

- Heap

Which data structure you will prefer to use when

(i) Data is sorted

(ii) Data is semi-sorted

Answer 1

i will use AVL Tree when data is sorted.

as in avl trees data is represented by nodes hence data can be sorted from upper to lower as well as lower to upper using avl trees.

i will use heap when data is semi sorted.

heap is used to put the data randomly hence it can be used as semi sorted