'Access process in Data Structures
Hi so I have been going over Big O but had a question about the access and search operation I'm aware of the search is basically iteration and access in the context of arrays would be something like array[3] to access specific part of the array, I just wanted to verify how it looks for other data structure's so am I correct when it comes to access for these data structures in my example:
// linked list access
head.next.next.next.value
// tree access
root.left.right.left.value
// graph access
node.id
node.edge[2]
node.edge[2].id
node.edge
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|