Trees, queues, and lookup tables are examples of data records that require a data structure to be maintained. The node state, node parent, node action, and node path cost, for example, are all contained in a single node.
-
-
-
• Node Path Cost: The cumulative cost to reach the current position (e.g., time, distance).