I have a binary search tree with $7$ vertices labeled by the keys $1,2,3,4,5,6,7.$ If I make this tree directed by directing all edges away from the root, a topological order of the vertices is $5,7,3,4,6,1,2.$ What is the sequence of vertices from a postorder traversal of this tree?