3 ms·
Oh by the way retrieval of nodes/records and storing modifications are logarithmic (O(log n)). Space complexity is O(n).
by lichtenberger 8y ago
Oh by the way retrieval of nodes/records and storing modifications are logarithmic (O(log n)). Space complexity is O(n).