Re: [Haskell-cafe] AVL Tree in a pattern matching way

Hi, I summarize the pattern matching method for AVL tree here: https://sites.google.com/site/algoxy/avltree Also the proof of the height boundary and updating of the balancing factors are provided. Regards. -- Larry On Thu, May 12, 2011 at 10:54 AM, larry.liuxinyu wrote: > Hi, > > I browsed t

[Haskell-cafe] AVL Tree in a pattern matching way

Hi, I browsed the current AVL tree implementation in Hackage http://hackage.haskell.org/packages/archive/AvlTree/4.2/doc/html/src/Data-Tree-AVL-Push.html AVL tree denote the different of height from right sub-tree to left sub-tree as delta, to keep the balance, abs(delta)<=1 is kept as invariant.