diagnoal Traversal of binary tree

Author: Manjunath

Data-Structure/Trees/diagnolTraversal.js

@@ -50,7 +50,7 @@ tree.rightNode.rightNode.rightNode = new Node(15);
 //     /   \       /   \
 //    4     5     6      7
 //   / \   / \   / \    / \
-//  8  9  10 11 12 13 14   15
+//  8   9  10 11 12 13 14   15
 let hm = new Map();
 dignolTraversal(tree, 0, hm);
 for (const valueArr of hm.values())