2021年1月23日
LeetCode | 0563. 二叉树的坡度【Python】
摘要： Problem LeetCode Given the root of a binary tree, return the sum of every tree node's tilt. The tilt of a tree node is the absolute difference between 阅读全文
posted @ 2021-01-23 18:32 Wonz 阅读(48) 评论(0) 推荐(0) 编辑
LeetCode | 0563. 二叉树的坡度【Python】
摘要： Problem LeetCode Given the root of a binary tree, return the sum of every tree node's tilt. The tilt of a tree node is the absolute difference between 阅读全文
posted @ 2021-01-23 18:27 Wonz 阅读(85) 评论(0) 推荐(0) 编辑
LeetCode | 0559. N 叉树的最大深度【Python】
摘要： Problem LeetCode Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down t 阅读全文
posted @ 2021-01-23 18:16 Wonz 阅读(100) 评论(0) 推荐(0) 编辑