2021年1月7日
LeetCode | 0222. 完全二叉树的节点个数【Python】
摘要： Problem LeetCode Given a complete binary tree, count the number of nodes. Note: Definition of a complete binary tree from Wikipedia: In a complete bin 阅读全文
posted @ 2021-01-07 22:59 Wonz 阅读(107) 评论(0) 推荐(0) 编辑
LeetCode | 1038. 把二叉搜索树转换为累加树【Python】
摘要： Problem LeetCode Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the 阅读全文
posted @ 2021-01-07 21:23 Wonz 阅读(83) 评论(0) 推荐(0) 编辑
LeetCode | 0538. 把二叉搜索树转换为累加树【Python】
摘要： Problem LeetCode Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the 阅读全文
posted @ 2021-01-07 21:08 Wonz 阅读(72) 评论(0) 推荐(0) 编辑
LeetCode | 0230. 二叉搜索树中第K小的元素【Python】
摘要： Problem LeetCode Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Example 1: Input: root = [3,1,4,null 阅读全文
posted @ 2021-01-07 20:54 Wonz 阅读(79) 评论(0) 推荐(0) 编辑