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. Practice
  2. Data Structures
  3. Trees
  4. Tree : Top View
  5. Discussions

Tree : Top View

  • evanadams28 + 7 comments

    My recursive solution. Like you're standing on the spine of a house roof. Look left, look down, look right. 

    void top_view(Node root)
{
    left_view(root.left);
    System.out.print(root.data + " ");
    right_view(root.right);
}

void left_view(Node root) {
    if (root == null) return;
    left_view(root.left);
    System.out.print(root.data + " ");
}

void right_view(Node root) {
    if (root == null) return;
    System.out.print(root.data + " ");
    right_view(root.right);
}
    • carlos_rosario11 + 0 comments
      [deleted]
    • jittenddra + 0 comments

      perfect adams very good solution

    • Ridhuvarshan + 1 comment

      I don't get it. I did the same logic and got the same output except for the fact that they were not in order. How on earth does 'top view' seem to give any idea in the direction to look first. Anyway I am using your logic(same as mine with different order) guilt free as ambiguity in problem statement is not my fault. Thanks

      • _yash_agarwal_ + 0 comments

        Maybe, you called rightview recursively before printing data

    • rajatshukla + 0 comments

      wow man ..

    • umbertodovidio + 0 comments

      Really nice, I made something similar using a stack. But I think using the recursion stack is much more elegant and beautiful

    • Shruti165 + 0 comments

      work well

    • saifulcseng + 0 comments

      Your solution will not work for the following tree:

      tree.root = new Node(1); tree.root.left = new Node(2); tree.root.right = new Node(3); tree.root.left.right = new Node(4); tree.root.left.right.right = new Node(5); tree.root.left.right.right.right = new Node(6);