Skiena's book on Algorithm contains the following question:...1) Evaluate expression given as binary tree in O(n) time, given n nodes....2) Evaluate expression given as DAG in O(n+m) time, given n nodes and m edges in DAG....I could think of a way for the...