2021年1月11日
LeetCode | 0429. N 叉树的层序遍历【Python】
摘要： Problem LeetCode Given an n-ary tree, return the level order traversal of its nodes' values. Nary-Tree input serialization is represented in their lev 阅读全文
posted @ 2021-01-11 21:45 Wonz 阅读(161) 评论(0) 推荐(0)
LeetCode | 0235. 二叉搜索树的最近公共祖先【Python】
摘要： Problem LeetCode Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of 阅读全文
posted @ 2021-01-11 21:36 Wonz 阅读(143) 评论(0) 推荐(0)
LeetCode | 0145. 二叉树的后序遍历【Python】
摘要： Problem LeetCode Given the root of a binary tree, return the postorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [ 阅读全文
posted @ 2021-01-11 21:22 Wonz 阅读(66) 评论(0) 推荐(0)
LeetCode | 0145. 二叉树的后序遍历【Python】
摘要： Problem LeetCode Given the root of a binary tree, return the postorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [ 阅读全文
posted @ 2021-01-11 21:20 Wonz 阅读(59) 评论(0) 推荐(0)