+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following is not an advantage of trees?

(a) Hierarchical structure

(b) Faster search

(c) Router algorithms

(d) Undo/Redo operations in a notepad

Question is taken from Binary Tree Properties in section Binary Trees of Data Structures & Algorithms I

I have been asked this question in my homework.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
Right choice is (d) Undo/Redo operations in a notepad

Best explanation: Undo/Redo operations in a notepad is an application of stack. Hierarchical structure, Faster search, Router algorithms are advantages of trees.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.

Categories

...