2021年12月4日
摘要: 题目 https://leetcode.com/problems/maximum-depth-of-n-ary-tree/ N叉树的最大深度 Given a n-ary tree, find its maximum depth. The maximum depth is the number of 阅读全文
posted @ 2021-12-04 18:35 alau 阅读(29) 评论(0) 推荐(0) 编辑
摘要: 题目 BST二叉搜索树中插入元素 二叉搜索树:左边<root<右边 https://leetcode.com/problems/insert-into-a-binary-search-tree/ You are given the root node of a binary search tree 阅读全文
posted @ 2021-12-04 08:10 alau 阅读(68) 评论(0) 推荐(0) 编辑
摘要: 题目 给定二叉树和两个点,求两点的LCA最近公共祖先 Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of L 阅读全文
posted @ 2021-12-04 02:54 alau 阅读(47) 评论(0) 推荐(0) 编辑