Given the root of a binary tree, return the postorder traversal of its nodes' values. Example 1: Input: root =… · Create a stack of TreeNode and push root to it.
確定! 回上一頁