lc.107 自底向上层序遍历 Posted Mar 19, 2025 By floyd white 1 min read相对于102.二叉树的层序遍历，就是最后把result数组反转输出一下就可以了 1 reverse(result.begin(), result.end()); // 反转数组 Data Structures, binary_tree dsa This post is licensed under CC BY 4.0 by the author. Share