摘要: 1. 翻转二叉树:https://leetcode-cn.com/problems/invert-binary-tree/ 2. 二叉树展开为链表,关键在于找到递归部分:https://leetcode-cn.com/problems/flatten-binary-tree-to-linked-li 阅读全文
posted @ 2021-04-13 09:00 nuo-o 阅读(77) 评论(0) 推荐(0) 编辑