To print the bottom view of a binary tree, we need to calculate the horizontal distance for every node.Then, a hash table is created to list down all the horizontal distances in ascending order.The nodes with similar horizontal distances are listed in level order traversal.The last nodes from each horizontal distance are selected to obtain the bottom view.