{"id":27245,"date":"2018-01-20T20:25:22","date_gmt":"2018-01-20T14:55:22","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=27245"},"modified":"2018-01-20T20:25:22","modified_gmt":"2018-01-20T14:55:22","slug":"python-programming-binary-tree-vertical-order-hashmap-based-method","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/python-programming-binary-tree-vertical-order-hashmap-based-method\/","title":{"rendered":"Python Programming – Binary Tree in Vertical Order Hashmap based Method"},"content":{"rendered":"

Given a binary tree, print it vertically. The following example illustrates vertical order traversal.<\/span><\/p>\n

           1\r\n        \/    \\\r\n       2      3\r\n      \/ \\    \/ \\\r\n     4   5  6   7\r\n             \\   \\\r\n              8   9 \r\n               \r\n\t\t\t  \r\nThe output of print this tree vertically will be:\r\n4\r\n2\r\n1 5 6\r\n3 8\r\n7\r\n9<\/pre>\n
\"binary\"<\/p>\n
We have discussed a O(n2<\/sup>) solution in the previous post<\/a>. In this post, an efficient solution based on hash map is discussed. We need to check the Horizontal Distances from root for all nodes. If two nodes have the same Horizontal Distance (HD), then they are on same vertical line. The idea of HD is simple. HD for root is 0, a right edge (edge connecting to right subtree) is considered as +1 horizontal distance and a left edge is considered as -1 horizontal distance. For example, in the above tree, HD for Node 4 is at -2, HD for Node 2 is -1, HD for 5 and 6 is 0 and HD for node 7 is +2.
\nWe can do preorder traversal of the given Binary Tree.<\/p>\n[ad type=”banner”]\n
While traversing the tree, we can recursively calculate HDs. We initially pass the horizontal distance as 0 for root. For left subtree, we pass the Horizontal Distance as Horizontal distance of root minus 1. For right subtree, we pass the Horizontal Distance as Horizontal Distance of root plus 1. For every HD value, we maintain a list of nodes in a hasp map. Whenever we see a node in traversal, we go to the hash map entry and add the node to the hash map using HD as a key in map.<\/p>\n
 
 Python Program<\/span> <\/div> 
# Python program for printing vertical order of a given# binary tree # A binary tree nodeclass Node:    # Constructor to create a new node    def __init__(self, key):        self.key = key        self.left = None        self.right = None # Utility function to store vertical order in map 'm' # 'hd' is horizontal distance of current node from root# 'hd' is initially passed as 0def getVerticalOrder(root, hd, m):     # Base Case    if root is None:        return         # Store current node in map 'm'    try:        m[hd].append(root.key)    except:        m[hd] = [root.key]         # Store nodes in left subtree    getVerticalOrder(root.left, hd-1, m)         # Store nodes in right subtree    getVerticalOrder(root.right, hd+1, m) # The main function to print vertical order of a binary#tree ith given rootdef printVerticalOrder(root):         # Create a map and store vertical order in map using    # function getVerticalORder()    m = dict()    hd = 0    getVerticalOrder(root, hd, m)         # Traverse the map and print nodes at every horizontal    # distance (hd)    for index, value in enumerate(sorted(m)):        for i in m[value]:            print i,        print  # Driver program to test above functionroot = Node(1)root.left = Node(2)root.right = Node(3)root.left.left = Node(4)root.left.right = Node(5)root.right.left = Node(6)root.right.right = Node(7)root.right.left.right = Node(8)root.right.right.right = Node(9)print "Vertical order traversal is"printVerticalOrder(root) # This code is contributed by Nikhil Kumar Singh(nickzuck_007)<\/code><\/pre> <\/div>\n
Output:<\/p>\n
Vertical order traversal is\r\n4\r\n2\r\n1 5 6\r\n3 8\r\n7\r\n9<\/pre>\n
Time Complexity<\/strong> of hashing based solution can be considered as O(n) under the assumption that we have good hashing function that allows insertion and retrieval operations in O(1) time. In the above C++ implementation, map of STL<\/a> is used. map in STL is typically implemented using a Self-Balancing Binary Search Tree where all operations take O(Logn) time. Therefore time complexity of above implementation is O(nLogn).<\/p>\n[ad type=”banner”]\n
Note that the above solution may print nodes in same vertical order as they appear in tree.<\/strong> For example, the above program prints 12 before 9. See this<\/a> for a sample run.<\/p>\n
             1\r\n          \/     \\\r\n         2       3\r\n        \/  \\    \/  \\\r\n       4    5  6    7\r\n                \\  \/  \\\r\n                 8 10  9 \r\n                     \\\r\n                     11\r\n                       \\\r\n                        12<\/pre>\n","protected":false},"excerpt":{"rendered":"
An efficient solution based on hash map is discussed. We need to check the Horizontal Distances from root for all nodes and two nodes have the same<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1,80128,4148],"tags":[73309,70268,70285,80816,81249,81253,81252,81250,81255,81251,80798,81254,73910],"class_list":["post-27245","post","type-post","status-publish","format-standard","hentry","category-coding","category-hashing","category-python","tag-binary-search-tree-traversal","tag-binary-tree","tag-binary-tree-traversal","tag-inorder-traversal","tag-pollution-under-control-certificate-wikipedia","tag-postal-order","tag-print-order","tag-sonicwall","tag-traversal-of-tree","tag-tree-drawing","tag-tree-traversal-in-data-structure","tag-vertical-column","tag-what-is-backtracking"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27245","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=27245"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/27245\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=27245"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=27245"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=27245"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}