Updated top_view_of_binary_tree.py with corrections

Author: yashdkadam

data_structures/binary_tree/top_view_of_binary_tree.py

@@ -11,7 +11,7 @@ def __init__(self, val=0, left=None, right=None):
 
 class Solution:
     # Function to return the top view of the binary tree
-    def topView(self, root):
+    def top_view(self, root):
         # List to store the result
         ans = []
 
@@ -22,15 +22,15 @@ def topView(self, root):
         # Dictionary to store the top view nodes based on their vertical positions
         mpp = {}
 
-        # Queue for BFS traversal, each element is a pair containing node and its vertical position
+        # Queue for BFS traversal
         q = deque([(root, 0)])
 
         # BFS traversal
         while q:
             # Retrieve the node and its vertical position from the front of the queue
             node, line = q.popleft()
 
-            # If the vertical position is not already in the map, add the node's data to the map
+
             if line not in mpp:
                 mpp[line] = node.data
 
@@ -41,7 +41,7 @@ def topView(self, root):
 
             # Process right child
             if node.right:
-                # Push the right child with an increased vertical position into the queue
+             
                 q.append((node.right, line + 1))
 
         # Transfer values from the map to the result list