Link Details

Link 964415 thumbnail
User 448255 avatar

By dotCore
via pavpanchekha.com
Submitted: May 04 2013 / 13:05

Treaps are an awesome variant of balanced binary tree. By making some useof randomness, we have a BBT that is expected to be of logarithmicheight, but is also easy to code, requiring none of the special-casebashing that characterizes red-black trees. Here, we'll code up acomplete treap implementation in Lisp (particularly, pylisp) that isalso fully functional.
  • 1
  • 0
  • 61
  • 17

Add your comment


Html tags not supported. Reply is editable for 5 minutes. Use [code lang="java|ruby|sql|css|xml"][/code] to post code snippets.

Voters For This Link (1)



Voters Against This Link (0)



    Java EE7
    Written by: Andrew Lee Rubinger
    Featured Refcardz: Top Refcardz:
    1. Design Patterns
    2. OO JS
    3. Cont. Delivery
    4. CI Patterns
    5. CI Tools
    1. Spring Integration
    2. Git
    3. Regex
    4. Java
    5. REST