The Importance of Data Structures in Closure

The first implementation of those data structures was done in closure. And this was the first realised implementation of those theoretical ideas. So there was a lot of stuff lifted out of Chris Ryszakki's book and most of it has visited the tests of time. We're going to start with how to do array access, which should be straightforward for everybody. But there may also be a couple of surprises in there about how closure works with arrays from the underlying system that it's built on. The next thing to go to are trees. These are important, they give us ordered sequences when we need to be able to do fast lookups. They're quite efficient in memory. From that structure