We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Trees
  4. Tree : Top View
  5. Discussions

Tree : Top View

  • LenaElika
     + 11 comments

    I came up with a similar solution in Java :) So far, I like it the most.

    void top_view(Node root)
{
    top_view(root, 0);
}

void top_view(Node root, int side)
{
    if (root != null) {
        if (side <= 0) {
            top_view(root.left, -1);
        }
        
        System.out.print(root.data + " ");
        
        if (side >= 0) {
            top_view(root.right, 1);
        }
    }
}