I have a question about the following post order traversal algorithm of a binary tree:
List res = new ArrayList<>(); public List&