Cerinta completa
Which of the following data structures can handle updates and queries in log(n) time on an array?
Limbajul de programare folosit: N/A (quiz / MCQ)
Raspuns corect: Segment Tree
Explicatie: Correct answer is Segment Tree. Please refer to this (https://en.wikipedia.org/wiki/Segment_tree) wikipedia article to read all the details of Segment Trees.
Cod:
N/A - Acest challenge este de tip MCQ (fara submit de cod).Scor obtinut: 5
Submission ID: 3184529
Link challenge: https://www.hackerrank.com/challenges/are-you-an-expert-on-data-structures/problem
Data Structures MCQ 2