- 4 Listen Head 10 1 Operation 7 Operations 4 Operations 5 2 Operations 74 46 For The Above Single Linked List L If 1 (46.65 KiB) Viewed 40 times
4) Listen head ▶ - 10 1 operation 7 operations 4 operations 5 2 operations 74 46 For the above single linked list L, if
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
4) Listen head ▶ - 10 1 operation 7 operations 4 operations 5 2 operations 74 46 For the above single linked list L, if
4) Listen head ▶ - 10 1 operation 7 operations 4 operations 5 2 operations 74 46 For the above single linked list L, if accessing a node pointer takes 1 operation. Deleting a node once accessed takes 2 operations. How long (in operations, access then delete) does List-Delete(L, 5) take? 31 NULL 72