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

  • evanadams28
     + 14 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);
}