FactSet Research Systems, Inc Interview Question
Software Engineer / DevelopersAny application in which fast querying is important, but so is order and relations.
i.e. A phone book and dictionary are great examples.
Moreover, space complexity is not a function of the dimension of the key domain, as is with hashes.
For just trees in general, you may want to mention expression trees.
in STL, associate containers(map & set) are implemented from binary tree
- itcecsa June 23, 2011