摘要：
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example:Given the below binary tree and sum 阅读全文
posted @ 2017-11-18 05:27
逸朵
阅读(131)
评论(0)
推荐(0)
摘要：
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. F 阅读全文
posted @ 2017-11-18 05:18
逸朵
阅读(136)
评论(0)
推荐(0)
摘要：
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest l 阅读全文
posted @ 2017-11-18 05:04
逸朵
阅读(151)
评论(0)
推荐(0)
摘要：
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which the dept 阅读全文
posted @ 2017-11-18 03:34
逸朵
阅读(143)
评论(0)
推荐(0)
摘要：
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. 阅读全文
posted @ 2017-11-18 01:23
逸朵
阅读(125)
评论(0)
推荐(0)
浙公网安备 33010602011771号