Binary Search Tree
Crystal_ting
个人博客 limengting.site
展开
-
230. Kth Smallest Element in a BST(Java)
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 is mod原创 2017-08-14 22:06:27 · 331 阅读 · 0 评论 -
108. Convert Sorted Array to Binary Search Tree(Java)
Given an array where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode lef原创 2017-08-14 22:17:32 · 273 阅读 · 0 评论 -
[4]《剑指offer》二叉搜索树的第k个节点
题目描述 给定一颗二叉搜索树,请找出其中的第k大的结点。例如, 5 / \ 3 7 /\ /\ 2 4 6 8 中,按结点数值大小顺序第三个结点的值为4。/*public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(...原创 2018-05-04 22:48:59 · 228 阅读 · 0 评论