🚀

End of Year Sale: Use Coupon Code END2025 to Get Extra 25% Off.

12DAYS
:
15HOURS
:
02MINUTES
:
09SECONDS

Leetcode Problem 314. Binary Tree Vertical Order Traversal

314. Binary Tree Vertical Order Traversal

Leetcode Solutions

Breadth-First Search (BFS) with Column Tracking

  1. Create a hash table columnTable to group nodes by their column index.
  2. Initialize a queue with a tuple containing the root node and its column index (0).
  3. While the queue is not empty, pop an element (node, column index) from the queue.
  4. If the node is not null, add its value to the columnTable under the corresponding column index.
  5. Add the left child to the queue with column index - 1, and the right child with column index + 1.
  6. After the BFS traversal, sort the columnTable by the column indices.
  7. Extract the node values from the columnTable in sorted order to get the final result.
UML Thumbnail

Depth-First Search (DFS) with Column and Row Tracking

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...