摘要: Given an array where elements are sorted in ascending order, convert it to a height balanced BST.For this problem, a height-balanced binary tree is de 阅读全文
posted @ 2019-05-15 20:07 GoodRnne 阅读(519) 评论(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 le 阅读全文
posted @ 2019-05-15 19:50 GoodRnne 阅读(146) 评论(0) 推荐(0) 编辑