In the "Heap" section, it is stated that finding the maximum value of a "Linked List (Sorted)" is O(1).
However, this is only the case for a Doubly Linked List, because to find the maximum in a sorted Singly Linked-List array, you'd have to walk the entire list, which makes it O(N).
Clarifying that it's a Doubly Linked List would probably fix this best.
In the "Heap" section, it is stated that finding the maximum value of a "Linked List (Sorted)" is O(1).
However, this is only the case for a Doubly Linked List, because to find the maximum in a sorted Singly Linked-List array, you'd have to walk the entire list, which makes it O(N).
Clarifying that it's a Doubly Linked List would probably fix this best.