1. A computer-implemented method for traversing a linked data structure, said method comprising: receiving an asynchronous event interrupt; retrieving parent node data corresponding to a first memory location in response to the receiving, the parent node data included in the linked data structure; determining whether a node value included in the parent node data matches a search value; storing a child node effective address that corresponds to a second memory location based on the determining, the child node effective address included in the parent node data; and setting a notification flag that corresponds to the child node effective address.