Archive for the ‘ Abstract Data Structures ’ Category

More on balanced ternary — implementing binary search trees

Hi all – so I’ve been busy as hell but that’s ok, there’s always time for some fun.  In my earlier posts I described how one could construct a tree using balanced ternary – it’s implementation time!  Lets begin by creating a really simple binary search tree. [ READ MORE ]

Making hashtables from binary trees

The next time a random guy on the street asks you if binary trees and hash tables are related answer yes, then look at him strange for asking you such a random question.  In all seriousness though, there exists a deep theoretical relationship between the pair of data structure: [ READ MORE ]

A curious idea

Ok, so I've been building a BST and all the accoutrements to connect it to the hypertree visualization. But what about balancing the BST? Because I have a math background I decided to forgo (at least for now) building AVL or red-black trees in lieu of a more 'mathematical' approach. What to do? [ READ MORE ]

Working toward the Javascript InfoVis Toolkit

If you haven’t seen this, then go here immediately and consider the possibilities of this toolkit: http://thejit.org/.  The JIT is a javascript library for advanced knowledge visualizations and hot damn its cool.  The only problem is that its in javascript and I’m a python programmer. [ READ MORE ]