As per the given vertices, the post order traversal is g -> c -> h - > f -> i -> e -> b -> a
In math, the term vertices refers a point where two or more line segments meet.
Here we have given that tree with root vertex d that has a left edge to f, a center edge to b, and a right edge to a. b has a left edge to i, a center edge to h, and a right edge to e.
And we have to find the post order traversal.
In order to find the solution, we must know the definition of post order traversal.
The term post order traversal means one of the traversing techniques used for visiting the node in the tree.
Based on these definition the resulting traversal is written as,
=> g -> c -> h - > f -> i -> e -> b -> a
To know more about Vertices here.
https://brainly.com/question/27029296
#SPJ4
