i am not able to apply the concept of get node and get node last,
Assuming the scenario,
Root Node - (0,0)
Child nodes of (0,0) at Level 1 - (0,1) (0,2)
child node of (0,2) - (2,1)
we have the statements say
GET NODE (0,0)
GET NODE (0,2)
GET NODE (0,0) LATE
what happens when each of the above statements are executed?
when does the late event get processed?
What are the nodes that are processed ( at each stage and after all statements are executed)