Shashank Rustagi shashankrustagi
😎
SuryaPratapK
/ Vertical Order Traversal of a Binary Tree
Created
August 10, 2020 17:32
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * Definition for a binary tree node. | |
| * struct TreeNode { | |
| * int val; | |
| * TreeNode *left; | |
| * TreeNode *right; | |
| * TreeNode() : val(0), left(nullptr), right(nullptr) {} | |
| * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} | |
| * TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {} | |
| * }; |