2020年2月11日
[LeetCode] 109. Convert Sorted List to Binary Search Tree
摘要： Given the head of a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. For this problem, a height-b 阅读全文
posted @ 2020-02-11 03:08 CNoodle 阅读(482) 评论(0) 推荐(0)
[LeetCode] 108. Convert Sorted Array to Binary Search Tree
摘要： Given an integer array nums where the elements are sorted in ascending order, convert it to a height-balanced binary search tree. A height-balanced bi 阅读全文
posted @ 2020-02-11 02:33 CNoodle 阅读(590) 评论(0) 推荐(0)
[LeetCode] 107. Binary Tree Level Order Traversal II
摘要： Given the root of a binary tree, return the bottom-up level order traversal of its nodes' values. (i.e., from left to right, level by level from leaf 阅读全文
posted @ 2020-02-11 01:05 CNoodle 阅读(431) 评论(0) 推荐(0)