2.3 Applications


2.3.1 Precedence Identification


• To determine a precedence we add a precedence count for each node. The basic check is,

1. Set all the precedence values to 1 (lowest precedence)

2. Cycle through and check each branch. For each branch ensure that the child vertex has a precedence that is one greater than the parent vertex.


• Consider the previous example.



2.3.2 Tree Searching


• Assume that each branch has a cost associated. We can then find the cost of each of the nodes.


• Identifying the vertex costs.