Hao Chen

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.


Lockable Tree - Google Interview Question


https://github.com/makerroot/python-online-reading 欢迎大伙pr


python-online-reading


MySQL Tutorial website provides a comprehensive MySQL tutorial that helps you master MySQL fast, easy & fun.


python-online-reading

Content

Link Preview