<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Binary Search Tree on 111qqz's blog</title><link>https://111qqz.com/en/tags/binary-search-tree/</link><description>Recent content in Binary Search Tree on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Tue, 21 Feb 2017 11:14:48 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/binary-search-tree/index.xml" rel="self" type="application/rss+xml"/><item><title>leetcode 108. Convert Sorted Array to Binary Search Tree（有序数组转化成bst）</title><link>https://111qqz.com/en/post/acm-icpc/2017/2017-02-21-leetcode-108-convert-sorted-array-to-binary-search-tree/</link><pubDate>Tue, 21 Feb 2017 11:14:48 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2017/2017-02-21-leetcode-108-convert-sorted-array-to-binary-search-tree/</guid><description>&lt;p&gt;&lt;a href="https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/?tab=Description" target="_blank" rel="noreferrer"&gt;leetcode108&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：把有一个有序的数组转化成一课高度尽量小的bst(二叉搜索树)&lt;/p&gt;</description></item></channel></rss>