- 博客(2)
- 收藏
- 关注
原创 230. Kth Smallest Element in a BST
Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Note: You may assume k is always valid, 1 ≤ k ≤ BST's total elements. Follow up: What if the BST
2016-05-07 10:19:27 329
原创 222. Count Complete Tree Nodes
Given a complete binary tree, count the number of nodes. Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly the last, is completely filled,
2016-05-07 10:06:55 328
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人