AVL trees give shorter path lengths. So the resulting structure ends up being be... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

pavpanchekha on Sept 11, 2011 | parent | context | favorite | on: Treaps: A Simple Balanced Binary Tree

AVL trees give shorter path lengths. So the resulting structure ends up being better, depending on your exact balance of insertion and selection.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact