Ds

10个小时的DataStructure的教学视频，看了下开头，还是挺好的（可以练习印度英文听力，哈）

Algorithms & Data Structures are critical to Backend Engineering however it really depends on what kind of application and infrastructure you are building.

The emergence of new hardware and platforms has led to reconsideration of how data management systems are designed. However, certain basic functions such as key indexed access to records remain essential. While we exploit the common architectural layering of prior systems, we make radically new design decisions about each layer. Our new form of B […]

Lockable tree is a great programming interview question asked by Google, and it is a very well thought out one. A lockable tree is a tree with nodes that can be locked if none of its ancestors and descendants is locked. In the question, we are asked to implement locking/unlocking operations that should run in O(h) time where h is the height of the tree. Lock/unlock methods do not need to be thread-safe.

A C++ library of Concurrent Data Structures. Contribute to khizmax/libcds development by creating an account on GitHub.