Vertical Order Traversal Of A Binary Tree | Data Structure & Algorithm | Leet Code 987
In a binary tree if we draw vertical lines across the binary tree nodes and start printing the tree nodes from left to right for each vertical point, the result will be vertical order traversal.
Algorithms :
1- Create a Sorted hash table and queue
2-push the root node to queue with vertical point value to 0
3-Pop the element from queue
►Add entry to hash table against each vertical point value.
►push its left child : If it is left child decrement the vertical point value by -1
►push its right child : If it is left child increment the vertical point value by +1
4-Continue this operation till queue becomes empty
5-Print values inside hash table
Source Code
►Source Code : https://github.com/webtechschool/Data...
Support Us
❤Facebook : / webtechschool.learn
❤Instagram: / webtechschool