Types of views in Binary tree

This is a companion discussion topic for the original entry at http://iq.opengenus.org/views-in-binary-tree/

Hey @shreya-shah-28,

The complexity for Top View and Bottom View can be improved to O(n) by using unordered_map instead of a map. I know a constant factor comes into play when using unordered_map, but that can be avoided by using a custom hash function to prevent from blowing up. Let me know what you think about this.


Aaditya Joshi