OS Data Structures Question:
Tell me why do tree always takes o(log n) time?
Answer:
Tree always takes o(log n) time because tree has height is
(log n).
(log n).
| Previous Question | Next Question |
| Explain applications of stacks and their uses? | Do you know how to find the number of possible tree in the given tree? |