高度平衡树 -- AVL 树
Scheme 的表达, 优雅.
#lang scheme
( define nil '() )
( define ( root tree )( car tree ) )
( define ( left-tree tree )( cadr tree ) )
( define ( right-tree tree )( caddr tree ) )
( define ( height tree )
( cond [ ( null? tree ) 0 ]
[ else ( cadddr tree ) ] ) )
( define ( make-leaf elem )( list elem nil nil 1 ) )
( define ( make-avl-tree root left right )
( list root left right ( + 1 ( max ( height left )
( height right ) ) ) ) )
( define ( contains-elem?
elem tree )
( cond [ ( null? tree ) false ]
[ ( = elem ( root tree ) ) true ]
[ ( < elem ( root tree ) )
( contains-elem?
elem ( left-tree tree ) ) ]
[ ( > elem ( root tree ) )
( contains-elem? elem ( right-tree tree ) ) ] ) )
( define ( rotate-left-left tree )
( cond [ ( null? tree ) tree ]
[ else ( make-avl-tree ( root ( left-tree tree ) )
( left-tree ( left-tree tree ) )
( make-avl-tree ( root tree )
( right-tree ( left-tree tree ) )
( right-tree tree ) ) ) ] ) )
( define ( rotate-right-right tree )
( cond [ ( null? tree ) tree ]
[ else ( make-avl-tree ( root ( right-tree tree ) )
( make-avl-tree ( root tree )
( left-tree tree )
( left-tree ( right-tree tree ) ) )
( right-tree ( right-tree tree ) ) ) ] ) )
( define ( rotate-right-left tree )
( cond [ ( null?
tree ) tree ]
[ else ( make-avl-tree ( left-tree ( right-tree tree ) )
( make-avl-tree ( root tree )
( left-tree tree )
( left-tree ( left-tree ( right-tree tree ) ) ) )
( make-avl-tree ( root ( right-tree tree ) )
( right-tree ( left-tree ( right-tree tree ) ) )
( right-tree ( right-tree tree ) ) ) ) ] ) )
( define ( rotate-left-right tree )
( cond [ ( null?
tree ) tree ]
[ else ( make-avl-tree ( root ( right-tree ( left-tree tree ) ) )
( make-avl-tree ( root ( left-tree tree ) )
( left-tree ( left-tree tree ) )
( left-tree ( right-tree ( left-tree tree ) ) ) )
( make-avl-tree ( root tree )
( right-tree ( right-tree ( left-tree tree ) ) )
( right-tree tree ) ) ) ] ) )
( define ( balance-avl-tree tree )
( define ( factor tree )
( - ( height ( right-tree tree ) )
( height ( left-tree tree ) ) ) )
( let ( [ f ( factor tree ) ] )
( cond [ ( = f 2 )
( cond [ ( < ( factor ( right-tree tree ) ) 0 )
( rotate-right-left tree ) ]
[ else ( rotate-right-right tree ) ] ) ]
[ ( = f -2 )
( cond [ ( > ( factor ( left-tree tree ) ) 0 )
( rotate-left-right tree ) ]
[ else ( rotate-left-left tree ) ] ) ]
[ else tree ] ) ) )
( define ( insert-elem elem tree )
( define ( insert-in-son elem tree )
( cond [ ( null? tree )
( make-leaf elem ) ]
[ ( < elem ( root tree ) )
( let* ( [ newLeftTree ( insert-in-son elem ( left-tree tree ) ) ]
[ newAVLTree ( make-avl-tree ( root tree )
newLeftTree
( right-tree tree ) ) ] )
( balance-avl-tree newAVLTree ) ) ]
[ ( > elem ( root tree ) )
( let* ( [ newRightTree ( insert-in-son elem ( right-tree tree ) ) ]
[ newAVLTree ( make-avl-tree ( root tree )
( left-tree tree )
newRightTree ) ] )
( balance-avl-tree newAVLTree ) ) ]
[ else tree ] ) )
( cond [ ( contains-elem? elem tree ) tree ]
[ else ( insert-in-son elem tree ) ] ) )
( define ( delete-elem elem tree )
( define ( delete-left-most tree )
( cond [ ( left-empty? tree ) tree ]
[ else ( let* ( [ leftMost ( delete-left-most ( left-tree tree ) ) ]
[ newRightTree ( make-avl-tree ( root tree )
( right-tree leftMost )
( right-tree tree ) ) ] )
( make-avl-tree ( root leftMost )
nil
( balance-avl-tree newRightTree ) ) ) ] ) )
( define ( delete-in-son elem tree )
( cond [ ( < elem ( root tree ) )
( let* ( [ newLeftTree ( delete-in-son elem ( left-tree tree ) ) ]
[ newAVLTree ( make-avl-tree ( root tree )
newLeftTree
( right-tree tree ) ) ] )
( balance-avl-tree newAVLTree ) ) ]
[ ( > elem ( root tree ) )
( let* ( [ newRightTree ( delete-in-son elem ( right-tree tree ) ) ]
[ newAVLTree ( make-avl-tree ( root tree )
( left-tree tree )
newRightTree ) ] )
( balance-avl-tree newAVLTree ) ) ]
[ ( = elem ( root tree ) )
( cond [ ( and ( right-empty? tree )
( left-empty? tree ) )
nil ]
[ ( right-empty? tree )
( left-tree tree ) ]
[ ( left-empty? tree )
( right-tree tree ) ]
[ else ( let ( [ leftMost ( delete-left-most ( right-tree tree ) ) ] )
( make-avl-tree ( root leftMost )
( left-tree tree )
( right-tree leftMost ) ) ) ] ) ] ) )
( define ( left-empty? tree )( null?
( left-tree tree ) ) )
( define ( right-empty? tree )( null?
( right-tree tree ) ) )
( cond [ ( contains-elem?
elem tree )
( delete-in-son elem tree ) ]
[ else tree ] ) )
( define ( list->avl elems )
( define ( iter elems tree )
( cond [ ( null?
elems ) tree ]
[ else ( iter ( cdr elems )
( insert-elem ( car elems ) tree ) ) ] ) )
( cond [ ( null? elems ) '() ]
[ else ( let( [ avl ( make-leaf ( car elems ) ) ] )
( iter ( cdr elems ) avl ) ) ] ) )
高度平衡树 -- AVL 树的更多相关文章
- 【数据结构】平衡二叉树—AVL树
(百度百科)在计算机科学中,AVL树是最先发明的自平衡二叉查找树.在AVL树中任何节点的两个子树的高度最大差别为一,所以它也被称为高度平衡树.查找.插入和删除在平均和最坏情况下都是O(log n).增 ...
- AVL树(一)之 图文解析 和 C语言的实现
概要 本章介绍AVL树.和前面介绍"二叉查找树"的流程一样,本章先对AVL树的理论知识进行简单介绍,然后给出C语言的实现.本篇实现的二叉查找树是C语言版的,后面章节再分别给出C++ ...
- AVL树的左旋右旋理解 （转）
AVL树是最先发明的自平衡二叉查找树.在AVL树中任何节点的两个子树的高度最大差别为一,所以它也被称为高度平衡树.查找.插入和删除在平均和最坏情况下都是O(log n).增加和删除可能需要通过一次或多 ...
- 简单数据结构———AVL树
C - 万恶的二叉树 Crawling in process... Crawling failed Time Limit:1000MS Memory Limit:32768KB 64b ...
- 算法二叉搜索树之AVL树
最近学习了二叉搜索树中的AVL树,特在此写一篇博客小结. 1.引言 对于二叉搜索树而言,其插入查找删除等性能直接和树的高度有关,因此我们发明了平衡二叉搜索树.在计算机科学中,AVL树是最先发明的自平衡 ...
- AVL树,红黑树
AVL树 https://baike.baidu.com/item/AVL%E6%A0%91/10986648 在计算机科学中,AVL树是最先发明的自平衡二叉查找树.在AVL树中任何节点的两个子树的高 ...
- AVL树的理解及自写AVL树
AVL树是最先发明的自平衡二叉查找树.在AVL树中任何节点的两个子树的高度最大差别为一,所以它也被称为高度平衡树.查找.插入和删除在平均和最坏情况下都是O(log n).增加和删除可能需要通过一次或多 ...
- 红黑树与AVL树
概述:本文从排序二叉树作为引子,讲解了红黑树,最后把红黑树和AVL树做了一个比较全面的对比. 1 排序二叉树 排序二叉树是一种特殊结构的二叉树,可以非常方便地对树中所有节点进行排序和检索. 排序二叉树 ...
- AVL树的实现——c++
一.概念 AVL树是根据它的发明者G.M. Adelson-Velsky和E.M. Landis命名的.它是最先发明的自平衡二叉查找树,也被称为高度平衡树.相比于"二叉查找树",它 ...
随机推荐
- 九. 常用类库、向量与哈希2.Object类
Object 类位于 java.lang 包中,是所有 Java 类的祖先,Java 中的每个类都由它扩展而来. 定义Java类时如果没有显示的指明父类,那么就默认继承了 Object 类.例如: p ...
- 七. 多线程编程6.isAlive()和join()的使用
如前所述,通常你希望主线程最后结束.在前面的例子中,这点是通过在main()中调用sleep()来实现的,经过足够长时间的延迟以确保所有子线程都先于主线程结束.然而,这不是一个令人满意的解决方法,它也 ...
- Bluetooth篇 开发实例之六 蓝牙RSSI计算距离
计算公式: d = 10^((abs(RSSI) - A) / (10 * n)) 其中: d - 计算所得距离 RSSI - 接收信号强度(负值) A - 发射端和接收端相隔1米时的信号强度 n - ...
- QQ协议
http://www.cnblogs.com/sufei/archive/2012/12/13/2816737.html http://www.360doc.com/content/12/0822/1 ...
- linux之openssh协议
SSH的全称是Secure Shell,简单说来ssh是一种安全的外壳协议,用于两个计算机间安全的远程登陆,说它安全,是因为ssh采用公钥加密的机制.最开始时用作远程管理的工具是telnet,这个协议 ...
- git -- 忽略某个文件
1.修改 .gitignore 文件 在git中如果想忽略掉某个文件,不让这个文件提交到版本库中,可以使用修改 .gitignore 文件的方法.举例:.gitignore文件内容如下: # Andr ...
- ubuntu16 安装cron 以及使用
https://www.cnblogs.com/intval/p/5763929.html sudo apt-get install cron 启动cron sudo service cron sta ...
- How to initialize th rasp berry PI
WHAT YOU WILL NEED REQUIRED SD Card We recommend an 8GB class 4 SD card – ideally preinstalled with ...
- 2017.7.18 windows下ELK环境搭建
参考来自:Windows环境下ELK平台的搭建 另一篇博文:2017.7.18 linux下ELK环境搭建 0 版本说明 因为ELK从5.0开始只支持jdk 1.8,但是项目中使用的是JDK 1.7, ...
- UVa 10192 - Vacation & UVa 10066 The Twin Towers ( LCS 最长公共子串)
链接:UVa 10192 题意:给定两个字符串.求最长公共子串的长度 思路:这个是最长公共子串的直接应用 #include<stdio.h> #include<string.h> ...