Published on December 16, 2016 by JSConf

We don’t have a whole lot of data structures here in JavaScript world, but there’s a whole world of super useful data structures out there. In this talk we’re going to learn all about the fundamental data structures. Hash Tables, Arrays, Stacks, Queues, Linked Lists, and Binary Search Trees, we won’t just learn them, we’re going to build them. When we’re done you’ll be impressing all your friends with your mad structured data skills.

James is an engineer at Facebook as well as a core contributor to projects like Yarn, BabelJS and Lerna. Outside of work James is trying to make computer science more approachable to front-end developers.

JSConf.Asia – Capitol Theatre, Singapore – 25+26 November 2016.


License: For reuse of this video under a more permissive license please get in touch with us. The speakers retain the copyright for their performances.

Leave a Reply

1 Comment on "James Kyle: From Zero To Binary Search Tree – JSConf.Asia 2016"

Notify of

Juan Je García
Juan Je García
1 year 4 months ago

isn't it too late for our computer science course? good talk, anyway.