摘要：
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文
posted @ 2020-05-24 22:07
苗妙苗
阅读(101)
评论(0)
推荐(0)
摘要：
Find the sum of all left leaves in a given binary tree. Example: 3 / \ 9 20 / \ 15 7 There are two left leaves in the binary tree, with values 9 and 1 阅读全文
posted @ 2020-05-24 10:48
苗妙苗
阅读(108)
评论(0)
推荐(0)
摘要：
Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes. Example: Input: 1 \ 3 / 2 O 阅读全文
posted @ 2020-05-24 10:01
苗妙苗
阅读(161)
评论(0)
推荐(0)
浙公网安备 33010602011771号