摘要：
Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. N 阅读全文
posted @ 2018-11-21 22:09
Veritas_des_Liberty
阅读(210)
评论(0)
推荐(0)
摘要：
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 @ 2018-11-21 18:33
Veritas_des_Liberty
阅读(192)
评论(0)
推荐(0)
摘要：
"Top-down" Solution Here is the pseudocode for the recursion function maximum_depth(root, depth): 1. return if root is null 2. if root is a leaf node: 阅读全文
posted @ 2018-11-21 18:11
Veritas_des_Liberty
阅读(295)
评论(0)
推荐(0)
浙公网安备 33010602011771号