Binary Tree Diagonal Traversal

Latest Source Code:
Github: BinaryTreeDiagonalTraversal.java

Output:

        8               
      / \       
     /   \      
    /     \     
   /       \    
   3       10       
  / \       \   
 /   \       \  
 1   6       14   
    / \     /   
    4 7     13   
                                
Diagonal Print: 
Diagonal : 0, Nodes: [8, 10, 14]
Diagonal : 1, Nodes: [3, 6, 7, 13]
Diagonal : 2, Nodes: [1, 4]