11:12 AKERS < 11_trees_hw.pdf (a) (5 points) Write the vertices in the order visited by a pre-order traversal. 69 (b) (5 points) Write the vertices in the order visited by a post-order traversal. Page 1 of 2 605.203 Discrete Mathematics Spring 2026 Homework 11 3. (10 points) A seven-segment display indicates a single decimal digit as a subset of lighted segments labeled A through G as shown below, where a 1 in the table indicates that the corresponding segment is on, and a 0 indicates it is off. Unfortunately, the display is very dim, so that you must focus on a single segment at a time to determine whether it is really on or off. You would like to determine the intended displayed digit by checking the fewest possible number of segments in the worst case. Construct a binary decision tree of minimum height representing your algorithm, labeling: each internal vertex with a letter A through G indicating which segment to check. each edge with a 0 (left) or 1 (right) indicating the state of…

2. Consider the rooted tree shown below. d b h k (a) (5 points) Write the vertices in the order visited by a pre-order traversal. (b) (5 points) Write the vertices in the order visited by a post-order traversal.

I couldn’t read your answer. Part of the answer was cut off in the corner of the solutions section. Put everything together in place this time.