Baixe o app para aproveitar ainda mais
Prévia do material em texto
���� For each of the four types of linked lists in the following table� what is the asymptotic worst�case run� ning time for each dynamic�set operation listed� singly singly doubly doubly unsorted sorted unsorted sorted Search�L� k� O�N� O�N� O�N� O�N�� Insert�L� x� O��� O�N� O�N� O�N�� Delete�L� x� O�N�� O�N�� O��� O��� Successor�L� x� O�N� O��� O�N� O��� Predecessor�L� x� O�N� O�N� O�N� O��� Minimum�L� O�N� O��� O�N� O��� Maximum�L� O�N� O���� O�N� O���� � I need a pointer to the predecessor� ��� � I need a pointer to the tail� ��� � Only bottleneck in otherwise perfect data struc� ture� ���
Compartilhar