Binary Search Tree
文章平均质量分 80
Yingying_code
这个作者很懒,什么都没留下…
展开
-
108. Convert Sorted Array to Binary Search Tree**
Given an array where elements are sorted in ascending order, convert it to a height balanced BST. My code: public class Solution { public TreeNode sortedArrayToBST(int[] nums) { if(nums.原创 2017-01-19 22:19:41 · 187 阅读 · 0 评论 -
98. Validate Binary Search Tree**
Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's key.Th原创 2017-01-29 22:50:58 · 247 阅读 · 0 评论 -
449. Serialize and Deserialize BST**
Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in a file or memory buffer, or transmitted across a network connection link to be原创 2017-02-25 21:57:15 · 252 阅读 · 0 评论 -
450. Delete Node in a BST**
Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST. Basically, the deletion can be divided i原创 2017-02-26 16:32:40 · 238 阅读 · 0 评论