摘要：
Description: Given the root of a binary search tree, and an integer k, return the kth (1-indexed) smallest element in the tree. Link: 230. Kth Smalles 阅读全文
摘要：
Description: A peak element is an element that is strictly greater than its neighbors. Given an integer array nums, find a peak element, and return it 阅读全文