0 Replies - 1583 Views - Last Post: 16 July 2013 - 07:57 AM

#1 macosxnerd101   User is offline

  • Games, Graphs, and Auctions
  • member icon

Reputation: 12324
  • View blog
  • Posts: 45,424
  • Joined: 27-December 08

[Link] Functional Data Structures in Clojure- Red-Black Tree

Post icon  Posted 16 July 2013 - 07:57 AM


Red-black trees are a type of self-balancing binary search tree. Back when I first learned the balancing algorithm used in operations such as insert and delete, I remember it being a particularly tricky one.

Traditionally, red-black trees are implemented destructively - meaning insertions and deletions happen in place. So in imperative languages like C or Java there is a lot of node pointer manipulation floating around, making this algorithm error prone.

This post, as its title implies, will deal with the functional implementation which, besides simpler, is also persistent.


Is This A Good Question/Topic? 0
  • +

Page 1 of 1