Java | Leetcode Java题解之第145题二叉树的后序遍历
题目: 题解: class Solution {public List<Integer> postorderTraversal(TreeNode root) {List<Integer> res new ArrayList<Integer>();if (root null) {return res;}TreeNode p1 root, p2 null;while (p1 ! null) {p2 p1.left…
2025-02-21