Select the data structure

Question

Shiva is developing two applications

Application 1 : Frequent searching is needed; but  insertions and deletions are moderate

Application 2: Frequent insertions and deletions but searching is moderate.

Which data structure Shiva should choose for application 1 and application 2 respectively?
State the reason

a) Red Black tree , AVL tree

b) AVL tree, Red Black tree

c) Either AVL tree or Red Black tree

d) Neither Red Black nor AVL Tree

Answer 1

The AVL trees are more balanced compared to Red Black Trees, but they may cause more rotations during insertion and deletion. So if your application involves many frequent insertions and deletions, then Red Black trees should be preferred. And if the insertions and deletions are less frequent and search is more frequent operation, then AVL tree should be preferred over Red Black Tree.

http://www.geeksforgeeks.org/red-black-tree-set-1-introduction-2/

So Answer should be B:

Answer 2

Red black tree and AVL tree both required rotation in insertion

Both can delete node from leaf nodes, not from intermediate.

In searching both required O(log n) time to search and find a node.

So, answer is D)

Comments

O(logn) is also good time only but not constant time...they can chose either AVL or Red-Black tree ryt..???

---

yes we can choose both