Title: leetcode144-二叉树的后序遍历 | snmlm
Open Graph Title: leetcode144-二叉树的后序遍历
Description: 题目描述给你一棵二叉树的根节点 root ,返回其节点值的 后序遍历 。 示例 1: 12输入:root = [1,null,2,3]输出:[3,2,1] 示例 2: 12输入:root = []输出:[] 示例 3: 12输入:root = [1]输出:[1] 提示: 树中节点的数目在范围 [0, 100] 内 -100 <= Node.val <= 100 题目思路
Open Graph Description: 题目描述给你一棵二叉树的根节点 root ,返回其节点值的 后序遍历 。 示例 1: 12输入:root = [1,null,2,3]输出:[3,2,1] 示例 2: 12输入:root = []输出:[] 示例 3: 12输入:root = [1]输出:[1] 提示: 树中节点的数目在范围 [0, 100] 内 -100 <= Node.val <= 100 题目思路
Keywords:
Mail addresses
undefined
Opengraph URL: https://snmlm.github.io/algorithm/leetcode/leetcode_145/
Generator: Hexo 5.1.1
Domain: snmlm.github.io
| None | no-siteapp |
| author | snmlm |
| copyright | snmlm |
| format-detection | telephone=no |
| theme-color | #ffffff |
| og:type | article |
| og:site_name | snmlm |
| og:image | https://snmlm.github.io/img/head.gif |
| article:published_time | 2023-06-29T16:00:00.000Z |
| article:modified_time | 2023-06-30T00:14:22.204Z |
| twitter:card | summary |
Links:
Viewport: width=device-width,initial-scale=1