BSTS快速排序关系，随机BST分析][Lecture 9: Relation of BSTs to Quicksort, Analysis of Random BST ]

BSTS快速排序关系，随机BST分析 Lecture 9: Relation of BSTs to Quicksort, Analysis of Random BST


课程网址:	http://videolectures.net/mit6046jf05_demaine_lec09/
主讲教师:	Erik Demaine
开课单位:	麻省理工学院
开课时间:	2009-02-10
课程语种:	英语
中文简介:	"那么, 我们今天要谈谈二元搜索树。它被称为随机构建的二进制搜索树。而且, 我将在整个讲座过程中将二进制搜索树缩写为 bst。而且, 你们都在一个地方看到了二元搜索树, 特别是周五的朗诵。所以, 我们要建立在那里提出的基本想法, 并讨论如何随机化它们, 并使它们好起来。所以, 你知道有很好的二进制搜索树, 它们相对平衡, 类似这样的东西。高度是日志 n... "//
课程简介:	//"So, we're going to talk today about binary search trees. It's something called randomly built binary search trees. And, I'll abbreviate binary search trees as BST's throughout the lecture. And, you of all seen binary search trees in one place or another, in particular, recitation on Friday. So, we're going to build up the basic ideas presented there, and talk about how to randomize them, and make them good. So, you know that there are good binary search trees, which are relatively balanced, something like this. The height is log n..."//
关键词:	二进制搜索树的排序; BST排序分析; 指数高度复发; 延森不等式
课程来源:	视频讲座网
最后编审:	2020-06-27：yumf
阅读次数:	31

境外开放课程导航